Theorems · Theorem · combinatorics

IsAddFreimanHom.subtypeVal

∀ {α : Type u_2} [inst : AddCommMonoid α] {n : ℕ} {S : Type u_5} [inst_1 : SetLike S α] [inst_2 : AddSubmonoidClass S α]
  {s : S}, IsAddFreimanHom n Set.univ Set.univ Subtype.val

Defined in: Mathlib.Combinatorics.Additive.FreimanHom
Cited by: 0 results in Mathlib
Foundations: Depth 52 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: AddCommMonoid SetLike AddSubmonoidClass

Mathlib docs Source Loogle LeanSearch

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.

DFunLike.coeproof · cited by 62,936
AddCommMonoidstatement and proof · cited by 12,281
Set.univstatement and proof · cited by 3,945
SetLikestatement and proof · cited by 1,084
AddSubmonoidClassstatement and proof · cited by 346
Set.mapsTo_univproof · cited by 55
IsAddFreimanHomstatement · cited by 32
AddSubmonoidClass.subtypeproof · cited by 12
AddHomClass.isAddFreimanHomproof · cited by 6

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.