Theorem odd2prm2 48642

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.)

Assertion

Ref	Expression
odd2prm2	⊢ ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2))

Proof of Theorem odd2prm2

Step	Hyp	Ref	Expression
1		eleq1 2850	. . . . . 6 ⊢ (𝑁 = (𝑃 + 𝑄) → (𝑁 ∈ Odd ↔ (𝑃 + 𝑄) ∈ Odd ))
2		evennodd 48567	. . . . . . . . 9 ⊢ ((𝑃 + 𝑄) ∈ Even → ¬ (𝑃 + 𝑄) ∈ Odd )
3	2	pm2.21d 122	. . . . . . . 8 ⊢ ((𝑃 + 𝑄) ∈ Even → ((𝑃 + 𝑄) ∈ Odd → (𝑃 = 2 ∨ 𝑄 = 2)))
4		df-ne 2958	. . . . . . . . . . . 12 ⊢ (𝑃 ≠ 2 ↔ ¬ 𝑃 = 2)
5		eldifsn 4751	. . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ (ℙ ∖ {2}) ↔ (𝑃 ∈ ℙ ∧ 𝑃 ≠ 2))
6		oddprmALTV 48611	. . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ (ℙ ∖ {2}) → 𝑃 ∈ Odd )
7	5, 6	sylbir 238	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 ≠ 2) → 𝑃 ∈ Odd )
8	7	ex 418	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ ℙ → (𝑃 ≠ 2 → 𝑃 ∈ Odd ))
9	4, 8	biimtrrid 246	. . . . . . . . . . 11 ⊢ (𝑃 ∈ ℙ → (¬ 𝑃 = 2 → 𝑃 ∈ Odd ))
10		df-ne 2958	. . . . . . . . . . . 12 ⊢ (𝑄 ≠ 2 ↔ ¬ 𝑄 = 2)
11		eldifsn 4751	. . . . . . . . . . . . . 14 ⊢ (𝑄 ∈ (ℙ ∖ {2}) ↔ (𝑄 ∈ ℙ ∧ 𝑄 ≠ 2))
12		oddprmALTV 48611	. . . . . . . . . . . . . 14 ⊢ (𝑄 ∈ (ℙ ∖ {2}) → 𝑄 ∈ Odd )
13	11, 12	sylbir 238	. . . . . . . . . . . . 13 ⊢ ((𝑄 ∈ ℙ ∧ 𝑄 ≠ 2) → 𝑄 ∈ Odd )
14	13	ex 418	. . . . . . . . . . . 12 ⊢ (𝑄 ∈ ℙ → (𝑄 ≠ 2 → 𝑄 ∈ Odd ))
15	10, 14	biimtrrid 246	. . . . . . . . . . 11 ⊢ (𝑄 ∈ ℙ → (¬ 𝑄 = 2 → 𝑄 ∈ Odd ))
16	9, 15	im2anan9 632	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → (𝑃 ∈ Odd ∧ 𝑄 ∈ Odd )))
17	16	imp 412	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ (¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2)) → (𝑃 ∈ Odd ∧ 𝑄 ∈ Odd ))
18		opoeALTV 48607	. . . . . . . . 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 421	. . . . . 6 ⊢ ((𝑃 + 𝑄) ∈ Odd → ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → (𝑃 = 2 ∨ 𝑄 = 2))))
22	1, 21	biimtrdi 256	. . . . 5 ⊢ (𝑁 = (𝑃 + 𝑄) → (𝑁 ∈ Odd → ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → (𝑃 = 2 ∨ 𝑄 = 2)))))
23	22	3imp231 1130	. . . 4 ⊢ ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → (𝑃 = 2 ∨ 𝑄 = 2)))
24	23	com12 33	. . 3 ⊢ ((¬ 𝑃 = 2 ∧ ¬ 𝑄 = 2) → ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2)))
25	24	ex 418	. 2 ⊢ (¬ 𝑃 = 2 → (¬ 𝑄 = 2 → ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2))))
26		orc 881	. . 3 ⊢ (𝑃 = 2 → (𝑃 = 2 ∨ 𝑄 = 2))
27	26	a1d 26	. 2 ⊢ (𝑃 = 2 → ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2)))
28		olc 882	. . 3 ⊢ (𝑄 = 2 → (𝑃 = 2 ∨ 𝑄 = 2))
29	28	a1d 26	. 2 ⊢ (𝑄 = 2 → ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2)))
30	25, 27, 29	pm2.61ii 185	1 ⊢ ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2957   ∖ cdif 3899  {csn 4587  (class class class)co 7417   + caddc 11131  2c2 12323  ℙcprime 16767   Even ceven 48548   Odd codd 48549

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-cnex 11184  ax-resscn 11185  ax-1cn 11186  ax-icn 11187  ax-addcl 11188  ax-addrcl 11189  ax-mulcl 11190  ax-mulrcl 11191  ax-mulcom 11192  ax-addass 11193  ax-mulass 11194  ax-distr 11195  ax-i2m1 11196  ax-1ne0 11197  ax-1rid 11198  ax-rnegex 11199  ax-rrecex 11200  ax-cnre 11201  ax-pre-lttri 11202  ax-pre-lttrn 11203  ax-pre-ltadd 11204  ax-pre-mulgt0 11205  ax-pre-sup 11206

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-er 8700  df-en 8957  df-dom 8958  df-sdom 8959  df-fin 8960  df-sup 9416  df-pnf 11273  df-mnf 11274  df-xr 11275  df-ltxr 11276  df-le 11277  df-sub 11471  df-neg 11472  df-div 11900  df-nn 12262  df-2 12331  df-3 12332  df-n0 12533  df-z 12620  df-uz 12892  df-rp 13047  df-seq 14070  df-exp 14130  df-cj 15190  df-re 15191  df-im 15192  df-sqrt 15326  df-abs 15327  df-dvds 16349  df-prm 16768  df-even 48550  df-odd 48551

This theorem is used by:  even3prm2  48643