dvdsexp2im - Metamath Proof Explorer

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

Theorem dvdsexp2im 16305

Description: If an integer divides another integer, then it also divides any of its powers. (Contributed by Scott Fenton, 7-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)

**Assertion**
Ref	Expression
dvdsexp2im	⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝐾 ∥ 𝑀 → 𝐾 ∥ (𝑀↑𝑁)))

Proof of Theorem dvdsexp2im Dummy variable 𝑚 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		divides 16234	. . 3 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐾 ∥ 𝑀 ↔ ∃𝑚 ∈ ℤ (𝑚 · 𝐾) = 𝑀))
2	1	3adant3 1129	. 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝐾 ∥ 𝑀 ↔ ∃𝑚 ∈ ℤ (𝑚 · 𝐾) = 𝑀))
3		simpl1 1188	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → 𝐾 ∈ ℤ)
4		nnnn0 12510	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ₀)
5	4	3ad2ant3 1132	. . . . . . . 8 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ₀)
6	5	adantr 479	. . . . . . 7 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℕ₀)
7		zexpcl 14075	. . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℕ₀) → (𝐾↑𝑁) ∈ ℤ)
8	3, 6, 7	syl2anc 582	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → (𝐾↑𝑁) ∈ ℤ)
9		simpr 483	. . . . . . . 8 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℤ)
10		zexpcl 14075	. . . . . . . 8 ⊢ ((𝑚 ∈ ℤ ∧ 𝑁 ∈ ℕ₀) → (𝑚↑𝑁) ∈ ℤ)
11	9, 6, 10	syl2anc 582	. . . . . . 7 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → (𝑚↑𝑁) ∈ ℤ)
12	11, 8	zmulcld 12703	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → ((𝑚↑𝑁) · (𝐾↑𝑁)) ∈ ℤ)
13		simpl3 1190	. . . . . . 7 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → 𝑁 ∈ ℕ)
14		iddvdsexp 16258	. . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑁 ∈ ℕ) → 𝐾 ∥ (𝐾↑𝑁))
15	3, 13, 14	syl2anc 582	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → 𝐾 ∥ (𝐾↑𝑁))
16		dvdsmul2 16257	. . . . . . 7 ⊢ (((𝑚↑𝑁) ∈ ℤ ∧ (𝐾↑𝑁) ∈ ℤ) → (𝐾↑𝑁) ∥ ((𝑚↑𝑁) · (𝐾↑𝑁)))
17	11, 8, 16	syl2anc 582	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → (𝐾↑𝑁) ∥ ((𝑚↑𝑁) · (𝐾↑𝑁)))
18	3, 8, 12, 15, 17	dvdstrd 16273	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → 𝐾 ∥ ((𝑚↑𝑁) · (𝐾↑𝑁)))
19		zcn 12594	. . . . . . 7 ⊢ (𝑚 ∈ ℤ → 𝑚 ∈ ℂ)
20	19	adantl 480	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → 𝑚 ∈ ℂ)
21		zcn 12594	. . . . . . . 8 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ)
22	21	3ad2ant1 1130	. . . . . . 7 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → 𝐾 ∈ ℂ)
23	22	adantr 479	. . . . . 6 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → 𝐾 ∈ ℂ)
24	20, 23, 6	mulexpd 14159	. . . . 5 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → ((𝑚 · 𝐾)↑𝑁) = ((𝑚↑𝑁) · (𝐾↑𝑁)))
25	18, 24	breqtrrd 5177	. . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → 𝐾 ∥ ((𝑚 · 𝐾)↑𝑁))
26		oveq1 7425	. . . . 5 ⊢ ((𝑚 · 𝐾) = 𝑀 → ((𝑚 · 𝐾)↑𝑁) = (𝑀↑𝑁))
27	26	breq2d 5161	. . . 4 ⊢ ((𝑚 · 𝐾) = 𝑀 → (𝐾 ∥ ((𝑚 · 𝐾)↑𝑁) ↔ 𝐾 ∥ (𝑀↑𝑁)))
28	25, 27	syl5ibcom 244	. . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) ∧ 𝑚 ∈ ℤ) → ((𝑚 · 𝐾) = 𝑀 → 𝐾 ∥ (𝑀↑𝑁)))
29	28	rexlimdva 3144	. 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (∃𝑚 ∈ ℤ (𝑚 · 𝐾) = 𝑀 → 𝐾 ∥ (𝑀↑𝑁)))
30	2, 29	sylbid 239	1 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝐾 ∥ 𝑀 → 𝐾 ∥ (𝑀↑𝑁)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∃wrex 3059 class class class wbr 5149 (class class class)co 7418 ℂcc 11137 · cmul 11144 ℕcn 12243 ℕ₀cn0 12503 ℤcz 12589 ↑cexp 14060 ∥ cdvds 16232

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 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7740 ax-cnex 11195 ax-resscn 11196 ax-1cn 11197 ax-icn 11198 ax-addcl 11199 ax-addrcl 11200 ax-mulcl 11201 ax-mulrcl 11202 ax-mulcom 11203 ax-addass 11204 ax-mulass 11205 ax-distr 11206 ax-i2m1 11207 ax-1ne0 11208 ax-1rid 11209 ax-rnegex 11210 ax-rrecex 11211 ax-cnre 11212 ax-pre-lttri 11213 ax-pre-lttrn 11214 ax-pre-ltadd 11215 ax-pre-mulgt0 11216

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 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3964 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6306 df-ord 6373 df-on 6374 df-lim 6375 df-suc 6376 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-riota 7374 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7871 df-2nd 7994 df-frecs 8286 df-wrecs 8317 df-recs 8391 df-rdg 8430 df-er 8724 df-en 8964 df-dom 8965 df-sdom 8966 df-pnf 11281 df-mnf 11282 df-xr 11283 df-ltxr 11284 df-le 11285 df-sub 11477 df-neg 11478 df-nn 12244 df-n0 12504 df-z 12590 df-uz 12854 df-seq 14001 df-exp 14061 df-dvds 16233

This theorem is referenced by: flt4lem5 42183 flt4lem7 42192 nna4b4nsq 42193

W3C validator

	
		OSZAR »