Metamath Proof Explorer


Theorem rprmdvdspow

Description: If a prime element divides a ring "power", it divides the term. (Contributed by Thierry Arnoux, 18-May-2025)

Ref Expression
Hypotheses rprmdvdspow.b ⊢ B = Base R
rprmdvdspow.p ⊢ P = RPrime ⁡ R
rprmdvdspow.d ⊢ ∥ ˙ = ∥ r ⁡ R
rprmdvdspow.m ⊢ M = mulGrp R
rprmdvdspow.o ⊢ × ˙ = ⋅ M
rprmdvdspow.r ⊢ φ → R ∈ CRing
rprmdvdspow.x ⊢ φ → X ∈ B
rprmdvdspow.q ⊢ φ → Q ∈ P
rprmdvdspow.n ⊢ φ → N ∈ ℕ 0
rprmdvdspow.1 ⊢ φ → Q ∥ ˙ N × ˙ X
Assertion rprmdvdspow ⊢ φ → Q ∥ ˙ X

Proof

Step Hyp Ref Expression
1 rprmdvdspow.b ⊢ B = Base R
2 rprmdvdspow.p ⊢ P = RPrime ⁡ R
3 rprmdvdspow.d ⊢ ∥ ˙ = ∥ r ⁡ R
4 rprmdvdspow.m ⊢ M = mulGrp R
5 rprmdvdspow.o ⊢ × ˙ = ⋅ M
6 rprmdvdspow.r ⊢ φ → R ∈ CRing
7 rprmdvdspow.x ⊢ φ → X ∈ B
8 rprmdvdspow.q ⊢ φ → Q ∈ P
9 rprmdvdspow.n ⊢ φ → N ∈ ℕ 0
10 rprmdvdspow.1 ⊢ φ → Q ∥ ˙ N × ˙ X
11 oveq1 ⊢ i = 0 → i × ˙ X = 0 × ˙ X
12 11 breq2d ⊢ i = 0 → Q ∥ ˙ i × ˙ X ↔ Q ∥ ˙ 0 × ˙ X
13 12 imbi1d ⊢ i = 0 → Q ∥ ˙ i × ˙ X → Q ∥ ˙ X ↔ Q ∥ ˙ 0 × ˙ X → Q ∥ ˙ X
14 oveq1 ⊢ i = n → i × ˙ X = n × ˙ X
15 14 breq2d ⊢ i = n → Q ∥ ˙ i × ˙ X ↔ Q ∥ ˙ n × ˙ X
16 15 imbi1d ⊢ i = n → Q ∥ ˙ i × ˙ X → Q ∥ ˙ X ↔ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X
17 oveq1 ⊢ i = n + 1 → i × ˙ X = n + 1 × ˙ X
18 17 breq2d ⊢ i = n + 1 → Q ∥ ˙ i × ˙ X ↔ Q ∥ ˙ n + 1 × ˙ X
19 18 imbi1d ⊢ i = n + 1 → Q ∥ ˙ i × ˙ X → Q ∥ ˙ X ↔ Q ∥ ˙ n + 1 × ˙ X → Q ∥ ˙ X
20 oveq1 ⊢ i = N → i × ˙ X = N × ˙ X
21 20 breq2d ⊢ i = N → Q ∥ ˙ i × ˙ X ↔ Q ∥ ˙ N × ˙ X
22 21 imbi1d ⊢ i = N → Q ∥ ˙ i × ˙ X → Q ∥ ˙ X ↔ Q ∥ ˙ N × ˙ X → Q ∥ ˙ X
23 4 1 mgpbas ⊢ B = Base M
24 eqid ⊢ 1 R = 1 R
25 4 24 ringidval ⊢ 1 R = 0 M
26 23 25 5 mulg0 ⊢ X ∈ B → 0 × ˙ X = 1 R
27 7 26 syl ⊢ φ → 0 × ˙ X = 1 R
28 27 breq2d ⊢ φ → Q ∥ ˙ 0 × ˙ X ↔ Q ∥ ˙ 1 R
29 28 biimpa ⊢ φ ∧ Q ∥ ˙ 0 × ˙ X → Q ∥ ˙ 1 R
30 24 3 2 6 8 rprmndvdsr1 ⊢ φ → ¬ Q ∥ ˙ 1 R
31 30 adantr ⊢ φ ∧ Q ∥ ˙ 0 × ˙ X → ¬ Q ∥ ˙ 1 R
32 29 31 pm2.21dd ⊢ φ ∧ Q ∥ ˙ 0 × ˙ X → Q ∥ ˙ X
33 32 ex ⊢ φ → Q ∥ ˙ 0 × ˙ X → Q ∥ ˙ X
34 simpllr ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X ∧ Q ∥ ˙ n + 1 × ˙ X ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ n × ˙ X → Q ∥ ˙ X
35 34 syldbl2 ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X ∧ Q ∥ ˙ n + 1 × ˙ X ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X
36 simpr ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X ∧ Q ∥ ˙ n + 1 × ˙ X ∧ Q ∥ ˙ X → Q ∥ ˙ X
37 eqid ⊢ ⋅ R = ⋅ R
38 6 ad3antrrr ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X ∧ Q ∥ ˙ n + 1 × ˙ X → R ∈ CRing
39 8 ad3antrrr ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X ∧ Q ∥ ˙ n + 1 × ˙ X → Q ∈ P
40 6 crngringd ⊢ φ → R ∈ Ring
41 4 ringmgp ⊢ R ∈ Ring → M ∈ Mnd
42 40 41 syl ⊢ φ → M ∈ Mnd
43 42 ad3antrrr ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X ∧ Q ∥ ˙ n + 1 × ˙ X → M ∈ Mnd
44 simpllr ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X ∧ Q ∥ ˙ n + 1 × ˙ X → n ∈ ℕ 0
45 7 ad3antrrr ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X ∧ Q ∥ ˙ n + 1 × ˙ X → X ∈ B
46 23 5 43 44 45 mulgnn0cld ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X ∧ Q ∥ ˙ n + 1 × ˙ X → n × ˙ X ∈ B
47 42 adantr ⊢ φ ∧ n ∈ ℕ 0 → M ∈ Mnd
48 simpr ⊢ φ ∧ n ∈ ℕ 0 → n ∈ ℕ 0
49 7 adantr ⊢ φ ∧ n ∈ ℕ 0 → X ∈ B
50 4 37 mgpplusg ⊢ ⋅ R = + M
51 23 5 50 mulgnn0p1 ⊢ M ∈ Mnd ∧ n ∈ ℕ 0 ∧ X ∈ B → n + 1 × ˙ X = n × ˙ X ⋅ R X
52 47 48 49 51 syl3anc ⊢ φ ∧ n ∈ ℕ 0 → n + 1 × ˙ X = n × ˙ X ⋅ R X
53 52 breq2d ⊢ φ ∧ n ∈ ℕ 0 → Q ∥ ˙ n + 1 × ˙ X ↔ Q ∥ ˙ n × ˙ X ⋅ R X
54 53 biimpa ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n + 1 × ˙ X → Q ∥ ˙ n × ˙ X ⋅ R X
55 54 adantlr ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X ∧ Q ∥ ˙ n + 1 × ˙ X → Q ∥ ˙ n × ˙ X ⋅ R X
56 1 2 3 37 38 39 46 45 55 rprmdvds ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X ∧ Q ∥ ˙ n + 1 × ˙ X → Q ∥ ˙ n × ˙ X ∨ Q ∥ ˙ X
57 35 36 56 mpjaodan ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X ∧ Q ∥ ˙ n + 1 × ˙ X → Q ∥ ˙ X
58 57 ex ⊢ φ ∧ n ∈ ℕ 0 ∧ Q ∥ ˙ n × ˙ X → Q ∥ ˙ X → Q ∥ ˙ n + 1 × ˙ X → Q ∥ ˙ X
59 13 16 19 22 33 58 nn0indd ⊢ φ ∧ N ∈ ℕ 0 → Q ∥ ˙ N × ˙ X → Q ∥ ˙ X
60 9 59 mpdan ⊢ φ → Q ∥ ˙ N × ˙ X → Q ∥ ˙ X
61 10 60 mpd ⊢ φ → Q ∥ ˙ X