pcexp - Metamath Proof Explorer

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

Theorem pcexp 16828

Description: Prime power of an exponential. (Contributed by Mario Carneiro, 10-Aug-2015.)

**Assertion**
Ref	Expression
pcexp	⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ) → (𝑃 pCnt (𝐴↑𝑁)) = (𝑁 · (𝑃 pCnt 𝐴)))

Proof of Theorem pcexp Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7371	. . . . 5 ⊢ (𝑥 = 0 → (𝐴↑𝑥) = (𝐴↑0))
2	1	oveq2d 7379	. . . 4 ⊢ (𝑥 = 0 → (𝑃 pCnt (𝐴↑𝑥)) = (𝑃 pCnt (𝐴↑0)))
3		oveq1 7370	. . . 4 ⊢ (𝑥 = 0 → (𝑥 · (𝑃 pCnt 𝐴)) = (0 · (𝑃 pCnt 𝐴)))
4	2, 3	eqeq12d 2756	. . 3 ⊢ (𝑥 = 0 → ((𝑃 pCnt (𝐴↑𝑥)) = (𝑥 · (𝑃 pCnt 𝐴)) ↔ (𝑃 pCnt (𝐴↑0)) = (0 · (𝑃 pCnt 𝐴))))
5		oveq2 7371	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝐴↑𝑥) = (𝐴↑𝑦))
6	5	oveq2d 7379	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑃 pCnt (𝐴↑𝑥)) = (𝑃 pCnt (𝐴↑𝑦)))
7		oveq1 7370	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 · (𝑃 pCnt 𝐴)) = (𝑦 · (𝑃 pCnt 𝐴)))
8	6, 7	eqeq12d 2756	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑃 pCnt (𝐴↑𝑥)) = (𝑥 · (𝑃 pCnt 𝐴)) ↔ (𝑃 pCnt (𝐴↑𝑦)) = (𝑦 · (𝑃 pCnt 𝐴))))
9		oveq2 7371	. . . . 5 ⊢ (𝑥 = (𝑦 + 1) → (𝐴↑𝑥) = (𝐴↑(𝑦 + 1)))
10	9	oveq2d 7379	. . . 4 ⊢ (𝑥 = (𝑦 + 1) → (𝑃 pCnt (𝐴↑𝑥)) = (𝑃 pCnt (𝐴↑(𝑦 + 1))))
11		oveq1 7370	. . . 4 ⊢ (𝑥 = (𝑦 + 1) → (𝑥 · (𝑃 pCnt 𝐴)) = ((𝑦 + 1) · (𝑃 pCnt 𝐴)))
12	10, 11	eqeq12d 2756	. . 3 ⊢ (𝑥 = (𝑦 + 1) → ((𝑃 pCnt (𝐴↑𝑥)) = (𝑥 · (𝑃 pCnt 𝐴)) ↔ (𝑃 pCnt (𝐴↑(𝑦 + 1))) = ((𝑦 + 1) · (𝑃 pCnt 𝐴))))
13		oveq2 7371	. . . . 5 ⊢ (𝑥 = -𝑦 → (𝐴↑𝑥) = (𝐴↑-𝑦))
14	13	oveq2d 7379	. . . 4 ⊢ (𝑥 = -𝑦 → (𝑃 pCnt (𝐴↑𝑥)) = (𝑃 pCnt (𝐴↑-𝑦)))
15		oveq1 7370	. . . 4 ⊢ (𝑥 = -𝑦 → (𝑥 · (𝑃 pCnt 𝐴)) = (-𝑦 · (𝑃 pCnt 𝐴)))
16	14, 15	eqeq12d 2756	. . 3 ⊢ (𝑥 = -𝑦 → ((𝑃 pCnt (𝐴↑𝑥)) = (𝑥 · (𝑃 pCnt 𝐴)) ↔ (𝑃 pCnt (𝐴↑-𝑦)) = (-𝑦 · (𝑃 pCnt 𝐴))))
17		oveq2 7371	. . . . 5 ⊢ (𝑥 = 𝑁 → (𝐴↑𝑥) = (𝐴↑𝑁))
18	17	oveq2d 7379	. . . 4 ⊢ (𝑥 = 𝑁 → (𝑃 pCnt (𝐴↑𝑥)) = (𝑃 pCnt (𝐴↑𝑁)))
19		oveq1 7370	. . . 4 ⊢ (𝑥 = 𝑁 → (𝑥 · (𝑃 pCnt 𝐴)) = (𝑁 · (𝑃 pCnt 𝐴)))
20	18, 19	eqeq12d 2756	. . 3 ⊢ (𝑥 = 𝑁 → ((𝑃 pCnt (𝐴↑𝑥)) = (𝑥 · (𝑃 pCnt 𝐴)) ↔ (𝑃 pCnt (𝐴↑𝑁)) = (𝑁 · (𝑃 pCnt 𝐴))))
21		pc1 16824	. . . . 5 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt 1) = 0)
22	21	adantr 481	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) → (𝑃 pCnt 1) = 0)
23		qcn 12911	. . . . . . 7 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℂ)
24	23	ad2antrl 734	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) → 𝐴 ∈ ℂ)
25	24	exp0d 14100	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) → (𝐴↑0) = 1)
26	25	oveq2d 7379	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) → (𝑃 pCnt (𝐴↑0)) = (𝑃 pCnt 1))
27		pcqcl 16825	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) → (𝑃 pCnt 𝐴) ∈ ℤ)
28	27	zcnd 12632	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) → (𝑃 pCnt 𝐴) ∈ ℂ)
29	28	mul02d 11342	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) → (0 · (𝑃 pCnt 𝐴)) = 0)
30	22, 26, 29	3eqtr4d 2785	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) → (𝑃 pCnt (𝐴↑0)) = (0 · (𝑃 pCnt 𝐴)))
31		oveq1 7370	. . . . 5 ⊢ ((𝑃 pCnt (𝐴↑𝑦)) = (𝑦 · (𝑃 pCnt 𝐴)) → ((𝑃 pCnt (𝐴↑𝑦)) + (𝑃 pCnt 𝐴)) = ((𝑦 · (𝑃 pCnt 𝐴)) + (𝑃 pCnt 𝐴)))
32		expp1 14028	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑦 ∈ ℕ₀) → (𝐴↑(𝑦 + 1)) = ((𝐴↑𝑦) · 𝐴))
33	24, 32	sylan 586	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → (𝐴↑(𝑦 + 1)) = ((𝐴↑𝑦) · 𝐴))
34	33	oveq2d 7379	. . . . . . 7 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → (𝑃 pCnt (𝐴↑(𝑦 + 1))) = (𝑃 pCnt ((𝐴↑𝑦) · 𝐴)))
35		simpll 772	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → 𝑃 ∈ ℙ)
36		simplrl 782	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → 𝐴 ∈ ℚ)
37		simplrr 783	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → 𝐴 ≠ 0)
38		nn0z 12546	. . . . . . . . . 10 ⊢ (𝑦 ∈ ℕ₀ → 𝑦 ∈ ℤ)
39	38	adantl 482	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → 𝑦 ∈ ℤ)
40		qexpclz 14041	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℚ ∧ 𝐴 ≠ 0 ∧ 𝑦 ∈ ℤ) → (𝐴↑𝑦) ∈ ℚ)
41	36, 37, 39, 40	syl3anc 1379	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → (𝐴↑𝑦) ∈ ℚ)
42	24	adantr 481	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → 𝐴 ∈ ℂ)
43	42, 37, 39	expne0d 14112	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → (𝐴↑𝑦) ≠ 0)
44		pcqmul 16822	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ ((𝐴↑𝑦) ∈ ℚ ∧ (𝐴↑𝑦) ≠ 0) ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) → (𝑃 pCnt ((𝐴↑𝑦) · 𝐴)) = ((𝑃 pCnt (𝐴↑𝑦)) + (𝑃 pCnt 𝐴)))
45	35, 41, 43, 36, 37, 44	syl122anc 1387	. . . . . . 7 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → (𝑃 pCnt ((𝐴↑𝑦) · 𝐴)) = ((𝑃 pCnt (𝐴↑𝑦)) + (𝑃 pCnt 𝐴)))
46	34, 45	eqtrd 2775	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → (𝑃 pCnt (𝐴↑(𝑦 + 1))) = ((𝑃 pCnt (𝐴↑𝑦)) + (𝑃 pCnt 𝐴)))
47		nn0cn 12445	. . . . . . . 8 ⊢ (𝑦 ∈ ℕ₀ → 𝑦 ∈ ℂ)
48	47	adantl 482	. . . . . . 7 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → 𝑦 ∈ ℂ)
49	28	adantr 481	. . . . . . 7 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → (𝑃 pCnt 𝐴) ∈ ℂ)
50	48, 49	adddirp1d 11169	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → ((𝑦 + 1) · (𝑃 pCnt 𝐴)) = ((𝑦 · (𝑃 pCnt 𝐴)) + (𝑃 pCnt 𝐴)))
51	46, 50	eqeq12d 2756	. . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → ((𝑃 pCnt (𝐴↑(𝑦 + 1))) = ((𝑦 + 1) · (𝑃 pCnt 𝐴)) ↔ ((𝑃 pCnt (𝐴↑𝑦)) + (𝑃 pCnt 𝐴)) = ((𝑦 · (𝑃 pCnt 𝐴)) + (𝑃 pCnt 𝐴))))
52	31, 51	imbitrrid 247	. . . 4 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ₀) → ((𝑃 pCnt (𝐴↑𝑦)) = (𝑦 · (𝑃 pCnt 𝐴)) → (𝑃 pCnt (𝐴↑(𝑦 + 1))) = ((𝑦 + 1) · (𝑃 pCnt 𝐴))))
53	52	ex 413	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) → (𝑦 ∈ ℕ₀ → ((𝑃 pCnt (𝐴↑𝑦)) = (𝑦 · (𝑃 pCnt 𝐴)) → (𝑃 pCnt (𝐴↑(𝑦 + 1))) = ((𝑦 + 1) · (𝑃 pCnt 𝐴)))))
54		negeq 11383	. . . . 5 ⊢ ((𝑃 pCnt (𝐴↑𝑦)) = (𝑦 · (𝑃 pCnt 𝐴)) → -(𝑃 pCnt (𝐴↑𝑦)) = -(𝑦 · (𝑃 pCnt 𝐴)))
55		nnnn0 12442	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℕ₀)
56		expneg 14029	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑦 ∈ ℕ₀) → (𝐴↑-𝑦) = (1 / (𝐴↑𝑦)))
57	24, 55, 56	syl2an 602	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ) → (𝐴↑-𝑦) = (1 / (𝐴↑𝑦)))
58	57	oveq2d 7379	. . . . . . 7 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ) → (𝑃 pCnt (𝐴↑-𝑦)) = (𝑃 pCnt (1 / (𝐴↑𝑦))))
59		simpll 772	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ) → 𝑃 ∈ ℙ)
60	55, 41	sylan2 599	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ) → (𝐴↑𝑦) ∈ ℚ)
61	55, 43	sylan2 599	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ) → (𝐴↑𝑦) ≠ 0)
62		pcrec 16827	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ ((𝐴↑𝑦) ∈ ℚ ∧ (𝐴↑𝑦) ≠ 0)) → (𝑃 pCnt (1 / (𝐴↑𝑦))) = -(𝑃 pCnt (𝐴↑𝑦)))
63	59, 60, 61, 62	syl12anc 842	. . . . . . 7 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ) → (𝑃 pCnt (1 / (𝐴↑𝑦))) = -(𝑃 pCnt (𝐴↑𝑦)))
64	58, 63	eqtrd 2775	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ) → (𝑃 pCnt (𝐴↑-𝑦)) = -(𝑃 pCnt (𝐴↑𝑦)))
65		nncn 12180	. . . . . . 7 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℂ)
66		mulneg1 11584	. . . . . . 7 ⊢ ((𝑦 ∈ ℂ ∧ (𝑃 pCnt 𝐴) ∈ ℂ) → (-𝑦 · (𝑃 pCnt 𝐴)) = -(𝑦 · (𝑃 pCnt 𝐴)))
67	65, 28, 66	syl2anr 603	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ) → (-𝑦 · (𝑃 pCnt 𝐴)) = -(𝑦 · (𝑃 pCnt 𝐴)))
68	64, 67	eqeq12d 2756	. . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ) → ((𝑃 pCnt (𝐴↑-𝑦)) = (-𝑦 · (𝑃 pCnt 𝐴)) ↔ -(𝑃 pCnt (𝐴↑𝑦)) = -(𝑦 · (𝑃 pCnt 𝐴))))
69	54, 68	imbitrrid 247	. . . 4 ⊢ (((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) ∧ 𝑦 ∈ ℕ) → ((𝑃 pCnt (𝐴↑𝑦)) = (𝑦 · (𝑃 pCnt 𝐴)) → (𝑃 pCnt (𝐴↑-𝑦)) = (-𝑦 · (𝑃 pCnt 𝐴))))
70	69	ex 413	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) → (𝑦 ∈ ℕ → ((𝑃 pCnt (𝐴↑𝑦)) = (𝑦 · (𝑃 pCnt 𝐴)) → (𝑃 pCnt (𝐴↑-𝑦)) = (-𝑦 · (𝑃 pCnt 𝐴)))))
71	4, 8, 12, 16, 20, 30, 53, 70	zindd 12628	. 2 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0)) → (𝑁 ∈ ℤ → (𝑃 pCnt (𝐴↑𝑁)) = (𝑁 · (𝑃 pCnt 𝐴))))
72	71	3impia 1123	1 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 ∈ ℚ ∧ 𝐴 ≠ 0) ∧ 𝑁 ∈ ℤ) → (𝑃 pCnt (𝐴↑𝑁)) = (𝑁 · (𝑃 pCnt 𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ≠ wne 2935 (class class class)co 7363 ℂcc 11034 0cc0 11036 1c1 11037 + caddc 11039 · cmul 11041 -cneg 11376 / cdiv 11805 ℕcn 12172 ℕ₀cn0 12435 ℤcz 12522 ℚcq 12896 ↑cexp 14021 ℙcprime 16638 pCnt cpc 16805

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 ax-pre-sup 11114

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-2o 8403 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-sup 9352 df-inf 9353 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-div 11806 df-nn 12173 df-2 12242 df-3 12243 df-n0 12436 df-z 12523 df-uz 12787 df-q 12897 df-rp 12941 df-fl 13749 df-mod 13827 df-seq 13962 df-exp 14022 df-cj 15059 df-re 15060 df-im 15061 df-sqrt 15195 df-abs 15196 df-dvds 16220 df-gcd 16462 df-prm 16639 df-pc 16806

This theorem is referenced by: qexpz 16870 expnprm 16871 dchrisum0flblem1 27496 dchrisum0flblem2 27497 aks4d1p7d1 42568 aks6d1c2p2 42605 aks6d1c7 42670

W3C validator