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 2826 | . . . . . 6 ⊢ (𝑁 = (𝑃 + 𝑄) → (𝑁 ∈ Odd ↔ (𝑃 + 𝑄) ∈ Odd )) | |
2 | evennodd 44983 | . . . . . . . . 9 ⊢ ((𝑃 + 𝑄) ∈ Even → ¬ (𝑃 + 𝑄) ∈ Odd ) | |
3 | 2 | pm2.21d 121 | . . . . . . . 8 ⊢ ((𝑃 + 𝑄) ∈ Even → ((𝑃 + 𝑄) ∈ Odd → (𝑃 = 2 ∨ 𝑄 = 2))) |
4 | df-ne 2943 | . . . . . . . . . . . 12 ⊢ (𝑃 ≠ 2 ↔ ¬ 𝑃 = 2) | |
5 | eldifsn 4717 | . . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ (ℙ ∖ {2}) ↔ (𝑃 ∈ ℙ ∧ 𝑃 ≠ 2)) | |
6 | oddprmALTV 45027 | . . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ Odd ) | |
7 | 5, 6 | sylbir 234 | . . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 ≠ 2) → 𝑃 ∈ Odd ) |
8 | 7 | ex 412 | . . . . . . . . . . . 12 ⊢ (𝑃 ∈ ℙ → (𝑃 ≠ 2 → 𝑃 ∈ Odd )) |
9 | 4, 8 | syl5bir 242 | . . . . . . . . . . 11 ⊢ (𝑃 ∈ ℙ → (¬ 𝑃 = 2 → 𝑃 ∈ Odd )) |
10 | df-ne 2943 | . . . . . . . . . . . 12 ⊢ (𝑄 ≠ 2 ↔ ¬ 𝑄 = 2) | |
11 | eldifsn 4717 | . . . . . . . . . . . . . 14 ⊢ (𝑄 ∈ (ℙ ∖ {2}) ↔ (𝑄 ∈ ℙ ∧ 𝑄 ≠ 2)) | |
12 | oddprmALTV 45027 | . . . . . . . . . . . . . 14 ⊢ (𝑄 ∈ (ℙ ∖ {2}) → 𝑄 ∈ Odd ) | |
13 | 11, 12 | sylbir 234 | . . . . . . . . . . . . 13 ⊢ ((𝑄 ∈ ℙ ∧ 𝑄 ≠ 2) → 𝑄 ∈ Odd ) |
14 | 13 | ex 412 | . . . . . . . . . . . 12 ⊢ (𝑄 ∈ ℙ → (𝑄 ≠ 2 → 𝑄 ∈ Odd )) |
15 | 10, 14 | syl5bir 242 | . . . . . . . . . . 11 ⊢ (𝑄 ∈ ℙ → (¬ 𝑄 = 2 → 𝑄 ∈ Odd )) |
16 | 9, 15 | im2anan9 619 | . . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → (𝑃 ∈ Odd ∧ 𝑄 ∈ Odd ))) |
17 | 16 | imp 406 | . . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2)) → (𝑃 ∈ Odd ∧ 𝑄 ∈ Odd )) |
18 | opoeALTV 45023 | . . . . . . . . 9 ⊢ ((𝑃 ∈ Odd ∧ 𝑄 ∈ Odd ) → (𝑃 + 𝑄) ∈ Even ) | |
19 | 17, 18 | syl 17 | . . . . . . . 8 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2)) → (𝑃 + 𝑄) ∈ Even ) |
20 | 3, 19 | syl11 33 | . . . . . . 7 ⊢ ((𝑃 + 𝑄) ∈ Odd → (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2)) → (𝑃 = 2 ∨ 𝑄 = 2))) |
21 | 20 | expd 415 | . . . . . 6 ⊢ ((𝑃 + 𝑄) ∈ Odd → ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → (𝑃 = 2 ∨ 𝑄 = 2)))) |
22 | 1, 21 | syl6bi 252 | . . . . 5 ⊢ (𝑁 = (𝑃 + 𝑄) → (𝑁 ∈ Odd → ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → (𝑃 = 2 ∨ 𝑄 = 2))))) |
23 | 22 | 3imp231 1111 | . . . 4 ⊢ ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → (𝑃 = 2 ∨ 𝑄 = 2))) |
24 | 23 | com12 32 | . . 3 ⊢ ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2))) |
25 | 24 | ex 412 | . 2 ⊢ (¬ 𝑃 = 2 → (¬ 𝑄 = 2 → ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2)))) |
26 | orc 863 | . . 3 ⊢ (𝑃 = 2 → (𝑃 = 2 ∨ 𝑄 = 2)) | |
27 | 26 | a1d 25 | . 2 ⊢ (𝑃 = 2 → ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2))) |
28 | olc 864 | . . 3 ⊢ (𝑄 = 2 → (𝑃 = 2 ∨ 𝑄 = 2)) | |
29 | 28 | a1d 25 | . 2 ⊢ (𝑄 = 2 → ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2))) |
30 | 25, 27, 29 | pm2.61ii 183 | 1 ⊢ ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 843 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∖ cdif 3880 {csn 4558 (class class class)co 7255 + caddc 10805 2c2 11958 ℙcprime 16304 Even ceven 44964 Odd codd 44965 |
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-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-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 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 df-even 44966 df-odd 44967 |
This theorem is referenced by: even3prm2 45059 |
Copyright terms: Public domain | W3C validator |