Theorems · Theorem · combinatorics
Finset.slice_union_shadow_falling_succ
∀ {α : Type u_2} [inst : DecidableEq α] (k : ℕ) (𝒜 : Finset (Finset α)),
𝒜.slice k ∪ (Finset.falling (k + 1) 𝒜).shadow = Finset.falling k 𝒜- Defined in
- Mathlib.Combinatorics.SetFamily.LYM
- Cited by
- 1 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
- LE.le.transproof · cited by 3,151
- Finset.cardproof · cited by 2,327
- Finset.extproof · cited by 565
- Finset.eraseproof · cited by 455
- Finset.mem_insert_selfproof · cited by 128
- Finset.card_insert_of_notMemproof · cited by 45
- Finset.card_erase_of_memproof · cited by 38
- Finset.shadowstatement and proof · cited by 35
- Finset.erase_subsetproof · cited by 31
- Finset.Subset.reflproof · cited by 29
- Finset.erase_insertproof · cited by 21
Cited by1
Results whose statement or proof uses this declaration.
- Finset.le_card_falling_div_chooseproof · cited by 1