Theorems · Inductive type · logic and foundations
FirstOrder.Language.StrongHomClass
(L : outParam FirstOrder.Language) →
(F : Type u_3) →
(M : outParam (Type u_4)) → (N : outParam (Type u_5)) → [FunLike F M N] → [L.Structure M] → [L.Structure N] → PropStrongHomClass L F M N states that F is a type of L-homomorphisms which preserve
relations in both directions.
- Defined in
- Mathlib.ModelTheory.Basic
- Cited by
- 16 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- FunLikestatement · cited by 2,560
- FirstOrder.Languagestatement · cited by 1,084
- FirstOrder.Language.Structurestatement · cited by 775
Cited by20
Results whose statement or proof uses this declaration.
- FirstOrder.Language.StrongHomClass.map_relstatement and proof · cited by 5
- FirstOrder.Language.StrongHomClass.toEmbeddingstatement and proof · cited by 4
- FirstOrder.Language.StrongHomClass.toEquivstatement and proof · cited by 4
- FirstOrder.Language.StrongHomClass.realize_sentencestatement and proof · cited by 3
- FirstOrder.Language.BoundedFormula.IsQF.realize_embeddingstatement and proof · cited by 2
- FirstOrder.Language.StrongHomClass.realize_boundedFormulastatement and proof · cited by 2
- FirstOrder.Language.StrongHomClass.realize_formulastatement and proof · cited by 2
- FirstOrder.Language.BoundedFormula.IsUniversal.realize_embeddingstatement and proof · cited by 1
- FirstOrder.Language.StrongHomClass.toEquiv_toFunstatement and proof · cited by 1
- FirstOrder.Language.HomClass.strongHomClassOfIsAlgebraicstatement · cited by 0
- FirstOrder.Language.StrongHomClass.casesOnstatement and proof · cited by 0
- FirstOrder.Language.StrongHomClass.elementarilyEquivalentstatement and proof · cited by 0