Theorems · Theorem · order theory
Lattice.inf_le_right
∀ {α : Type u} [self : Lattice α] (a b : α), Lattice.inf a b ≤ bThe infimum is a lower bound on the second argument
- Defined in
- Mathlib.Order.Lattice
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
- Assumes
- Lattice
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.
- Latticestatement and proof · cited by 916
- Lattice.infstatement · cited by 18
Cited by36
Results whose statement or proof uses this declaration.
- BooleanAlgebra.inf_compl_le_botstatement · cited by 1
- BooleanAlgebra.sdiff_eqstatement · cited by 1
- GeneralizedBooleanAlgebra.inf_inf_sdiffstatement · cited by 1
- GeneralizedBooleanAlgebra.sup_inf_sdiffstatement · cited by 1
- GeneralizedHeytingAlgebra.le_himp_iffstatement · cited by 1
- DistribLattice.le_sup_infstatement · cited by 1
- Order.Frame.le_himp_iffstatement · cited by 0
- Order.Frame.recOnstatement · cited by 0
- CompletelyDistribLattice.casesOnstatement · cited by 0
- CompletelyDistribLattice.le_himp_iffstatement · cited by 0
- DistribLattice.mk.noConfusionstatement · cited by 0
- CompletelyDistribLattice.recOnstatement · cited by 0