Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sbgoldbaltlem1 Structured version   Visualization version   GIF version

Theorem sbgoldbaltlem1 48682
Description: Lemma 1 for sbgoldbalt 48684: 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
StepHypRef Expression
1 prmnn 16768 . . . . . 6 (𝑄 ∈ ℙ → 𝑄 ∈ ℕ)
2 nneoALTV 48575 . . . . . . 7 (𝑄 ∈ ℕ → (𝑄 ∈ Even ↔ ¬ 𝑄 ∈ Odd ))
32bicomd 226 . . . . . 6 (𝑄 ∈ ℕ → (¬ 𝑄 ∈ Odd ↔ 𝑄 ∈ Even ))
41, 3syl 18 . . . . 5 (𝑄 ∈ ℙ → (¬ 𝑄 ∈ Odd ↔ 𝑄 ∈ Even ))
5 evenprm2 48617 . . . . 5 (𝑄 ∈ ℙ → (𝑄 ∈ Even ↔ 𝑄 = 2))
64, 5bitrd 282 . . . 4 (𝑄 ∈ ℙ → (¬ 𝑄 ∈ Odd ↔ 𝑄 = 2))
76adantl 487 . . 3 ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → (¬ 𝑄 ∈ Odd ↔ 𝑄 = 2))
8 oveq2 7424 . . . . . . . . 9 (𝑄 = 2 → (𝑃 + 𝑄) = (𝑃 + 2))
98eqeq2d 2773 . . . . . . . 8 (𝑄 = 2 → (𝑁 = (𝑃 + 𝑄) ↔ 𝑁 = (𝑃 + 2)))
109adantl 487 . . . . . . 7 ((𝑃 ∈ ℙ ∧ 𝑄 = 2) → (𝑁 = (𝑃 + 𝑄) ↔ 𝑁 = (𝑃 + 2)))
11103anbi3d 1470 . . . . . 6 ((𝑃 ∈ ℙ ∧ 𝑄 = 2) → ((𝑁 ∈ Even ∧ 4 < 𝑁𝑁 = (𝑃 + 𝑄)) ↔ (𝑁 ∈ Even ∧ 4 < 𝑁𝑁 = (𝑃 + 2))))
12 breq2 5111 . . . . . . . . . . . . 13 (𝑁 = (𝑃 + 2) → (4 < 𝑁 ↔ 4 < (𝑃 + 2)))
13 eleq1 2850 . . . . . . . . . . . . 13 (𝑁 = (𝑃 + 2) → (𝑁 ∈ Even ↔ (𝑃 + 2) ∈ Even ))
1412, 13anbi12d 644 . . . . . . . . . . . 12 (𝑁 = (𝑃 + 2) → ((4 < 𝑁𝑁 ∈ Even ) ↔ (4 < (𝑃 + 2) ∧ (𝑃 + 2) ∈ Even )))
15 prmz 16769 . . . . . . . . . . . . . . . 16 (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
16 2evenALTV 48595 . . . . . . . . . . . . . . . 16 2 ∈ Even
17 evensumeven 48610 . . . . . . . . . . . . . . . 16 ((𝑃 ∈ ℤ ∧ 2 ∈ Even ) → (𝑃 ∈ Even ↔ (𝑃 + 2) ∈ Even ))
1815, 16, 17sylancl 598 . . . . . . . . . . . . . . 15 (𝑃 ∈ ℙ → (𝑃 ∈ Even ↔ (𝑃 + 2) ∈ Even ))
19 evenprm2 48617 . . . . . . . . . . . . . . . 16 (𝑃 ∈ ℙ → (𝑃 ∈ Even ↔ 𝑃 = 2))
20 oveq1 7423 . . . . . . . . . . . . . . . . . . 19 (𝑃 = 2 → (𝑃 + 2) = (2 + 2))
21 2p2e4 12402 . . . . . . . . . . . . . . . . . . 19 (2 + 2) = 4
2220, 21eqtrdi 2813 . . . . . . . . . . . . . . . . . 18 (𝑃 = 2 → (𝑃 + 2) = 4)
2322breq2d 5119 . . . . . . . . . . . . . . . . 17 (𝑃 = 2 → (4 < (𝑃 + 2) ↔ 4 < 4))
24 4re 12352 . . . . . . . . . . . . . . . . . . 19 4 ∈ ℝ
2524ltnri 11346 . . . . . . . . . . . . . . . . . 18 ¬ 4 < 4
2625pm2.21i 120 . . . . . . . . . . . . . . . . 17 (4 < 4 → 𝑄 ∈ Odd )
2723, 26biimtrdi 256 . . . . . . . . . . . . . . . 16 (𝑃 = 2 → (4 < (𝑃 + 2) → 𝑄 ∈ Odd ))
2819, 27biimtrdi 256 . . . . . . . . . . . . . . 15 (𝑃 ∈ ℙ → (𝑃 ∈ Even → (4 < (𝑃 + 2) → 𝑄 ∈ Odd )))
2918, 28sylbird 263 . . . . . . . . . . . . . 14 (𝑃 ∈ ℙ → ((𝑃 + 2) ∈ Even → (4 < (𝑃 + 2) → 𝑄 ∈ Odd )))
3029com13 89 . . . . . . . . . . . . 13 (4 < (𝑃 + 2) → ((𝑃 + 2) ∈ Even → (𝑃 ∈ ℙ → 𝑄 ∈ Odd )))
3130imp 412 . . . . . . . . . . . 12 ((4 < (𝑃 + 2) ∧ (𝑃 + 2) ∈ Even ) → (𝑃 ∈ ℙ → 𝑄 ∈ Odd ))
3214, 31biimtrdi 256 . . . . . . . . . . 11 (𝑁 = (𝑃 + 2) → ((4 < 𝑁𝑁 ∈ Even ) → (𝑃 ∈ ℙ → 𝑄 ∈ Odd )))
3332expd 421 . . . . . . . . . 10 (𝑁 = (𝑃 + 2) → (4 < 𝑁 → (𝑁 ∈ Even → (𝑃 ∈ ℙ → 𝑄 ∈ Odd ))))
3433com13 89 . . . . . . . . 9 (𝑁 ∈ Even → (4 < 𝑁 → (𝑁 = (𝑃 + 2) → (𝑃 ∈ ℙ → 𝑄 ∈ Odd ))))
35343imp 1128 . . . . . . . 8 ((𝑁 ∈ Even ∧ 4 < 𝑁𝑁 = (𝑃 + 2)) → (𝑃 ∈ ℙ → 𝑄 ∈ Odd ))
3635com12 33 . . . . . . 7 (𝑃 ∈ ℙ → ((𝑁 ∈ Even ∧ 4 < 𝑁𝑁 = (𝑃 + 2)) → 𝑄 ∈ Odd ))
3736adantr 486 . . . . . 6 ((𝑃 ∈ ℙ ∧ 𝑄 = 2) → ((𝑁 ∈ Even ∧ 4 < 𝑁𝑁 = (𝑃 + 2)) → 𝑄 ∈ Odd ))
3811, 37sylbid 243 . . . . 5 ((𝑃 ∈ ℙ ∧ 𝑄 = 2) → ((𝑁 ∈ Even ∧ 4 < 𝑁𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd ))
3938ex 418 . . . 4 (𝑃 ∈ ℙ → (𝑄 = 2 → ((𝑁 ∈ Even ∧ 4 < 𝑁𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd )))
4039adantr 486 . . 3 ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → (𝑄 = 2 → ((𝑁 ∈ Even ∧ 4 < 𝑁𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd )))
417, 40sylbid 243 . 2 ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → (¬ 𝑄 ∈ Odd → ((𝑁 ∈ Even ∧ 4 < 𝑁𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd )))
42 ax-1 6 . 2 (𝑄 ∈ Odd → ((𝑁 ∈ Even ∧ 4 < 𝑁𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd ))
4341, 42pm2.61d2 183 1 ((𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) → ((𝑁 ∈ Even ∧ 4 < 𝑁𝑁 = (𝑃 + 𝑄)) → 𝑄 ∈ Odd ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2145   class class class wbr 5107  (class class class)co 7416   + caddc 11130   < clt 11270  cn 12260  2c2 12322  4c4 12324  cz 12618  cprime 16765   Even ceven 48527   Odd codd 48528
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 7739  ax-cnex 11183  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204  ax-pre-sup 11205
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 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-2o 8459  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-sup 9415  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-div 11899  df-nn 12261  df-2 12330  df-3 12331  df-4 12332  df-n0 12532  df-z 12619  df-uz 12891  df-rp 13045  df-seq 14068  df-exp 14128  df-cj 15188  df-re 15189  df-im 15190  df-sqrt 15324  df-abs 15325  df-dvds 16347  df-prm 16766  df-even 48529  df-odd 48530
This theorem is used by:  sbgoldbaltlem2  48683
  Copyright terms: Public domain W3C validator