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 15544 | . . . 4 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑆 ∈ ℕ0 ∧ (𝑃↑𝑆) ∥ 𝑁)) |
4 | 3 | simpld 475 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → 𝑆 ∈ ℕ0) |
5 | nn0re 11301 | . . 3 ⊢ (𝑆 ∈ ℕ0 → 𝑆 ∈ ℝ) | |
6 | ltp1 10861 | . . . 4 ⊢ (𝑆 ∈ ℝ → 𝑆 < (𝑆 + 1)) | |
7 | peano2re 10209 | . . . . 5 ⊢ (𝑆 ∈ ℝ → (𝑆 + 1) ∈ ℝ) | |
8 | ltnle 10117 | . . . . 5 ⊢ ((𝑆 ∈ ℝ ∧ (𝑆 + 1) ∈ ℝ) → (𝑆 < (𝑆 + 1) ↔ ¬ (𝑆 + 1) ≤ 𝑆)) | |
9 | 7, 8 | mpdan 702 | . . . 4 ⊢ (𝑆 ∈ ℝ → (𝑆 < (𝑆 + 1) ↔ ¬ (𝑆 + 1) ≤ 𝑆)) |
10 | 6, 9 | mpbid 222 | . . 3 ⊢ (𝑆 ∈ ℝ → ¬ (𝑆 + 1) ≤ 𝑆) |
11 | 4, 5, 10 | 3syl 18 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ (𝑆 + 1) ≤ 𝑆) |
12 | 1 | pclem 15543 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)) |
13 | peano2nn0 11333 | . . . 4 ⊢ (𝑆 ∈ ℕ0 → (𝑆 + 1) ∈ ℕ0) | |
14 | oveq2 6658 | . . . . . . 7 ⊢ (𝑥 = (𝑆 + 1) → (𝑃↑𝑥) = (𝑃↑(𝑆 + 1))) | |
15 | 14 | breq1d 4663 | . . . . . 6 ⊢ (𝑥 = (𝑆 + 1) → ((𝑃↑𝑥) ∥ 𝑁 ↔ (𝑃↑(𝑆 + 1)) ∥ 𝑁)) |
16 | oveq2 6658 | . . . . . . . . 9 ⊢ (𝑛 = 𝑥 → (𝑃↑𝑛) = (𝑃↑𝑥)) | |
17 | 16 | breq1d 4663 | . . . . . . . 8 ⊢ (𝑛 = 𝑥 → ((𝑃↑𝑛) ∥ 𝑁 ↔ (𝑃↑𝑥) ∥ 𝑁)) |
18 | 17 | cbvrabv 3199 | . . . . . . 7 ⊢ {𝑛 ∈ ℕ0 ∣ (𝑃↑𝑛) ∥ 𝑁} = {𝑥 ∈ ℕ0 ∣ (𝑃↑𝑥) ∥ 𝑁} |
19 | 1, 18 | eqtri 2644 | . . . . . 6 ⊢ 𝐴 = {𝑥 ∈ ℕ0 ∣ (𝑃↑𝑥) ∥ 𝑁} |
20 | 15, 19 | elrab2 3366 | . . . . 5 ⊢ ((𝑆 + 1) ∈ 𝐴 ↔ ((𝑆 + 1) ∈ ℕ0 ∧ (𝑃↑(𝑆 + 1)) ∥ 𝑁)) |
21 | 20 | simplbi2 655 | . . . 4 ⊢ ((𝑆 + 1) ∈ ℕ0 → ((𝑃↑(𝑆 + 1)) ∥ 𝑁 → (𝑆 + 1) ∈ 𝐴)) |
22 | 4, 13, 21 | 3syl 18 | . . 3 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ((𝑃↑(𝑆 + 1)) ∥ 𝑁 → (𝑆 + 1) ∈ 𝐴)) |
23 | suprzub 11779 | . . . . . 6 ⊢ ((𝐴 ⊆ ℤ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ∧ (𝑆 + 1) ∈ 𝐴) → (𝑆 + 1) ≤ sup(𝐴, ℝ, < )) | |
24 | 23, 2 | syl6breqr 4695 | . . . . 5 ⊢ ((𝐴 ⊆ ℤ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ∧ (𝑆 + 1) ∈ 𝐴) → (𝑆 + 1) ≤ 𝑆) |
25 | 24 | 3expia 1267 | . . . 4 ⊢ ((𝐴 ⊆ ℤ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) → ((𝑆 + 1) ∈ 𝐴 → (𝑆 + 1) ≤ 𝑆)) |
26 | 25 | 3adant2 1080 | . . 3 ⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) → ((𝑆 + 1) ∈ 𝐴 → (𝑆 + 1) ≤ 𝑆)) |
27 | 12, 22, 26 | sylsyld 61 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ((𝑃↑(𝑆 + 1)) ∥ 𝑁 → (𝑆 + 1) ≤ 𝑆)) |
28 | 11, 27 | mtod 189 | 1 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → ¬ (𝑃↑(𝑆 + 1)) ∥ 𝑁) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 ∃wrex 2913 {crab 2916 ⊆ wss 3574 ∅c0 3915 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 supcsup 8346 ℝcr 9935 0cc0 9936 1c1 9937 + caddc 9939 < clt 10074 ≤ cle 10075 2c2 11070 ℕ0cn0 11292 ℤcz 11377 ℤ≥cuz 11687 ↑cexp 12860 ∥ cdvds 14983 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-sup 8348 df-inf 8349 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-z 11378 df-uz 11688 df-rp 11833 df-fl 12593 df-seq 12802 df-exp 12861 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-dvds 14984 |
This theorem is referenced by: pcprendvds2 15546 pczndvds 15569 |
Copyright terms: Public domain | W3C validator |