Theorems · Theorem · logic and foundations
Set.encard_union_eq
∀ {α : Type u_1} {s t : Set α}, Disjoint s t → (s ∪ t).encard = s.encard + t.encard- Defined in
- Mathlib.Data.Set.Card
- Cited by
- 15 results in Mathlib
- Foundations
- Depth 93 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.Elemproof · cited by 7,166
- ENatstatement · cited by 4,985
- Disjointstatement and proof · cited by 2,201
- Set.encardstatement and proof · cited by 327
- Equiv.Set.unionproof · cited by 10
- ENat.card_congrproof · cited by 8
- ENat.card_sumproof · cited by 2
Cited by15
Results whose statement or proof uses this declaration.
- Set.encard_insert_of_notMemproof · cited by 17
- Set.encard_le_encardproof · cited by 10
- Set.encard_sdiff_add_encard_interproof · cited by 6
- Set.encard_sdiff_add_encard_of_subsetproof · cited by 6
- Set.ncard_union_eqproof · cited by 6
- Set.exists_superset_subset_encard_eqproof · cited by 3
- Set.encard_union_add_encard_interproof · cited by 3
- Set.encard_sdiff_add_encardproof · cited by 2
- Set.encard_add_encard_complproof · cited by 2
- Matroid.eRk_dual_add_eRankproof · cited by 1
- Set.encard_ne_add_oneproof · cited by 1
- SimpleGraph.IsBipartite.four_mul_encard_edgeSet_leproof · cited by 0