Theorems · Theorem · order theory
Finite.ciInf_mono
∀ {α : Type u_1} {ι : Type u_2} [Finite ι] [inst : ConditionallyCompleteLattice α] {f g : ι → α},
(∀ (x : ι), f x ≤ g x) → iInf f ≤ iInf g- Defined in
- Mathlib.Data.Fintype.Order
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- Finitestatement and proof · cited by 3,029
- iInfstatement · cited by 1,690
- ConditionallyCompleteLatticestatement and proof · cited by 364
- ciInf_monoproof · cited by 2
- Finite.bddBelow_rangeproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.