Theorems · Theorem · combinatorics
IsAddFreimanHom.snd
∀ {α : Type u_2} {β : Type u_3} [inst : AddCommMonoid α] [inst_1 : AddCommMonoid β] {A : Set α} {B : Set β} {n : ℕ},
IsAddFreimanHom n (A ×ˢ B) B Prod.snd- Cited by
- 1 results in Mathlib
- Foundations
- Depth 52 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.
Cites7
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
- SProd.sprodstatement · cited by 1,750
- AddMonoidHom.sndproof · cited by 42
- IsAddFreimanHomstatement · cited by 32
- Set.mapsTo_snd_prodproof · cited by 9
- AddHomClass.isAddFreimanHomproof · cited by 6
Cited by1
Results whose statement or proof uses this declaration.
- IsAddFreimanHom.prodMapproof · cited by 1