Theorems · Theorem · combinatorics
Set.powersetCard.coe_nonempty_iff
∀ {α : Type u_1} {n : ℕ} {s : ↑(Set.powersetCard α n)}, (↑s).Nonempty ↔ 1 ≤ n- Defined in
- Mathlib.Data.Set.PowersetCard
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 63 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.
- Setproof · cited by 53,352
- Finsetstatement · cited by 13,712
- SetLike.coestatement · cited by 8,199
- Set.Elemstatement and proof · cited by 7,166
- Set.Nonemptystatement and proof · cited by 2,627
- Subtype.propproof · cited by 505
- Set.powersetCardstatement and proof · cited by 100
- Finset.coe_nonemptyproof · cited by 18
- Finset.one_le_cardproof · cited by 4
- Set.powersetCard.coe_coeproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- Set.powersetCard.isPreprimitive_alternatingGroupproof · cited by 2
- Set.powersetCard.isPreprimitive_permproof · cited by 1