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 1056 | . . 3 ⊢ (¬ (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)) ↔ (¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3 ∧ ¬ 𝑃 ∈ (ℤ≥‘5))) | |
3 | 3ianor 1055 | . . . . . . 7 ⊢ (¬ (5 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 5 ≤ 𝑃) ↔ (¬ 5 ∈ ℤ ∨ ¬ 𝑃 ∈ ℤ ∨ ¬ 5 ≤ 𝑃)) | |
4 | eluz2 11693 | . . . . . . 7 ⊢ (𝑃 ∈ (ℤ≥‘5) ↔ (5 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 5 ≤ 𝑃)) | |
5 | 3, 4 | xchnxbir 323 | . . . . . 6 ⊢ (¬ 𝑃 ∈ (ℤ≥‘5) ↔ (¬ 5 ∈ ℤ ∨ ¬ 𝑃 ∈ ℤ ∨ ¬ 5 ≤ 𝑃)) |
6 | 5nn 11188 | . . . . . . . . 9 ⊢ 5 ∈ ℕ | |
7 | 6 | nnzi 11401 | . . . . . . . 8 ⊢ 5 ∈ ℤ |
8 | 7 | pm2.24i 146 | . . . . . . 7 ⊢ (¬ 5 ∈ ℤ → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
9 | pm2.24 121 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℤ → (¬ 𝑃 ∈ ℤ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) | |
10 | prmz 15389 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
11 | 9, 10 | syl11 33 | . . . . . . . 8 ⊢ (¬ 𝑃 ∈ ℤ → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
12 | 11 | a1d 25 | . . . . . . 7 ⊢ (¬ 𝑃 ∈ ℤ → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
13 | 10 | zred 11482 | . . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℝ) |
14 | 5re 11099 | . . . . . . . . . . 11 ⊢ 5 ∈ ℝ | |
15 | 14 | a1i 11 | . . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 5 ∈ ℝ) |
16 | 13, 15 | ltnled 10184 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃 < 5 ↔ ¬ 5 ≤ 𝑃)) |
17 | prm23lt5 15519 | . . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 < 5) → (𝑃 = 2 ∨ 𝑃 = 3)) | |
18 | ioran 511 | . . . . . . . . . . . 12 ⊢ (¬ (𝑃 = 2 ∨ 𝑃 = 3) ↔ (¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3)) | |
19 | pm2.24 121 | . . . . . . . . . . . 12 ⊢ ((𝑃 = 2 ∨ 𝑃 = 3) → (¬ (𝑃 = 2 ∨ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) | |
20 | 18, 19 | syl5bir 233 | . . . . . . . . . . 11 ⊢ ((𝑃 = 2 ∨ 𝑃 = 3) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
21 | 17, 20 | syl 17 | . . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 < 5) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
22 | 21 | ex 450 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃 < 5 → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
23 | 16, 22 | sylbird 250 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (¬ 5 ≤ 𝑃 → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
24 | 23 | com3l 89 | . . . . . . 7 ⊢ (¬ 5 ≤ 𝑃 → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
25 | 8, 12, 24 | 3jaoi 1391 | . . . . . 6 ⊢ ((¬ 5 ∈ ℤ ∨ ¬ 𝑃 ∈ ℤ ∨ ¬ 5 ≤ 𝑃) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
26 | 5, 25 | sylbi 207 | . . . . 5 ⊢ (¬ 𝑃 ∈ (ℤ≥‘5) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
27 | 26 | com12 32 | . . . 4 ⊢ ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (¬ 𝑃 ∈ (ℤ≥‘5) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
28 | 27 | 3impia 1261 | . . 3 ⊢ ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3 ∧ ¬ 𝑃 ∈ (ℤ≥‘5)) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
29 | 2, 28 | sylbi 207 | . 2 ⊢ (¬ (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
30 | 1, 29 | pm2.61i 176 | 1 ⊢ (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∨ wo 383 ∧ wa 384 ∨ w3o 1036 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 class class class wbr 4653 ‘cfv 5888 ℝcr 9935 < clt 10074 ≤ cle 10075 2c2 11070 3c3 11071 5c5 11073 ℤcz 11377 ℤ≥cuz 11687 ℙcprime 15385 |
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-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-2o 7561 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-sup 8348 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-4 11081 df-5 11082 df-n0 11293 df-z 11378 df-uz 11688 df-rp 11833 df-fz 12327 df-seq 12802 df-exp 12861 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-dvds 14984 df-prm 15386 |
This theorem is referenced by: gausslemma2dlem0f 25086 gausslemma2dlem4 25094 |
Copyright terms: Public domain | W3C validator |