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 1104 | . . 3 ⊢ (¬ (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)) ↔ (¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3 ∧ ¬ 𝑃 ∈ (ℤ≥‘5))) | |
3 | 3ianor 1105 | . . . . . . 7 ⊢ (¬ (5 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 5 ≤ 𝑃) ↔ (¬ 5 ∈ ℤ ∨ ¬ 𝑃 ∈ ℤ ∨ ¬ 5 ≤ 𝑃)) | |
4 | eluz2 12517 | . . . . . . 7 ⊢ (𝑃 ∈ (ℤ≥‘5) ↔ (5 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 5 ≤ 𝑃)) | |
5 | 3, 4 | xchnxbir 332 | . . . . . 6 ⊢ (¬ 𝑃 ∈ (ℤ≥‘5) ↔ (¬ 5 ∈ ℤ ∨ ¬ 𝑃 ∈ ℤ ∨ ¬ 5 ≤ 𝑃)) |
6 | 5nn 11989 | . . . . . . . . 9 ⊢ 5 ∈ ℕ | |
7 | 6 | nnzi 12274 | . . . . . . . 8 ⊢ 5 ∈ ℤ |
8 | 7 | pm2.24i 150 | . . . . . . 7 ⊢ (¬ 5 ∈ ℤ → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
9 | pm2.24 124 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℤ → (¬ 𝑃 ∈ ℤ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) | |
10 | prmz 16308 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
11 | 9, 10 | syl11 33 | . . . . . . . 8 ⊢ (¬ 𝑃 ∈ ℤ → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
12 | 11 | a1d 25 | . . . . . . 7 ⊢ (¬ 𝑃 ∈ ℤ → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
13 | 10 | zred 12355 | . . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℝ) |
14 | 5re 11990 | . . . . . . . . . . 11 ⊢ 5 ∈ ℝ | |
15 | 14 | a1i 11 | . . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 5 ∈ ℝ) |
16 | 13, 15 | ltnled 11052 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃 < 5 ↔ ¬ 5 ≤ 𝑃)) |
17 | prm23lt5 16443 | . . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 < 5) → (𝑃 = 2 ∨ 𝑃 = 3)) | |
18 | ioran 980 | . . . . . . . . . . . 12 ⊢ (¬ (𝑃 = 2 ∨ 𝑃 = 3) ↔ (¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3)) | |
19 | pm2.24 124 | . . . . . . . . . . . 12 ⊢ ((𝑃 = 2 ∨ 𝑃 = 3) → (¬ (𝑃 = 2 ∨ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) | |
20 | 18, 19 | syl5bir 242 | . . . . . . . . . . 11 ⊢ ((𝑃 = 2 ∨ 𝑃 = 3) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
21 | 17, 20 | syl 17 | . . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 < 5) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
22 | 21 | ex 412 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃 < 5 → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
23 | 16, 22 | sylbird 259 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (¬ 5 ≤ 𝑃 → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
24 | 23 | com3l 89 | . . . . . . 7 ⊢ (¬ 5 ≤ 𝑃 → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
25 | 8, 12, 24 | 3jaoi 1425 | . . . . . 6 ⊢ ((¬ 5 ∈ ℤ ∨ ¬ 𝑃 ∈ ℤ ∨ ¬ 5 ≤ 𝑃) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
26 | 5, 25 | sylbi 216 | . . . . 5 ⊢ (¬ 𝑃 ∈ (ℤ≥‘5) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
27 | 26 | com12 32 | . . . 4 ⊢ ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (¬ 𝑃 ∈ (ℤ≥‘5) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
28 | 27 | 3impia 1115 | . . 3 ⊢ ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3 ∧ ¬ 𝑃 ∈ (ℤ≥‘5)) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
29 | 2, 28 | sylbi 216 | . 2 ⊢ (¬ (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
30 | 1, 29 | pm2.61i 182 | 1 ⊢ (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 843 ∨ w3o 1084 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 class class class wbr 5070 ‘cfv 6418 ℝcr 10801 < clt 10940 ≤ cle 10941 2c2 11958 3c3 11959 5c5 11961 ℤcz 12249 ℤ≥cuz 12511 ℙcprime 16304 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-sup 9131 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-fz 13169 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-dvds 15892 df-prm 16305 |
This theorem is referenced by: gausslemma2dlem0f 26414 gausslemma2dlem4 26422 |
Copyright terms: Public domain | W3C validator |