Theorems · Theorem · group theory
AddSubmonoid.apply_ne_zero_of_mem_or_neg_mem_closure
∀ {ι : 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) (f : G →+ S) (s : Set ι),
(∀ i ∈ s, 0 < f (v i)) →
∀ (i : ι),
v i ≠ 0 → v (-i) = -v i → v i ∈ AddSubmonoid.closure (v '' s) ∨ -v i ∈ AddSubmonoid.closure (v '' s) → f (v i) ≠ 0- Cited by
- 3 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites21
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 and proof · cited by 53,352
- AddCommGroupstatement and proof · cited by 12,871
- LinearOrderstatement and proof · cited by 8,572
- Set.imagestatement and proof · cited by 5,609
- AddMonoidHomstatement and proof · cited by 3,230
- IsOrderedAddMonoidstatement and proof · cited by 1,659
- map_zeroproof · cited by 1,614
- LT.lt.ne'proof · cited by 1,417
- AddSubmonoidstatement · cited by 1,178
- eq_or_neproof · cited by 1,117
- map_addproof · cited by 964
Cited by3
Results whose statement or proof uses this declaration.
- RootPairing.eq_baseOf_of_linearIndepOn_of_mem_or_neg_mem_closureproof · cited by 2
- IsAddIndecomposable.apply_ne_zero_iff_mem_closureproof · cited by 0
- RootPairing.coroot_mem_or_neg_mem_closure_of_rootproof · cited by 0