Theorems · Theorem · logic and foundations
FirstOrder.Language.Substructure.map_le_iff_le_comap
∀ {L : FirstOrder.Language} {M : Type w} {N : Type u_1} [inst : L.Structure M] [inst_1 : L.Structure N] {f : L.Hom M N}
{S : L.Substructure M} {T : L.Substructure N},
FirstOrder.Language.Substructure.map f S ≤ T ↔ S ≤ FirstOrder.Language.Substructure.comap f T- Defined in
- Mathlib.ModelTheory.Substructures
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 24 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- FirstOrder.Languagestatement and proof · cited by 1,084
- FirstOrder.Language.Structurestatement and proof · cited by 775
- FirstOrder.Language.Substructurestatement and proof · cited by 242
- Set.image_subset_iffproof · cited by 203
- FirstOrder.Language.Homstatement and proof · cited by 107
- FirstOrder.Language.Substructure.mapstatement · cited by 49
- FirstOrder.Language.Substructure.comapstatement · cited by 31
Cited by3
Results whose statement or proof uses this declaration.
- FirstOrder.Language.Substructure.gc_map_comapproof · cited by 14
- FirstOrder.Language.Substructure.map_closureproof · cited by 4
- FirstOrder.Language.Hom.range_le_iff_comapproof · cited by 0