| 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 49122 | . 2 ⊢ (𝑍 ∈ GoldbachEven ↔ (𝑍 ∈ Even ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)))) | |
| 2 | prmnn 16893 | . . . . . . . . 9 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℕ) | |
| 3 | prmnn 16893 | . . . . . . . . 9 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℕ) | |
| 4 | nnaddcl 12398 | . . . . . . . . 9 ⊢ ((𝑝 ∈ ℕ ∧ 𝑞 ∈ ℕ) → (𝑝 + 𝑞) ∈ ℕ) | |
| 5 | 2, 3, 4 | syl2an 608 | . . . . . . . 8 ⊢ ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) → (𝑝 + 𝑞) ∈ ℕ) |
| 6 | eleq1 2852 | . . . . . . . 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 3222 | . . 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 2147 ∃wrex 3090 (class class class)co 7451 + caddc 11242 ℕcn 12375 ℙcprime 16890 Even ceven 48995 Odd codd 48996 GoldbachEven cgbe 49116 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 ax-un 7783 ax-1cn 11297 ax-addcl 11299 ax-addass 11304 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-nn 12376 df-prm 16891 df-gbe 49119 |
| This theorem is used by: gbege6 49136 |
| Copyright terms: Public domain | W3C validator |