Theorems · Theorem · combinatorics
IsAddFreimanIso.bijOn
∀ {α : Type u_2} {β : Type u_3} [inst : AddCommMonoid α] [inst_1 : AddCommMonoid β] {n : ℕ} {A : Set α} {B : Set β}
{f : α → β}, IsAddFreimanIso n A B f → Set.BijOn f A B- Cited by
- 14 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
- Assumes
- AddCommMonoidAddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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
- AddCommMonoidstatement and proof · cited by 12,281
- Set.BijOnstatement · cited by 168
- IsAddFreimanIsostatement and proof · cited by 30
Cited by14
Results whose statement or proof uses this declaration.
- IsAddFreimanIso.isAddFreimanHomproof · cited by 5
- threeAPFree_imageproof · cited by 2
- isCorner_imageproof · cited by 2
- IsAddFreimanIso.invFunOnproof · cited by 2
- IsAddFreimanIso.symmproof · cited by 1
- IsAddFreimanIso.threeAPFree_congrproof · cited by 1
- IsAddFreimanIso.addRothNumber_congrproof · cited by 1
- isCornerFree_imageproof · cited by 1
- IsAddFreimanIso.monoproof · cited by 0
- IsAddFreimanIso.prodMapproof · cited by 0
- isAddFreimanIso_one_iffproof · cited by 0
- isAddFreimanIso_twoproof · cited by 0