Theorems · Theorem · group theory
IsMulIndecomposable.mem_or_inv_mem_closure_baseOf
∀ {ι : Type u_1} {G : Type u_3} {S : Type u_4} [inst : CommGroup G] [inst_1 : LinearOrder S] [Finite ι]
[inst_3 : InvolutiveInv ι] [inst_4 : CommGroup S] [IsOrderedMonoid S] (v : ι → G) (f : G →* S) (i : ι),
f (v i) ≠ 1 →
v i⁻¹ = (v i)⁻¹ →
v i ∈ Submonoid.closure (v '' IsMulIndecomposable.baseOf v f) ∨
(v i)⁻¹ ∈ Submonoid.closure (v '' IsMulIndecomposable.baseOf v f)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- DFunLike.coestatement and proof · cited by 62,936
- LinearOrderstatement and proof · cited by 8,572
- Set.imagestatement · cited by 5,609
- MonoidHomstatement and proof · cited by 3,629
- Submonoidstatement and proof · cited by 3,086
- Finitestatement and proof · cited by 3,029
- CommGroupstatement and proof · cited by 990
- IsOrderedMonoidstatement and proof · cited by 577
- Submonoid.closurestatement · cited by 167
- InvolutiveInvstatement and proof · cited by 102
- map_invproof · cited by 95
- Submonoid.subset_closureproof · cited by 46
Cited by1
Results whose statement or proof uses this declaration.
- IsMulIndecomposable.apply_ne_one_iff_mem_closureproof · cited by 0