Mathlib Map

Theorems · Theorem · logic and foundations

FirstOrder.Language.Theory.IsUniversal.isUniversal_of_mem

∀ {L : FirstOrder.Language} {T : L.Theory} [self : T.IsUniversal] ⦃φ : L.Sentence⦄,
  φ ∈ T → FirstOrder.Language.BoundedFormula.IsUniversal φ
Defined in
Mathlib.ModelTheory.Complexity
Cited by
2 results in Mathlib
Foundations
Depth 8 from the axioms · uses no axioms
Assumes
FirstOrder.Language.Theory.IsUniversal
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

FirstOrder.Language.Theory.IsUniversal.models_of_embedding · cited by 1IsUniversal.models_of_emb…FirstOrder.Language.Theory.IsUniversal.insert · cited by 0IsUniversal.insertFirstOrder.Language · cited by 1084FirstOrder.LanguageFirstOrder.Language.Theory · cited by 154Language.TheoryFirstOrder.Language.Sentence · cited by 127Language.SentenceFirstOrder.Language.BoundedFormula.IsUniversal · cited by 12BoundedFormula.IsUniversalFirstOrder.Language.Theory.IsUniversal · cited by 3Theory.IsUniversalIsUniversal.isUniversal_of_memCITED BYCITES

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by2

Results whose statement or proof uses this declaration.