Theorems · Theorem · combinatorics
Finset.Shatters.exists_superset
∀ {α : Type u_1} [inst : DecidableEq α] {𝒜 : Finset (Finset α)} {s : Finset α}, 𝒜.Shatters s → ∃ t ∈ 𝒜, s ⊆ t- Defined in
- Mathlib.Combinatorics.SetFamily.Shatter
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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
- Finset.Subset.rflproof · cited by 41
- Finset.Shattersstatement and proof · cited by 19
- Finset.inter_eq_leftproof · cited by 7
Cited by2
Results whose statement or proof uses this declaration.
- Finset.mem_shattererproof · cited by 5
- Finset.shatterer_eqproof · cited by 0