| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prm2orodd | Structured version Visualization version GIF version | ||
| Description: A prime number is either 2 or odd. (Contributed by AV, 19-Jun-2021.) |
| Ref | Expression |
|---|---|
| prm2orodd | ⊢ (𝑃 ∈ ℙ → (𝑃 = 2 ∨ ¬ 2 ∥ 𝑃)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2nn 12259 | . . . . 5 ⊢ 2 ∈ ℕ | |
| 2 | dvdsprime 16657 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 2 ∈ ℕ) → (2 ∥ 𝑃 ↔ (2 = 𝑃 ∨ 2 = 1))) | |
| 3 | 1, 2 | mpan2 691 | . . . 4 ⊢ (𝑃 ∈ ℙ → (2 ∥ 𝑃 ↔ (2 = 𝑃 ∨ 2 = 1))) |
| 4 | eqcom 2736 | . . . . . 6 ⊢ (2 = 𝑃 ↔ 𝑃 = 2) | |
| 5 | 4 | biimpi 216 | . . . . 5 ⊢ (2 = 𝑃 → 𝑃 = 2) |
| 6 | 1ne2 12389 | . . . . . 6 ⊢ 1 ≠ 2 | |
| 7 | necom 2978 | . . . . . . 7 ⊢ (1 ≠ 2 ↔ 2 ≠ 1) | |
| 8 | eqneqall 2936 | . . . . . . . 8 ⊢ (2 = 1 → (2 ≠ 1 → 𝑃 = 2)) | |
| 9 | 8 | com12 32 | . . . . . . 7 ⊢ (2 ≠ 1 → (2 = 1 → 𝑃 = 2)) |
| 10 | 7, 9 | sylbi 217 | . . . . . 6 ⊢ (1 ≠ 2 → (2 = 1 → 𝑃 = 2)) |
| 11 | 6, 10 | ax-mp 5 | . . . . 5 ⊢ (2 = 1 → 𝑃 = 2) |
| 12 | 5, 11 | jaoi 857 | . . . 4 ⊢ ((2 = 𝑃 ∨ 2 = 1) → 𝑃 = 2) |
| 13 | 3, 12 | biimtrdi 253 | . . 3 ⊢ (𝑃 ∈ ℙ → (2 ∥ 𝑃 → 𝑃 = 2)) |
| 14 | 13 | con3d 152 | . 2 ⊢ (𝑃 ∈ ℙ → (¬ 𝑃 = 2 → ¬ 2 ∥ 𝑃)) |
| 15 | 14 | orrd 863 | 1 ⊢ (𝑃 ∈ ℙ → (𝑃 = 2 ∨ ¬ 2 ∥ 𝑃)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∨ wo 847 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 class class class wbr 5107 1c1 11069 ℕcn 12186 2c2 12241 ∥ cdvds 16222 ℙcprime 16641 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-2o 8435 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-sup 9393 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-3 12250 df-n0 12443 df-z 12530 df-uz 12794 df-rp 12952 df-seq 13967 df-exp 14027 df-cj 15065 df-re 15066 df-im 15067 df-sqrt 15201 df-abs 15202 df-dvds 16223 df-prm 16642 |
| This theorem is referenced by: 2lgs 27318 |
| Copyright terms: Public domain | W3C validator |