| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fltoprmlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for fltoprm 28025: Every positive integer is either a power of 2 or has an odd prime factor. (Contributed by AV, 15-Sep-2026.) |
| Ref | Expression |
|---|---|
| fltoprmlem1 | ⊢ (𝑁 ∈ ℕ → (∃𝑝 ∈ ℙ (2 < 𝑝 ∧ 𝑝 ∥ 𝑁) ∨ ∃𝑛 ∈ ℕ0 𝑁 = (2↑𝑛))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oddprmdvds 17110 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ℕ0 𝑁 = (2↑𝑛)) → ∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝑁) | |
| 2 | rexdifsn 4757 | . . . . . . 7 ⊢ (∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝑁 ↔ ∃𝑝 ∈ ℙ (𝑝 ≠ 2 ∧ 𝑝 ∥ 𝑁)) | |
| 3 | simpr 490 | . . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℕ ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℙ) | |
| 4 | 3 | anim1i 627 | . . . . . . . . . . . 12 ⊢ (((𝑁 ∈ ℕ ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 2) → (𝑝 ∈ ℙ ∧ 𝑝 ≠ 2)) |
| 5 | eldifsn 4748 | . . . . . . . . . . . 12 ⊢ (𝑝 ∈ (ℙ ∖ {2}) ↔ (𝑝 ∈ ℙ ∧ 𝑝 ≠ 2)) | |
| 6 | 4, 5 | sylibr 237 | . . . . . . . . . . 11 ⊢ (((𝑁 ∈ ℕ ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 2) → 𝑝 ∈ (ℙ ∖ {2})) |
| 7 | oddprmgt2 16904 | . . . . . . . . . . 11 ⊢ (𝑝 ∈ (ℙ ∖ {2}) → 2 < 𝑝) | |
| 8 | 6, 7 | syl 18 | . . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 2) → 2 < 𝑝) |
| 9 | 8 | ex 418 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝑝 ∈ ℙ) → (𝑝 ≠ 2 → 2 < 𝑝)) |
| 10 | 9 | anim1d 623 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝑝 ∈ ℙ) → ((𝑝 ≠ 2 ∧ 𝑝 ∥ 𝑁) → (2 < 𝑝 ∧ 𝑝 ∥ 𝑁))) |
| 11 | 10 | reximdva 3179 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → (∃𝑝 ∈ ℙ (𝑝 ≠ 2 ∧ 𝑝 ∥ 𝑁) → ∃𝑝 ∈ ℙ (2 < 𝑝 ∧ 𝑝 ∥ 𝑁))) |
| 12 | 2, 11 | biimtrid 245 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝑁 → ∃𝑝 ∈ ℙ (2 < 𝑝 ∧ 𝑝 ∥ 𝑁))) |
| 13 | 12 | adantr 486 | . . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ℕ0 𝑁 = (2↑𝑛)) → (∃𝑝 ∈ (ℙ ∖ {2})𝑝 ∥ 𝑁 → ∃𝑝 ∈ ℙ (2 < 𝑝 ∧ 𝑝 ∥ 𝑁))) |
| 14 | 1, 13 | mpd 16 | . . . 4 ⊢ ((𝑁 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ℕ0 𝑁 = (2↑𝑛)) → ∃𝑝 ∈ ℙ (2 < 𝑝 ∧ 𝑝 ∥ 𝑁)) |
| 15 | 14 | orcd 887 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ℕ0 𝑁 = (2↑𝑛)) → (∃𝑝 ∈ ℙ (2 < 𝑝 ∧ 𝑝 ∥ 𝑁) ∨ ∃𝑛 ∈ ℕ0 𝑁 = (2↑𝑛))) |
| 16 | 15 | ex 418 | . 2 ⊢ (𝑁 ∈ ℕ → (¬ ∃𝑛 ∈ ℕ0 𝑁 = (2↑𝑛) → (∃𝑝 ∈ ℙ (2 < 𝑝 ∧ 𝑝 ∥ 𝑁) ∨ ∃𝑛 ∈ ℕ0 𝑁 = (2↑𝑛)))) |
| 17 | olc 882 | . 2 ⊢ (∃𝑛 ∈ ℕ0 𝑁 = (2↑𝑛) → (∃𝑝 ∈ ℙ (2 < 𝑝 ∧ 𝑝 ∥ 𝑁) ∨ ∃𝑛 ∈ ℕ0 𝑁 = (2↑𝑛))) | |
| 18 | 16, 17 | pm2.61d2 183 | 1 ⊢ (𝑁 ∈ ℕ → (∃𝑝 ∈ ℙ (2 < 𝑝 ∧ 𝑝 ∥ 𝑁) ∨ ∃𝑛 ∈ ℕ0 𝑁 = (2↑𝑛))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∃wrex 3090 ∖ cdif 4048 {csn 4588 class class class wbr 5106 (class class class)co 7443 < clt 11370 ℕcn 12362 2c2 12424 ℕ0cn0 12633 ↑cexp 14231 ∥ cdvds 16451 ℙcprime 16875 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 ax-pre-sup 11305 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-2o 8505 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-sup 9461 df-inf 9462 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-div 12001 df-nn 12363 df-2 12432 df-3 12433 df-n0 12634 df-z 12721 df-uz 12993 df-q 13103 df-rp 13148 df-fz 13667 df-fl 13959 df-mod 14037 df-seq 14172 df-exp 14232 df-cj 15295 df-re 15296 df-im 15297 df-sqrt 15431 df-abs 15432 df-dvds 16452 df-gcd 16694 df-prm 16876 df-pc 17044 |
| This theorem is used by: fltoprm 28025 |
| Copyright terms: Public domain | W3C validator |