Theorems · Theorem · combinatorics
isMulFreimanIso_two
∀ {α : Type u_2} {β : Type u_3} [inst : CommMonoid α] [inst_1 : CommMonoid β] {A : Set α} {B : Set β} {f : α → β},
IsMulFreimanIso 2 A B f ↔ Set.BijOn f A B ∧ ∀ a ∈ A, ∀ b ∈ A, ∀ c ∈ A, ∀ d ∈ A, f a * f b = f c * f d ↔ a * b = c * dCharacterisation of 2-Freiman homs.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext, Quot.sound
- Assumes
- CommMonoidCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
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
- Multisetproof · cited by 2,627
- CommMonoidstatement and proof · cited by 2,264
- Multiset.prodproof · cited by 528
- Multiset.cardproof · cited by 375
- Multiset.consproof · cited by 313
- Set.BijOnstatement and proof · cited by 168
- Multiset.map_consproof · cited by 93
- Multiset.prod_consproof · cited by 68
- Multiset.prod_singletonproof · cited by 29
- IsMulFreimanIsostatement and proof · cited by 22
- IsMulFreimanIso.bijOnproof · cited by 13
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.