Theorems · Theorem · number theory
Finset.MulETransform.card
∀ {α : Type u_1} [inst : DecidableEq α] [inst_1 : Group α] (e : α) (x : Finset α × Finset α),
(Finset.mulETransformLeft e x).1.card + (Finset.mulETransformLeft e x).2.card +
((Finset.mulETransformRight e x).1.card + (Finset.mulETransformRight e x).2.card) =
x.1.card + x.2.card + (x.1.card + x.2.card)This statement is meant to be combined with le_or_lt_of_add_le_add and similar lemmas.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqGroup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- Groupstatement and proof · cited by 6,238
- Finset.cardstatement and proof · cited by 2,327
- mul_addproof · cited by 413
- two_mulproof · cited by 232
- add_add_add_commproof · cited by 56
- Finset.mulETransformLeftstatement and proof · cited by 10
- Finset.mulETransformRightstatement and proof · cited by 10
- Finset.mulETransformLeft.cardproof · cited by 1
- Finset.mulETransformRight.cardproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- cauchy_davenport_minOrder_mulproof · cited by 1