Theorems · Theorem · combinatorics
Equiv.Finset.union_inl
∀ {α : Type u_1} [inst : DecidableEq α] {s t : Finset α} (h : Disjoint s t) (x : ↥s),
(Equiv.Finset.union s t h) (Sum.inl x) = ⟨↑x, ⋯⟩- Defined in
- Mathlib.Data.Finset.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 63 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.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Finsetstatement and proof · cited by 13,712
- Equivstatement · cited by 8,337
- Disjointstatement and proof · cited by 2,201
- Finset.mem_unionstatement · cited by 49
- Equiv.Finset.unionstatement · cited by 9
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.