Theorems · Theorem · combinatorics
isAddFreimanHom_empty
∀ {α : Type u_2} {β : Type u_3} [inst : AddCommMonoid α] [inst_1 : AddCommMonoid β] {B : Set β} {f : α → β} {n : ℕ},
IsAddFreimanHom n ∅ B f- Cited by
- 0 results in Mathlib
- Foundations
- Depth 16 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.
Cites11
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.sumproof · cited by 388
- Multiset.cardproof · cited by 375
- Multiset.map_congrproof · cited by 232
- Set.mem_empty_iff_falseproof · cited by 32
- IsAddFreimanHomstatement · cited by 32
- Multiset.notMem_zeroproof · cited by 17
- Multiset.eq_zero_of_forall_notMemproof · cited by 13
- Set.mapsTo_emptyproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.