Theorems · Theorem · combinatorics
IsAddFreimanHom.to_isAddFreimanIso
∀ {α : Type u_2} {β : Type u_3} [inst : AddCommMonoid α] [inst_1 : AddCommMonoid β] {A : Set α} {B : Set β} {f : α → β}
{n : ℕ} {g : β → α}, Set.InvOn g f A B → IsAddFreimanHom n A B f → IsAddFreimanHom n B A g → IsAddFreimanIso n A B fIf the inverse of a Freiman homomorphism is itself a Freiman homomorphism, then it is a Freiman isomorphism.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses propext, Quot.sound
- Assumes
- AddCommMonoidAddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
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
- Multisetproof · cited by 2,627
- Multiset.mapproof · cited by 876
- Set.MapsToproof · cited by 732
- Multiset.sumproof · cited by 388
- Multiset.cardproof · cited by 375
- Multiset.map_congrproof · cited by 232
- Multiset.map_mapproof · cited by 151
- Multiset.mem_mapproof · cited by 72
- Multiset.card_mapproof · cited by 57
- IsAddFreimanHomstatement and proof · cited by 32
Cited by2
Results whose statement or proof uses this declaration.
- IsAddFreimanIso.monoproof · cited by 0
- IsAddFreimanIso.prodMapproof · cited by 0