| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > gbepos | Structured version Visualization version GIF version | ||
| Description: Any even Goldbach number is positive. (Contributed by AV, 20-Jul-2020.) |
| Ref | Expression |
|---|---|
| gbepos | ⊢ (𝑍 ∈ GoldbachEven → 𝑍 ∈ ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isgbe 48548 | . 2 ⊢ (𝑍 ∈ GoldbachEven ↔ (𝑍 ∈ Even ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)))) | |
| 2 | prmnn 16742 | . . . . . . . . 9 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℕ) | |
| 3 | prmnn 16742 | . . . . . . . . 9 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℕ) | |
| 4 | nnaddcl 12266 | . . . . . . . . 9 ⊢ ((𝑝 ∈ ℕ ∧ 𝑞 ∈ ℕ) → (𝑝 + 𝑞) ∈ ℕ) | |
| 5 | 2, 3, 4 | syl2an 608 | . . . . . . . 8 ⊢ ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) → (𝑝 + 𝑞) ∈ ℕ) |
| 6 | eleq1 2854 | . . . . . . . 8 ⊢ (𝑍 = (𝑝 + 𝑞) → (𝑍 ∈ ℕ ↔ (𝑝 + 𝑞) ∈ ℕ)) | |
| 7 | 5, 6 | imbitrrid 249 | . . . . . . 7 ⊢ (𝑍 = (𝑝 + 𝑞) → ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) → 𝑍 ∈ ℕ)) |
| 8 | 7 | 3ad2ant3 1153 | . . . . . 6 ⊢ ((𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)) → ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) → 𝑍 ∈ ℕ)) |
| 9 | 8 | com12 33 | . . . . 5 ⊢ ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) → ((𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)) → 𝑍 ∈ ℕ)) |
| 10 | 9 | a1i 11 | . . . 4 ⊢ (𝑍 ∈ Even → ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) → ((𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)) → 𝑍 ∈ ℕ))) |
| 11 | 10 | rexlimdvv 3224 | . . 3 ⊢ (𝑍 ∈ Even → (∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)) → 𝑍 ∈ ℕ)) |
| 12 | 11 | imp 412 | . 2 ⊢ ((𝑍 ∈ Even ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞))) → 𝑍 ∈ ℕ) |
| 13 | 1, 12 | sylbi 220 | 1 ⊢ (𝑍 ∈ GoldbachEven → 𝑍 ∈ ℕ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∃wrex 3092 (class class class)co 7416 + caddc 11113 ℕcn 12243 ℙcprime 16739 Even ceven 48421 Odd codd 48422 GoldbachEven cgbe 48542 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5260 ax-nul 5272 ax-pr 5407 ax-un 7738 ax-1cn 11168 ax-addcl 11170 ax-addass 11175 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4876 df-iun 4961 df-br 5113 df-opab 5177 df-mpt 5196 df-tr 5222 df-id 5559 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5670 df-rel 5671 df-cnv 5672 df-co 5673 df-dm 5674 df-rn 5675 df-res 5676 df-ima 5677 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7419 df-om 7865 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-nn 12244 df-prm 16740 df-gbe 48545 |
| This theorem is used by: gbege6 48562 |
| Copyright terms: Public domain | W3C validator |