![]() |
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 1103 | . . 3 ⊢ (¬ (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)) ↔ (¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3 ∧ ¬ 𝑃 ∈ (ℤ≥‘5))) | |
3 | 3ianor 1104 | . . . . . . 7 ⊢ (¬ (5 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 5 ≤ 𝑃) ↔ (¬ 5 ∈ ℤ ∨ ¬ 𝑃 ∈ ℤ ∨ ¬ 5 ≤ 𝑃)) | |
4 | eluz2 12866 | . . . . . . 7 ⊢ (𝑃 ∈ (ℤ≥‘5) ↔ (5 ∈ ℤ ∧ 𝑃 ∈ ℤ ∧ 5 ≤ 𝑃)) | |
5 | 3, 4 | xchnxbir 332 | . . . . . 6 ⊢ (¬ 𝑃 ∈ (ℤ≥‘5) ↔ (¬ 5 ∈ ℤ ∨ ¬ 𝑃 ∈ ℤ ∨ ¬ 5 ≤ 𝑃)) |
6 | 5nn 12336 | . . . . . . . . 9 ⊢ 5 ∈ ℕ | |
7 | 6 | nnzi 12624 | . . . . . . . 8 ⊢ 5 ∈ ℤ |
8 | 7 | pm2.24i 150 | . . . . . . 7 ⊢ (¬ 5 ∈ ℤ → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
9 | pm2.24 124 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℤ → (¬ 𝑃 ∈ ℤ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) | |
10 | prmz 16653 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
11 | 9, 10 | syl11 33 | . . . . . . . 8 ⊢ (¬ 𝑃 ∈ ℤ → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
12 | 11 | a1d 25 | . . . . . . 7 ⊢ (¬ 𝑃 ∈ ℤ → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 ∈ ℙ → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5))))) |
13 | 10 | zred 12704 | . . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℝ) |
14 | 5re 12337 | . . . . . . . . . . 11 ⊢ 5 ∈ ℝ | |
15 | 14 | a1i 11 | . . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → 5 ∈ ℝ) |
16 | 13, 15 | ltnled 11399 | . . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃 < 5 ↔ ¬ 5 ≤ 𝑃)) |
17 | prm23lt5 16790 | . . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 < 5) → (𝑃 = 2 ∨ 𝑃 = 3)) | |
18 | ioran 981 | . . . . . . . . . . . 12 ⊢ (¬ (𝑃 = 2 ∨ 𝑃 = 3) ↔ (¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3)) | |
19 | pm2.24 124 | . . . . . . . . . . . 12 ⊢ ((𝑃 = 2 ∨ 𝑃 = 3) → (¬ (𝑃 = 2 ∨ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) | |
20 | 18, 19 | biimtrrid 242 | . . . . . . . . . . 11 ⊢ ((𝑃 = 2 ∨ 𝑃 = 3) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
21 | 17, 20 | syl 17 | . . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 < 5) → ((¬ 𝑃 = 2 ∧ ¬ 𝑃 = 3) → (𝑃 = 2 ∨ 𝑃 = 3 ∨ 𝑃 ∈ (ℤ≥‘5)))) |
22 | 21 | ex 411 | . . . . . . . . 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 1424 | . . . . . 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 1114 | . . 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 394 ∨ wo 845 ∨ w3o 1083 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 class class class wbr 5152 ‘cfv 6553 ℝcr 11145 < clt 11286 ≤ cle 11287 2c2 12305 3c3 12306 5c5 12308 ℤcz 12596 ℤ≥cuz 12860 ℙcprime 16649 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-cnex 11202 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 ax-pre-mulgt0 11223 ax-pre-sup 11224 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-tp 4637 df-op 4639 df-uni 4913 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7877 df-1st 7999 df-2nd 8000 df-frecs 8293 df-wrecs 8324 df-recs 8398 df-rdg 8437 df-1o 8493 df-2o 8494 df-er 8731 df-en 8971 df-dom 8972 df-sdom 8973 df-fin 8974 df-sup 9473 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 df-sub 11484 df-neg 11485 df-div 11910 df-nn 12251 df-2 12313 df-3 12314 df-4 12315 df-5 12316 df-n0 12511 df-z 12597 df-uz 12861 df-rp 13015 df-fz 13525 df-seq 14007 df-exp 14067 df-cj 15086 df-re 15087 df-im 15088 df-sqrt 15222 df-abs 15223 df-dvds 16239 df-prm 16650 |
This theorem is referenced by: gausslemma2dlem0f 27314 gausslemma2dlem4 27322 |
Copyright terms: Public domain | W3C validator |