Theorems · Theorem · group theory
Finset.prod_involution
∀ {ι : Type u_1} {M : Type u_4} {s : Finset ι} [inst : CommMonoid M] {f : ι → M} (g : (a : ι) → a ∈ s → ι),
(∀ (a : ι) (ha : a ∈ s), f a * f (g a ha) = 1) →
(∀ (a : ι) (ha : a ∈ s), f a ≠ 1 → g a ha ≠ a) →
∀ (g_mem : ∀ (a : ι) (ha : a ∈ s), g a ha ∈ s), (∀ (a : ι) (ha : a ∈ s), g (g a ha) ⋯ = a) → ∏ x ∈ s, f x = 1The difference with Finset.prod_ninvolution is that the involution is allowed to use
membership of the domain of the product, rather than being a non-dependent function.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- one_mulproof · cited by 2,841
- Finset.prodstatement and proof · cited by 2,356
- CommMonoidstatement and proof · cited by 2,264
- eq_or_neproof · cited by 1,117
- Finset.Nonemptyproof · cited by 1,001
- Finset.prod_congrproof · cited by 646
- Finset.eq_empty_or_nonemptyproof · cited by 104
- Finset.prod_singletonproof · cited by 78
- Finset.insert_eq_of_memproof · cited by 28
- Finset.sdiff_subsetproof · cited by 21
- Finset.insert_unionproof · cited by 16
Cited by2
Results whose statement or proof uses this declaration.
- FiniteField.prod_univ_units_id_eq_neg_oneproof · cited by 1
- Finset.prod_ninvolutionproof · cited by 0