Theorems · Theorem · combinatorics
IsAddFreimanIso.invFunOn
∀ {α : Type u_2} {β : Type u_3} [inst : AddCommMonoid α] [inst_1 : AddCommMonoid β] {A : Set α} {B : Set β} {f : α → β}
{n : ℕ}, IsAddFreimanIso n A B f → IsAddFreimanIso n B A (Function.invFunOn f A)If f is an additive Freiman isomorphism from A to B, then f.invFunOn A is
an additive Freiman isomorphism from B to A.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddCommMonoidAddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- Function.invFunOnstatement · cited by 35
- Set.BijOn.surjOnproof · cited by 31
- IsAddFreimanIsostatement and proof · cited by 30
- IsAddFreimanIso.bijOnproof · cited by 14
- Set.SurjOn.rightInvOn_invFunOnproof · cited by 9
- Set.SurjOn.mapsTo_invFunOnproof · cited by 7
- IsAddFreimanIso.symmproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- IsAddFreimanIso.monoproof · cited by 0
- IsAddFreimanIso.prodMapproof · cited by 0