Theorems · Inductive type · logic and foundations
FirstOrder.Language.ElementarySubstructure
(L : FirstOrder.Language) → (M : Type u_1) → [L.Structure M] → Type u_1
An elementary substructure is one in which every formula applied to a tuple in the substructure agrees with its value in the overall structure.
- Cited by
- 18 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- FirstOrder.Languagestatement · cited by 1,084
- FirstOrder.Language.Structurestatement · cited by 775
Cited by30
Results whose statement or proof uses this declaration.
- FirstOrder.Language.ElementarySubstructure.subtypestatement and proof · cited by 7
- FirstOrder.Language.Substructure.elementarySkolem₁Reductstatement · cited by 4
- FirstOrder.Language.ElementarySubstructure.toSubstructurestatement and proof · cited by 3
- FirstOrder.Language.exists_elementaryEmbedding_card_eq_of_leproof · cited by 2
- FirstOrder.Language.Substructure.toElementarySubstructurestatement · cited by 1
- FirstOrder.Language.Substructure.coeSort_elementarySkolem₁Reductstatement · cited by 1
- FirstOrder.Language.ElementarySubstructure.isElementary'statement and proof · cited by 1
- FirstOrder.Language.ElementarySubstructure.toModelstatement and proof · cited by 1
- FirstOrder.Language.ElementarySubstructure.mk.injstatement · cited by 1
- FirstOrder.Language.ElementarySubstructure.mk.noConfusionstatement · cited by 1
- FirstOrder.Language.exists_elementarySubstructure_card_eqstatement and proof · cited by 1
- FirstOrder.Language.ElementarySubstructure.casesOnstatement and proof · cited by 0