Theorems · Theorem · order theory
Finset.sup_le_of_le_directed
∀ {α : Type u_7} [inst : SemilatticeSup α] [inst_1 : OrderBot α] (s : Set α),
s.Nonempty → DirectedOn (fun x1 x2 => x1 ≤ x2) s → ∀ (t : Finset α), (∀ x ∈ t, ∃ y ∈ s, x ≤ y) → ∃ x ∈ s, t.sup id ≤ x- Defined in
- Mathlib.Data.Finset.Lattice.Fold
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SemilatticeSupOrderBot
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites16
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SetLike.coeproof · cited by 8,199
- Set.Nonemptystatement and proof · cited by 2,627
- OrderBotstatement and proof · cited by 1,055
- le_transproof · cited by 985
- SemilatticeSupstatement and proof · cited by 785
- Finset.supstatement and proof · cited by 530
- DirectedOnstatement and proof · cited by 271
- Finset.induction_onproof · cited by 167
- Finset.mem_insert_selfproof · cited by 128
- Finset.coe_subsetproof · cited by 93
Cited by2
Results whose statement or proof uses this declaration.
- CompleteLattice.isCompactElement_iff_exists_le_sSup_of_le_sSupproof · cited by 4
- CompleteLattice.isCompactElement_finsetSupproof · cited by 3