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 16683

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 7423	. . . . . . 7 ⊢ (𝑚 = 1 → (𝐴↑𝑚) = (𝐴↑1))
2	1	breq2d 5155	. . . . . 6 ⊢ (𝑚 = 1 → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ (𝐴↑1)))
3	2	bibi1d 342	. . . . 5 ⊢ (𝑚 = 1 → ((𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴) ↔ (𝑃 ∥ (𝐴↑1) ↔ 𝑃 ∥ 𝐴)))
4	3	imbi2d 339	. . . 4 ⊢ (𝑚 = 1 → (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴)) ↔ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑1) ↔ 𝑃 ∥ 𝐴))))
5		oveq2 7423	. . . . . . 7 ⊢ (𝑚 = 𝑘 → (𝐴↑𝑚) = (𝐴↑𝑘))
6	5	breq2d 5155	. . . . . 6 ⊢ (𝑚 = 𝑘 → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ (𝐴↑𝑘)))
7	6	bibi1d 342	. . . . 5 ⊢ (𝑚 = 𝑘 → ((𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴) ↔ (𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴)))
8	7	imbi2d 339	. . . 4 ⊢ (𝑚 = 𝑘 → (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴)) ↔ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴))))
9		oveq2 7423	. . . . . . 7 ⊢ (𝑚 = (𝑘 + 1) → (𝐴↑𝑚) = (𝐴↑(𝑘 + 1)))
10	9	breq2d 5155	. . . . . 6 ⊢ (𝑚 = (𝑘 + 1) → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ (𝐴↑(𝑘 + 1))))
11	10	bibi1d 342	. . . . 5 ⊢ (𝑚 = (𝑘 + 1) → ((𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴) ↔ (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ 𝐴)))
12	11	imbi2d 339	. . . 4 ⊢ (𝑚 = (𝑘 + 1) → (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴)) ↔ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ 𝐴))))
13		oveq2 7423	. . . . . . 7 ⊢ (𝑚 = 𝑁 → (𝐴↑𝑚) = (𝐴↑𝑁))
14	13	breq2d 5155	. . . . . 6 ⊢ (𝑚 = 𝑁 → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ (𝐴↑𝑁)))
15	14	bibi1d 342	. . . . 5 ⊢ (𝑚 = 𝑁 → ((𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴) ↔ (𝑃 ∥ (𝐴↑𝑁) ↔ 𝑃 ∥ 𝐴)))
16	15	imbi2d 339	. . . 4 ⊢ (𝑚 = 𝑁 → (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑚) ↔ 𝑃 ∥ 𝐴)) ↔ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑁) ↔ 𝑃 ∥ 𝐴))))
17		zcn 12591	. . . . . . 7 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ)
18	17	adantl 480	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → 𝐴 ∈ ℂ)
19	18	exp1d 14135	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝐴↑1) = 𝐴)
20	19	breq2d 5155	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑1) ↔ 𝑃 ∥ 𝐴))
21		nnnn0 12507	. . . . . . . . . 10 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℕ₀)
22		expp1 14063	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (𝐴↑(𝑘 + 1)) = ((𝐴↑𝑘) · 𝐴))
23	18, 21, 22	syl2an 594	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → (𝐴↑(𝑘 + 1)) = ((𝐴↑𝑘) · 𝐴))
24	23	breq2d 5155	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ ((𝐴↑𝑘) · 𝐴)))
25		simpll 765	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → 𝑃 ∈ ℙ)
26		simpr 483	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → 𝐴 ∈ ℤ)
27		zexpcl 14071	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℤ ∧ 𝑘 ∈ ℕ₀) → (𝐴↑𝑘) ∈ ℤ)
28	26, 21, 27	syl2an 594	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → (𝐴↑𝑘) ∈ ℤ)
29		simplr 767	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → 𝐴 ∈ ℤ)
30		euclemma 16681	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴↑𝑘) ∈ ℤ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ ((𝐴↑𝑘) · 𝐴) ↔ (𝑃 ∥ (𝐴↑𝑘) ∨ 𝑃 ∥ 𝐴)))
31	25, 28, 29, 30	syl3anc 1368	. . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → (𝑃 ∥ ((𝐴↑𝑘) · 𝐴) ↔ (𝑃 ∥ (𝐴↑𝑘) ∨ 𝑃 ∥ 𝐴)))
32	24, 31	bitrd 278	. . . . . . 7 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ (𝑃 ∥ (𝐴↑𝑘) ∨ 𝑃 ∥ 𝐴)))
33		orbi1 915	. . . . . . . . 9 ⊢ ((𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴) → ((𝑃 ∥ (𝐴↑𝑘) ∨ 𝑃 ∥ 𝐴) ↔ (𝑃 ∥ 𝐴 ∨ 𝑃 ∥ 𝐴)))
34		oridm 902	. . . . . . . . 9 ⊢ ((𝑃 ∥ 𝐴 ∨ 𝑃 ∥ 𝐴) ↔ 𝑃 ∥ 𝐴)
35	33, 34	bitrdi 286	. . . . . . . 8 ⊢ ((𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴) → ((𝑃 ∥ (𝐴↑𝑘) ∨ 𝑃 ∥ 𝐴) ↔ 𝑃 ∥ 𝐴))
36	35	bibi2d 341	. . . . . . 7 ⊢ ((𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴) → ((𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ (𝑃 ∥ (𝐴↑𝑘) ∨ 𝑃 ∥ 𝐴)) ↔ (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ 𝐴)))
37	32, 36	syl5ibcom 244	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑘 ∈ ℕ) → ((𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴) → (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ 𝐴)))
38	37	expcom 412	. . . . 5 ⊢ (𝑘 ∈ ℕ → ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → ((𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴) → (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ 𝐴))))
39	38	a2d 29	. . . 4 ⊢ (𝑘 ∈ ℕ → (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑘) ↔ 𝑃 ∥ 𝐴)) → ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑(𝑘 + 1)) ↔ 𝑃 ∥ 𝐴))))
40	4, 8, 12, 16, 20, 39	nnind 12258	. . 3 ⊢ (𝑁 ∈ ℕ → ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) → (𝑃 ∥ (𝐴↑𝑁) ↔ 𝑃 ∥ 𝐴)))
41	40	impcom 406	. 2 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ) ∧ 𝑁 ∈ ℕ) → (𝑃 ∥ (𝐴↑𝑁) ↔ 𝑃 ∥ 𝐴))
42	41	3impa 1107	1 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑃 ∥ (𝐴↑𝑁) ↔ 𝑃 ∥ 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 845 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 class class class wbr 5143 (class class class)co 7415 ℂcc 11134 1c1 11137 + caddc 11139 · cmul 11141 ℕcn 12240 ℕ₀cn0 12500 ℤcz 12586 ↑cexp 14056 ∥ cdvds 16228 ℙcprime 16639

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7737 ax-cnex 11192 ax-resscn 11193 ax-1cn 11194 ax-icn 11195 ax-addcl 11196 ax-addrcl 11197 ax-mulcl 11198 ax-mulrcl 11199 ax-mulcom 11200 ax-addass 11201 ax-mulass 11202 ax-distr 11203 ax-i2m1 11204 ax-1ne0 11205 ax-1rid 11206 ax-rnegex 11207 ax-rrecex 11208 ax-cnre 11209 ax-pre-lttri 11210 ax-pre-lttrn 11211 ax-pre-ltadd 11212 ax-pre-mulgt0 11213 ax-pre-sup 11214

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-pss 3960 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7371 df-ov 7418 df-oprab 7419 df-mpo 7420 df-om 7868 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8388 df-rdg 8427 df-1o 8483 df-2o 8484 df-er 8721 df-en 8961 df-dom 8962 df-sdom 8963 df-fin 8964 df-sup 9463 df-inf 9464 df-pnf 11278 df-mnf 11279 df-xr 11280 df-ltxr 11281 df-le 11282 df-sub 11474 df-neg 11475 df-div 11900 df-nn 12241 df-2 12303 df-3 12304 df-n0 12501 df-z 12587 df-uz 12851 df-rp 13005 df-fl 13787 df-mod 13865 df-seq 13997 df-exp 14057 df-cj 15076 df-re 15077 df-im 15078 df-sqrt 15212 df-abs 15213 df-dvds 16229 df-gcd 16467 df-prm 16640

This theorem is referenced by: prmdvdsexpb 16684 prmdvdssq 16686 rpexp 16691 pythagtriplem4 16785 lgslem4 27249 lgsqr 27300 lgsqrmodndvds 27302 2sqlem3 27369 aks6d1c7 41711 etransclem41 45725 lighneallem4 47012

W3C validator