| 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 16768 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ (𝑃↑(𝑆 + 1)) ∥ 𝑁) |
| 4 | eluz2nn 12801 | . . . . . 6 ⊢ (𝑃 ∈ (ℤ≥‘2) → 𝑃 ∈ ℕ) | |
| 5 | 4 | adantr 480 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑃 ∈ ℕ) |
| 6 | 5 | nnzd 12514 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑃 ∈ ℤ) |
| 7 | 1, 2 | pcprecl 16767 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑆 ∈ ℕ0 ∧ (𝑃↑𝑆) ∥ 𝑁)) |
| 8 | 7 | simprd 495 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑𝑆) ∥ 𝑁) |
| 9 | 7 | simpld 494 | . . . . . . . 8 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑆 ∈ ℕ0) |
| 10 | 5, 9 | nnexpcld 14168 | . . . . . . 7 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑𝑆) ∈ ℕ) |
| 11 | 10 | nnzd 12514 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑𝑆) ∈ ℤ) |
| 12 | 10 | nnne0d 12195 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑𝑆) ≠ 0) |
| 13 | simprl 770 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑁 ∈ ℤ) | |
| 14 | dvdsval2 16182 | . . . . . 6 ⊢ (((𝑃↑𝑆) ∈ ℤ ∧ (𝑃↑𝑆) ≠ 0 ∧ 𝑁 ∈ ℤ) → ((𝑃↑𝑆) ∥ 𝑁 ↔ (𝑁 / (𝑃↑𝑆)) ∈ ℤ)) | |
| 15 | 11, 12, 13, 14 | syl3anc 1373 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ((𝑃↑𝑆) ∥ 𝑁 ↔ (𝑁 / (𝑃↑𝑆)) ∈ ℤ)) |
| 16 | 8, 15 | mpbid 232 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑁 / (𝑃↑𝑆)) ∈ ℤ) |
| 17 | dvdscmul 16209 | . . . 4 ⊢ ((𝑃 ∈ ℤ ∧ (𝑁 / (𝑃↑𝑆)) ∈ ℤ ∧ (𝑃↑𝑆) ∈ ℤ) → (𝑃 ∥ (𝑁 / (𝑃↑𝑆)) → ((𝑃↑𝑆) · 𝑃) ∥ ((𝑃↑𝑆) · (𝑁 / (𝑃↑𝑆))))) | |
| 18 | 6, 16, 11, 17 | syl3anc 1373 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃 ∥ (𝑁 / (𝑃↑𝑆)) → ((𝑃↑𝑆) · 𝑃) ∥ ((𝑃↑𝑆) · (𝑁 / (𝑃↑𝑆))))) |
| 19 | 5 | nncnd 12161 | . . . . . 6 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑃 ∈ ℂ) |
| 20 | 19, 9 | expp1d 14070 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑(𝑆 + 1)) = ((𝑃↑𝑆) · 𝑃)) |
| 21 | 20 | eqcomd 2742 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ((𝑃↑𝑆) · 𝑃) = (𝑃↑(𝑆 + 1))) |
| 22 | zcn 12493 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 23 | 22 | ad2antrl 728 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑁 ∈ ℂ) |
| 24 | 10 | nncnd 12161 | . . . . 5 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃↑𝑆) ∈ ℂ) |
| 25 | 23, 24, 12 | divcan2d 11919 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ((𝑃↑𝑆) · (𝑁 / (𝑃↑𝑆))) = 𝑁) |
| 26 | 21, 25 | breq12d 5111 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (((𝑃↑𝑆) · 𝑃) ∥ ((𝑃↑𝑆) · (𝑁 / (𝑃↑𝑆))) ↔ (𝑃↑(𝑆 + 1)) ∥ 𝑁)) |
| 27 | 18, 26 | sylibd 239 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑃 ∥ (𝑁 / (𝑃↑𝑆)) → (𝑃↑(𝑆 + 1)) ∥ 𝑁)) |
| 28 | 3, 27 | mtod 198 | 1 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ 𝑃 ∥ (𝑁 / (𝑃↑𝑆))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 {crab 3399 class class class wbr 5098 ‘cfv 6492 (class class class)co 7358 supcsup 9343 ℂcc 11024 ℝcr 11025 0cc0 11026 1c1 11027 + caddc 11029 · cmul 11031 < clt 11166 / cdiv 11794 ℕcn 12145 2c2 12200 ℕ0cn0 12401 ℤcz 12488 ℤ≥cuz 12751 ↑cexp 13984 ∥ cdvds 16179 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 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 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-inf 9346 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-fl 13712 df-seq 13925 df-exp 13985 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-dvds 16180 |
| This theorem is referenced by: pcpremul 16771 pczndvds2 16795 |
| Copyright terms: Public domain | W3C validator |