Theorems · Theorem · order theory
Finset.inf_le_iff
∀ {α : Type u_2} {ι : Type u_5} [inst : LinearOrder α] [inst_1 : OrderTop α] {s : Finset ι} {f : ι → α} {a : α},
a < ⊤ → (s.inf f ≤ a ↔ ∃ b ∈ s, f b ≤ a)- Defined in
- Mathlib.Data.Finset.Lattice.Fold
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 59 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrderOrderTop
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Top.topstatement and proof · cited by 9,680
- LinearOrderstatement and proof · cited by 8,572
- OrderTopstatement and proof · cited by 493
- Finset.consproof · cited by 221
- Finset.infstatement and proof · cited by 219
- not_le_of_gtproof · cited by 97
- Finset.cons_inductionproof · cited by 85
- Finset.mem_consproof · cited by 35
- ge_transproof · cited by 34
- Finset.inf_leproof · cited by 23
- Finset.inf_consproof · cited by 16
Cited by2
Results whose statement or proof uses this declaration.
- Finset.inf_eq_bot_iffproof · cited by 1
- Finset.inf'_le_iffproof · cited by 0