| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > odd2prm2 | Structured version Visualization version GIF version | ||
| Description: If an odd number is the sum of two prime numbers, one of the prime numbers must be 2. (Contributed by AV, 26-Dec-2021.) |
| Ref | Expression |
|---|---|
| odd2prm2 | ⊢ ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 2853 | . . . . . 6 ⊢ (𝑁 = (𝑃 + 𝑄) → (𝑁 ∈ Odd ↔ (𝑃 + 𝑄) ∈ Odd )) | |
| 2 | evennodd 48263 | . . . . . . . . 9 ⊢ ((𝑃 + 𝑄) ∈ Even → ¬ (𝑃 + 𝑄) ∈ Odd ) | |
| 3 | 2 | pm2.21d 122 | . . . . . . . 8 ⊢ ((𝑃 + 𝑄) ∈ Even → ((𝑃 + 𝑄) ∈ Odd → (𝑃 = 2 ∨ 𝑄 = 2))) |
| 4 | df-ne 2961 | . . . . . . . . . . . 12 ⊢ (𝑃 ≠ 2 ↔ ¬ 𝑃 = 2) | |
| 5 | eldifsn 4749 | . . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ (ℙ ∖ {2}) ↔ (𝑃 ∈ ℙ ∧ 𝑃 ≠ 2)) | |
| 6 | oddprmALTV 48307 | . . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ Odd ) | |
| 7 | 5, 6 | sylbir 238 | . . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 ≠ 2) → 𝑃 ∈ Odd ) |
| 8 | 7 | ex 417 | . . . . . . . . . . . 12 ⊢ (𝑃 ∈ ℙ → (𝑃 ≠ 2 → 𝑃 ∈ Odd )) |
| 9 | 4, 8 | biimtrrid 246 | . . . . . . . . . . 11 ⊢ (𝑃 ∈ ℙ → (¬ 𝑃 = 2 → 𝑃 ∈ Odd )) |
| 10 | df-ne 2961 | . . . . . . . . . . . 12 ⊢ (𝑄 ≠ 2 ↔ ¬ 𝑄 = 2) | |
| 11 | eldifsn 4749 | . . . . . . . . . . . . . 14 ⊢ (𝑄 ∈ (ℙ ∖ {2}) ↔ (𝑄 ∈ ℙ ∧ 𝑄 ≠ 2)) | |
| 12 | oddprmALTV 48307 | . . . . . . . . . . . . . 14 ⊢ (𝑄 ∈ (ℙ ∖ {2}) → 𝑄 ∈ Odd ) | |
| 13 | 11, 12 | sylbir 238 | . . . . . . . . . . . . 13 ⊢ ((𝑄 ∈ ℙ ∧ 𝑄 ≠ 2) → 𝑄 ∈ Odd ) |
| 14 | 13 | ex 417 | . . . . . . . . . . . 12 ⊢ (𝑄 ∈ ℙ → (𝑄 ≠ 2 → 𝑄 ∈ Odd )) |
| 15 | 10, 14 | biimtrrid 246 | . . . . . . . . . . 11 ⊢ (𝑄 ∈ ℙ → (¬ 𝑄 = 2 → 𝑄 ∈ Odd )) |
| 16 | 9, 15 | im2anan9 631 | . . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → (𝑃 ∈ Odd ∧ 𝑄 ∈ Odd ))) |
| 17 | 16 | imp 411 | . . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2)) → (𝑃 ∈ Odd ∧ 𝑄 ∈ Odd )) |
| 18 | opoeALTV 48303 | . . . . . . . . 9 ⊢ ((𝑃 ∈ Odd ∧ 𝑄 ∈ Odd ) → (𝑃 + 𝑄) ∈ Even ) | |
| 19 | 17, 18 | syl 18 | . . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2)) → (𝑃 + 𝑄) ∈ Even ) |
| 20 | 3, 19 | syl11 34 | . . . . . . 7 ⊢ ((𝑃 + 𝑄) ∈ Odd → (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2)) → (𝑃 = 2 ∨ 𝑄 = 2))) |
| 21 | 20 | expd 420 | . . . . . 6 ⊢ ((𝑃 + 𝑄) ∈ Odd → ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → (𝑃 = 2 ∨ 𝑄 = 2)))) |
| 22 | 1, 21 | biimtrdi 256 | . . . . 5 ⊢ (𝑁 = (𝑃 + 𝑄) → (𝑁 ∈ Odd → ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → (𝑃 = 2 ∨ 𝑄 = 2))))) |
| 23 | 22 | 3imp231 1128 | . . . 4 ⊢ ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → (𝑃 = 2 ∨ 𝑄 = 2))) |
| 24 | 23 | com12 33 | . . 3 ⊢ ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2))) |
| 25 | 24 | ex 417 | . 2 ⊢ (¬ 𝑃 = 2 → (¬ 𝑄 = 2 → ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2)))) |
| 26 | orc 880 | . . 3 ⊢ (𝑃 = 2 → (𝑃 = 2 ∨ 𝑄 = 2)) | |
| 27 | 26 | a1d 26 | . 2 ⊢ (𝑃 = 2 → ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2))) |
| 28 | olc 881 | . . 3 ⊢ (𝑄 = 2 → (𝑃 = 2 ∨ 𝑄 = 2)) | |
| 29 | 28 | a1d 26 | . 2 ⊢ (𝑄 = 2 → ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2))) |
| 30 | 25, 27, 29 | pm2.61ii 185 | 1 ⊢ ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∨ wo 860 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 ∖ cdif 3904 {csn 4585 (class class class)co 7400 + caddc 11091 2c2 12286 ℙcprime 16719 Even ceven 48244 Odd codd 48245 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-2o 8442 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-sup 9390 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12225 df-2 12294 df-3 12295 df-n0 12496 df-z 12583 df-uz 12854 df-rp 13008 df-seq 14029 df-exp 14089 df-cj 15140 df-re 15141 df-im 15142 df-sqrt 15276 df-abs 15277 df-dvds 16301 df-prm 16720 df-even 48246 df-odd 48247 |
| This theorem is referenced by: even3prm2 48339 |
| Copyright terms: Public domain | W3C validator |