rplpwr - Metamath Proof Explorer

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

Theorem rplpwr 16528

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.

Step	Hyp	Ref	Expression
1		oveq2 7395	. . . . . . . 8 ⊢ (𝑘 = 1 → (𝐴↑𝑘) = (𝐴↑1))
2	1	oveq1d 7402	. . . . . . 7 ⊢ (𝑘 = 1 → ((𝐴↑𝑘) gcd 𝐵) = ((𝐴↑1) gcd 𝐵))
3	2	eqeq1d 2731	. . . . . 6 ⊢ (𝑘 = 1 → (((𝐴↑𝑘) gcd 𝐵) = 1 ↔ ((𝐴↑1) gcd 𝐵) = 1))
4	3	imbi2d 340	. . . . 5 ⊢ (𝑘 = 1 → ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑𝑘) gcd 𝐵) = 1) ↔ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑1) gcd 𝐵) = 1)))
5		oveq2 7395	. . . . . . . 8 ⊢ (𝑘 = 𝑛 → (𝐴↑𝑘) = (𝐴↑𝑛))
6	5	oveq1d 7402	. . . . . . 7 ⊢ (𝑘 = 𝑛 → ((𝐴↑𝑘) gcd 𝐵) = ((𝐴↑𝑛) gcd 𝐵))
7	6	eqeq1d 2731	. . . . . 6 ⊢ (𝑘 = 𝑛 → (((𝐴↑𝑘) gcd 𝐵) = 1 ↔ ((𝐴↑𝑛) gcd 𝐵) = 1))
8	7	imbi2d 340	. . . . 5 ⊢ (𝑘 = 𝑛 → ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑𝑘) gcd 𝐵) = 1) ↔ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑𝑛) gcd 𝐵) = 1)))
9		oveq2 7395	. . . . . . . 8 ⊢ (𝑘 = (𝑛 + 1) → (𝐴↑𝑘) = (𝐴↑(𝑛 + 1)))
10	9	oveq1d 7402	. . . . . . 7 ⊢ (𝑘 = (𝑛 + 1) → ((𝐴↑𝑘) gcd 𝐵) = ((𝐴↑(𝑛 + 1)) gcd 𝐵))
11	10	eqeq1d 2731	. . . . . 6 ⊢ (𝑘 = (𝑛 + 1) → (((𝐴↑𝑘) gcd 𝐵) = 1 ↔ ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1))
12	11	imbi2d 340	. . . . 5 ⊢ (𝑘 = (𝑛 + 1) → ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑𝑘) gcd 𝐵) = 1) ↔ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1)))
13		oveq2 7395	. . . . . . . 8 ⊢ (𝑘 = 𝑁 → (𝐴↑𝑘) = (𝐴↑𝑁))
14	13	oveq1d 7402	. . . . . . 7 ⊢ (𝑘 = 𝑁 → ((𝐴↑𝑘) gcd 𝐵) = ((𝐴↑𝑁) gcd 𝐵))
15	14	eqeq1d 2731	. . . . . 6 ⊢ (𝑘 = 𝑁 → (((𝐴↑𝑘) gcd 𝐵) = 1 ↔ ((𝐴↑𝑁) gcd 𝐵) = 1))
16	15	imbi2d 340	. . . . 5 ⊢ (𝑘 = 𝑁 → ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑𝑘) gcd 𝐵) = 1) ↔ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑𝑁) gcd 𝐵) = 1)))
17		nncn 12194	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ)
18	17	exp1d 14106	. . . . . . . . 9 ⊢ (𝐴 ∈ ℕ → (𝐴↑1) = 𝐴)
19	18	oveq1d 7402	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → ((𝐴↑1) gcd 𝐵) = (𝐴 gcd 𝐵))
20	19	adantr 480	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴↑1) gcd 𝐵) = (𝐴 gcd 𝐵))
21	20	eqeq1d 2731	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (((𝐴↑1) gcd 𝐵) = 1 ↔ (𝐴 gcd 𝐵) = 1))
22	21	biimpar 477	. . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑1) gcd 𝐵) = 1)
23		df-3an 1088	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ↔ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑛 ∈ ℕ))
24		simpl1 1192	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → 𝐴 ∈ ℕ)
25	24	nncnd 12202	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → 𝐴 ∈ ℂ)
26		simpl3 1194	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → 𝑛 ∈ ℕ)
27	26	nnnn0d 12503	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → 𝑛 ∈ ℕ₀)
28	25, 27	expp1d 14112	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴↑(𝑛 + 1)) = ((𝐴↑𝑛) · 𝐴))
29		simp1 1136	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → 𝐴 ∈ ℕ)
30		nnnn0 12449	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℕ₀)
31	30	3ad2ant3 1135	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ₀)
32	29, 31	nnexpcld 14210	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → (𝐴↑𝑛) ∈ ℕ)
33	32	nnzd 12556	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → (𝐴↑𝑛) ∈ ℤ)
34	33	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴↑𝑛) ∈ ℤ)
35	34	zcnd 12639	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴↑𝑛) ∈ ℂ)
36	35, 25	mulcomd 11195	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑𝑛) · 𝐴) = (𝐴 · (𝐴↑𝑛)))
37	28, 36	eqtrd 2764	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴↑(𝑛 + 1)) = (𝐴 · (𝐴↑𝑛)))
38	37	oveq2d 7403	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐵 gcd (𝐴↑(𝑛 + 1))) = (𝐵 gcd (𝐴 · (𝐴↑𝑛))))
39		simpl2 1193	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → 𝐵 ∈ ℕ)
40	32	adantr 480	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴↑𝑛) ∈ ℕ)
41		nnz 12550	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ)
42	41	3ad2ant1 1133	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → 𝐴 ∈ ℤ)
43		nnz 12550	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ)
44	43	3ad2ant2 1134	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → 𝐵 ∈ ℤ)
45	42, 44	gcdcomd 16484	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → (𝐴 gcd 𝐵) = (𝐵 gcd 𝐴))
46	45	eqeq1d 2731	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → ((𝐴 gcd 𝐵) = 1 ↔ (𝐵 gcd 𝐴) = 1))
47	46	biimpa 476	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐵 gcd 𝐴) = 1)
48		rpmulgcd 16527	. . . . . . . . . . . . . 14 ⊢ (((𝐵 ∈ ℕ ∧ 𝐴 ∈ ℕ ∧ (𝐴↑𝑛) ∈ ℕ) ∧ (𝐵 gcd 𝐴) = 1) → (𝐵 gcd (𝐴 · (𝐴↑𝑛))) = (𝐵 gcd (𝐴↑𝑛)))
49	39, 24, 40, 47, 48	syl31anc 1375	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐵 gcd (𝐴 · (𝐴↑𝑛))) = (𝐵 gcd (𝐴↑𝑛)))
50	38, 49	eqtrd 2764	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐵 gcd (𝐴↑(𝑛 + 1))) = (𝐵 gcd (𝐴↑𝑛)))
51		peano2nn 12198	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ ℕ → (𝑛 + 1) ∈ ℕ)
52	51	3ad2ant3 1135	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) → (𝑛 + 1) ∈ ℕ)
53	52	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝑛 + 1) ∈ ℕ)
54	53	nnnn0d 12503	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝑛 + 1) ∈ ℕ₀)
55	24, 54	nnexpcld 14210	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴↑(𝑛 + 1)) ∈ ℕ)
56	55	nnzd 12556	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (𝐴↑(𝑛 + 1)) ∈ ℤ)
57	44	adantr 480	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → 𝐵 ∈ ℤ)
58	56, 57	gcdcomd 16484	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = (𝐵 gcd (𝐴↑(𝑛 + 1))))
59	34, 57	gcdcomd 16484	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑𝑛) gcd 𝐵) = (𝐵 gcd (𝐴↑𝑛)))
60	50, 58, 59	3eqtr4d 2774	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = ((𝐴↑𝑛) gcd 𝐵))
61	60	eqeq1d 2731	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1 ↔ ((𝐴↑𝑛) gcd 𝐵) = 1))
62	61	biimprd 248	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (((𝐴↑𝑛) gcd 𝐵) = 1 → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1))
63	23, 62	sylanbr 582	. . . . . . . 8 ⊢ ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ 𝑛 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (((𝐴↑𝑛) gcd 𝐵) = 1 → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1))
64	63	an32s 652	. . . . . . 7 ⊢ ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) ∧ 𝑛 ∈ ℕ) → (((𝐴↑𝑛) gcd 𝐵) = 1 → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1))
65	64	expcom 413	. . . . . 6 ⊢ (𝑛 ∈ ℕ → (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → (((𝐴↑𝑛) gcd 𝐵) = 1 → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1)))
66	65	a2d 29	. . . . 5 ⊢ (𝑛 ∈ ℕ → ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑𝑛) gcd 𝐵) = 1) → (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑(𝑛 + 1)) gcd 𝐵) = 1)))
67	4, 8, 12, 16, 22, 66	nnind 12204	. . . 4 ⊢ (𝑁 ∈ ℕ → (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) ∧ (𝐴 gcd 𝐵) = 1) → ((𝐴↑𝑁) gcd 𝐵) = 1))
68	67	expd 415	. . 3 ⊢ (𝑁 ∈ ℕ → ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 gcd 𝐵) = 1 → ((𝐴↑𝑁) gcd 𝐵) = 1)))
69	68	com12 32	. 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝑁 ∈ ℕ → ((𝐴 gcd 𝐵) = 1 → ((𝐴↑𝑁) gcd 𝐵) = 1)))
70	69	3impia 1117	1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝑁 ∈ ℕ) → ((𝐴 gcd 𝐵) = 1 → ((𝐴↑𝑁) gcd 𝐵) = 1))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 (class class class)co 7387 1c1 11069 + caddc 11071 · cmul 11073 ℕcn 12186 ℕ₀cn0 12442 ℤcz 12529 ↑cexp 14026 gcd cgcd 16464

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-sup 9393 df-inf 9394 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-3 12250 df-n0 12443 df-z 12530 df-uz 12794 df-rp 12952 df-fl 13754 df-mod 13832 df-seq 13967 df-exp 14027 df-cj 15065 df-re 15066 df-im 15067 df-sqrt 15201 df-abs 15202 df-dvds 16223 df-gcd 16465

This theorem is referenced by: rprpwr 16529 rppwr 16530 logbgcd1irr 26704 lgsne0 27246 2sqlem8 27337 flt4lem5a 42640 flt4lem5b 42641 flt4lem5c 42642 flt4lem5d 42643 flt4lem5e 42644

W3C validator