Theorems · Theorem · order theory
inf_eq_right
∀ {α : Type u} [inst : SemilatticeInf α] {a b : α}, a ⊓ b = b ↔ b ≤ a- Defined in
- Mathlib.Order.Lattice
- Cited by
- 64 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses propext
- Assumes
- SemilatticeInf
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SemilatticeInfstatement and proof · cited by 634
- inf_le_rightproof · cited by 238
- le_inf_iffproof · cited by 48
- Std.ge_reflproof · cited by 23
- ge_antisymm_iffproof · cited by 8
Cited by64
Results whose statement or proof uses this declaration.
- inf_of_le_rightproof · cited by 128
- Set.inter_eq_rightproof · cited by 41
- Set.uIcc_of_geproof · cited by 22
- nhdsWithin_inter_of_memproof · cited by 20
- nhdsWithin_singletonproof · cited by 12
- Finset.inter_eq_rightproof · cited by 11
- AlgebraicGeometry.exists_basicOpen_le_affine_interproof · cited by 7
- ClusterPt.of_le_nhdsproof · cited by 7
- Submodule.biSup_comap_subtype_eq_topproof · cited by 5
- Submodule.map_comap_eq_selfproof · cited by 5
- right_eq_infproof · cited by 4
- inf_indproof · cited by 4