Theorems · Theorem · combinatorics
Finset.powersetCard_sup
∀ {α : Type u_1} [inst : DecidableEq α] (u : Finset α), ∀ n < u.card, (Finset.powersetCard n.succ u).sup id = u- Defined in
- Mathlib.Data.Finset.Powerset
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 78 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.
Cites17
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.cardstatement and proof · cited by 2,327
- le_antisymmproof · cited by 2,068
- le_transproof · cited by 985
- Finset.supstatement · cited by 530
- Finset.eraseproof · cited by 455
- Finset.mem_insert_selfproof · cited by 128
- Finset.mem_image_of_memproof · cited by 81
- Finset.insert_eraseproof · cited by 65
- Finset.powersetCardstatement and proof · cited by 60
- Finset.notMem_eraseproof · cited by 59
- Finset.mem_union_rightproof · cited by 15
Cited by2
Results whose statement or proof uses this declaration.
- Finset.powersetCard_biUnionproof · cited by 1
- MvPolynomial.degrees_esymmproof · cited by 0