Loogle!
Result
Found 131 declarations mentioning FirstOrder.Language.Sentence.
- FirstOrder.Language.Sentence π Mathlib.ModelTheory.Syntax
(L : FirstOrder.Language) : Type (max u v) - FirstOrder.Language.Sentence.cardGe π Mathlib.ModelTheory.Syntax
(L : FirstOrder.Language) (n : β) : L.Sentence - FirstOrder.Language.Formula.exClosure π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {Ξ± : Type u'} [DecidableEq Ξ±] (Ο : L.Formula Ξ±) : L.Sentence - FirstOrder.Language.LHom.onSentence π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {L' : FirstOrder.Language} (g : L βα΄Έ L') : L.Sentence β L'.Sentence - FirstOrder.Language.Formula.equivSentence π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {Ξ± : Type u'} : L.Formula Ξ± β (L.withConstants Ξ±).Sentence - FirstOrder.Language.LEquiv.onSentence π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {L' : FirstOrder.Language} (Ο : L βα΄Έ L') : L.Sentence β L'.Sentence - FirstOrder.Language.Relations.antisymmetric π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} (r : L.Relations 2) : L.Sentence - FirstOrder.Language.Relations.irreflexive π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} (r : L.Relations 2) : L.Sentence - FirstOrder.Language.Relations.reflexive π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} (r : L.Relations 2) : L.Sentence - FirstOrder.Language.Relations.symmetric π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} (r : L.Relations 2) : L.Sentence - FirstOrder.Language.Relations.total π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} (r : L.Relations 2) : L.Sentence - FirstOrder.Language.Relations.transitive π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} (r : L.Relations 2) : L.Sentence - 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.LEquiv.onSentence_apply π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {L' : FirstOrder.Language} (Ο : L βα΄Έ L') (aβ : L.BoundedFormula Empty 0) : Ο.onSentence aβ = Ο.toLHom.onBoundedFormula aβ - FirstOrder.Language.LEquiv.onSentence_symm_apply π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {L' : FirstOrder.Language} (Ο : L βα΄Έ L') (aβ : L'.BoundedFormula Empty 0) : Ο.onSentence.symm aβ = Ο.invLHom.onBoundedFormula aβ - FirstOrder.Language.Formula.equivSentence_not π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {Ξ± : Type u'} (Ο : L.Formula Ξ±) : FirstOrder.Language.Formula.equivSentence Ο.not = FirstOrder.Language.Formula.not (FirstOrder.Language.Formula.equivSentence Ο) - FirstOrder.Language.Formula.equivSentence_inf π Mathlib.ModelTheory.Syntax
{L : FirstOrder.Language} {Ξ± : Type u'} (Ο Ο : L.Formula Ξ±) : FirstOrder.Language.Formula.equivSentence (Ο β Ο) = FirstOrder.Language.Formula.equivSentence Ο β FirstOrder.Language.Formula.equivSentence Ο - FirstOrder.Language.Sentence.Realize π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) [L.Structure M] (Ο : L.Sentence) : Prop - FirstOrder.Language.model_empty π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] : M β¨ β - FirstOrder.Language.Sentence.realize_top π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) [L.Structure M] : M β¨ β€ - FirstOrder.Language.Sentence.not_realize_bot π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) [L.Structure M] : Β¬M β¨ β₯ - FirstOrder.Language.Sentence.realize_not π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) [L.Structure M] {Ο : L.Sentence} : M β¨ FirstOrder.Language.Formula.not Ο β Β¬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.Theory.model_singleton_iff π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {Ο : L.Sentence} : M β¨ {Ο} β M β¨ Ο - 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.realize_sentence π 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.Sentence) : M β¨ Ο β N β¨ Ο - FirstOrder.Language.elementarilyEquivalent_iff π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} {N : Type u_1} [L.Structure M] [L.Structure N] : L.ElementarilyEquivalent M N β β (Ο : L.Sentence), M β¨ Ο β N β¨ Ο - FirstOrder.Language.Sentence.realize_imp π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) [L.Structure M] {Ο Ο : L.Sentence} : M β¨ FirstOrder.Language.Formula.imp Ο Ο β M β¨ Ο β M β¨ Ο - 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.realize_iff_of_model_completeTheory π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) (N : Type u_1) [L.Structure M] [L.Structure N] [N β¨ L.completeTheory M] (Ο : L.Sentence) : N β¨ Ο β M β¨ Ο - FirstOrder.Language.Sentence.realize_iff π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) [L.Structure M] {Ο Ο : L.Sentence} : M β¨ FirstOrder.Language.Formula.iff Ο Ο β (M β¨ Ο β 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.realize_onSentence π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {L' : FirstOrder.Language} (M : Type w) [L.Structure M] [L'.Structure M] (Ο : L βα΄Έ L') [Ο.IsExpansionOn M] (Ο : L.Sentence) : M β¨ Ο.onSentence Ο β M β¨ Ο - FirstOrder.Language.Sentence.realize_inf π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) [L.Structure M] {Ο Ο : L.Sentence} : M β¨ Ο β Ο β M β¨ Ο β§ M β¨ Ο - FirstOrder.Language.Sentence.realize_sup π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) [L.Structure M] {Ο Ο : L.Sentence} : M β¨ Ο β Ο β M β¨ Ο β¨ M β¨ Ο - FirstOrder.Language.StrongHomClass.realize_sentence π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} {N : Type u_1} [L.Structure M] [L.Structure N] {F : Type u_4} [EquivLike F M N] [L.StrongHomClass F M N] (g : F) (Ο : L.Sentence) : M β¨ Ο β N β¨ Ο - FirstOrder.Language.Formula.exists_realize_equivSentence_iff_realize_exClosure π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {Ξ± : Type u'} [DecidableEq Ξ±] [Nonempty M] {Ο : L.Formula Ξ±} : (β v, M β¨ FirstOrder.Language.Formula.equivSentence Ο) β M β¨ Ο.exClosure - FirstOrder.Language.Formula.realize_exClosure_of_realize_equivSentence π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} {M : Type w} [L.Structure M] {Ξ± : Type u'} [DecidableEq Ξ±] [(L.withConstants Ξ±).Structure M] [(L.lhomWithConstants Ξ±).IsExpansionOn M] {Ο : L.Formula Ξ±} (h : M β¨ FirstOrder.Language.Formula.equivSentence Ο) : M β¨ Ο.exClosure - FirstOrder.Language.Formula.realize_equivSentence_symm π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) [L.Structure M] {Ξ± : Type u'} (Ο : (L.withConstants Ξ±).Sentence) (v : Ξ± β M) : (FirstOrder.Language.Formula.equivSentence.symm Ο).Realize v β M β¨ Ο - FirstOrder.Language.Formula.realize_equivSentence π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) [L.Structure M] {Ξ± : Type u'} [(L.withConstants Ξ±).Structure M] [(L.lhomWithConstants Ξ±).IsExpansionOn M] (Ο : L.Formula Ξ±) : M β¨ FirstOrder.Language.Formula.equivSentence Ο β Ο.Realize fun a => β(L.con a) - FirstOrder.Language.Formula.realize_equivSentence_symm_con π Mathlib.ModelTheory.Semantics
{L : FirstOrder.Language} (M : Type w) [L.Structure M] {Ξ± : Type u'} [(L.withConstants Ξ±).Structure M] [(L.lhomWithConstants Ξ±).IsExpansionOn M] (Ο : (L.withConstants Ξ±).Sentence) : ((FirstOrder.Language.Formula.equivSentence.symm Ο).Realize fun a => β(L.con a)) β M β¨ Ο - FirstOrder.Field.FieldAxiom.toSentence π Mathlib.ModelTheory.Algebra.Field.Basic
: FirstOrder.Field.FieldAxiom β FirstOrder.Language.ring.Sentence - FirstOrder.Field.eqZero π Mathlib.ModelTheory.Algebra.Field.CharP
(n : β) : FirstOrder.Language.ring.Sentence - FirstOrder.Language.Ultraproduct.sentence_realize π Mathlib.ModelTheory.Ultraproducts
{Ξ± : Type u_1} {M : Ξ± β Type u_2} {u : Ultrafilter Ξ±} {L : FirstOrder.Language} [(a : Ξ±) β L.Structure (M a)] [β (a : Ξ±), Nonempty (M a)] (Ο : L.Sentence) : (βu).Product M β¨ Ο β βαΆ (a : Ξ±) in βu, M a β¨ Ο - FirstOrder.Language.ElementaryEmbedding.map_sentence π 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) (Ο : L.Sentence) : M β¨ Ο β N β¨ Ο - FirstOrder.Language.ElementarySubstructure.realize_sentence π Mathlib.ModelTheory.ElementarySubstructures
{L : FirstOrder.Language} {M : Type u_1} [L.Structure M] (S : L.ElementarySubstructure M) (Ο : L.Sentence) : β₯S β¨ Ο β M β¨ Ο - FirstOrder.Language.Theory.ModelType.instInhabited π Mathlib.ModelTheory.Bundled
{L : FirstOrder.Language} : Inhabited β .ModelType - 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.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.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.isSatisfiable_empty π Mathlib.ModelTheory.Satisfiability
(L : FirstOrder.Language) : β .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.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.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.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.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_iff_not_satisfiable π Mathlib.ModelTheory.Satisfiability
{L : FirstOrder.Language} {T : L.Theory} (Ο : L.Sentence) : T β¨α΅ Ο β Β¬(T βͺ {FirstOrder.Language.Formula.not Ο}).IsSatisfiable - 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.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.Field.genericMonicPolyHasRoot π Mathlib.ModelTheory.Algebra.Field.IsAlgClosed
(n : β) : FirstOrder.Language.ring.Sentence - FirstOrder.Field.ACF_zero_realize_iff_infinite_ACF_prime_realize π Mathlib.ModelTheory.Algebra.Field.IsAlgClosed
{Ο : FirstOrder.Language.ring.Sentence} : FirstOrder.Language.Theory.ACF 0 β¨α΅ Ο β {p | FirstOrder.Language.Theory.ACF βp β¨α΅ Ο}.Infinite - FirstOrder.Field.finite_ACF_prime_not_realize_of_ACF_zero_realize π Mathlib.ModelTheory.Algebra.Field.IsAlgClosed
(Ο : FirstOrder.Language.ring.Sentence) (h : FirstOrder.Language.Theory.ACF 0 β¨α΅ Ο) : {p | Β¬FirstOrder.Language.Theory.ACF βp β¨α΅ Ο}.Finite - FirstOrder.Field.ACF_zero_realize_iff_finite_ACF_prime_not_realize π Mathlib.ModelTheory.Algebra.Field.IsAlgClosed
{Ο : FirstOrder.Language.ring.Sentence} : FirstOrder.Language.Theory.ACF 0 β¨α΅ Ο β {p | FirstOrder.Language.Theory.ACF βp β¨α΅ Ο}αΆ.Finite - FirstOrder.genericPolyMapSurjOnOfInjOn π Mathlib.FieldTheory.AxGrothendieck
{ΞΉ : Type u_1} {Ξ± : Type u_2} [Finite Ξ±] [Finite ΞΉ] (Ο : FirstOrder.Language.ring.Formula (Ξ± β ΞΉ)) (mons : ΞΉ β Finset (ΞΉ ββ β)) : FirstOrder.Language.ring.Sentence - 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.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.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.denselyOrderedSentence π Mathlib.ModelTheory.Order
(L : FirstOrder.Language) [L.IsOrdered] : L.Sentence - FirstOrder.Language.noBotOrderSentence π Mathlib.ModelTheory.Order
(L : FirstOrder.Language) [L.IsOrdered] : L.Sentence - FirstOrder.Language.noTopOrderSentence π Mathlib.ModelTheory.Order
(L : FirstOrder.Language) [L.IsOrdered] : L.Sentence - FirstOrder.Language.Theory.CompleteType.instNonempty π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {Ξ± : Type w} : Nonempty (β .CompleteType Ξ±) - 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.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} (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.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 β¨α΅ Ο - FirstOrder.Language.Theory.CompleteType.setOfPred_subset_eq_empty_iff π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (S : (L.withConstants Ξ±).Theory) : {p | S β βp} = β β Β¬((L.lhomWithConstants Ξ±).onTheory T βͺ S).IsSatisfiable - FirstOrder.Language.Theory.CompleteType.setOf_subset_eq_empty_iff π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (S : (L.withConstants Ξ±).Theory) : {p | S β βp} = β β Β¬((L.lhomWithConstants Ξ±).onTheory T βͺ S).IsSatisfiable - FirstOrder.Language.Theory.CompleteType.setOfPred_subset_eq_univ_iff π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (S : (L.withConstants Ξ±).Theory) : {p | S β βp} = Set.univ β β Ο β S, (L.lhomWithConstants Ξ±).onTheory T β¨α΅ Ο - FirstOrder.Language.Theory.CompleteType.setOf_subset_eq_univ_iff π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} (S : (L.withConstants Ξ±).Theory) : {p | S β βp} = Set.univ β β Ο β S, (L.lhomWithConstants Ξ±).onTheory T β¨α΅ Ο - FirstOrder.Language.Theory.CompleteType.compl_setOfPred_mem π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {Ο : (L.withConstants Ξ±).Sentence} : {p | Ο β p}αΆ = {p | FirstOrder.Language.Formula.not Ο β p} - FirstOrder.Language.Theory.CompleteType.compl_setOf_mem π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {Ο : (L.withConstants Ξ±).Sentence} : {p | Ο β p}αΆ = {p | FirstOrder.Language.Formula.not Ο β p} - FirstOrder.Language.Theory.CompleteType.iInter_setOfPred_subset π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {ΞΉ : Type u_1} (S : ΞΉ β (L.withConstants Ξ±).Theory) : β i, {p | S i β βp} = {p | β i, S i β βp} - FirstOrder.Language.Theory.CompleteType.iInter_setOf_subset π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {ΞΉ : Type u_1} (S : ΞΉ β (L.withConstants Ξ±).Theory) : β i, {p | S i β βp} = {p | β i, S i β βp} - FirstOrder.Language.Theory.CompleteType.formula_mem_typeOf π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {M : Type w'} [L.Structure M] [Nonempty M] [M β¨ T] {v : Ξ± β M} {Ο : L.Formula Ξ±} : FirstOrder.Language.Formula.equivSentence Ο β T.typeOf v β Ο.Realize v - FirstOrder.Language.Theory.CompleteType.mem_typeOf π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {M : Type w'} [L.Structure M] [Nonempty M] [M β¨ T] {v : Ξ± β M} {Ο : (L.withConstants Ξ±).Sentence} : Ο β T.typeOf v β (FirstOrder.Language.Formula.equivSentence.symm Ο).Realize v - FirstOrder.Language.Theory.CompleteType.toList_foldr_inf_mem π Mathlib.ModelTheory.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type w} {p : T.CompleteType Ξ±} {t : Finset (L.withConstants Ξ±).Sentence} : List.foldr (fun x1 x2 => x1 β x2) β€ t.toList β p β βt β βp - CompleteType.isClopen_typesWith π Mathlib.ModelTheory.Topology.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type u_1} (Ο : (L.withConstants Ξ±).Sentence) : IsClopen (T.typesWith Ο) - CompleteType.isClosed_typesWith π Mathlib.ModelTheory.Topology.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type u_1} (Ο : (L.withConstants Ξ±).Sentence) : IsClosed (T.typesWith Ο) - CompleteType.isOpen_typesWith π Mathlib.ModelTheory.Topology.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type u_1} (Ο : (L.withConstants Ξ±).Sentence) : IsOpen (T.typesWith Ο) - CompleteType.isTopologicalBasis_range_typesWith π Mathlib.ModelTheory.Topology.Types
{L : FirstOrder.Language} {T : L.Theory} {Ξ± : Type u_1} : TopologicalSpace.IsTopologicalBasis (Set.range T.typesWith)
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 ce5dd8c