prmdvdsexp - Metamath Proof Explorer

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

Theorem prmdvdsexp 16652

Description: A prime divides a positive power of an integer iff it divides the integer. (Contributed by Mario Carneiro, 24-Feb-2014.) (Revised by Mario Carneiro, 17-Jul-2014.)

**Assertion**
Ref	Expression
prmdvdsexp	⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑃 ∥ (𝐴↑𝑁) ↔ 𝑃 ∥ 𝐴))

Proof of Theorem prmdvdsexp Dummy variables 𝑚 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7417	. . . . . . 7 ⊢ (𝑚 = 1 → (𝐴↑𝑚) = (𝐴↑1))
2	1	breq2d 5161	. . . . . 6 ⊢ (𝑚 = 1 → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ (𝐴↑1)))
3	2	bibi1d 344	. . . . 5 ⊢ (𝑚 = 1 → ((𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴) ↔ (𝑃 ∥ (𝐴↑1) ↔ 𝑃 ∥ 𝐴)))
4	3	imbi2d 341	. . . 4 ⊢ (𝑚 = 1 → (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴)) ↔ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑1) ↔ 𝑃 ∥ 𝐴))))
5		oveq2 7417	. . . . . . 7 ⊢ (𝑚 = 𝑘 → (𝐴↑𝑚) = (𝐴↑𝑘))
6	5	breq2d 5161	. . . . . 6 ⊢ (𝑚 = 𝑘 → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ (𝐴↑𝑘)))
7	6	bibi1d 344	. . . . 5 ⊢ (𝑚 = 𝑘 → ((𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴) ↔ (𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴)))
8	7	imbi2d 341	. . . 4 ⊢ (𝑚 = 𝑘 → (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴)) ↔ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴))))
9		oveq2 7417	. . . . . . 7 ⊢ (𝑚 = (𝑘 + 1) → (𝐴↑𝑚) = (𝐴↑(𝑘 + 1)))
10	9	breq2d 5161	. . . . . 6 ⊢ (𝑚 = (𝑘 + 1) → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ (𝐴↑(𝑘 + 1))))
11	10	bibi1d 344	. . . . 5 ⊢ (𝑚 = (𝑘 + 1) → ((𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴) ↔ (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ 𝐴)))
12	11	imbi2d 341	. . . 4 ⊢ (𝑚 = (𝑘 + 1) → (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴)) ↔ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ 𝐴))))
13		oveq2 7417	. . . . . . 7 ⊢ (𝑚 = 𝑁 → (𝐴↑𝑚) = (𝐴↑𝑁))
14	13	breq2d 5161	. . . . . 6 ⊢ (𝑚 = 𝑁 → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ (𝐴↑𝑁)))
15	14	bibi1d 344	. . . . 5 ⊢ (𝑚 = 𝑁 → ((𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴) ↔ (𝑃 ∥ (𝐴↑𝑁) ↔ 𝑃 ∥ 𝐴)))
16	15	imbi2d 341	. . . 4 ⊢ (𝑚 = 𝑁 → (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴)) ↔ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑁) ↔ 𝑃 ∥ 𝐴))))
17		zcn 12563	. . . . . . 7 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ)
18	17	adantl 483	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → 𝐴 ∈ ℂ)
19	18	exp1d 14106	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝐴↑1) = 𝐴)
20	19	breq2d 5161	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑1) ↔ 𝑃 ∥ 𝐴))
21		nnnn0 12479	. . . . . . . . . 10 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℕ₀)
22		expp1 14034	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (𝐴↑(𝑘 + 1)) = ((𝐴↑𝑘) · 𝐴))
23	18, 21, 22	syl2an 597	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → (𝐴↑(𝑘 + 1)) = ((𝐴↑𝑘) · 𝐴))
24	23	breq2d 5161	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ ((𝐴↑𝑘) · 𝐴)))
25		simpll 766	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → 𝑃 ∈ ℙ)
26		simpr 486	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → 𝐴 ∈ ℤ)
27		zexpcl 14042	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ 𝑘 ∈ ℕ₀) → (𝐴↑𝑘) ∈ ℤ)
28	26, 21, 27	syl2an 597	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → (𝐴↑𝑘) ∈ ℤ)
29		simplr 768	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → 𝐴 ∈ ℤ)
30		euclemma 16650	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴↑𝑘) ∈ ℤ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ ((𝐴↑𝑘) · 𝐴) ↔ (𝑃 ∥ (𝐴↑𝑘) ∨ 𝑃 ∥ 𝐴)))
31	25, 28, 29, 30	syl3anc 1372	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → (𝑃 ∥ ((𝐴↑𝑘) · 𝐴) ↔ (𝑃 ∥ (𝐴↑𝑘) ∨ 𝑃 ∥ 𝐴)))
32	24, 31	bitrd 279	. . . . . . 7 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ (𝑃 ∥ (𝐴↑𝑘) ∨ 𝑃 ∥ 𝐴)))
33		orbi1 917	. . . . . . . . 9 ⊢ ((𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴) → ((𝑃 ∥ (𝐴↑𝑘) ∨ 𝑃 ∥ 𝐴) ↔ (𝑃 ∥ 𝐴 ∨ 𝑃 ∥ 𝐴)))
34		oridm 904	. . . . . . . . 9 ⊢ ((𝑃 ∥ 𝐴 ∨ 𝑃 ∥ 𝐴) ↔ 𝑃 ∥ 𝐴)
35	33, 34	bitrdi 287	. . . . . . . 8 ⊢ ((𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴) → ((𝑃 ∥ (𝐴↑𝑘) ∨ 𝑃 ∥ 𝐴) ↔ 𝑃 ∥ 𝐴))
36	35	bibi2d 343	. . . . . . 7 ⊢ ((𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴) → ((𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ (𝑃 ∥ (𝐴↑𝑘) ∨ 𝑃 ∥ 𝐴)) ↔ (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ 𝐴)))
37	32, 36	syl5ibcom 244	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → ((𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴) → (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ 𝐴)))
38	37	expcom 415	. . . . 5 ⊢ (𝑘 ∈ ℕ → ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → ((𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴) → (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ 𝐴))))
39	38	a2d 29	. . . 4 ⊢ (𝑘 ∈ ℕ → (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴)) → ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ 𝐴))))
40	4, 8, 12, 16, 20, 39	nnind 12230	. . 3 ⊢ (𝑁 ∈ ℕ → ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑁) ↔ 𝑃 ∥ 𝐴)))
41	40	impcom 409	. 2 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑁 ∈ ℕ) → (𝑃 ∥ (𝐴↑𝑁) ↔ 𝑃 ∥ 𝐴))
42	41	3impa 1111	1 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑃 ∥ (𝐴↑𝑁) ↔ 𝑃 ∥ 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 class class class wbr 5149 (class class class)co 7409 ℂcc 11108 1c1 11111 + caddc 11113 · cmul 11115 ℕcn 12212 ℕ₀cn0 12472 ℤcz 12558 ↑cexp 14027 ∥ cdvds 16197 ℙcprime 16608

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-2o 8467 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9437 df-inf 9438 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-n0 12473 df-z 12559 df-uz 12823 df-rp 12975 df-fl 13757 df-mod 13835 df-seq 13967 df-exp 14028 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-dvds 16198 df-gcd 16436 df-prm 16609

This theorem is referenced by: prmdvdsexpb 16653 prmdvdssq 16655 rpexp 16659 pythagtriplem4 16752 lgslem4 26803 lgsqr 26854 lgsqrmodndvds 26856 2sqlem3 26923 etransclem41 44991 lighneallem4 46278

W3C validator