MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rplpwr Structured version   Visualization version   GIF version

Theorem rplpwr 15505
Description: If 𝐴 and 𝐵 are relatively prime, then so are 𝐴𝑁 and 𝐵. (Contributed by Scott Fenton, 12-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
Assertion
Ref Expression
rplpwr ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐴 gcd 𝐵) = 1 → ((𝐴𝑁) gcd 𝐵) = 1))

Proof of Theorem rplpwr
Dummy variables 𝑛 𝑘 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 6820 . . . . . . . 8 (𝑘 = 1 → (𝐴𝑘) = (𝐴↑1))
21oveq1d 6827 . . . . . . 7 (𝑘 = 1 → ((𝐴𝑘) gcd 𝐵) = ((𝐴↑1) gcd 𝐵))
32eqeq1d 2776 . . . . . 6 (𝑘 = 1 → (((𝐴𝑘) gcd 𝐵) = 1 ↔ ((𝐴↑1) gcd 𝐵) = 1))
43imbi2d 330 . . . . 5 (𝑘 = 1 → ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴𝑘) gcd 𝐵) = 1) ↔ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑1) gcd 𝐵) = 1)))
5 oveq2 6820 . . . . . . . 8 (𝑘 = 𝑛 → (𝐴𝑘) = (𝐴𝑛))
65oveq1d 6827 . . . . . . 7 (𝑘 = 𝑛 → ((𝐴𝑘) gcd 𝐵) = ((𝐴𝑛) gcd 𝐵))
76eqeq1d 2776 . . . . . 6 (𝑘 = 𝑛 → (((𝐴𝑘) gcd 𝐵) = 1 ↔ ((𝐴𝑛) gcd 𝐵) = 1))
87imbi2d 330 . . . . 5 (𝑘 = 𝑛 → ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴𝑘) gcd 𝐵) = 1) ↔ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴𝑛) gcd 𝐵) = 1)))
9 oveq2 6820 . . . . . . . 8 (𝑘 = (𝑛 + 1) → (𝐴𝑘) = (𝐴↑(𝑛 + 1)))
109oveq1d 6827 . . . . . . 7 (𝑘 = (𝑛 + 1) → ((𝐴𝑘) gcd 𝐵) = ((𝐴↑(𝑛 + 1)) gcd 𝐵))
1110eqeq1d 2776 . . . . . 6 (𝑘 = (𝑛 + 1) → (((𝐴𝑘) gcd 𝐵) = 1 ↔ ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1))
1211imbi2d 330 . . . . 5 (𝑘 = (𝑛 + 1) → ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴𝑘) gcd 𝐵) = 1) ↔ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1)))
13 oveq2 6820 . . . . . . . 8 (𝑘 = 𝑁 → (𝐴𝑘) = (𝐴𝑁))
1413oveq1d 6827 . . . . . . 7 (𝑘 = 𝑁 → ((𝐴𝑘) gcd 𝐵) = ((𝐴𝑁) gcd 𝐵))
1514eqeq1d 2776 . . . . . 6 (𝑘 = 𝑁 → (((𝐴𝑘) gcd 𝐵) = 1 ↔ ((𝐴𝑁) gcd 𝐵) = 1))
1615imbi2d 330 . . . . 5 (𝑘 = 𝑁 → ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴𝑘) gcd 𝐵) = 1) ↔ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴𝑁) gcd 𝐵) = 1)))
17 nncn 11251 . . . . . . . . . 10 (𝐴 ∈ ℕ → 𝐴 ∈ ℂ)
1817exp1d 13232 . . . . . . . . 9 (𝐴 ∈ ℕ → (𝐴↑1) = 𝐴)
1918oveq1d 6827 . . . . . . . 8 (𝐴 ∈ ℕ → ((𝐴↑1) gcd 𝐵) = (𝐴 gcd 𝐵))
2019adantr 467 . . . . . . 7 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴↑1) gcd 𝐵) = (𝐴 gcd 𝐵))
2120eqeq1d 2776 . . . . . 6 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (((𝐴↑1) gcd 𝐵) = 1 ↔ (𝐴 gcd 𝐵) = 1))
2221biimpar 464 . . . . 5 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑1) gcd 𝐵) = 1)
23 df-3an 1100 . . . . . . . . 9 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ↔ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑛 ∈ ℕ))
24 simpl1 1233 . . . . . . . . . . . . . . . . 17 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → 𝐴 ∈ ℕ)
2524nncnd 11259 . . . . . . . . . . . . . . . 16 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → 𝐴 ∈ ℂ)
26 simpl3 1237 . . . . . . . . . . . . . . . . 17 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → 𝑛 ∈ ℕ)
2726nnnn0d 11575 . . . . . . . . . . . . . . . 16 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → 𝑛 ∈ ℕ0)
2825, 27expp1d 13238 . . . . . . . . . . . . . . 15 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴↑(𝑛 + 1)) = ((𝐴𝑛) · 𝐴))
29 simp1 1157 . . . . . . . . . . . . . . . . . . . 20 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → 𝐴 ∈ ℕ)
30 nnnn0 11523 . . . . . . . . . . . . . . . . . . . . 21 (𝑛 ∈ ℕ → 𝑛 ∈ ℕ0)
31303ad2ant3 1156 . . . . . . . . . . . . . . . . . . . 20 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ0)
3229, 31nnexpcld 13259 . . . . . . . . . . . . . . . . . . 19 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → (𝐴𝑛) ∈ ℕ)
3332nnzd 11705 . . . . . . . . . . . . . . . . . 18 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → (𝐴𝑛) ∈ ℤ)
3433adantr 467 . . . . . . . . . . . . . . . . 17 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴𝑛) ∈ ℤ)
3534zcnd 11707 . . . . . . . . . . . . . . . 16 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴𝑛) ∈ ℂ)
3635, 25mulcomd 10284 . . . . . . . . . . . . . . 15 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴𝑛) · 𝐴) = (𝐴 · (𝐴𝑛)))
3728, 36eqtrd 2808 . . . . . . . . . . . . . 14 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴↑(𝑛 + 1)) = (𝐴 · (𝐴𝑛)))
3837oveq2d 6828 . . . . . . . . . . . . 13 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐵 gcd (𝐴↑(𝑛 + 1))) = (𝐵 gcd (𝐴 · (𝐴𝑛))))
39 simpl2 1235 . . . . . . . . . . . . . 14 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → 𝐵 ∈ ℕ)
4032adantr 467 . . . . . . . . . . . . . 14 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴𝑛) ∈ ℕ)
41 nnz 11623 . . . . . . . . . . . . . . . . . 18 (𝐴 ∈ ℕ → 𝐴 ∈ ℤ)
42413ad2ant1 1154 . . . . . . . . . . . . . . . . 17 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → 𝐴 ∈ ℤ)
43 nnz 11623 . . . . . . . . . . . . . . . . . 18 (𝐵 ∈ ℕ → 𝐵 ∈ ℤ)
44433ad2ant2 1155 . . . . . . . . . . . . . . . . 17 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → 𝐵 ∈ ℤ)
45 gcdcom 15464 . . . . . . . . . . . . . . . . 17 ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 gcd 𝐵) = (𝐵 gcd 𝐴))
4642, 44, 45syl2anc 574 . . . . . . . . . . . . . . . 16 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → (𝐴 gcd 𝐵) = (𝐵 gcd 𝐴))
4746eqeq1d 2776 . . . . . . . . . . . . . . 15 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → ((𝐴 gcd 𝐵) = 1 ↔ (𝐵 gcd 𝐴) = 1))
4847biimpa 463 . . . . . . . . . . . . . 14 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐵 gcd 𝐴) = 1)
49 rpmulgcd 15504 . . . . . . . . . . . . . 14 (((𝐵 ∈ ℕ ∧ 𝐴 ∈ ℕ ∧ (𝐴𝑛) ∈ ℕ) ∧ (𝐵 gcd 𝐴) = 1) → (𝐵 gcd (𝐴 · (𝐴𝑛))) = (𝐵 gcd (𝐴𝑛)))
5039, 24, 40, 48, 49syl31anc 1482 . . . . . . . . . . . . 13 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐵 gcd (𝐴 · (𝐴𝑛))) = (𝐵 gcd (𝐴𝑛)))
5138, 50eqtrd 2808 . . . . . . . . . . . 12 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐵 gcd (𝐴↑(𝑛 + 1))) = (𝐵 gcd (𝐴𝑛)))
52 peano2nn 11255 . . . . . . . . . . . . . . . . . 18 (𝑛 ∈ ℕ → (𝑛 + 1) ∈ ℕ)
53523ad2ant3 1156 . . . . . . . . . . . . . . . . 17 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → (𝑛 + 1) ∈ ℕ)
5453adantr 467 . . . . . . . . . . . . . . . 16 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝑛 + 1) ∈ ℕ)
5554nnnn0d 11575 . . . . . . . . . . . . . . 15 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝑛 + 1) ∈ ℕ0)
5624, 55nnexpcld 13259 . . . . . . . . . . . . . 14 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴↑(𝑛 + 1)) ∈ ℕ)
5756nnzd 11705 . . . . . . . . . . . . 13 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴↑(𝑛 + 1)) ∈ ℤ)
5844adantr 467 . . . . . . . . . . . . 13 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → 𝐵 ∈ ℤ)
59 gcdcom 15464 . . . . . . . . . . . . 13 (((𝐴↑(𝑛 + 1)) ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = (𝐵 gcd (𝐴↑(𝑛 + 1))))
6057, 58, 59syl2anc 574 . . . . . . . . . . . 12 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = (𝐵 gcd (𝐴↑(𝑛 + 1))))
61 gcdcom 15464 . . . . . . . . . . . . 13 (((𝐴𝑛) ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴𝑛) gcd 𝐵) = (𝐵 gcd (𝐴𝑛)))
6234, 58, 61syl2anc 574 . . . . . . . . . . . 12 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴𝑛) gcd 𝐵) = (𝐵 gcd (𝐴𝑛)))
6351, 60, 623eqtr4d 2818 . . . . . . . . . . 11 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = ((𝐴𝑛) gcd 𝐵))
6463eqeq1d 2776 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1 ↔ ((𝐴𝑛) gcd 𝐵) = 1))
6564biimprd 239 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (((𝐴𝑛) gcd 𝐵) = 1 → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1))
6623, 65sylanbr 572 . . . . . . . 8 ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (((𝐴𝑛) gcd 𝐵) = 1 → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1))
6766an32s 632 . . . . . . 7 ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) ∧ 𝑛 ∈ ℕ) → (((𝐴𝑛) gcd 𝐵) = 1 → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1))
6867expcom 399 . . . . . 6 (𝑛 ∈ ℕ → (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (((𝐴𝑛) gcd 𝐵) = 1 → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1)))
6968a2d 29 . . . . 5 (𝑛 ∈ ℕ → ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴𝑛) gcd 𝐵) = 1) → (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1)))
704, 8, 12, 16, 22, 69nnind 11261 . . . 4 (𝑁 ∈ ℕ → (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴𝑁) gcd 𝐵) = 1))
7170expd 401 . . 3 (𝑁 ∈ ℕ → ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 gcd 𝐵) = 1 → ((𝐴𝑁) gcd 𝐵) = 1)))
7271com12 32 . 2 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝑁 ∈ ℕ → ((𝐴 gcd 𝐵) = 1 → ((𝐴𝑁) gcd 𝐵) = 1)))
73723impia 1136 1 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐴 gcd 𝐵) = 1 → ((𝐴𝑁) gcd 𝐵) = 1))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1098   = wceq 1634  wcel 2148  (class class class)co 6812  1c1 10160   + caddc 10162   · cmul 10164  cn 11243  0cn0 11516  cz 11601  cexp 13089   gcd cgcd 15445
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1873  ax-4 1888  ax-5 1994  ax-6 2060  ax-7 2096  ax-8 2150  ax-9 2157  ax-10 2177  ax-11 2193  ax-12 2206  ax-13 2411  ax-ext 2754  ax-sep 4928  ax-nul 4936  ax-pow 4988  ax-pr 5048  ax-un 7117  ax-cnex 10215  ax-resscn 10216  ax-1cn 10217  ax-icn 10218  ax-addcl 10219  ax-addrcl 10220  ax-mulcl 10221  ax-mulrcl 10222  ax-mulcom 10223  ax-addass 10224  ax-mulass 10225  ax-distr 10226  ax-i2m1 10227  ax-1ne0 10228  ax-1rid 10229  ax-rnegex 10230  ax-rrecex 10231  ax-cnre 10232  ax-pre-lttri 10233  ax-pre-lttrn 10234  ax-pre-ltadd 10235  ax-pre-mulgt0 10236  ax-pre-sup 10237
This theorem depends on definitions:  df-bi 198  df-an 384  df-or 864  df-3or 1099  df-3an 1100  df-tru 1637  df-ex 1856  df-nf 1861  df-sb 2053  df-eu 2625  df-mo 2626  df-clab 2761  df-cleq 2767  df-clel 2770  df-nfc 2905  df-ne 2947  df-nel 3050  df-ral 3069  df-rex 3070  df-reu 3071  df-rmo 3072  df-rab 3073  df-v 3357  df-sbc 3594  df-csb 3689  df-dif 3732  df-un 3734  df-in 3736  df-ss 3743  df-pss 3745  df-nul 4074  df-if 4236  df-pw 4309  df-sn 4327  df-pr 4329  df-tp 4331  df-op 4333  df-uni 4586  df-iun 4667  df-br 4798  df-opab 4860  df-mpt 4877  df-tr 4900  df-id 5171  df-eprel 5176  df-po 5184  df-so 5185  df-fr 5222  df-we 5224  df-xp 5269  df-rel 5270  df-cnv 5271  df-co 5272  df-dm 5273  df-rn 5274  df-res 5275  df-ima 5276  df-pred 5834  df-ord 5880  df-on 5881  df-lim 5882  df-suc 5883  df-iota 6005  df-fun 6044  df-fn 6045  df-f 6046  df-f1 6047  df-fo 6048  df-f1o 6049  df-fv 6050  df-riota 6773  df-ov 6815  df-oprab 6816  df-mpt2 6817  df-om 7234  df-2nd 7337  df-wrecs 7580  df-recs 7642  df-rdg 7680  df-er 7917  df-en 8131  df-dom 8132  df-sdom 8133  df-sup 8525  df-inf 8526  df-pnf 10299  df-mnf 10300  df-xr 10301  df-ltxr 10302  df-le 10303  df-sub 10491  df-neg 10492  df-div 10908  df-nn 11244  df-2 11302  df-3 11303  df-n0 11517  df-z 11602  df-uz 11911  df-rp 12053  df-fl 12823  df-mod 12899  df-seq 13031  df-exp 13090  df-cj 14069  df-re 14070  df-im 14071  df-sqrt 14205  df-abs 14206  df-dvds 15212  df-gcd 15446
This theorem is referenced by:  rppwr  15506  lgsne0  25302  2sqlem8  25393
  Copyright terms: Public domain W3C validator