| 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 27977: 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 17061 | . . . . 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 16855 | . . . . . . . . . . 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 3176 | . . . . . . 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 2145 ≠ wne 2956 ∃wrex 3087 ∖ cdif 3896 {csn 4584 class class class wbr 5103 (class class class)co 7412 < clt 11324 ℕcn 12316 2c2 12378 ℕ0cn0 12587 ↑cexp 14184 ∥ cdvds 16402 ℙcprime 16826 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259 |
| 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 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-2o 8461 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-sup 9418 df-inf 9419 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-2 12386 df-3 12387 df-n0 12588 df-z 12675 df-uz 12947 df-q 13057 df-rp 13102 df-fz 13621 df-fl 13912 df-mod 13990 df-seq 14125 df-exp 14185 df-cj 15246 df-re 15247 df-im 15248 df-sqrt 15382 df-abs 15383 df-dvds 16403 df-gcd 16645 df-prm 16827 df-pc 16995 |
| This theorem is used by: fltoprm 27977 |
| Copyright terms: Public domain | W3C validator |