![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > pcprendvds | 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 |
---|---|
pcprendvds | ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ (𝑃↑(𝑆 + 1)) ∥ 𝑁) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pclem.1 | . . . . 5 ⊢ 𝐴 = {𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑁} | |
2 | pclem.2 | . . . . 5 ⊢ 𝑆 = sup(𝐴, ℝ, < ) | |
3 | 1, 2 | pcprecl 16805 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑆 ∈ ℕ0 ∧ (𝑃↑𝑆) ∥ 𝑁)) |
4 | 3 | simpld 493 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑆 ∈ ℕ0) |
5 | nn0re 12509 | . . 3 ⊢ (𝑆 ∈ ℕ0 → 𝑆 ∈ ℝ) | |
6 | ltp1 12082 | . . . 4 ⊢ (𝑆 ∈ ℝ → 𝑆 < (𝑆 + 1)) | |
7 | peano2re 11415 | . . . . 5 ⊢ (𝑆 ∈ ℝ → (𝑆 + 1) ∈ ℝ) | |
8 | ltnle 11321 | . . . . 5 ⊢ ((𝑆 ∈ ℝ ∧ (𝑆 + 1) ∈ ℝ) → (𝑆 < (𝑆 + 1) ↔ ¬ (𝑆 + 1) ≤ 𝑆)) | |
9 | 7, 8 | mpdan 685 | . . . 4 ⊢ (𝑆 ∈ ℝ → (𝑆 < (𝑆 + 1) ↔ ¬ (𝑆 + 1) ≤ 𝑆)) |
10 | 6, 9 | mpbid 231 | . . 3 ⊢ (𝑆 ∈ ℝ → ¬ (𝑆 + 1) ≤ 𝑆) |
11 | 4, 5, 10 | 3syl 18 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ (𝑆 + 1) ≤ 𝑆) |
12 | 1 | pclem 16804 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
13 | peano2nn0 12540 | . . . 4 ⊢ (𝑆 ∈ ℕ0 → (𝑆 + 1) ∈ ℕ0) | |
14 | oveq2 7423 | . . . . . . 7 ⊢ (𝑥 = (𝑆 + 1) → (𝑃↑𝑥) = (𝑃↑(𝑆 + 1))) | |
15 | 14 | breq1d 5153 | . . . . . 6 ⊢ (𝑥 = (𝑆 + 1) → ((𝑃↑𝑥) ∥ 𝑁 ↔ (𝑃↑(𝑆 + 1)) ∥ 𝑁)) |
16 | oveq2 7423 | . . . . . . . . 9 ⊢ (𝑛 = 𝑥 → (𝑃↑𝑛) = (𝑃↑𝑥)) | |
17 | 16 | breq1d 5153 | . . . . . . . 8 ⊢ (𝑛 = 𝑥 → ((𝑃↑𝑛) ∥ 𝑁 ↔ (𝑃↑𝑥) ∥ 𝑁)) |
18 | 17 | cbvrabv 3430 | . . . . . . 7 ⊢ {𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑁} = {𝑥 ∈ ℕ0 ∣ (𝑃↑𝑥) ∥ 𝑁} |
19 | 1, 18 | eqtri 2753 | . . . . . 6 ⊢ 𝐴 = {𝑥 ∈ ℕ0 ∣ (𝑃↑𝑥) ∥ 𝑁} |
20 | 15, 19 | elrab2 3678 | . . . . 5 ⊢ ((𝑆 + 1) ∈ 𝐴 ↔ ((𝑆 + 1) ∈ ℕ0 ∧ (𝑃↑(𝑆 + 1)) ∥ 𝑁)) |
21 | 20 | simplbi2 499 | . . . 4 ⊢ ((𝑆 + 1) ∈ ℕ0 → ((𝑃↑(𝑆 + 1)) ∥ 𝑁 → (𝑆 + 1) ∈ 𝐴)) |
22 | 4, 13, 21 | 3syl 18 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ((𝑃↑(𝑆 + 1)) ∥ 𝑁 → (𝑆 + 1) ∈ 𝐴)) |
23 | suprzub 12951 | . . . . . 6 ⊢ ((𝐴 ⊆ ℤ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ∧ (𝑆 + 1) ∈ 𝐴) → (𝑆 + 1) ≤ sup(𝐴, ℝ, < )) | |
24 | 23, 2 | breqtrrdi 5185 | . . . . 5 ⊢ ((𝐴 ⊆ ℤ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ∧ (𝑆 + 1) ∈ 𝐴) → (𝑆 + 1) ≤ 𝑆) |
25 | 24 | 3expia 1118 | . . . 4 ⊢ ((𝐴 ⊆ ℤ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) → ((𝑆 + 1) ∈ 𝐴 → (𝑆 + 1) ≤ 𝑆)) |
26 | 25 | 3adant2 1128 | . . 3 ⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) → ((𝑆 + 1) ∈ 𝐴 → (𝑆 + 1) ≤ 𝑆)) |
27 | 12, 22, 26 | sylsyld 61 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ((𝑃↑(𝑆 + 1)) ∥ 𝑁 → (𝑆 + 1) ≤ 𝑆)) |
28 | 11, 27 | mtod 197 | 1 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ (𝑃↑(𝑆 + 1)) ∥ 𝑁) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2930 ∀wral 3051 ∃wrex 3060 {crab 3419 ⊆ wss 3940 ∅c0 4318 class class class wbr 5143 ‘cfv 6542 (class class class)co 7415 supcsup 9461 ℝcr 11135 0cc0 11136 1c1 11137 + caddc 11139 < clt 11276 ≤ cle 11277 2c2 12295 ℕ0cn0 12500 ℤcz 12586 ℤ≥cuz 12850 ↑cexp 14056 ∥ cdvds 16228 |
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-er 8721 df-en 8961 df-dom 8962 df-sdom 8963 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-seq 13997 df-exp 14057 df-cj 15076 df-re 15077 df-im 15078 df-sqrt 15212 df-abs 15213 df-dvds 16229 |
This theorem is referenced by: pcprendvds2 16807 pczndvds 16831 |
Copyright terms: Public domain | W3C validator |