model_theory.fraisse | Mathlib porting status

Changes since the initial port

The following section lists changes to this file in mathlib3 and mathlib4 that occured after the initial port. Most recent changes are shown first. Hovering over a commit will show all commits associated with the same mathlib3 commit.

Changes in mathlib3

0602c598

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

1a51edf1

bump to nightly-2024-03-17-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

22f01ce4

Diff

@@ -252,8 +252,8 @@ theorem exists_cg_is_age_of (hn : K.Nonempty)
     (jep : JointEmbedding K) : ∃ M : Bundled.{w} L.Structure, Structure.CG L M ∧ L.age M = K :=
   by
   obtain ⟨F, hF⟩ := hc.exists_eq_range (hn.image _)
-  simp only [Set.ext_iff, Quotient.forall, mem_image, mem_range, Quotient.eq'] at hF 
-  simp_rw [Quotient.eq_mk_iff_out] at hF 
+  simp only [Set.ext_iff, Quotient.forall, mem_image, mem_range, Quotient.eq'] at hF
+  simp_rw [Quotient.eq_mk_iff_out] at hF
   have hF' : ∀ n : ℕ, (F n).out ∈ K := by
     intro n
     obtain ⟨P, hP1, hP2⟩ := (hF (F n).out).2 ⟨n, Setoid.refl _⟩
@@ -336,7 +336,7 @@ theorem IsUltrahomogeneous.amalgamation_age (h : L.IsUltrahomogeneous M) : Amalg
   ext n
   have hgn := (embedding.ext_iff.1 hg) ((PM.comp NP).equivRange n)
   simp only [embedding.comp_apply, Equiv.coe_toEmbedding, Equiv.symm_apply_apply,
-    substructure.coe_subtype, embedding.equiv_range_apply] at hgn 
+    substructure.coe_subtype, embedding.equiv_range_apply] at hgn
   simp only [embedding.comp_apply, Equiv.coe_toEmbedding, substructure.coe_inclusion,
     Set.coe_inclusion, embedding.equiv_range_apply, hgn]
 #align first_order.language.is_ultrahomogeneous.amalgamation_age FirstOrder.Language.IsUltrahomogeneous.amalgamation_age

1a51edf1

bump to nightly-2024-02-01-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

5433bded

Diff

@@ -200,6 +200,18 @@ theorem age.jointEmbedding : JointEmbedding (L.age M) := fun N hN P hP =>
 classes). -/
 theorem age.countable_quotient [h : Countable M] : (Quotient.mk' '' L.age M).Countable := by
   classical
+  refine'
+    (congr_arg _ (Set.ext <| Quotient.forall.2 fun N => _)).mp
+      (countable_range fun s : Finset M => ⟦⟨closure L (s : Set M), inferInstance⟩⟧)
+  simp only [mem_image, mem_range, mem_set_of_eq, Quotient.eq']
+  constructor
+  · rintro ⟨s, hs⟩
+    use bundled.of ↥(closure L (s : Set M))
+    exact ⟨⟨(fg_iff_Structure_fg _).1 (fg_closure s.finite_to_set), ⟨Subtype _⟩⟩, hs⟩
+  · rintro ⟨P, ⟨⟨s, hs⟩, ⟨PM⟩⟩, hP2⟩
+    refine' ⟨s.image PM, Setoid.trans _ hP2⟩
+    rw [← embedding.coe_to_hom, Finset.coe_image, closure_image PM.to_hom, hs, ← hom.range_eq_map]
+    exact ⟨PM.equiv_range.symm⟩
 #align first_order.language.age.countable_quotient FirstOrder.Language.age.countable_quotient
 -/
 
@@ -210,6 +222,24 @@ theorem age_directLimit {ι : Type w} [Preorder ι] [IsDirected ι (· ≤ ·)]
     (G : ι → Type max w w') [∀ i, L.Structure (G i)] (f : ∀ i j, i ≤ j → G i ↪[L] G j)
     [DirectedSystem G fun i j h => f i j h] : L.age (DirectLimit G f) = ⋃ i : ι, L.age (G i) := by
   classical
+  ext M
+  simp only [mem_Union]
+  constructor
+  · rintro ⟨Mfg, ⟨e⟩⟩
+    obtain ⟨s, hs⟩ := Mfg.range e.to_hom
+    let out := @Quotient.out _ (direct_limit.setoid G f)
+    obtain ⟨i, hi⟩ := Finset.exists_le (s.image (Sigma.fst ∘ out))
+    have e' := (direct_limit.of L ι G f i).equivRange.symm.toEmbedding
+    refine' ⟨i, Mfg, ⟨e'.comp ((substructure.inclusion _).comp e.equiv_range.to_embedding)⟩⟩
+    rw [← hs, closure_le]
+    intro x hx
+    refine' ⟨f (out x).1 i (hi (out x).1 (Finset.mem_image_of_mem _ hx)) (out x).2, _⟩
+    rw [embedding.coe_to_hom, direct_limit.of_apply, Quotient.mk_eq_iff_out,
+      direct_limit.equiv_iff G f _ (hi (out x).1 (Finset.mem_image_of_mem _ hx)),
+      DirectedSystem.map_self]
+    rfl
+  · rintro ⟨i, Mfg, ⟨e⟩⟩
+    exact ⟨Mfg, ⟨Embedding.comp (direct_limit.of L ι G f i) e⟩⟩
 #align first_order.language.age_direct_limit FirstOrder.Language.age_directLimit
 -/

1a51edf1

bump to nightly-2024-01-31-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

61100fe9

Diff

@@ -200,18 +200,6 @@ theorem age.jointEmbedding : JointEmbedding (L.age M) := fun N hN P hP =>
 classes). -/
 theorem age.countable_quotient [h : Countable M] : (Quotient.mk' '' L.age M).Countable := by
   classical
-  refine'
-    (congr_arg _ (Set.ext <| Quotient.forall.2 fun N => _)).mp
-      (countable_range fun s : Finset M => ⟦⟨closure L (s : Set M), inferInstance⟩⟧)
-  simp only [mem_image, mem_range, mem_set_of_eq, Quotient.eq']
-  constructor
-  · rintro ⟨s, hs⟩
-    use bundled.of ↥(closure L (s : Set M))
-    exact ⟨⟨(fg_iff_Structure_fg _).1 (fg_closure s.finite_to_set), ⟨Subtype _⟩⟩, hs⟩
-  · rintro ⟨P, ⟨⟨s, hs⟩, ⟨PM⟩⟩, hP2⟩
-    refine' ⟨s.image PM, Setoid.trans _ hP2⟩
-    rw [← embedding.coe_to_hom, Finset.coe_image, closure_image PM.to_hom, hs, ← hom.range_eq_map]
-    exact ⟨PM.equiv_range.symm⟩
 #align first_order.language.age.countable_quotient FirstOrder.Language.age.countable_quotient
 -/
 
@@ -222,24 +210,6 @@ theorem age_directLimit {ι : Type w} [Preorder ι] [IsDirected ι (· ≤ ·)]
     (G : ι → Type max w w') [∀ i, L.Structure (G i)] (f : ∀ i j, i ≤ j → G i ↪[L] G j)
     [DirectedSystem G fun i j h => f i j h] : L.age (DirectLimit G f) = ⋃ i : ι, L.age (G i) := by
   classical
-  ext M
-  simp only [mem_Union]
-  constructor
-  · rintro ⟨Mfg, ⟨e⟩⟩
-    obtain ⟨s, hs⟩ := Mfg.range e.to_hom
-    let out := @Quotient.out _ (direct_limit.setoid G f)
-    obtain ⟨i, hi⟩ := Finset.exists_le (s.image (Sigma.fst ∘ out))
-    have e' := (direct_limit.of L ι G f i).equivRange.symm.toEmbedding
-    refine' ⟨i, Mfg, ⟨e'.comp ((substructure.inclusion _).comp e.equiv_range.to_embedding)⟩⟩
-    rw [← hs, closure_le]
-    intro x hx
-    refine' ⟨f (out x).1 i (hi (out x).1 (Finset.mem_image_of_mem _ hx)) (out x).2, _⟩
-    rw [embedding.coe_to_hom, direct_limit.of_apply, Quotient.mk_eq_iff_out,
-      direct_limit.equiv_iff G f _ (hi (out x).1 (Finset.mem_image_of_mem _ hx)),
-      DirectedSystem.map_self]
-    rfl
-  · rintro ⟨i, Mfg, ⟨e⟩⟩
-    exact ⟨Mfg, ⟨Embedding.comp (direct_limit.of L ι G f i) e⟩⟩
 #align first_order.language.age_direct_limit FirstOrder.Language.age_directLimit
 -/

1a51edf1

bump to nightly-2023-10-05-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce64cd319bb6b3e82f31c2d38e79080d377be451

e028a08c

Diff

@@ -162,13 +162,13 @@ theorem Structure.FG.mem_age_of_equiv {M N : Bundled L.Structure} (h : Structure
 #align first_order.language.Structure.fg.mem_age_of_equiv FirstOrder.Language.Structure.FG.mem_age_of_equiv
 -/
 
-#print FirstOrder.Language.Hereditary.is_equiv_invariant_of_fG /-
-theorem Hereditary.is_equiv_invariant_of_fG (h : Hereditary K)
+#print FirstOrder.Language.Hereditary.is_equiv_invariant_of_fg /-
+theorem Hereditary.is_equiv_invariant_of_fg (h : Hereditary K)
     (fg : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.FG L M) (M N : Bundled.{w} L.Structure)
     (hn : Nonempty (M ≃[L] N)) : M ∈ K ↔ N ∈ K :=
   ⟨fun MK => h M MK ((fg M MK).mem_age_of_equiv hn), fun NK =>
     h N NK ((fg N NK).mem_age_of_equiv ⟨hn.some.symm⟩)⟩
-#align first_order.language.hereditary.is_equiv_invariant_of_fg FirstOrder.Language.Hereditary.is_equiv_invariant_of_fG
+#align first_order.language.hereditary.is_equiv_invariant_of_fg FirstOrder.Language.Hereditary.is_equiv_invariant_of_fg
 -/
 
 variable (M)

1a51edf1

bump to nightly-2023-09-24-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce64cd319bb6b3e82f31c2d38e79080d377be451

5655435f

Diff

@@ -3,9 +3,9 @@ Copyright (c) 2022 Aaron Anderson. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Aaron Anderson
 -/
-import Mathbin.ModelTheory.FinitelyGenerated
-import Mathbin.ModelTheory.DirectLimit
-import Mathbin.ModelTheory.Bundled
+import ModelTheory.FinitelyGenerated
+import ModelTheory.DirectLimit
+import ModelTheory.Bundled
 
 #align_import model_theory.fraisse from "leanprover-community/mathlib"@"1a51edf13debfcbe223fa06b1cb353b9ed9751cc"

1a51edf1

bump to nightly-2023-09-20-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce64cd319bb6b3e82f31c2d38e79080d377be451

e28e6964

Diff

@@ -201,7 +201,7 @@ classes). -/
 theorem age.countable_quotient [h : Countable M] : (Quotient.mk' '' L.age M).Countable := by
   classical
   refine'
-    (congr_arg _ (Set.ext <| forall_quotient_iff.2 fun N => _)).mp
+    (congr_arg _ (Set.ext <| Quotient.forall.2 fun N => _)).mp
       (countable_range fun s : Finset M => ⟦⟨closure L (s : Set M), inferInstance⟩⟧)
   simp only [mem_image, mem_range, mem_set_of_eq, Quotient.eq']
   constructor
@@ -252,7 +252,7 @@ theorem exists_cg_is_age_of (hn : K.Nonempty)
     (jep : JointEmbedding K) : ∃ M : Bundled.{w} L.Structure, Structure.CG L M ∧ L.age M = K :=
   by
   obtain ⟨F, hF⟩ := hc.exists_eq_range (hn.image _)
-  simp only [Set.ext_iff, forall_quotient_iff, mem_image, mem_range, Quotient.eq'] at hF 
+  simp only [Set.ext_iff, Quotient.forall, mem_image, mem_range, Quotient.eq'] at hF 
   simp_rw [Quotient.eq_mk_iff_out] at hF 
   have hF' : ∀ n : ℕ, (F n).out ∈ K := by
     intro n

1a51edf1

bump to nightly-2023-07-20-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/8ea5598db6caeddde6cb734aa179cc2408dbd345

9c56d0dd

Diff

@@ -2,16 +2,13 @@
 Copyright (c) 2022 Aaron Anderson. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Aaron Anderson
-
-! This file was ported from Lean 3 source module model_theory.fraisse
-! leanprover-community/mathlib commit 1a51edf13debfcbe223fa06b1cb353b9ed9751cc
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.ModelTheory.FinitelyGenerated
 import Mathbin.ModelTheory.DirectLimit
 import Mathbin.ModelTheory.Bundled
 
+#align_import model_theory.fraisse from "leanprover-community/mathlib"@"1a51edf13debfcbe223fa06b1cb353b9ed9751cc"
+
 /-!
 # Fraïssé Classes and Fraïssé Limits

1a51edf1

bump to nightly-2023-07-09-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/1a51edf13debfcbe223fa06b1cb353b9ed9751cc

e0217a15

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Aaron Anderson
 
 ! This file was ported from Lean 3 source module model_theory.fraisse
-! leanprover-community/mathlib commit 0602c59878ff3d5f71dea69c2d32ccf2e93e5398
+! leanprover-community/mathlib commit 1a51edf13debfcbe223fa06b1cb353b9ed9751cc
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -15,6 +15,9 @@ import Mathbin.ModelTheory.Bundled
 /-!
 # Fraïssé Classes and Fraïssé Limits
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 This file pertains to the ages of countable first-order structures. The age of a structure is the
 class of all finitely-generated structures that embed into it.

0602c598

bump to nightly-2023-07-07-19

mathlib commit https://github.com/leanprover-community/mathlib/commit/8905e5ed90859939681a725b00f6063e65096d95

4b102645

Diff

@@ -77,25 +77,32 @@ variable (L : Language.{u, v})
 /-! ### The Age of a Structure and Fraïssé Classes-/
 
 
+#print FirstOrder.Language.age /-
 /-- The age of a structure `M` is the class of finitely-generated structures that embed into it. -/
 def age (M : Type w) [L.Structure M] : Set (Bundled.{w} L.Structure) :=
   {N | Structure.FG L N ∧ Nonempty (N ↪[L] M)}
 #align first_order.language.age FirstOrder.Language.age
+-/
 
 variable {L} (K : Set (Bundled.{w} L.Structure))
 
+#print FirstOrder.Language.Hereditary /-
 /-- A class `K` has the hereditary property when all finitely-generated structures that embed into
   structures in `K` are also in `K`.  -/
 def Hereditary : Prop :=
   ∀ M : Bundled.{w} L.Structure, M ∈ K → L.age M ⊆ K
 #align first_order.language.hereditary FirstOrder.Language.Hereditary
+-/
 
+#print FirstOrder.Language.JointEmbedding /-
 /-- A class `K` has the joint embedding property when for every `M`, `N` in `K`, there is another
   structure in `K` into which both `M` and `N` embed. -/
 def JointEmbedding : Prop :=
   DirectedOn (fun M N : Bundled.{w} L.Structure => Nonempty (M ↪[L] N)) K
 #align first_order.language.joint_embedding FirstOrder.Language.JointEmbedding
+-/
 
+#print FirstOrder.Language.Amalgamation /-
 /-- A class `K` has the amalgamation property when for any pair of embeddings of a structure `M` in
   `K` into other structures in `K`, those two structures can be embedded into a fourth structure in
   `K` such that the resulting square of embeddings commutes. -/
@@ -107,7 +114,9 @@ def Amalgamation : Prop :=
           ∃ (Q : Bundled.{w} L.Structure) (NQ : N ↪[L] Q) (PQ : P ↪[L] Q),
             Q ∈ K ∧ NQ.comp MN = PQ.comp MP
 #align first_order.language.amalgamation FirstOrder.Language.Amalgamation
+-/
 
+#print FirstOrder.Language.IsFraisse /-
 /-- A Fraïssé class is a nonempty, isomorphism-invariant, essentially countable class of structures
 satisfying the hereditary, joint embedding, and amalgamation properties. -/
 class IsFraisse : Prop where
@@ -119,48 +128,64 @@ class IsFraisse : Prop where
   JointEmbedding : JointEmbedding K
   Amalgamation : Amalgamation K
 #align first_order.language.is_fraisse FirstOrder.Language.IsFraisse
+-/
 
 variable {K} (L) (M : Type w) [L.Structure M]
 
+#print FirstOrder.Language.age.is_equiv_invariant /-
 theorem age.is_equiv_invariant (N P : Bundled.{w} L.Structure) (h : Nonempty (N ≃[L] P)) :
     N ∈ L.age M ↔ P ∈ L.age M :=
   and_congr h.some.fg_iff
     ⟨Nonempty.map fun x => Embedding.comp x h.some.symm.toEmbedding,
       Nonempty.map fun x => Embedding.comp x h.some.toEmbedding⟩
 #align first_order.language.age.is_equiv_invariant FirstOrder.Language.age.is_equiv_invariant
+-/
 
 variable {L} {M} {N : Type w} [L.Structure N]
 
+#print FirstOrder.Language.Embedding.age_subset_age /-
 theorem Embedding.age_subset_age (MN : M ↪[L] N) : L.age M ⊆ L.age N := fun _ =>
   And.imp_right (Nonempty.map MN.comp)
 #align first_order.language.embedding.age_subset_age FirstOrder.Language.Embedding.age_subset_age
+-/
 
+#print FirstOrder.Language.Equiv.age_eq_age /-
 theorem Equiv.age_eq_age (MN : M ≃[L] N) : L.age M = L.age N :=
   le_antisymm MN.toEmbedding.age_subset_age MN.symm.toEmbedding.age_subset_age
 #align first_order.language.equiv.age_eq_age FirstOrder.Language.Equiv.age_eq_age
+-/
 
+#print FirstOrder.Language.Structure.FG.mem_age_of_equiv /-
 theorem Structure.FG.mem_age_of_equiv {M N : Bundled L.Structure} (h : Structure.FG L M)
     (MN : Nonempty (M ≃[L] N)) : N ∈ L.age M :=
   ⟨MN.some.fg_iff.1 h, ⟨MN.some.symm.toEmbedding⟩⟩
 #align first_order.language.Structure.fg.mem_age_of_equiv FirstOrder.Language.Structure.FG.mem_age_of_equiv
+-/
 
+#print FirstOrder.Language.Hereditary.is_equiv_invariant_of_fG /-
 theorem Hereditary.is_equiv_invariant_of_fG (h : Hereditary K)
     (fg : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.FG L M) (M N : Bundled.{w} L.Structure)
     (hn : Nonempty (M ≃[L] N)) : M ∈ K ↔ N ∈ K :=
   ⟨fun MK => h M MK ((fg M MK).mem_age_of_equiv hn), fun NK =>
     h N NK ((fg N NK).mem_age_of_equiv ⟨hn.some.symm⟩)⟩
 #align first_order.language.hereditary.is_equiv_invariant_of_fg FirstOrder.Language.Hereditary.is_equiv_invariant_of_fG
+-/
 
 variable (M)
 
+#print FirstOrder.Language.age.nonempty /-
 theorem age.nonempty : (L.age M).Nonempty :=
   ⟨Bundled.of (Substructure.closure L (∅ : Set M)),
     (fg_iff_structure_fg _).1 (fg_closure Set.finite_empty), ⟨Substructure.subtype _⟩⟩
 #align first_order.language.age.nonempty FirstOrder.Language.age.nonempty
+-/
 
+#print FirstOrder.Language.age.hereditary /-
 theorem age.hereditary : Hereditary (L.age M) := fun N hN P hP => hN.2.some.age_subset_age hP
 #align first_order.language.age.hereditary FirstOrder.Language.age.hereditary
+-/
 
+#print FirstOrder.Language.age.jointEmbedding /-
 theorem age.jointEmbedding : JointEmbedding (L.age M) := fun N hN P hP =>
   ⟨Bundled.of ↥(hN.2.some.toHom.range ⊔ hP.2.some.toHom.range),
     ⟨(fg_iff_structure_fg _).1 ((hN.1.range hN.2.some.toHom).sup (hP.1.range hP.2.some.toHom)),
@@ -168,7 +193,9 @@ theorem age.jointEmbedding : JointEmbedding (L.age M) := fun N hN P hP =>
     ⟨Embedding.comp (inclusion le_sup_left) hN.2.some.equivRange.toEmbedding⟩,
     ⟨Embedding.comp (inclusion le_sup_right) hP.2.some.equivRange.toEmbedding⟩⟩
 #align first_order.language.age.joint_embedding FirstOrder.Language.age.jointEmbedding
+-/
 
+#print FirstOrder.Language.age.countable_quotient /-
 /-- The age of a countable structure is essentially countable (has countably many isomorphism
 classes). -/
 theorem age.countable_quotient [h : Countable M] : (Quotient.mk' '' L.age M).Countable := by
@@ -186,7 +213,9 @@ theorem age.countable_quotient [h : Countable M] : (Quotient.mk' '' L.age M).Cou
     rw [← embedding.coe_to_hom, Finset.coe_image, closure_image PM.to_hom, hs, ← hom.range_eq_map]
     exact ⟨PM.equiv_range.symm⟩
 #align first_order.language.age.countable_quotient FirstOrder.Language.age.countable_quotient
+-/
 
+#print FirstOrder.Language.age_directLimit /-
 /-- The age of a direct limit of structures is the union of the ages of the structures. -/
 @[simp]
 theorem age_directLimit {ι : Type w} [Preorder ι] [IsDirected ι (· ≤ ·)] [Nonempty ι]
@@ -212,9 +241,11 @@ theorem age_directLimit {ι : Type w} [Preorder ι] [IsDirected ι (· ≤ ·)]
   · rintro ⟨i, Mfg, ⟨e⟩⟩
     exact ⟨Mfg, ⟨Embedding.comp (direct_limit.of L ι G f i) e⟩⟩
 #align first_order.language.age_direct_limit FirstOrder.Language.age_directLimit
+-/
 
+#print FirstOrder.Language.exists_cg_is_age_of /-
 /-- Sufficient conditions for a class to be the age of a countably-generated structure. -/
-theorem exists_cG_is_age_of (hn : K.Nonempty)
+theorem exists_cg_is_age_of (hn : K.Nonempty)
     (h : ∀ M N : Bundled.{w} L.Structure, Nonempty (M ≃[L] N) → (M ∈ K ↔ N ∈ K))
     (hc : (Quotient.mk' '' K).Countable)
     (fg : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.FG L M) (hp : Hereditary K)
@@ -239,8 +270,10 @@ theorem exists_cG_is_age_of (hn : K.Nonempty)
   cases n
   · exact embedding.refl _ _
   · exact (hFP _ n).some
-#align first_order.language.exists_cg_is_age_of FirstOrder.Language.exists_cG_is_age_of
+#align first_order.language.exists_cg_is_age_of FirstOrder.Language.exists_cg_is_age_of
+-/
 
+#print FirstOrder.Language.exists_countable_is_age_of_iff /-
 theorem exists_countable_is_age_of_iff [Countable (Σ l, L.Functions l)] :
     (∃ M : Bundled.{w} L.Structure, Countable M ∧ L.age M = K) ↔
       K.Nonempty ∧
@@ -259,18 +292,22 @@ theorem exists_countable_is_age_of_iff [Countable (Σ l, L.Functions l)] :
     obtain ⟨M, hM, rfl⟩ := exists_cg_is_age_of Kn eqinv cq hfg hp jep
     exact ⟨M, Structure.cg_iff_countable.1 hM, rfl⟩
 #align first_order.language.exists_countable_is_age_of_iff FirstOrder.Language.exists_countable_is_age_of_iff
+-/
 
 variable {K} (L) (M)
 
+#print FirstOrder.Language.IsUltrahomogeneous /-
 /-- A structure `M` is ultrahomogeneous if every embedding of a finitely generated substructure
 into `M` extends to an automorphism of `M`. -/
 def IsUltrahomogeneous : Prop :=
   ∀ (S : L.Substructure M) (hs : S.FG) (f : S ↪[L] M),
     ∃ g : M ≃[L] M, f = g.toEmbedding.comp S.Subtype
 #align first_order.language.is_ultrahomogeneous FirstOrder.Language.IsUltrahomogeneous
+-/
 
 variable {L} (K)
 
+#print FirstOrder.Language.IsFraisseLimit /-
 /-- A structure `M` is a Fraïssé limit for a class `K` if it is countably generated,
 ultrahomogeneous, and has age `K`. -/
 @[protect_proj]
@@ -278,9 +315,11 @@ structure IsFraisseLimit [Countable (Σ l, L.Functions l)] [Countable M] : Prop
   ultrahomogeneous : IsUltrahomogeneous L M
   age : L.age M = K
 #align first_order.language.is_fraisse_limit FirstOrder.Language.IsFraisseLimit
+-/
 
 variable {L} {M}
 
+#print FirstOrder.Language.IsUltrahomogeneous.amalgamation_age /-
 theorem IsUltrahomogeneous.amalgamation_age (h : L.IsUltrahomogeneous M) : Amalgamation (L.age M) :=
   by
   rintro N P Q NP NQ ⟨Nfg, ⟨NM⟩⟩ ⟨Pfg, ⟨PM⟩⟩ ⟨Qfg, ⟨QM⟩⟩
@@ -301,20 +340,25 @@ theorem IsUltrahomogeneous.amalgamation_age (h : L.IsUltrahomogeneous M) : Amalg
   simp only [embedding.comp_apply, Equiv.coe_toEmbedding, substructure.coe_inclusion,
     Set.coe_inclusion, embedding.equiv_range_apply, hgn]
 #align first_order.language.is_ultrahomogeneous.amalgamation_age FirstOrder.Language.IsUltrahomogeneous.amalgamation_age
+-/
 
+#print FirstOrder.Language.IsUltrahomogeneous.age_isFraisse /-
 theorem IsUltrahomogeneous.age_isFraisse [Countable M] (h : L.IsUltrahomogeneous M) :
     IsFraisse (L.age M) :=
   ⟨age.nonempty M, fun _ hN => hN.1, age.is_equiv_invariant L M, age.countable_quotient M,
     age.hereditary M, age.jointEmbedding M, h.amalgamation_age⟩
 #align first_order.language.is_ultrahomogeneous.age_is_fraisse FirstOrder.Language.IsUltrahomogeneous.age_isFraisse
+-/
 
 namespace IsFraisseLimit
 
+#print FirstOrder.Language.IsFraisseLimit.isFraisse /-
 /-- If a class has a Fraïssé limit, it must be Fraïssé. -/
 theorem isFraisse [Countable (Σ l, L.Functions l)] [Countable M] (h : IsFraisseLimit K M) :
     IsFraisse K :=
   (congr rfl h.age).mp h.ultrahomogeneous.age_isFraisse
 #align first_order.language.is_fraisse_limit.is_fraisse FirstOrder.Language.IsFraisseLimit.isFraisse
+-/
 
 end IsFraisseLimit

0602c598

bump to nightly-2023-06-04-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/5f25c089cb34db4db112556f23c50d12da81b297

3fb4268b

Diff

@@ -79,7 +79,7 @@ variable (L : Language.{u, v})
 
 /-- The age of a structure `M` is the class of finitely-generated structures that embed into it. -/
 def age (M : Type w) [L.Structure M] : Set (Bundled.{w} L.Structure) :=
-  { N | Structure.FG L N ∧ Nonempty (N ↪[L] M) }
+  {N | Structure.FG L N ∧ Nonempty (N ↪[L] M)}
 #align first_order.language.age FirstOrder.Language.age
 
 variable {L} (K : Set (Bundled.{w} L.Structure))
@@ -173,18 +173,18 @@ theorem age.jointEmbedding : JointEmbedding (L.age M) := fun N hN P hP =>
 classes). -/
 theorem age.countable_quotient [h : Countable M] : (Quotient.mk' '' L.age M).Countable := by
   classical
-    refine'
-      (congr_arg _ (Set.ext <| forall_quotient_iff.2 fun N => _)).mp
-        (countable_range fun s : Finset M => ⟦⟨closure L (s : Set M), inferInstance⟩⟧)
-    simp only [mem_image, mem_range, mem_set_of_eq, Quotient.eq']
-    constructor
-    · rintro ⟨s, hs⟩
-      use bundled.of ↥(closure L (s : Set M))
-      exact ⟨⟨(fg_iff_Structure_fg _).1 (fg_closure s.finite_to_set), ⟨Subtype _⟩⟩, hs⟩
-    · rintro ⟨P, ⟨⟨s, hs⟩, ⟨PM⟩⟩, hP2⟩
-      refine' ⟨s.image PM, Setoid.trans _ hP2⟩
-      rw [← embedding.coe_to_hom, Finset.coe_image, closure_image PM.to_hom, hs, ← hom.range_eq_map]
-      exact ⟨PM.equiv_range.symm⟩
+  refine'
+    (congr_arg _ (Set.ext <| forall_quotient_iff.2 fun N => _)).mp
+      (countable_range fun s : Finset M => ⟦⟨closure L (s : Set M), inferInstance⟩⟧)
+  simp only [mem_image, mem_range, mem_set_of_eq, Quotient.eq']
+  constructor
+  · rintro ⟨s, hs⟩
+    use bundled.of ↥(closure L (s : Set M))
+    exact ⟨⟨(fg_iff_Structure_fg _).1 (fg_closure s.finite_to_set), ⟨Subtype _⟩⟩, hs⟩
+  · rintro ⟨P, ⟨⟨s, hs⟩, ⟨PM⟩⟩, hP2⟩
+    refine' ⟨s.image PM, Setoid.trans _ hP2⟩
+    rw [← embedding.coe_to_hom, Finset.coe_image, closure_image PM.to_hom, hs, ← hom.range_eq_map]
+    exact ⟨PM.equiv_range.symm⟩
 #align first_order.language.age.countable_quotient FirstOrder.Language.age.countable_quotient
 
 /-- The age of a direct limit of structures is the union of the ages of the structures. -/
@@ -193,24 +193,24 @@ theorem age_directLimit {ι : Type w} [Preorder ι] [IsDirected ι (· ≤ ·)]
     (G : ι → Type max w w') [∀ i, L.Structure (G i)] (f : ∀ i j, i ≤ j → G i ↪[L] G j)
     [DirectedSystem G fun i j h => f i j h] : L.age (DirectLimit G f) = ⋃ i : ι, L.age (G i) := by
   classical
-    ext M
-    simp only [mem_Union]
-    constructor
-    · rintro ⟨Mfg, ⟨e⟩⟩
-      obtain ⟨s, hs⟩ := Mfg.range e.to_hom
-      let out := @Quotient.out _ (direct_limit.setoid G f)
-      obtain ⟨i, hi⟩ := Finset.exists_le (s.image (Sigma.fst ∘ out))
-      have e' := (direct_limit.of L ι G f i).equivRange.symm.toEmbedding
-      refine' ⟨i, Mfg, ⟨e'.comp ((substructure.inclusion _).comp e.equiv_range.to_embedding)⟩⟩
-      rw [← hs, closure_le]
-      intro x hx
-      refine' ⟨f (out x).1 i (hi (out x).1 (Finset.mem_image_of_mem _ hx)) (out x).2, _⟩
-      rw [embedding.coe_to_hom, direct_limit.of_apply, Quotient.mk_eq_iff_out,
-        direct_limit.equiv_iff G f _ (hi (out x).1 (Finset.mem_image_of_mem _ hx)),
-        DirectedSystem.map_self]
-      rfl
-    · rintro ⟨i, Mfg, ⟨e⟩⟩
-      exact ⟨Mfg, ⟨Embedding.comp (direct_limit.of L ι G f i) e⟩⟩
+  ext M
+  simp only [mem_Union]
+  constructor
+  · rintro ⟨Mfg, ⟨e⟩⟩
+    obtain ⟨s, hs⟩ := Mfg.range e.to_hom
+    let out := @Quotient.out _ (direct_limit.setoid G f)
+    obtain ⟨i, hi⟩ := Finset.exists_le (s.image (Sigma.fst ∘ out))
+    have e' := (direct_limit.of L ι G f i).equivRange.symm.toEmbedding
+    refine' ⟨i, Mfg, ⟨e'.comp ((substructure.inclusion _).comp e.equiv_range.to_embedding)⟩⟩
+    rw [← hs, closure_le]
+    intro x hx
+    refine' ⟨f (out x).1 i (hi (out x).1 (Finset.mem_image_of_mem _ hx)) (out x).2, _⟩
+    rw [embedding.coe_to_hom, direct_limit.of_apply, Quotient.mk_eq_iff_out,
+      direct_limit.equiv_iff G f _ (hi (out x).1 (Finset.mem_image_of_mem _ hx)),
+      DirectedSystem.map_self]
+    rfl
+  · rintro ⟨i, Mfg, ⟨e⟩⟩
+    exact ⟨Mfg, ⟨Embedding.comp (direct_limit.of L ι G f i) e⟩⟩
 #align first_order.language.age_direct_limit FirstOrder.Language.age_directLimit
 
 /-- Sufficient conditions for a class to be the age of a countably-generated structure. -/

0602c598

bump to nightly-2023-06-01-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/cca40788df1b8755d5baf17ab2f27dacc2e17acb

b9c87c70

Diff

@@ -104,7 +104,7 @@ def Amalgamation : Prop :=
     M ∈ K →
       N ∈ K →
         P ∈ K →
-          ∃ (Q : Bundled.{w} L.Structure)(NQ : N ↪[L] Q)(PQ : P ↪[L] Q),
+          ∃ (Q : Bundled.{w} L.Structure) (NQ : N ↪[L] Q) (PQ : P ↪[L] Q),
             Q ∈ K ∧ NQ.comp MN = PQ.comp MP
 #align first_order.language.amalgamation FirstOrder.Language.Amalgamation
 
@@ -221,8 +221,8 @@ theorem exists_cG_is_age_of (hn : K.Nonempty)
     (jep : JointEmbedding K) : ∃ M : Bundled.{w} L.Structure, Structure.CG L M ∧ L.age M = K :=
   by
   obtain ⟨F, hF⟩ := hc.exists_eq_range (hn.image _)
-  simp only [Set.ext_iff, forall_quotient_iff, mem_image, mem_range, Quotient.eq'] at hF
-  simp_rw [Quotient.eq_mk_iff_out] at hF
+  simp only [Set.ext_iff, forall_quotient_iff, mem_image, mem_range, Quotient.eq'] at hF 
+  simp_rw [Quotient.eq_mk_iff_out] at hF 
   have hF' : ∀ n : ℕ, (F n).out ∈ K := by
     intro n
     obtain ⟨P, hP1, hP2⟩ := (hF (F n).out).2 ⟨n, Setoid.refl _⟩
@@ -241,7 +241,7 @@ theorem exists_cG_is_age_of (hn : K.Nonempty)
   · exact (hFP _ n).some
 #align first_order.language.exists_cg_is_age_of FirstOrder.Language.exists_cG_is_age_of
 
-theorem exists_countable_is_age_of_iff [Countable (Σl, L.Functions l)] :
+theorem exists_countable_is_age_of_iff [Countable (Σ l, L.Functions l)] :
     (∃ M : Bundled.{w} L.Structure, Countable M ∧ L.age M = K) ↔
       K.Nonempty ∧
         (∀ M N : Bundled.{w} L.Structure, Nonempty (M ≃[L] N) → (M ∈ K ↔ N ∈ K)) ∧
@@ -274,7 +274,7 @@ variable {L} (K)
 /-- A structure `M` is a Fraïssé limit for a class `K` if it is countably generated,
 ultrahomogeneous, and has age `K`. -/
 @[protect_proj]
-structure IsFraisseLimit [Countable (Σl, L.Functions l)] [Countable M] : Prop where
+structure IsFraisseLimit [Countable (Σ l, L.Functions l)] [Countable M] : Prop where
   ultrahomogeneous : IsUltrahomogeneous L M
   age : L.age M = K
 #align first_order.language.is_fraisse_limit FirstOrder.Language.IsFraisseLimit
@@ -297,7 +297,7 @@ theorem IsUltrahomogeneous.amalgamation_age (h : L.IsUltrahomogeneous M) : Amalg
   ext n
   have hgn := (embedding.ext_iff.1 hg) ((PM.comp NP).equivRange n)
   simp only [embedding.comp_apply, Equiv.coe_toEmbedding, Equiv.symm_apply_apply,
-    substructure.coe_subtype, embedding.equiv_range_apply] at hgn
+    substructure.coe_subtype, embedding.equiv_range_apply] at hgn 
   simp only [embedding.comp_apply, Equiv.coe_toEmbedding, substructure.coe_inclusion,
     Set.coe_inclusion, embedding.equiv_range_apply, hgn]
 #align first_order.language.is_ultrahomogeneous.amalgamation_age FirstOrder.Language.IsUltrahomogeneous.amalgamation_age
@@ -311,7 +311,7 @@ theorem IsUltrahomogeneous.age_isFraisse [Countable M] (h : L.IsUltrahomogeneous
 namespace IsFraisseLimit
 
 /-- If a class has a Fraïssé limit, it must be Fraïssé. -/
-theorem isFraisse [Countable (Σl, L.Functions l)] [Countable M] (h : IsFraisseLimit K M) :
+theorem isFraisse [Countable (Σ l, L.Functions l)] [Countable M] (h : IsFraisseLimit K M) :
     IsFraisse K :=
   (congr rfl h.age).mp h.ultrahomogeneous.age_isFraisse
 #align first_order.language.is_fraisse_limit.is_fraisse FirstOrder.Language.IsFraisseLimit.isFraisse

0602c598

bump to nightly-2023-05-28-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

8d353152

Diff

@@ -62,7 +62,7 @@ structures. In the case of a language with countably many function symbols, thes
 
 universe u v w w'
 
-open FirstOrder
+open scoped FirstOrder
 
 open Set CategoryTheory

0602c598

bump to nightly-2023-05-13-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/403190b5419b3f03f1a2893ad9352ca7f7d8bff6

a0be3cad

Diff

@@ -79,7 +79,7 @@ variable (L : Language.{u, v})
 
 /-- The age of a structure `M` is the class of finitely-generated structures that embed into it. -/
 def age (M : Type w) [L.Structure M] : Set (Bundled.{w} L.Structure) :=
-  { N | Structure.Fg L N ∧ Nonempty (N ↪[L] M) }
+  { N | Structure.FG L N ∧ Nonempty (N ↪[L] M) }
 #align first_order.language.age FirstOrder.Language.age
 
 variable {L} (K : Set (Bundled.{w} L.Structure))
@@ -112,7 +112,7 @@ def Amalgamation : Prop :=
 satisfying the hereditary, joint embedding, and amalgamation properties. -/
 class IsFraisse : Prop where
   is_nonempty : K.Nonempty
-  Fg : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.Fg L M
+  FG : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.FG L M
   is_equiv_invariant : ∀ M N : Bundled.{w} L.Structure, Nonempty (M ≃[L] N) → (M ∈ K ↔ N ∈ K)
   is_essentially_countable : (Quotient.mk' '' K).Countable
   Hereditary : Hereditary K
@@ -139,17 +139,17 @@ theorem Equiv.age_eq_age (MN : M ≃[L] N) : L.age M = L.age N :=
   le_antisymm MN.toEmbedding.age_subset_age MN.symm.toEmbedding.age_subset_age
 #align first_order.language.equiv.age_eq_age FirstOrder.Language.Equiv.age_eq_age
 
-theorem Structure.Fg.mem_age_of_equiv {M N : Bundled L.Structure} (h : Structure.Fg L M)
+theorem Structure.FG.mem_age_of_equiv {M N : Bundled L.Structure} (h : Structure.FG L M)
     (MN : Nonempty (M ≃[L] N)) : N ∈ L.age M :=
   ⟨MN.some.fg_iff.1 h, ⟨MN.some.symm.toEmbedding⟩⟩
-#align first_order.language.Structure.fg.mem_age_of_equiv FirstOrder.Language.Structure.Fg.mem_age_of_equiv
+#align first_order.language.Structure.fg.mem_age_of_equiv FirstOrder.Language.Structure.FG.mem_age_of_equiv
 
-theorem Hereditary.is_equiv_invariant_of_fg (h : Hereditary K)
-    (fg : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.Fg L M) (M N : Bundled.{w} L.Structure)
+theorem Hereditary.is_equiv_invariant_of_fG (h : Hereditary K)
+    (fg : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.FG L M) (M N : Bundled.{w} L.Structure)
     (hn : Nonempty (M ≃[L] N)) : M ∈ K ↔ N ∈ K :=
   ⟨fun MK => h M MK ((fg M MK).mem_age_of_equiv hn), fun NK =>
     h N NK ((fg N NK).mem_age_of_equiv ⟨hn.some.symm⟩)⟩
-#align first_order.language.hereditary.is_equiv_invariant_of_fg FirstOrder.Language.Hereditary.is_equiv_invariant_of_fg
+#align first_order.language.hereditary.is_equiv_invariant_of_fg FirstOrder.Language.Hereditary.is_equiv_invariant_of_fG
 
 variable (M)
 
@@ -214,11 +214,11 @@ theorem age_directLimit {ι : Type w} [Preorder ι] [IsDirected ι (· ≤ ·)]
 #align first_order.language.age_direct_limit FirstOrder.Language.age_directLimit
 
 /-- Sufficient conditions for a class to be the age of a countably-generated structure. -/
-theorem exists_cg_is_age_of (hn : K.Nonempty)
+theorem exists_cG_is_age_of (hn : K.Nonempty)
     (h : ∀ M N : Bundled.{w} L.Structure, Nonempty (M ≃[L] N) → (M ∈ K ↔ N ∈ K))
     (hc : (Quotient.mk' '' K).Countable)
-    (fg : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.Fg L M) (hp : Hereditary K)
-    (jep : JointEmbedding K) : ∃ M : Bundled.{w} L.Structure, Structure.Cg L M ∧ L.age M = K :=
+    (fg : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.FG L M) (hp : Hereditary K)
+    (jep : JointEmbedding K) : ∃ M : Bundled.{w} L.Structure, Structure.CG L M ∧ L.age M = K :=
   by
   obtain ⟨F, hF⟩ := hc.exists_eq_range (hn.image _)
   simp only [Set.ext_iff, forall_quotient_iff, mem_image, mem_range, Quotient.eq'] at hF
@@ -231,7 +231,7 @@ theorem exists_cg_is_age_of (hn : K.Nonempty)
   let G : ℕ → K := @Nat.rec (fun _ => K) ⟨(F 0).out, hF' 0⟩ fun n N => ⟨P N n, hPK N n⟩
   let f : ∀ i j, i ≤ j → G i ↪[L] G j := directed_system.nat_le_rec fun n => (hP _ n).some
   refine'
-    ⟨bundled.of (direct_limit (fun n => G n) f), direct_limit.cg _ fun n => (fg _ (G n).2).Cg,
+    ⟨bundled.of (direct_limit (fun n => G n) f), direct_limit.cg _ fun n => (fg _ (G n).2).CG,
       (age_direct_limit _ _).trans
         (subset_antisymm (Union_subset fun n N hN => hp (G n) (G n).2 hN) fun N KN => _)⟩
   obtain ⟨n, ⟨e⟩⟩ := (hF N).1 ⟨N, KN, Setoid.refl _⟩
@@ -239,14 +239,14 @@ theorem exists_cg_is_age_of (hn : K.Nonempty)
   cases n
   · exact embedding.refl _ _
   · exact (hFP _ n).some
-#align first_order.language.exists_cg_is_age_of FirstOrder.Language.exists_cg_is_age_of
+#align first_order.language.exists_cg_is_age_of FirstOrder.Language.exists_cG_is_age_of
 
 theorem exists_countable_is_age_of_iff [Countable (Σl, L.Functions l)] :
     (∃ M : Bundled.{w} L.Structure, Countable M ∧ L.age M = K) ↔
       K.Nonempty ∧
         (∀ M N : Bundled.{w} L.Structure, Nonempty (M ≃[L] N) → (M ∈ K ↔ N ∈ K)) ∧
           (Quotient.mk' '' K).Countable ∧
-            (∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.Fg L M) ∧
+            (∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.FG L M) ∧
               Hereditary K ∧ JointEmbedding K :=
   by
   constructor
@@ -265,7 +265,7 @@ variable {K} (L) (M)
 /-- A structure `M` is ultrahomogeneous if every embedding of a finitely generated substructure
 into `M` extends to an automorphism of `M`. -/
 def IsUltrahomogeneous : Prop :=
-  ∀ (S : L.Substructure M) (hs : S.Fg) (f : S ↪[L] M),
+  ∀ (S : L.Substructure M) (hs : S.FG) (f : S ↪[L] M),
     ∃ g : M ≃[L] M, f = g.toEmbedding.comp S.Subtype
 #align first_order.language.is_ultrahomogeneous FirstOrder.Language.IsUltrahomogeneous

0602c598

bump to nightly-2023-02-21-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/bd9851ca476957ea4549eb19b40e7b5ade9428cc

1107b979

Changes in mathlib4

mathlib3

mathlib4

0602c598

chore: superfluous parentheses (#12116)

Co-authored-by: Moritz Firsching <firsching@google.com>

596d5eca

Diff

@@ -231,7 +231,7 @@ theorem exists_cg_is_age_of (hn : K.Nonempty)
   let f : ∀ (i j : ℕ), i ≤ j → (G i).val ↪[L] (G j).val := by
     refine DirectedSystem.natLERec (G' := fun i => (G i).val) (L := L) ?_
     dsimp only [G]
-    exact (fun n => (hP _ n).some)
+    exact fun n => (hP _ n).some
   have : DirectedSystem (fun n ↦ (G n).val) fun i j h ↦ ↑(f i j h) := by
     dsimp [f, G]; infer_instance
   refine ⟨Bundled.of (@DirectLimit L _ _ (fun n ↦ (G n).val) _ f _ _), ?_, ?_⟩

0602c598

chore: more backporting of simp changes from #10995 (#11001)

Co-authored-by: Patrick Massot <patrickmassot@free.fr> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

d9589c14

Diff

@@ -230,10 +230,10 @@ theorem exists_cg_is_age_of (hn : K.Nonempty)
   -- let f : ∀ i j, i ≤ j → G i ↪[L] G j := DirectedSystem.natLeRec fun n => (hP _ n).some
   let f : ∀ (i j : ℕ), i ≤ j → (G i).val ↪[L] (G j).val := by
     refine DirectedSystem.natLERec (G' := fun i => (G i).val) (L := L) ?_
-    dsimp only
+    dsimp only [G]
     exact (fun n => (hP _ n).some)
   have : DirectedSystem (fun n ↦ (G n).val) fun i j h ↦ ↑(f i j h) := by
-    dsimp; infer_instance
+    dsimp [f, G]; infer_instance
   refine ⟨Bundled.of (@DirectLimit L _ _ (fun n ↦ (G n).val) _ f _ _), ?_, ?_⟩
   · exact DirectLimit.cg _ (fun n => (fg _ (G n).2).cg)
   · refine (age_directLimit (fun n ↦ (G n).val) f).trans
@@ -242,8 +242,8 @@ theorem exists_cg_is_age_of (hn : K.Nonempty)
     obtain ⟨n, ⟨e⟩⟩ := (hF N).1 ⟨N, KN, this⟩
     refine mem_iUnion_of_mem n ⟨fg _ KN, ⟨Embedding.comp ?_ e.symm.toEmbedding⟩⟩
     cases' n with n
-    · dsimp; exact Embedding.refl _ _
-    · dsimp; exact (hFP _ n).some
+    · dsimp [G]; exact Embedding.refl _ _
+    · dsimp [G]; exact (hFP _ n).some
 #align first_order.language.exists_cg_is_age_of FirstOrder.Language.exists_cg_is_age_of
 
 theorem exists_countable_is_age_of_iff [Countable (Σ l, L.Functions l)] :

0602c598

Revert "chore: revert #7703 (#7710)"

This reverts commit f3695eb2.

ab56fa28

Diff

@@ -300,6 +300,10 @@ theorem IsUltrahomogeneous.amalgamation_age (h : L.IsUltrahomogeneous M) :
   erw [Substructure.coe_inclusion, Substructure.coe_inclusion]
   simp only [Embedding.comp_apply, Equiv.coe_toEmbedding, Set.coe_inclusion,
     Embedding.equivRange_apply, hgn]
+  -- This used to be `simp only [...]` before leanprover/lean4#2644
+  erw [Embedding.comp_apply, Equiv.coe_toEmbedding,
+    Embedding.equivRange_apply]
+  simp
 #align first_order.language.is_ultrahomogeneous.amalgamation_age FirstOrder.Language.IsUltrahomogeneous.amalgamation_age
 
 theorem IsUltrahomogeneous.age_isFraisse [Countable M] (h : L.IsUltrahomogeneous M) :

0602c598

chore: revert #7703 (#7710)

This reverts commit 26eb2b0a.

f3695eb2

Diff

@@ -300,10 +300,6 @@ theorem IsUltrahomogeneous.amalgamation_age (h : L.IsUltrahomogeneous M) :
   erw [Substructure.coe_inclusion, Substructure.coe_inclusion]
   simp only [Embedding.comp_apply, Equiv.coe_toEmbedding, Set.coe_inclusion,
     Embedding.equivRange_apply, hgn]
-  -- This used to be `simp only [...]` before leanprover/lean4#2644
-  erw [Embedding.comp_apply, Equiv.coe_toEmbedding,
-    Embedding.equivRange_apply]
-  simp
 #align first_order.language.is_ultrahomogeneous.amalgamation_age FirstOrder.Language.IsUltrahomogeneous.amalgamation_age
 
 theorem IsUltrahomogeneous.age_isFraisse [Countable M] (h : L.IsUltrahomogeneous M) :

0602c598

chore: bump toolchain to v4.2.0-rc2 (#7703)

This includes all the changes from #7606.

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

26eb2b0a

Diff

@@ -300,6 +300,10 @@ theorem IsUltrahomogeneous.amalgamation_age (h : L.IsUltrahomogeneous M) :
   erw [Substructure.coe_inclusion, Substructure.coe_inclusion]
   simp only [Embedding.comp_apply, Equiv.coe_toEmbedding, Set.coe_inclusion,
     Embedding.equivRange_apply, hgn]
+  -- This used to be `simp only [...]` before leanprover/lean4#2644
+  erw [Embedding.comp_apply, Equiv.coe_toEmbedding,
+    Embedding.equivRange_apply]
+  simp
 #align first_order.language.is_ultrahomogeneous.amalgamation_age FirstOrder.Language.IsUltrahomogeneous.amalgamation_age
 
 theorem IsUltrahomogeneous.age_isFraisse [Countable M] (h : L.IsUltrahomogeneous M) :

0602c598

chore: tidy various files (#7359)

df7b0423

Diff

@@ -109,9 +109,9 @@ class IsFraisse : Prop where
   FG : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.FG L M
   is_equiv_invariant : ∀ M N : Bundled.{w} L.Structure, Nonempty (M ≃[L] N) → (M ∈ K ↔ N ∈ K)
   is_essentially_countable : (Quotient.mk' '' K).Countable
-  Hereditary : Hereditary K
-  JointEmbedding : JointEmbedding K
-  Amalgamation : Amalgamation K
+  hereditary : Hereditary K
+  jointEmbedding : JointEmbedding K
+  amalgamation : Amalgamation K
 #align first_order.language.is_fraisse FirstOrder.Language.IsFraisse
 
 variable {K} (L) (M : Type w) [Structure L M]
@@ -139,12 +139,12 @@ theorem Structure.FG.mem_age_of_equiv {M N : Bundled L.Structure} (h : Structure
 set_option linter.uppercaseLean3 false in
 #align first_order.language.Structure.fg.mem_age_of_equiv FirstOrder.Language.Structure.FG.mem_age_of_equiv
 
-theorem Hereditary.is_equiv_invariant_of_fG (h : Hereditary K)
+theorem Hereditary.is_equiv_invariant_of_fg (h : Hereditary K)
     (fg : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.FG L M) (M N : Bundled.{w} L.Structure)
     (hn : Nonempty (M ≃[L] N)) : M ∈ K ↔ N ∈ K :=
-  ⟨fun MK => h M MK ((fg M MK).mem_age_of_equiv hn), fun NK =>
-    h N NK ((fg N NK).mem_age_of_equiv ⟨hn.some.symm⟩)⟩
-#align first_order.language.hereditary.is_equiv_invariant_of_fg FirstOrder.Language.Hereditary.is_equiv_invariant_of_fG
+  ⟨fun MK => h M MK ((fg M MK).mem_age_of_equiv hn),
+   fun NK => h N NK ((fg N NK).mem_age_of_equiv ⟨hn.some.symm⟩)⟩
+#align first_order.language.hereditary.is_equiv_invariant_of_fg FirstOrder.Language.Hereditary.is_equiv_invariant_of_fg
 
 variable (M)

0602c598

feat: add lemma Quotient.exists (#7220)

Also forall_quotient_iff {α : Type*} [r : Setoid α] ... -> Quotient.forall {α : Sort*} {s : Setoid α} ...

9ebe3593

Diff

@@ -168,7 +168,7 @@ theorem age.jointEmbedding : JointEmbedding (L.age M) := fun _ hN _ hP =>
 classes). -/
 theorem age.countable_quotient [h : Countable M] : (Quotient.mk' '' L.age M).Countable := by
   classical
-  refine' (congr_arg _ (Set.ext <| forall_quotient_iff.2 fun N => _)).mp
+  refine' (congr_arg _ (Set.ext <| Quotient.forall.2 fun N => _)).mp
     (countable_range fun s : Finset M => ⟦⟨closure L (s : Set M), inferInstance⟩⟧)
   constructor
   · rintro ⟨s, hs⟩
@@ -215,7 +215,7 @@ theorem exists_cg_is_age_of (hn : K.Nonempty)
     (fg : ∀ M : Bundled.{w} L.Structure, M ∈ K → Structure.FG L M) (hp : Hereditary K)
     (jep : JointEmbedding K) : ∃ M : Bundled.{w} L.Structure, Structure.CG L M ∧ L.age M = K := by
   obtain ⟨F, hF⟩ := hc.exists_eq_range (hn.image _)
-  simp only [Set.ext_iff, forall_quotient_iff, mem_image, mem_range, Quotient.eq'] at hF
+  simp only [Set.ext_iff, Quotient.forall, mem_image, mem_range, Quotient.eq'] at hF
   simp_rw [Quotient.eq_mk_iff_out] at hF
   have hF' : ∀ n : ℕ, (F n).out ∈ K := by
     intro n

0602c598

chore: script to replace headers with #align_import statements (#5979)

depends on: #5966

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

89aa3a3b

Diff

@@ -2,16 +2,13 @@
 Copyright (c) 2022 Aaron Anderson. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Aaron Anderson
-
-! This file was ported from Lean 3 source module model_theory.fraisse
-! leanprover-community/mathlib commit 0602c59878ff3d5f71dea69c2d32ccf2e93e5398
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.ModelTheory.FinitelyGenerated
 import Mathlib.ModelTheory.DirectLimit
 import Mathlib.ModelTheory.Bundled
 
+#align_import model_theory.fraisse from "leanprover-community/mathlib"@"0602c59878ff3d5f71dea69c2d32ccf2e93e5398"
+
 /-!
 # Fraïssé Classes and Fraïssé Limits

0602c598

chore: tidy various files (#5840)

6a00552b

Diff

@@ -232,7 +232,7 @@ theorem exists_cg_is_age_of (hn : K.Nonempty)
   -- Poting note: was
   -- let f : ∀ i j, i ≤ j → G i ↪[L] G j := DirectedSystem.natLeRec fun n => (hP _ n).some
   let f : ∀ (i j : ℕ), i ≤ j → (G i).val ↪[L] (G j).val := by
-    refine DirectedSystem.natLeRec (G' := fun i => (G i).val) (L := L) ?_
+    refine DirectedSystem.natLERec (G' := fun i => (G i).val) (L := L) ?_
     dsimp only
     exact (fun n => (hP _ n).some)
   have : DirectedSystem (fun n ↦ (G n).val) fun i j h ↦ ↑(f i j h) := by

0602c598

feat: port ModelTheory.Fraisse (#4565)

Co-authored-by: Parcly Taxel <reddeloostw@gmail.com> Co-authored-by: Xavier-François Roblot <46200072+xroblot@users.noreply.github.com> Co-authored-by: Johan Commelin <johan@commelin.net> Co-authored-by: Matthew Ballard <matt@mrb.email>

b07960ca

`model_theory.fraisse` ⟷ `Mathlib.ModelTheory.Fraisse`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 8 + 531

model_theory.fraisse ⟷ Mathlib.ModelTheory.Fraisse

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 8 + 531

`model_theory.fraisse` ⟷ `Mathlib.ModelTheory.Fraisse`