Theorems · Theorem · combinatorics
Finset.fold_union_empty_singleton
∀ {α : Type u_1} [inst : DecidableEq α] (s : Finset α), Finset.fold (fun x1 x2 => x1 ∪ x2) ∅ singleton s = s- Defined in
- Mathlib.Data.Finset.Fold
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 61 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.
Cites5
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.induction_onproof · cited by 167
- Finset.foldstatement and proof · cited by 46
- Finset.insert_eqproof · cited by 12
- Finset.fold_insertproof · cited by 11
Cited by1
Results whose statement or proof uses this declaration.
- Finset.fold_sup_bot_singletonproof · cited by 0