Theorems · Inductive type · group theory
AddEquiv
(A : Type u_9) → (B : Type u_10) → [Add A] → [Add B] → Type (max u_10 u_9)
AddEquiv α β is the type of an equiv α ≃ β which preserves addition.
- Defined in
- Mathlib.Algebra.Group.Equiv.Defs
- Cited by
- 1,087 results in Mathlib
- Foundations
- Depth 1 from the axioms, rests on 2 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by1,583
Results whose statement or proof uses this declaration.
- RingEquiv.symmproof · cited by 567
- AddEquiv.symmstatement and proof · cited by 530
- AddEquiv.toEquivstatement and proof · cited by 174
- AlgEquiv.toLinearEquivproof · cited by 117
- AddEquiv.toAddMonoidHomstatement and proof · cited by 101
- MonomialOrder.toSynstatement · cited by 82
- AddAutproof · cited by 75
- RingEquiv.reflproof · cited by 72
- LinearEquiv.toAddEquivstatement · cited by 58
- AddEquiv.injectivestatement and proof · cited by 58
- RingEquiv.transproof · cited by 54
- AddEquivClass.toAddEquivstatement · cited by 54
Showing the 200 most cited of 1,583.