Loogle!
Result
Found 217 declarations mentioning FirstOrder.Language.Theory. Of these, only the first 200 are shown.
- FirstOrder.Language.Theory π Mathlib.ModelTheory.Syntax
(L : FirstOrder.Language) : Type (max u v) - FirstOrder.Language.infiniteTheory π Mathlib.ModelTheory.Syntax
(L : FirstOrder.Language) : L.Theory - FirstOrder.Language.nonemptyTheory π Mathlib.ModelTheory.Syntax
(L : FirstOrder.Language) : L.Theory - FirstOrder.Language.distinctConstantsTheory π Mathlib.ModelTheory.Syntax
(L : FirstOrder.Language) {Ξ± : Type u'} (s : Set Ξ±) : (L.withConstants Ξ±).Theory - FirstOrder.Language.LHom.onTheory π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {L' : FirstOrder.Language} (g : L βα΄Έ L') (T : L.Theory) : L'.Theory - FirstOrder.Language.distinctConstantsTheory_mono π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {Ξ± : Type u'} {s t : Set Ξ±} (h : s β t) : L.distinctConstantsTheory s β L.distinctConstantsTheory t - FirstOrder.Language.directed_distinctConstantsTheory π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {Ξ± : Type u'} : Directed (fun x1 x2 => x1 β x2) L.distinctConstantsTheory - FirstOrder.Language.LHom.mem_onTheory π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {L' : FirstOrder.Language} {g : L βα΄Έ L'} {T : L.Theory} {Ο : L'.Sentence} : Ο β g.onTheory T β β Οβ β T, g.onSentence Οβ = Ο - FirstOrder.Language.monotone_distinctConstantsTheory π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {Ξ± : Type u'} : Monotone L.distinctConstantsTheory - FirstOrder.Language.distinctConstantsTheory_eq_iUnion π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {Ξ± : Type u'} (s : Set Ξ±) : L.distinctConstantsTheory s = β t, L.distinctConstantsTheory β(Finset.map (Function.Embedding.subtype fun x => x β s) t) - FirstOrder.Language.completeTheory π Mathlib.ModelTheory.Semantics
(L : FirstOrder.Language) (M : Type w) [L.Structure M] : L.Theory - FirstOrder.Language.Theory.Model π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) [L.Structure M] (T : L.Theory) : Prop - FirstOrder.Language.model_empty π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] : M β¨ β - FirstOrder.Language.Theory.completeTheory.subset π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {T : L.Theory} [MT : M β¨ T] : T β L.completeTheory M - FirstOrder.Language.Theory.model_iff_subset_completeTheory π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {T : L.Theory} : M β¨ T β T β L.completeTheory M - FirstOrder.Language.mem_completeTheory π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {Ο : L.Sentence} : Ο β L.completeTheory M β M β¨ Ο - FirstOrder.Language.ElementarilyEquivalent.completeTheory_eq π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} {N : Type u_1} [L.Structure M] [L.Structure N] (h : L.ElementarilyEquivalent M N) : L.completeTheory M = L.completeTheory N - FirstOrder.Language.Theory.model_singleton_iff π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {Ο : L.Sentence} : M β¨ {Ο} β M β¨ Ο - FirstOrder.Language.ElementarilyEquivalent.theory_model π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} {N : Type u_1} [L.Structure M] [L.Structure N] {T : L.Theory} [MT : M β¨ T] (h : L.ElementarilyEquivalent M N) : N β¨ T - FirstOrder.Language.Theory.Model.mono π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {T T' : L.Theory} (_h : M β¨ T') (hs : T β T') : M β¨ T - FirstOrder.Language.ElementarilyEquivalent.theory_model_iff π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} {N : Type u_1} [L.Structure M] [L.Structure N] {T : L.Theory} (h : L.ElementarilyEquivalent M N) : M β¨ T β N β¨ T - FirstOrder.Language.Theory.realize_sentence_of_mem π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] (T : L.Theory) [M β¨ T] {Ο : L.Sentence} (h : Ο β T) : M β¨ Ο - FirstOrder.Language.Theory.Model.mk π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {T : L.Theory} (realize_of_mem : β Ο β T, M β¨ Ο) : M β¨ T - FirstOrder.Language.Theory.Model.realize_of_mem π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} {instβ : L.Structure M} {T : L.Theory} [self : M β¨ T] (Ο : L.Sentence) : Ο β T β M β¨ Ο - FirstOrder.Language.Theory.model_iff π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] (T : L.Theory) : M β¨ T β β Ο β T, M β¨ Ο - FirstOrder.Language.Theory.Model.union π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {T T' : L.Theory} (h : M β¨ T) (h' : M β¨ T') : M β¨ T βͺ T' - FirstOrder.Language.Theory.model_union_iff π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {T T' : L.Theory} : M β¨ T βͺ T' β M β¨ T β§ M β¨ T' - FirstOrder.Language.Theory.model_insert_iff π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {T : L.Theory} {Ο : L.Sentence} : M β¨ insert Ο T β M β¨ Ο β§ M β¨ T - FirstOrder.Language.LHom.onTheory_model π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {L' : FirstOrder.Language} {M : Type w} [L.Structure M] [L'.Structure M] (Ο : L βα΄Έ L') [Ο.IsExpansionOn M] (T : L.Theory) : M β¨ Ο.onTheory T β M β¨ T - FirstOrder.Language.StrongHomClass.theory_model π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} {N : Type u_1} [L.Structure M] [L.Structure N] {T : L.Theory} {F : Type u_4} [EquivLike F M N] [L.StrongHomClass F M N] (g : F) [M β¨ T] : N β¨ T - FirstOrder.Language.Theory.field π Mathlib.ModelTheory.Algebra.Field.Basic
: FirstOrder.Language.ring.Theory - FirstOrder.Language.Theory.fieldOfChar π Mathlib.ModelTheory.Algebra.Field.CharP
(p : β) : FirstOrder.Language.ring.Theory - FirstOrder.Language.elementaryDiagram π Mathlib.ModelTheory.ElementaryMaps
(L : FirstOrder.Language) (M : Type u_1) [L.Structure M] : (L.withConstants M).Theory - FirstOrder.Language.ElementaryEmbedding.theory_model_iff π Mathlib.ModelTheory.ElementaryMaps
{L : FirstOrder.Language} {M : Type u_1} {N : Type u_2} [L.Structure M] [L.Structure N] (f : L.ElementaryEmbedding M N) (T : L.Theory) : M β¨ T β N β¨ T - FirstOrder.Language.ElementarySubstructure.theory_model π Mathlib.ModelTheory.ElementarySubstructures
{L : FirstOrder.Language} {M : Type u_1} [L.Structure M] {T : L.Theory} [h : M β¨ T] {S : L.ElementarySubstructure M} : β₯S β¨ T - FirstOrder.Language.ElementarySubstructure.theory_model_iff π Mathlib.ModelTheory.ElementarySubstructures
{L : FirstOrder.Language} {M : Type u_1} [L.Structure M] (S : L.ElementarySubstructure M) (T : L.Theory) : β₯S β¨ T β M β¨ T - FirstOrder.Language.Theory.ModelType π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} (T : L.Theory) : Type (max (max u v) (w + 1)) - FirstOrder.Language.Theory.ModelType.Carrier π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} (self : T.ModelType) : Type w - FirstOrder.Language.Theory.ModelType.instCoeSort π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} (T : L.Theory) : CoeSort T.ModelType (Type w) - FirstOrder.Language.Theory.ModelType.ulift π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} (M : T.ModelType) : T.ModelType - FirstOrder.Language.Theory.ModelType.instInhabited π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} : Inhabited β .ModelType - FirstOrder.Language.Theory.ModelType.instNonempty π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} (T : L.Theory) (M : T.ModelType) : Nonempty βM - FirstOrder.Language.Theory.ModelType.nonempty' π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} (self : T.ModelType) : Nonempty βself - FirstOrder.Language.Theory.ModelType.struc π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} (self : T.ModelType) : L.Structure βself - FirstOrder.Language.Theory.ModelType.shrink π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} (M : T.ModelType) [Small.{w', w} βM] : T.ModelType - FirstOrder.Language.Theory.ModelType.equivInduced π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} {M : T.ModelType} {N : Type w'} (e : βM β N) : T.ModelType - FirstOrder.Language.Theory.Model.bundled π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} {M : Type w} [LM : L.Structure M] [ne : Nonempty M] (h : M β¨ T) : T.ModelType - FirstOrder.Language.Theory.ModelType.is_model π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} (self : T.ModelType) : βself β¨ T - FirstOrder.Language.Theory.ModelType.mk π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} (Carrier : Type w) [struc : L.Structure Carrier] [is_model : Carrier β¨ T] [nonempty' : Nonempty Carrier] : T.ModelType - FirstOrder.Language.Theory.ModelType.of π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} (T : L.Theory) (M : Type w) [L.Structure M] [M β¨ T] [Nonempty M] : T.ModelType - FirstOrder.Language.Theory.ModelType.reduct π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} {L' : FirstOrder.Language} (Ο : L βα΄Έ L') (M : (Ο.onTheory T).ModelType) : T.ModelType - FirstOrder.Language.ElementarySubstructure.toModel π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} (T : L.Theory) {M : T.ModelType} (S : L.ElementarySubstructure βM) : T.ModelType - FirstOrder.Language.Theory.ModelType.leftStructure π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {L' : FirstOrder.Language} {T : (L.sum L').Theory} (M : T.ModelType) : L.Structure βM - FirstOrder.Language.Theory.ModelType.rightStructure π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {L' : FirstOrder.Language} {T : (L.sum L').Theory} (M : T.ModelType) : L'.Structure βM - FirstOrder.Language.Theory.ModelType.subtheoryModel π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} (M : T.ModelType) {T' : L.Theory} (h : T' β T) : T'.ModelType - FirstOrder.Language.ElementarilyEquivalent.toModel π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} (T : L.Theory) {M : T.ModelType} {N : Type u_1} [LN : L.Structure N] (h : L.ElementarilyEquivalent (βM) N) : T.ModelType - FirstOrder.Language.Theory.coe_of π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} {M : Type w} [L.Structure M] [Nonempty M] (h : M β¨ T) : βh.bundled = M - FirstOrder.Language.Theory.ModelType.coe_of π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} (T : L.Theory) (M : Type w) [L.Structure M] [M β¨ T] [Nonempty M] : β(FirstOrder.Language.Theory.ModelType.of T M) = M - FirstOrder.Language.Theory.ModelType.of_small π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} (M : Type w) [Nonempty M] [L.Structure M] [M β¨ T] [h : Small.{w', w} M] : Small.{w', w} β(FirstOrder.Language.Theory.ModelType.of T M) - FirstOrder.Language.Theory.ModelType.subtheoryModel_Carrier π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} (M : T.ModelType) {T' : L.Theory} (h : T' β T) : β(M.subtheoryModel h) = βM - FirstOrder.Language.Theory.ModelType.reduct_Carrier π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} {L' : FirstOrder.Language} (Ο : L βα΄Έ L') (M : (Ο.onTheory T).ModelType) : β(FirstOrder.Language.Theory.ModelType.reduct Ο M) = βM - FirstOrder.Language.Theory.ModelType.subtheoryModel_struc π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} (M : T.ModelType) {T' : L.Theory} (h : T' β T) : (M.subtheoryModel h).struc = M.struc - FirstOrder.Language.Theory.ModelType.subtheoryModel_models π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} (M : T.ModelType) {T' : L.Theory} (h : T' β T) : β(M.subtheoryModel h) β¨ T - FirstOrder.Language.Theory.ModelType.reduct_struc π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} {L' : FirstOrder.Language} (Ο : L βα΄Έ L') (M : (Ο.onTheory T).ModelType) : (FirstOrder.Language.Theory.ModelType.reduct Ο M).struc = Ο.reduct βM - FirstOrder.Language.ElementarySubstructure.toModel.instSmall π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} (T : L.Theory) {M : T.ModelType} (S : L.ElementarySubstructure βM) [h : Small.{w, x} β₯S] : Small.{w, x} β(FirstOrder.Language.ElementarySubstructure.toModel T S) - FirstOrder.Language.Theory.ModelType.defaultExpansion π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} {L' : FirstOrder.Language} {Ο : L βα΄Έ L'} (h : Ο.Injective) [(n : β) β (f : L'.Functions n) β Decidable (f β Set.range fun f => Ο.onFunction f)] [(n : β) β (r : L'.Relations n) β Decidable (r β Set.range fun r => Ο.onRelation r)] (M : T.ModelType) [Inhabited βM] : (Ο.onTheory T).ModelType - FirstOrder.Language.Theory.ModelType.defaultExpansion_Carrier π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} {L' : FirstOrder.Language} {Ο : L βα΄Έ L'} (h : Ο.Injective) [(n : β) β (f : L'.Functions n) β Decidable (f β Set.range fun f => Ο.onFunction f)] [(n : β) β (r : L'.Relations n) β Decidable (r β Set.range fun r => Ο.onRelation r)] (M : T.ModelType) [Inhabited βM] : β(FirstOrder.Language.Theory.ModelType.defaultExpansion h M) = βM - FirstOrder.Language.Theory.ModelType.defaultExpansion_struc π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} {T : L.Theory} {L' : FirstOrder.Language} {Ο : L βα΄Έ L'} (h : Ο.Injective) [(n : β) β (f : L'.Functions n) β Decidable (f β Set.range fun f => Ο.onFunction f)] [(n : β) β (r : L'.Relations n) β Decidable (r β Set.range fun r => Ο.onRelation r)] (M : T.ModelType) [Inhabited βM] : (FirstOrder.Language.Theory.ModelType.defaultExpansion h M).struc = Ο.defaultExpansion βM - FirstOrder.Language.Theory.IsComplete π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} (T : L.Theory) : Prop - FirstOrder.Language.Theory.IsFinitelySatisfiable π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} (T : L.Theory) : Prop - FirstOrder.Language.Theory.IsMaximal π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} (T : L.Theory) : Prop - FirstOrder.Language.Theory.IsSatisfiable π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} (T : L.Theory) : Prop - Cardinal.Categorical π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} (ΞΊ : Cardinal.{w}) (T : L.Theory) : Prop - Cardinal.empty_theory_categorical π Mathlib.ModelTheory.Satisfiability
(ΞΊ : Cardinal.{w}) (T : FirstOrder.Language.empty.Theory) : ΞΊ.Categorical T - FirstOrder.Language.Theory.isSatisfiable_empty π Mathlib.ModelTheory.Satisfiability
(L : FirstOrder.Language) : β .IsSatisfiable - FirstOrder.Language.Theory.IsMaximal.isComplete π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (h : T.IsMaximal) : T.IsComplete - FirstOrder.Language.Theory.IsSatisfiable.isFinitelySatisfiable π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (h : T.IsSatisfiable) : T.IsFinitelySatisfiable - FirstOrder.Language.Theory.ModelsBoundedFormula π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} (T : L.Theory) {Ξ± : Type w} {n : β} (Ο : L.BoundedFormula Ξ± n) : Prop - FirstOrder.Language.Theory.isSatisfiable_iff_isFinitelySatisfiable π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} : T.IsSatisfiable β T.IsFinitelySatisfiable - FirstOrder.Language.Theory.isSatisfiable_of_isSatisfiable_onTheory π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} {L' : FirstOrder.Language} (Ο : L βα΄Έ L') (h : (Ο.onTheory T).IsSatisfiable) : T.IsSatisfiable - FirstOrder.Language.Theory.Model.isSatisfiable π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (M : Type w) [Nonempty M] [L.Structure M] [M β¨ T] : T.IsSatisfiable - FirstOrder.Language.Theory.IsSatisfiable.mono π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T T' : L.Theory} (h : T'.IsSatisfiable) (hs : T β T') : T.IsSatisfiable - FirstOrder.Language.Theory.isSatisfiable_onTheory_iff π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} {L' : FirstOrder.Language} {Ο : L βα΄Έ L'} (h : Ο.Injective) : (Ο.onTheory T).IsSatisfiable β T.IsSatisfiable - FirstOrder.Language.Theory.models_sentence_of_mem π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} {Ο : L.Sentence} (h : Ο β T) : T β¨α΅ Ο - FirstOrder.Language.Theory.IsMaximal.mem_of_models π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (h : T.IsMaximal) {Ο : L.Sentence} (hΟ : T β¨α΅ Ο) : Ο β T - FirstOrder.Language.Theory.IsMaximal.mem_iff_models π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (h : T.IsMaximal) (Ο : L.Sentence) : Ο β T β T β¨α΅ Ο - FirstOrder.Language.Theory.models_sentence_iff π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} {Ο : L.Sentence} : T β¨α΅ Ο β β (M : T.ModelType), βM β¨ Ο - FirstOrder.Language.Theory.ModelsBoundedFormula.realize_sentence π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} {Ο : L.Sentence} (h : T β¨α΅ Ο) (M : Type u_1) [L.Structure M] [M β¨ T] [Nonempty M] : M β¨ Ο - FirstOrder.Language.Theory.exists_large_model_of_infinite_model π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} (T : L.Theory) (ΞΊ : Cardinal.{w}) (M : Type w') [L.Structure M] [M β¨ T] [Infinite M] : β N, Cardinal.lift.{max u v w, w} ΞΊ β€ Cardinal.mk βN - FirstOrder.Language.Theory.models_toFormula_iff π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο : L.BoundedFormula Ξ± n} : T β¨α΅ Ο.toFormula β T β¨α΅ Ο - FirstOrder.Language.Theory.IsComplete.models_not_iff π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (h : T.IsComplete) (Ο : L.Sentence) : T β¨α΅ FirstOrder.Language.Formula.not Ο β Β¬T β¨α΅ Ο - FirstOrder.Language.Theory.IsMaximal.mem_or_not_mem π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (h : T.IsMaximal) (Ο : L.Sentence) : Ο β T β¨ FirstOrder.Language.Formula.not Ο β T - FirstOrder.Language.Theory.IsComplete.models_elementarily_equivalent π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (h : T.IsComplete) (M : Type u_1) (N : Type u_2) [L.Structure M] [L.Structure N] [M β¨ T] [N β¨ T] [Nonempty M] [Nonempty N] : L.ElementarilyEquivalent M N - Cardinal.Categorical.isComplete π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} (ΞΊ : Cardinal.{w}) (T : L.Theory) (h : ΞΊ.Categorical T) (h1 : Cardinal.aleph0 β€ ΞΊ) (h2 : Cardinal.lift.{w, max u v} L.card β€ Cardinal.lift.{max u v, w} ΞΊ) (hS : T.IsSatisfiable) (hT : β (M : T.ModelType), Infinite βM) : T.IsComplete - FirstOrder.Language.Theory.IsComplete.isComplete_iff_models_elementarily_equivalent π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} : T.IsComplete β T.IsSatisfiable β§ β (M N : T.ModelType), L.ElementarilyEquivalent βM βN - FirstOrder.Language.Theory.IsComplete.realize_sentence_iff π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (h : T.IsComplete) (Ο : L.Sentence) (M : Type u_1) [L.Structure M] [M β¨ T] [Nonempty M] : M β¨ Ο β T β¨α΅ Ο - FirstOrder.Language.Theory.ModelsBoundedFormula.realize_formula π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {Ο : L.Formula Ξ±} (h : T β¨α΅ Ο) (M : Type u_1) [L.Structure M] [M β¨ T] [Nonempty M] {v : Ξ± β M} : Ο.Realize v - FirstOrder.Language.completeTheory.mem_or_not_mem π Mathlib.ModelTheory.Satisfiability
(L : FirstOrder.Language) (M : Type w) [L.Structure M] (Ο : L.Sentence) : Ο β L.completeTheory M β¨ FirstOrder.Language.Formula.not Ο β L.completeTheory M - FirstOrder.Language.Theory.isSatisfiable_directed_union_iff π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {ΞΉ : Type u_1} [Nonempty ΞΉ] {T : ΞΉ β L.Theory} (h : Directed (fun x1 x2 => x1 β x2) T) : FirstOrder.Language.Theory.IsSatisfiable (β i, T i) β β (i : ΞΉ), (T i).IsSatisfiable - FirstOrder.Language.Theory.models_formula_iff π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {Ο : L.Formula Ξ±} : T β¨α΅ Ο β β (M : T.ModelType) (v : Ξ± β βM), Ο.Realize v - FirstOrder.Language.Theory.models_iff_not_satisfiable π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (Ο : L.Sentence) : T β¨α΅ Ο β Β¬(T βͺ {FirstOrder.Language.Formula.not Ο}).IsSatisfiable - FirstOrder.Language.Theory.ModelsBoundedFormula.realize_boundedFormula π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο : L.BoundedFormula Ξ± n} (h : T β¨α΅ Ο) (M : Type u_1) [L.Structure M] [M β¨ T] [Nonempty M] {v : Ξ± β M} {xs : Fin n β M} : Ο.Realize v xs - FirstOrder.Language.Theory.exists_model_card_eq π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (h : β M, Infinite βM) (ΞΊ : Cardinal.{w}) (h1 : Cardinal.aleph0 β€ ΞΊ) (h2 : Cardinal.lift.{w, max u v} L.card β€ Cardinal.lift.{max u v, w} ΞΊ) : β N, Cardinal.mk βN = ΞΊ - FirstOrder.Language.Theory.isSatisfiable_union_distinctConstantsTheory_of_infinite π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {Ξ± : Type w} (T : L.Theory) (s : Set Ξ±) (M : Type w') [L.Structure M] [M β¨ T] [Infinite M] : ((L.lhomWithConstants Ξ±).onTheory T βͺ L.distinctConstantsTheory s).IsSatisfiable - FirstOrder.Language.Theory.models_of_models_theory π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {T' : L.Theory} (h : β Ο β T', T β¨α΅ Ο) {Ο : L.Formula Ξ±} (hΟ : T' β¨α΅ Ο) : T β¨α΅ Ο - FirstOrder.Language.Theory.isSatisfiable_iUnion_iff_isSatisfiable_iUnion_finset π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {ΞΉ : Type u_1} (T : ΞΉ β L.Theory) : FirstOrder.Language.Theory.IsSatisfiable (β i, T i) β β (s : Finset ΞΉ), FirstOrder.Language.Theory.IsSatisfiable (β i β s, T i) - FirstOrder.Language.Theory.isSatisfiable_union_distinctConstantsTheory_of_card_le π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {Ξ± : Type w} (T : L.Theory) (s : Set Ξ±) (M : Type w') [Nonempty M] [L.Structure M] [M β¨ T] (h : Cardinal.lift.{w', w} (Cardinal.mk βs) β€ Cardinal.lift.{w, w'} (Cardinal.mk M)) : ((L.lhomWithConstants Ξ±).onTheory T βͺ L.distinctConstantsTheory s).IsSatisfiable - FirstOrder.Language.Theory.IsComplete.eq_complete_theory π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (h : T.IsComplete) (M : Type u_1) [L.Structure M] [M β¨ T] [Nonempty M] : {Ο | T β¨α΅ Ο} = L.completeTheory M - FirstOrder.Language.Theory.models_iff_finset_models π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} {Ο : L.Sentence} : T β¨α΅ Ο β β T0, βT0 β T β§ βT0 β¨α΅ Ο - FirstOrder.Language.Theory.models_formula_iff_onTheory_models_equivSentence π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {Ο : L.Formula Ξ±} : T β¨α΅ Ο β (L.lhomWithConstants Ξ±).onTheory T β¨α΅ FirstOrder.Language.Formula.equivSentence Ο - FirstOrder.Language.Theory.ACF π Mathlib.ModelTheory.Algebra.Field.IsAlgClosed
(p : β) : FirstOrder.Language.ring.Theory - FirstOrder.Language.Theory.iffSetoid π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {Ξ± : Type w} {n : β} (T : L.Theory) : Setoid (L.BoundedFormula Ξ± n) - FirstOrder.Language.Theory.Iff π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {Ξ± : Type w} {n : β} (T : L.Theory) (Ο Ο : L.BoundedFormula Ξ± n) : Prop - FirstOrder.Language.Theory.Imp π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {Ξ± : Type w} {n : β} (T : L.Theory) (Ο Ο : L.BoundedFormula Ξ± n) : Prop - FirstOrder.Language.Theory.Iff.instIsTransBoundedFormula π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} : IsTrans (L.BoundedFormula Ξ± n) T.Iff - FirstOrder.Language.Theory.Iff.instReflBoundedFormula π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} : Std.Refl T.Iff - FirstOrder.Language.Theory.Iff.instSymmBoundedFormula π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} : Std.Symm T.Iff - FirstOrder.Language.Theory.Imp.instIsTransBoundedFormula π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} : IsTrans (L.BoundedFormula Ξ± n) T.Imp - FirstOrder.Language.Theory.Imp.instReflBoundedFormula π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} : Std.Refl T.Imp - FirstOrder.Language.Theory.Iff.refl π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο : L.BoundedFormula Ξ± n) : T.Iff Ο Ο - FirstOrder.Language.Theory.Imp.refl π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο : L.BoundedFormula Ξ± n) : T.Imp Ο Ο - FirstOrder.Language.BoundedFormula.iff_not_not π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο : L.BoundedFormula Ξ± n) : T.Iff Ο Ο.not.not - FirstOrder.Language.Formula.iff_not_not π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (Ο : L.Formula Ξ±) : T.Iff Ο Ο.not.not - FirstOrder.Language.Theory.bot_imp π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο : L.BoundedFormula Ξ± n) : T.Imp β₯ Ο - FirstOrder.Language.Theory.imp_top π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο : L.BoundedFormula Ξ± n) : T.Imp Ο β€ - FirstOrder.Language.Theory.Iff.mp π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο : L.BoundedFormula Ξ± n} (h : T.Iff Ο Ο) : T.Imp Ο Ο - FirstOrder.Language.Theory.Iff.mpr π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο : L.BoundedFormula Ξ± n} (h : T.Iff Ο Ο) : T.Imp Ο Ο - FirstOrder.Language.Theory.Iff.symm π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο : L.BoundedFormula Ξ± n} (h : T.Iff Ο Ο) : T.Iff Ο Ο - FirstOrder.Language.BoundedFormula.iff_all_liftAt π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο : L.BoundedFormula Ξ± n) : T.Iff Ο (FirstOrder.Language.BoundedFormula.liftAt 1 n Ο).all - FirstOrder.Language.Theory.imp_sup_left π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο Ο : L.BoundedFormula Ξ± n) : T.Imp Ο (Ο β Ο) - FirstOrder.Language.Theory.imp_sup_right π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο Ο : L.BoundedFormula Ξ± n) : T.Imp Ο (Ο β Ο) - FirstOrder.Language.Theory.inf_imp_left π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο Ο : L.BoundedFormula Ξ± n) : T.Imp (Ο β Ο) Ο - FirstOrder.Language.Theory.inf_imp_right π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο Ο : L.BoundedFormula Ξ± n) : T.Imp (Ο β Ο) Ο - FirstOrder.Language.Theory.imp_antisymm π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο : L.BoundedFormula Ξ± n} (hβ : T.Imp Ο Ο) (hβ : T.Imp Ο Ο) : T.Iff Ο Ο - FirstOrder.Language.Theory.Iff.not π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο : L.BoundedFormula Ξ± n} (h : T.Iff Ο Ο) : T.Iff Ο.not Ο.not - FirstOrder.Language.Theory.iff_iff_imp_and_imp π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο : L.BoundedFormula Ξ± n} : T.Iff Ο Ο β T.Imp Ο Ο β§ T.Imp Ο Ο - FirstOrder.Language.BoundedFormula.inf_not_iff_bot π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο : L.BoundedFormula Ξ± n) : T.Iff (Ο β Ο.not) β₯ - FirstOrder.Language.BoundedFormula.sup_not_iff_top π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο : L.BoundedFormula Ξ± n) : T.Iff (Ο β Ο.not) β€ - FirstOrder.Language.Theory.Iff.trans π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο ΞΈ : L.BoundedFormula Ξ± n} (h1 : T.Iff Ο Ο) (h2 : T.Iff Ο ΞΈ) : T.Iff Ο ΞΈ - FirstOrder.Language.Theory.Imp.trans π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο ΞΈ : L.BoundedFormula Ξ± n} (h1 : T.Imp Ο Ο) (h2 : T.Imp Ο ΞΈ) : T.Imp Ο ΞΈ - FirstOrder.Language.BoundedFormula.imp_iff_not_sup π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο Ο : L.BoundedFormula Ξ± n) : T.Iff (Ο.imp Ο) (Ο.not β Ο) - FirstOrder.Language.Theory.Iff.models_sentence_iff π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ο Ο : L.Sentence} {M : Type u_2} [Nonempty M] [L.Structure M] [M β¨ T] (h : T.Iff Ο Ο) : M β¨ Ο β M β¨ Ο - FirstOrder.Language.Formula.imp_iff_not_sup π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (Ο Ο : L.Formula Ξ±) : T.Iff (Ο.imp Ο) (Ο.not β Ο) - FirstOrder.Language.Theory.imp_inf π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο ΞΈ : L.BoundedFormula Ξ± n} (hβ : T.Imp Ο Ο) (hβ : T.Imp Ο ΞΈ) : T.Imp Ο (Ο β ΞΈ) - FirstOrder.Language.Theory.sup_imp π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο ΞΈ : L.BoundedFormula Ξ± n} (hβ : T.Imp Ο ΞΈ) (hβ : T.Imp Ο ΞΈ) : T.Imp (Ο β Ο) ΞΈ - FirstOrder.Language.Theory.Iff.realize_iff π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {Ο Ο : L.Formula Ξ±} {M : Type u_2} [Nonempty M] [L.Structure M] [M β¨ T] (h : T.Iff Ο Ο) {v : Ξ± β M} : Ο.Realize v β Ο.Realize v - FirstOrder.Language.Theory.imp_inf_iff π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο ΞΈ : L.BoundedFormula Ξ± n} : T.Imp Ο (Ο β ΞΈ) β T.Imp Ο Ο β§ T.Imp Ο ΞΈ - FirstOrder.Language.Theory.sup_imp_iff π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο ΞΈ : L.BoundedFormula Ξ± n} : T.Imp (Ο β Ο) ΞΈ β T.Imp Ο ΞΈ β§ T.Imp Ο ΞΈ - FirstOrder.Language.BoundedFormula.inf_iff_not_sup_not π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο Ο : L.BoundedFormula Ξ± n) : T.Iff (Ο β Ο) (Ο.not β Ο.not).not - FirstOrder.Language.BoundedFormula.sup_iff_not_inf_not π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο Ο : L.BoundedFormula Ξ± n) : T.Iff (Ο β Ο) (Ο.not β Ο.not).not - FirstOrder.Language.Theory.Iff.imp π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο Ο' Ο' : L.BoundedFormula Ξ± n} (h : T.Iff Ο Ο) (h' : T.Iff Ο' Ο') : T.Iff (Ο.imp Ο') (Ο.imp Ο') - FirstOrder.Language.Theory.Iff.realize_bd_iff π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {M : Type u_1} [Nonempty M] [L.Structure M] [M β¨ T] {Ο Ο : L.BoundedFormula Ξ± n} (h : T.Iff Ο Ο) {v : Ξ± β M} {xs : Fin n β M} : Ο.Realize v xs β Ο.Realize v xs - FirstOrder.Language.BoundedFormula.all_iff_not_ex_not π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο : L.BoundedFormula Ξ± (n + 1)) : T.Iff Ο.all Ο.not.ex.not - FirstOrder.Language.BoundedFormula.ex_iff_not_all_not π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} (Ο : L.BoundedFormula Ξ± (n + 1)) : T.Iff Ο.ex Ο.not.all.not - FirstOrder.Language.Formula.inf_iff_not_sup_not π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (Ο Ο : L.Formula Ξ±) : T.Iff (Ο β Ο) (Ο.not β Ο.not).not - FirstOrder.Language.Formula.sup_iff_not_inf_not π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (Ο Ο : L.Formula Ξ±) : T.Iff (Ο β Ο) (Ο.not β Ο.not).not - FirstOrder.Language.Theory.Iff.all π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο : L.BoundedFormula Ξ± (n + 1)} (h : T.Iff Ο Ο) : T.Iff Ο.all Ο.all - FirstOrder.Language.Theory.Iff.ex π Mathlib.ModelTheory.Equivalence
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {n : β} {Ο Ο : L.BoundedFormula Ξ± (n + 1)} (h : T.Iff Ο Ο) : T.Iff Ο.ex Ο.ex - FirstOrder.Language.Theory.IsUniversal π Mathlib.ModelTheory.Complexity
{L : FirstOrder.Language} (T : L.Theory) : Prop - FirstOrder.Language.BoundedFormula.iff_toPrenex π Mathlib.ModelTheory.Complexity
{L : FirstOrder.Language} {Ξ± : Type u'} {n : β} (Ο : L.BoundedFormula Ξ± n) : β .Iff Ο Ο.toPrenex - FirstOrder.Language.Theory.IsUniversal.isUniversal_of_mem π Mathlib.ModelTheory.Complexity
{L : FirstOrder.Language} {T : L.Theory} [self : T.IsUniversal] β¦Ο : L.Sentenceβ¦ : Ο β T β FirstOrder.Language.BoundedFormula.IsUniversal Ο - FirstOrder.Language.Theory.IsUniversal.mk π Mathlib.ModelTheory.Complexity
{L : FirstOrder.Language} {T : L.Theory} (isUniversal_of_mem : β β¦Ο : L.Sentenceβ¦, Ο β T β FirstOrder.Language.BoundedFormula.IsUniversal Ο) : T.IsUniversal - FirstOrder.Language.Theory.IsUniversal.insert π Mathlib.ModelTheory.Complexity
{L : FirstOrder.Language} {T : L.Theory} [hT : T.IsUniversal] {Ο : L.Sentence} (hΟ : FirstOrder.Language.BoundedFormula.IsUniversal Ο) : (insert Ο T).IsUniversal - FirstOrder.Language.Theory.IsUniversal.models_of_embedding π Mathlib.ModelTheory.Complexity
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {T : L.Theory} [hT : T.IsUniversal] {N : Type u_1} [L.Structure N] [N β¨ T] (f : L.Embedding M N) : M β¨ T - FirstOrder.Language.Substructure.models_of_isUniversal π Mathlib.ModelTheory.Complexity
{L : FirstOrder.Language} {M : Type w} [L.Structure M] (S : L.Substructure M) (T : L.Theory) [T.IsUniversal] [M β¨ T] : β₯S β¨ T - FirstOrder.Language.BoundedFormula.IsQF.induction_on_inf_not π Mathlib.ModelTheory.Complexity
{L : FirstOrder.Language} {Ξ± : Type u'} {n : β} {P : L.BoundedFormula Ξ± n β Prop} {Ο : L.BoundedFormula Ξ± n} (h : Ο.IsQF) (hf : P β₯) (ha : β (Ο : L.BoundedFormula Ξ± n), Ο.IsAtomic β P Ο) (hinf : β {Οβ Οβ : L.BoundedFormula Ξ± n}, P Οβ β P Οβ β P (Οβ β Οβ)) (hnot : β {Ο : L.BoundedFormula Ξ± n}, P Ο β P Ο.not) (hse : β {Οβ Οβ : L.BoundedFormula Ξ± n}, β .Iff Οβ Οβ β (P Οβ β P Οβ)) : P Ο - FirstOrder.Language.BoundedFormula.IsQF.induction_on_sup_not π Mathlib.ModelTheory.Complexity
{L : FirstOrder.Language} {Ξ± : Type u'} {n : β} {P : L.BoundedFormula Ξ± n β Prop} {Ο : L.BoundedFormula Ξ± n} (h : Ο.IsQF) (hf : P β₯) (ha : β (Ο : L.BoundedFormula Ξ± n), Ο.IsAtomic β P Ο) (hsup : β {Οβ Οβ : L.BoundedFormula Ξ± n}, P Οβ β P Οβ β P (Οβ β Οβ)) (hnot : β {Ο : L.BoundedFormula Ξ± n}, P Ο β P Ο.not) (hse : β {Οβ Οβ : L.BoundedFormula Ξ± n}, β .Iff Οβ Οβ β (P Οβ β P Οβ)) : P Ο - FirstOrder.Language.BoundedFormula.induction_on_exists_not π Mathlib.ModelTheory.Complexity
{L : FirstOrder.Language} {Ξ± : Type u'} {n : β} {P : {m : β} β L.BoundedFormula Ξ± m β Prop} (Ο : L.BoundedFormula Ξ± n) (hqf : β {m : β} {Ο : L.BoundedFormula Ξ± m}, Ο.IsQF β P Ο) (hnot : β {m : β} {Ο : L.BoundedFormula Ξ± m}, P Ο β P Ο.not) (hex : β {m : β} {Ο : L.BoundedFormula Ξ± (m + 1)}, P Ο β P Ο.ex) (hse : β {m : β} {Οβ Οβ : L.BoundedFormula Ξ± m}, β .Iff Οβ Οβ β (P Οβ β P Οβ)) : P Ο - FirstOrder.Language.BoundedFormula.induction_on_all_ex π Mathlib.ModelTheory.Complexity
{L : FirstOrder.Language} {Ξ± : Type u'} {n : β} {P : {m : β} β L.BoundedFormula Ξ± m β Prop} (Ο : L.BoundedFormula Ξ± n) (hqf : β {m : β} {Ο : L.BoundedFormula Ξ± m}, Ο.IsQF β P Ο) (hall : β {m : β} {Ο : L.BoundedFormula Ξ± (m + 1)}, P Ο β P Ο.all) (hex : β {m : β} {Ο : L.BoundedFormula Ξ± (m + 1)}, P Ο β P Ο.ex) (hse : β {m : β} {Οβ Οβ : L.BoundedFormula Ξ± m}, β .Iff Οβ Οβ β (P Οβ β P Οβ)) : P Ο - FirstOrder.Language.Theory.simpleGraph π Mathlib.ModelTheory.Graph
: FirstOrder.Language.graph.Theory - FirstOrder.Language.dlo π Mathlib.ModelTheory.Order
(L : FirstOrder.Language) [L.IsOrdered] : L.Theory - FirstOrder.Language.linearOrderTheory π Mathlib.ModelTheory.Order
(L : FirstOrder.Language) [L.IsOrdered] : L.Theory - FirstOrder.Language.partialOrderTheory π Mathlib.ModelTheory.Order
(L : FirstOrder.Language) [L.IsOrdered] : L.Theory - FirstOrder.Language.preorderTheory π Mathlib.ModelTheory.Order
(L : FirstOrder.Language) [L.IsOrdered] : L.Theory - FirstOrder.Language.Theory.CompleteType π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} (T : L.Theory) (Ξ± : Type w) : Type (max (max u v) w) - FirstOrder.Language.Theory.CompleteType.instPartialOrder π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} : PartialOrder (T.CompleteType Ξ±) - FirstOrder.Language.Theory.CompleteType.instNonempty π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {Ξ± : Type w} : Nonempty (β .CompleteType Ξ±) - FirstOrder.Language.Theory.CompleteType.toTheory π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (self : T.CompleteType Ξ±) : (L.withConstants Ξ±).Theory - FirstOrder.Language.Theory.typesWith π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {Ξ± : Type w} (T : L.Theory) : (L.withConstants Ξ±).Sentence β Set (T.CompleteType Ξ±) - FirstOrder.Language.Theory.CompleteType.nonempty_iff π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} : Nonempty (T.CompleteType Ξ±) β T.IsSatisfiable - FirstOrder.Language.Theory.CompleteType.Sentence.instSetLike π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} : SetLike (T.CompleteType Ξ±) (L.withConstants Ξ±).Sentence - FirstOrder.Language.Theory.CompleteType.isMaximal' π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (self : T.CompleteType Ξ±) : (βself).IsMaximal - FirstOrder.Language.Theory.realizedTypes π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} (T : L.Theory) (M : Type w') [L.Structure M] [Nonempty M] [M β¨ T] (Ξ± : Type w) : Set (T.CompleteType Ξ±) - FirstOrder.Language.Theory.typeOf π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} (T : L.Theory) {Ξ± : Type w} {M : Type w'} [L.Structure M] [Nonempty M] [M β¨ T] (v : Ξ± β M) : T.CompleteType Ξ± - FirstOrder.Language.Theory.CompleteType.isMaximal π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (p : T.CompleteType Ξ±) : FirstOrder.Language.Theory.IsMaximal βp - FirstOrder.Language.Theory.CompleteType.subset' π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (self : T.CompleteType Ξ±) : (L.lhomWithConstants Ξ±).onTheory T β βself - FirstOrder.Language.Theory.CompleteType.typesWith_top π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} : T.typesWith β€ = Set.univ - FirstOrder.Language.Theory.CompleteType.mk π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (toTheory : (L.withConstants Ξ±).Theory) (subset' : (L.lhomWithConstants Ξ±).onTheory T β toTheory) (isMaximal' : toTheory.IsMaximal) : T.CompleteType Ξ± - FirstOrder.Language.Theory.CompleteType.subset π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (p : T.CompleteType Ξ±) : (L.lhomWithConstants Ξ±).onTheory T β βp - FirstOrder.Language.Theory.CompleteType.false_of_mem_of_not_mem π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} (hT : T.IsSatisfiable) {Ο : L.Sentence} (hΟ : Ο β T) (hΟ' : FirstOrder.Language.BoundedFormula.not Ο β T) : False - FirstOrder.Language.Theory.CompleteType.typesWith_not π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (Ο : (L.withConstants Ξ±).Sentence) : T.typesWith (FirstOrder.Language.BoundedFormula.not Ο) = (T.typesWith Ο)αΆ - FirstOrder.Language.Theory.CompleteType.typesWith_eq_univ_of_mem_onTheory_lhomWithConstants π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {Ο : (L.withConstants Ξ±).Sentence} (hΟ : Ο β (L.lhomWithConstants Ξ±).onTheory T) : T.typesWith Ο = Set.univ - FirstOrder.Language.Theory.exists_modelType_is_realized_in π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} (T : L.Theory) {Ξ± : Type w} (p : T.CompleteType Ξ±) : β M, p β T.realizedTypes (βM) Ξ± - FirstOrder.Language.Theory.CompleteType.mem_of_models π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (p : T.CompleteType Ξ±) {Ο : (L.withConstants Ξ±).Sentence} (h : (L.lhomWithConstants Ξ±).onTheory T β¨α΅ Ο) : Ο β p - FirstOrder.Language.Theory.CompleteType.mem_typesWith_iff π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (Ο : (L.withConstants Ξ±).Sentence) (p : T.CompleteType Ξ±) : p β T.typesWith Ο β Ο β p - FirstOrder.Language.Theory.CompleteType.typesWith_inf π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (Ο Ο : (L.withConstants Ξ±).Sentence) : T.typesWith (Ο β Ο) = T.typesWith Ο β© T.typesWith Ο - FirstOrder.Language.Theory.CompleteType.mem_or_not_mem π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (p : T.CompleteType Ξ±) (Ο : (L.withConstants Ξ±).Sentence) : Ο β p β¨ FirstOrder.Language.Formula.not Ο β p - FirstOrder.Language.Theory.CompleteType.not_mem_iff π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (p : T.CompleteType Ξ±) (Ο : (L.withConstants Ξ±).Sentence) : FirstOrder.Language.Formula.not Ο β p β Ο β p - FirstOrder.Language.Theory.CompleteType.setOfPred_mem_eq_univ_iff π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (Ο : (L.withConstants Ξ±).Sentence) : {p | Ο β p} = Set.univ β (L.lhomWithConstants Ξ±).onTheory T β¨α΅ Ο - FirstOrder.Language.Theory.CompleteType.setOf_mem_eq_univ_iff π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (Ο : (L.withConstants Ξ±).Sentence) : {p | Ο β p} = Set.univ β (L.lhomWithConstants Ξ±).onTheory T β¨α΅ Ο
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
β’ (_ : Type _)finds all definitions which provide data whileβ’ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59