| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prm23ge5 | Structured version Visualization version GIF version | ||
| Description: A prime is either 2 or 3 or greater than or equal to 5. (Contributed by AV, 5-Jul-2021.) |
| Ref | Expression |
|---|---|
| prm23ge5 | ⊢ (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-1 6 | . 2 ⊢ ((𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) | |
| 2 | 3ioran 1118 | . . 3 ⊢ (¬ (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)) ↔ (¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3 ∧ ¬ 𝑃 ∈ (ℤ≥‘5))) | |
| 3 | 3ianor 1119 | . . . . . . 7 ⊢ (¬ (5 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 5 ≤ 𝑃) ↔ (¬ 5 ∈ ℤ ∨ ¬ 𝑃 ∈ ℤ ∨ ¬ 5 ≤ 𝑃)) | |
| 4 | eluz2 12845 | . . . . . . 7 ⊢ (𝑃 ∈ (ℤ≥‘5) ↔ (5 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 5 ≤ 𝑃)) | |
| 5 | 3, 4 | xchnxbir 335 | . . . . . 6 ⊢ (¬ 𝑃 ∈ (ℤ≥‘5) ↔ (¬ 5 ∈ ℤ ∨ ¬ 𝑃 ∈ ℤ ∨ ¬ 5 ≤ 𝑃)) |
| 6 | 5nn 12304 | . . . . . . . . 9 ⊢ 5 ∈ ℕ | |
| 7 | 6 | nnzi 12595 | . . . . . . . 8 ⊢ 5 ∈ ℤ |
| 8 | 7 | pm2.24i 150 | . . . . . . 7 ⊢ (¬ 5 ∈ ℤ → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
| 9 | pm2.24 124 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℤ → (¬ 𝑃 ∈ ℤ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) | |
| 10 | prmz 16709 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
| 11 | 9, 10 | syl11 33 | . . . . . . . 8 ⊢ (¬ 𝑃 ∈ ℤ → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
| 12 | 11 | a1d 25 | . . . . . . 7 ⊢ (¬ 𝑃 ∈ ℤ → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
| 13 | 10 | zred 12677 | . . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℝ) |
| 14 | 5re 12305 | . . . . . . . . . . 11 ⊢ 5 ∈ ℝ | |
| 15 | 14 | a1i 11 | . . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 5 ∈ ℝ) |
| 16 | 13, 15 | ltnled 11330 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃 < 5 ↔ ¬ 5 ≤ 𝑃)) |
| 17 | prm23lt5 16850 | . . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 < 5) → (𝑃 = 2 ∨ 𝑃 = 3)) | |
| 18 | ioran 997 | . . . . . . . . . . . 12 ⊢ (¬ (𝑃 = 2 ∨ 𝑃 = 3) ↔ (¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3)) | |
| 19 | pm2.24 124 | . . . . . . . . . . . 12 ⊢ ((𝑃 = 2 ∨ 𝑃 = 3) → (¬ (𝑃 = 2 ∨ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) | |
| 20 | 18, 19 | biimtrrid 245 | . . . . . . . . . . 11 ⊢ ((𝑃 = 2 ∨ 𝑃 = 3) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
| 21 | 17, 20 | syl 17 | . . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 < 5) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
| 22 | 21 | ex 416 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃 < 5 → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
| 23 | 16, 22 | sylbird 262 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (¬ 5 ≤ 𝑃 → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
| 24 | 23 | com3l 89 | . . . . . . 7 ⊢ (¬ 5 ≤ 𝑃 → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
| 25 | 8, 12, 24 | 3jaoi 1447 | . . . . . 6 ⊢ ((¬ 5 ∈ ℤ ∨ ¬ 𝑃 ∈ ℤ ∨ ¬ 5 ≤ 𝑃) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
| 26 | 5, 25 | sylbi 219 | . . . . 5 ⊢ (¬ 𝑃 ∈ (ℤ≥‘5) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
| 27 | 26 | com12 32 | . . . 4 ⊢ ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (¬ 𝑃 ∈ (ℤ≥‘5) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
| 28 | 27 | 3impia 1130 | . . 3 ⊢ ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3 ∧ ¬ 𝑃 ∈ (ℤ≥‘5)) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
| 29 | 2, 28 | sylbi 219 | . 2 ⊢ (¬ (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
| 30 | 1, 29 | pm2.61i 183 | 1 ⊢ (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∨ wo 858 ∨ w3o 1097 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 class class class wbr 5100 ‘cfv 6521 ℝcr 11072 < clt 11216 ≤ cle 11217 2c2 12272 3c3 12273 5c5 12275 ℤcz 12568 ℤ≥cuz 12839 ℙcprime 16705 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 ax-pre-sup 11151 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-2o 8438 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-sup 9388 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-div 11845 df-nn 12211 df-2 12280 df-3 12281 df-4 12282 df-5 12283 df-n0 12482 df-z 12569 df-uz 12840 df-rp 12994 df-fz 13513 df-seq 14015 df-exp 14075 df-cj 15126 df-re 15127 df-im 15128 df-sqrt 15262 df-abs 15263 df-dvds 16287 df-prm 16706 |
| This theorem is referenced by: gausslemma2dlem0f 27422 gausslemma2dlem4 27430 |
| Copyright terms: Public domain | W3C validator |