Theorems · Theorem · combinatorics

AddEquivClass.isAddFreimanIso

∀ {F : Type u_1} {α : Type u_2} {β : Type u_3} [inst : AddCommMonoid α] [inst_1 : AddCommMonoid β] {A : Set α}
  {B : Set β} {n : ℕ} [inst_2 : EquivLike F α β] [AddEquivClass F α β] (f : F),
  Set.BijOn (⇑f) A B → IsAddFreimanIso n A B ⇑f

Defined in

Mathlib.Combinatorics.Additive.FreimanHom

Cited by

0 results in Mathlib

Foundations

Depth 16 from the axioms · uses propext, Quot.sound

Assumes

AddCommMonoidAddCommMonoidEquivLikeAddEquivClass