Theorem sbgoldbaltlem1 48799

Description: Lemma 1 for sbgoldbalt 48801: If an even number greater than 4 is the sum of two primes, one of the prime summands must be odd, i.e. not 2. (Contributed by AV, 22-Jul-2020.)

Assertion

Ref	Expression
sbgoldbaltlem1	⊢ ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → ((𝑁 ∈ Even ∧ 4 < 𝑁 ∧ 𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd ))

Proof of Theorem sbgoldbaltlem1

Step	Hyp	Ref	Expression
1		prmnn 16811	. . . . . 6 ⊢ (𝑄 ∈ ℙ → 𝑄 ∈ ℕ)
2		nneoALTV 48692	. . . . . . 7 ⊢ (𝑄 ∈ ℕ → (𝑄 ∈ Even ↔ ¬ 𝑄 ∈ Odd ))
3	2	bicomd 226	. . . . . 6 ⊢ (𝑄 ∈ ℕ → (¬ 𝑄 ∈ Odd ↔ 𝑄 ∈ Even ))
4	1, 3	syl 18	. . . . 5 ⊢ (𝑄 ∈ ℙ → (¬ 𝑄 ∈ Odd ↔ 𝑄 ∈ Even ))
5		evenprm2 48734	. . . . 5 ⊢ (𝑄 ∈ ℙ → (𝑄 ∈ Even ↔ 𝑄 = 2))
6	4, 5	bitrd 282	. . . 4 ⊢ (𝑄 ∈ ℙ → (¬ 𝑄 ∈ Odd ↔ 𝑄 = 2))
7	6	adantl 487	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → (¬ 𝑄 ∈ Odd ↔ 𝑄 = 2))
8		oveq2 7416	. . . . . . . . 9 ⊢ (𝑄 = 2 → (𝑃 + 𝑄) = (𝑃 + 2))
9	8	eqeq2d 2771	. . . . . . . 8 ⊢ (𝑄 = 2 → (𝑁 = (𝑃 + 𝑄) ↔ 𝑁 = (𝑃 + 2)))
10	9	adantl 487	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 = 2) → (𝑁 = (𝑃 + 𝑄) ↔ 𝑁 = (𝑃 + 2)))
11	10	3anbi3d 1470	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 = 2) → ((𝑁 ∈ Even ∧ 4 < 𝑁 ∧ 𝑁 = (𝑃 + 𝑄)) ↔ (𝑁 ∈ Even ∧ 4 < 𝑁 ∧ 𝑁 = (𝑃 + 2))))
12		breq2 5106	. . . . . . . . . . . . 13 ⊢ (𝑁 = (𝑃 + 2) → (4 < 𝑁 ↔ 4 < (𝑃 + 2)))
13		eleq1 2848	. . . . . . . . . . . . 13 ⊢ (𝑁 = (𝑃 + 2) → (𝑁 ∈ Even ↔ (𝑃 + 2) ∈ Even ))
14	12, 13	anbi12d 644	. . . . . . . . . . . 12 ⊢ (𝑁 = (𝑃 + 2) → ((4 < 𝑁 ∧ 𝑁 ∈ Even ) ↔ (4 < (𝑃 + 2) ∧ (𝑃 + 2) ∈ Even )))
15		prmz 16812	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
16		2evenALTV 48712	. . . . . . . . . . . . . . . 16 ⊢ 2 ∈ Even
17		evensumeven 48727	. . . . . . . . . . . . . . . 16 ⊢ ((𝑃 ∈ ℤ ∧ 2 ∈ Even ) → (𝑃 ∈ Even ↔ (𝑃 + 2) ∈ Even ))
18	15, 16, 17	sylancl 598	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ℙ → (𝑃 ∈ Even ↔ (𝑃 + 2) ∈ Even ))
19		evenprm2 48734	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ ℙ → (𝑃 ∈ Even ↔ 𝑃 = 2))
20		oveq1 7415	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑃 = 2 → (𝑃 + 2) = (2 + 2))
21		2p2e4 12446	. . . . . . . . . . . . . . . . . . 19 ⊢ (2 + 2) = 4
22	20, 21	eqtrdi 2811	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑃 = 2 → (𝑃 + 2) = 4)
23	22	breq2d 5114	. . . . . . . . . . . . . . . . 17 ⊢ (𝑃 = 2 → (4 < (𝑃 + 2) ↔ 4 < 4))
24		4re 12396	. . . . . . . . . . . . . . . . . . 19 ⊢ 4 ∈ ℝ
25	24	ltnri 11390	. . . . . . . . . . . . . . . . . 18 ⊢ ¬ 4 < 4
26	25	pm2.21i 120	. . . . . . . . . . . . . . . . 17 ⊢ (4 < 4 → 𝑄 ∈ Odd )
27	23, 26	biimtrdi 256	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 = 2 → (4 < (𝑃 + 2) → 𝑄 ∈ Odd ))
28	19, 27	biimtrdi 256	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ℙ → (𝑃 ∈ Even → (4 < (𝑃 + 2) → 𝑄 ∈ Odd )))
29	18, 28	sylbird 263	. . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ ℙ → ((𝑃 + 2) ∈ Even → (4 < (𝑃 + 2) → 𝑄 ∈ Odd )))
30	29	com13 89	. . . . . . . . . . . . 13 ⊢ (4 < (𝑃 + 2) → ((𝑃 + 2) ∈ Even → (𝑃 ∈ ℙ → 𝑄 ∈ Odd )))
31	30	imp 412	. . . . . . . . . . . 12 ⊢ ((4 < (𝑃 + 2) ∧ (𝑃 + 2) ∈ Even ) → (𝑃 ∈ ℙ → 𝑄 ∈ Odd ))
32	14, 31	biimtrdi 256	. . . . . . . . . . 11 ⊢ (𝑁 = (𝑃 + 2) → ((4 < 𝑁 ∧ 𝑁 ∈ Even ) → (𝑃 ∈ ℙ → 𝑄 ∈ Odd )))
33	32	expd 421	. . . . . . . . . 10 ⊢ (𝑁 = (𝑃 + 2) → (4 < 𝑁 → (𝑁 ∈ Even → (𝑃 ∈ ℙ → 𝑄 ∈ Odd ))))
34	33	com13 89	. . . . . . . . 9 ⊢ (𝑁 ∈ Even → (4 < 𝑁 → (𝑁 = (𝑃 + 2) → (𝑃 ∈ ℙ → 𝑄 ∈ Odd ))))
35	34	3imp 1128	. . . . . . . 8 ⊢ ((𝑁 ∈ Even ∧ 4 < 𝑁 ∧ 𝑁 = (𝑃 + 2)) → (𝑃 ∈ ℙ → 𝑄 ∈ Odd ))
36	35	com12 33	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → ((𝑁 ∈ Even ∧ 4 < 𝑁 ∧ 𝑁 = (𝑃 + 2)) → 𝑄 ∈ Odd ))
37	36	adantr 486	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 = 2) → ((𝑁 ∈ Even ∧ 4 < 𝑁 ∧ 𝑁 = (𝑃 + 2)) → 𝑄 ∈ Odd ))
38	11, 37	sylbid 243	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 = 2) → ((𝑁 ∈ Even ∧ 4 < 𝑁 ∧ 𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd ))
39	38	ex 418	. . . 4 ⊢ (𝑃 ∈ ℙ → (𝑄 = 2 → ((𝑁 ∈ Even ∧ 4 < 𝑁 ∧ 𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd )))
40	39	adantr 486	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → (𝑄 = 2 → ((𝑁 ∈ Even ∧ 4 < 𝑁 ∧ 𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd )))
41	7, 40	sylbid 243	. 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → (¬ 𝑄 ∈ Odd → ((𝑁 ∈ Even ∧ 4 < 𝑁 ∧ 𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd )))
42		ax-1 6	. 2 ⊢ (𝑄 ∈ Odd → ((𝑁 ∈ Even ∧ 4 < 𝑁 ∧ 𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd ))
43	41, 42	pm2.61d2 183	1 ⊢ ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → ((𝑁 ∈ Even ∧ 4 < 𝑁 ∧ 𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd ))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   class class class wbr 5102  (class class class)co 7408   + caddc 11174   < clt 11314  ℕcn 12304  2c2 12366  4c4 12368  ℤcz 12662  ℙcprime 16808   Even ceven 48644   Odd codd 48645

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 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734  ax-cnex 11227  ax-resscn 11228  ax-1cn 11229  ax-icn 11230  ax-addcl 11231  ax-addrcl 11232  ax-mulcl 11233  ax-mulrcl 11234  ax-mulcom 11235  ax-addass 11236  ax-mulass 11237  ax-distr 11238  ax-i2m1 11239  ax-1ne0 11240  ax-1rid 11241  ax-rnegex 11242  ax-rrecex 11243  ax-cnre 11244  ax-pre-lttri 11245  ax-pre-lttrn 11246  ax-pre-ltadd 11247  ax-pre-mulgt0 11248  ax-pre-sup 11249

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7861  df-2nd 7985  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8454  df-2o 8455  df-er 8695  df-en 8952  df-dom 8953  df-sdom 8954  df-fin 8955  df-sup 9412  df-pnf 11316  df-mnf 11317  df-xr 11318  df-ltxr 11319  df-le 11320  df-sub 11514  df-neg 11515  df-div 11943  df-nn 12305  df-2 12374  df-3 12375  df-4 12376  df-n0 12576  df-z 12663  df-uz 12935  df-rp 13090  df-seq 14113  df-exp 14173  df-cj 15233  df-re 15234  df-im 15235  df-sqrt 15369  df-abs 15370  df-dvds 16390  df-prm 16809  df-even 48646  df-odd 48647

This theorem is used by:  sbgoldbaltlem2  48800