Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > pcprendvds2 | Structured version Visualization version GIF version |
Description: Non-divisibility property of the prime power pre-function. (Contributed by Mario Carneiro, 23-Feb-2014.) |
Ref | Expression |
---|---|
pclem.1 | ⊢ 𝐴 = {𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑁} |
pclem.2 | ⊢ 𝑆 = sup(𝐴, ℝ, < ) |
Ref | Expression |
---|---|
pcprendvds2 | ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ 𝑃 ∥ (𝑁 / (𝑃↑𝑆))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pclem.1 | . . 3 ⊢ 𝐴 = {𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑁} | |
2 | pclem.2 | . . 3 ⊢ 𝑆 = sup(𝐴, ℝ, < ) | |
3 | 1, 2 | pcprendvds 16469 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ (𝑃↑(𝑆 + 1)) ∥ 𝑁) |
4 | eluz2nn 12553 | . . . . . 6 ⊢ (𝑃 ∈ (ℤ≥‘2) → 𝑃 ∈ ℕ) | |
5 | 4 | adantr 480 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑃 ∈ ℕ) |
6 | 5 | nnzd 12354 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑃 ∈ ℤ) |
7 | 1, 2 | pcprecl 16468 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑆 ∈ ℕ0 ∧ (𝑃↑𝑆) ∥ 𝑁)) |
8 | 7 | simprd 495 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑𝑆) ∥ 𝑁) |
9 | 7 | simpld 494 | . . . . . . . 8 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑆 ∈ ℕ0) |
10 | 5, 9 | nnexpcld 13888 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑𝑆) ∈ ℕ) |
11 | 10 | nnzd 12354 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑𝑆) ∈ ℤ) |
12 | 10 | nnne0d 11953 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑𝑆) ≠ 0) |
13 | simprl 767 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑁 ∈ ℤ) | |
14 | dvdsval2 15894 | . . . . . 6 ⊢ (((𝑃↑𝑆) ∈ ℤ ∧ (𝑃↑𝑆) ≠ 0 ∧ 𝑁 ∈ ℤ) → ((𝑃↑𝑆) ∥ 𝑁 ↔ (𝑁 / (𝑃↑𝑆)) ∈ ℤ)) | |
15 | 11, 12, 13, 14 | syl3anc 1369 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ((𝑃↑𝑆) ∥ 𝑁 ↔ (𝑁 / (𝑃↑𝑆)) ∈ ℤ)) |
16 | 8, 15 | mpbid 231 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑁 / (𝑃↑𝑆)) ∈ ℤ) |
17 | dvdscmul 15920 | . . . 4 ⊢ ((𝑃 ∈ ℤ ∧ (𝑁 / (𝑃↑𝑆)) ∈ ℤ ∧ (𝑃↑𝑆) ∈ ℤ) → (𝑃 ∥ (𝑁 / (𝑃↑𝑆)) → ((𝑃↑𝑆) · 𝑃) ∥ ((𝑃↑𝑆) · (𝑁 / (𝑃↑𝑆))))) | |
18 | 6, 16, 11, 17 | syl3anc 1369 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃 ∥ (𝑁 / (𝑃↑𝑆)) → ((𝑃↑𝑆) · 𝑃) ∥ ((𝑃↑𝑆) · (𝑁 / (𝑃↑𝑆))))) |
19 | 5 | nncnd 11919 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑃 ∈ ℂ) |
20 | 19, 9 | expp1d 13793 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑(𝑆 + 1)) = ((𝑃↑𝑆) · 𝑃)) |
21 | 20 | eqcomd 2744 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ((𝑃↑𝑆) · 𝑃) = (𝑃↑(𝑆 + 1))) |
22 | zcn 12254 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
23 | 22 | ad2antrl 724 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑁 ∈ ℂ) |
24 | 10 | nncnd 11919 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑𝑆) ∈ ℂ) |
25 | 23, 24, 12 | divcan2d 11683 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ((𝑃↑𝑆) · (𝑁 / (𝑃↑𝑆))) = 𝑁) |
26 | 21, 25 | breq12d 5083 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (((𝑃↑𝑆) · 𝑃) ∥ ((𝑃↑𝑆) · (𝑁 / (𝑃↑𝑆))) ↔ (𝑃↑(𝑆 + 1)) ∥ 𝑁)) |
27 | 18, 26 | sylibd 238 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃 ∥ (𝑁 / (𝑃↑𝑆)) → (𝑃↑(𝑆 + 1)) ∥ 𝑁)) |
28 | 3, 27 | mtod 197 | 1 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ 𝑃 ∥ (𝑁 / (𝑃↑𝑆))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 {crab 3067 class class class wbr 5070 ‘cfv 6418 (class class class)co 7255 supcsup 9129 ℂcc 10800 ℝcr 10801 0cc0 10802 1c1 10803 + caddc 10805 · cmul 10807 < clt 10940 / cdiv 11562 ℕcn 11903 2c2 11958 ℕ0cn0 12163 ℤcz 12249 ℤ≥cuz 12511 ↑cexp 13710 ∥ cdvds 15891 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-sup 9131 df-inf 9132 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-fl 13440 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-dvds 15892 |
This theorem is referenced by: pcpremul 16472 pczndvds2 16496 |
Copyright terms: Public domain | W3C validator |