Theorems · Theorem · order theory
Finset.empty_union
∀ {α : Type u_1} [inst : DecidableEq α] (s : Finset α), ∅ ∪ s = s- Defined in
- Mathlib.Data.Finset.Lattice.Lemmas
- Cited by
- 8 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.
Cites3
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.extproof · cited by 565
- Finset.mem_unionproof · cited by 49
Cited by8
Results whose statement or proof uses this declaration.
- List.toFinset_appendproof · cited by 2
- Finsupp.card_Iicproof · cited by 1
- MvPolynomial.vars_bind₁proof · cited by 1
- Finset.gcd_unionproof · cited by 1
- DFinsupp.card_Iicproof · cited by 1
- Nat.mul_divisors_filter_prime_powproof · cited by 1
- Multiset.card_Iicproof · cited by 0
- Finset.lcm_unionproof · cited by 0