Theorems · Theorem · order theory
DirectedOn.exists_mem_subset_of_finite_of_subset_sUnion
∀ {α : Type u_1} {c : Set (Set α)},
c.Nonempty → DirectedOn (fun x1 x2 => x1 ⊆ x2) c → ∀ {s : Set α}, s.Finite → s ⊆ ⋃₀ c → ∃ t ∈ c, s ⊆ t- Defined in
- Mathlib.Data.Set.Finite.Lattice
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- SetLike.coeproof · cited by 8,199
- Set.Nonemptystatement and proof · cited by 2,627
- Set.Finitestatement and proof · cited by 1,814
- Set.sUnionstatement and proof · cited by 392
- Set.Finite.toFinsetproof · cited by 351
- DirectedOnstatement and proof · cited by 271
- Set.Finite.coe_toFinsetproof · cited by 124
- Set.sUnion_eq_biUnionproof · cited by 51
- DirectedOn.exists_mem_subset_of_finset_subset_biUnionproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- Convexity.IsConvexSet.sUnionproof · cited by 1
- Order.IsOfFiniteCharacter.exists_maximalproof · cited by 0