Theorems · Theorem · group theory
IsAddIndecomposable.pairwise_baseOf_sub_notMem
∀ {ι : Type u_1} {G : Type u_3} {S : Type u_4} [inst : AddCommGroup G] [inst_1 : LinearOrder S]
[inst_2 : InvolutiveNeg ι] [inst_3 : AddCommGroup S] [IsOrderedAddMonoid S] (v : ι → G),
(∀ (i : ι), v (-i) = -v i) →
∀ (f : G →+ S),
(∀ (i : ι), f (v i) ≠ 0) → (IsAddIndecomposable.baseOf v f).Pairwise fun i j => v i - v j ∉ Set.range v- Cited by
- 1 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
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
- Setstatement · cited by 53,352
- AddCommGroupstatement and proof · cited by 12,871
- LinearOrderstatement and proof · cited by 8,572
- Set.rangestatement · cited by 4,705
- AddMonoidHomstatement and proof · cited by 3,230
- IsOrderedAddMonoidstatement and proof · cited by 1,659
- Set.Pairwisestatement · cited by 321
- InvolutiveNegstatement and proof · cited by 151
- Set.Subset.reflproof · cited by 66
- IsAddIndecomposable.baseOfstatement and proof · cited by 15
- IsAddIndecomposable.pairwise_sub_notMem_range'proof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- RootPairing.baseOf_pairwise_pairing_le_zeroproof · cited by 1