Theorems · Theorem · combinatorics

AddHomClass.isAddFreimanHom

∀ {F : Type u_1} {α : Type u_2} {β : Type u_3} [inst : AddCommMonoid α] [inst_1 : AddCommMonoid β] {A : Set α}
  {B : Set β} {n : ℕ} [inst_2 : FunLike F α β] [AddHomClass F α β] (f : F),
  Set.MapsTo (⇑f) A B → IsAddFreimanHom n A B ⇑f

Defined in

Mathlib.Combinatorics.Additive.FreimanHom

Cited by

6 results in Mathlib

Foundations

Depth 51 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

AddCommMonoidAddCommMonoidFunLikeAddHomClass