| 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 48667 | . 2 ⊢ (𝑍 ∈ GoldbachEven ↔ (𝑍 ∈ Even ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)))) | |
| 2 | prmnn 16764 | . . . . . . . . 9 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℕ) | |
| 3 | prmnn 16764 | . . . . . . . . 9 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℕ) | |
| 4 | nnaddcl 12280 | . . . . . . . . 9 ⊢ ((𝑝 ∈ ℕ ∧ 𝑞 ∈ ℕ) → (𝑝 + 𝑞) ∈ ℕ) | |
| 5 | 2, 3, 4 | syl2an 608 | . . . . . . . 8 ⊢ ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) → (𝑝 + 𝑞) ∈ ℕ) |
| 6 | eleq1 2848 | . . . . . . . 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 3218 | . . 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 2145 ∃wrex 3086 (class class class)co 7413 + caddc 11127 ℕcn 12257 ℙcprime 16761 Even ceven 48540 Odd codd 48541 GoldbachEven cgbe 48661 |
| 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 5251 ax-nul 5263 ax-pr 5398 ax-un 7736 ax-1cn 11182 ax-addcl 11184 ax-addass 11189 |
| 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-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7416 df-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-nn 12258 df-prm 16762 df-gbe 48664 |
| This theorem is used by: gbege6 48681 |
| Copyright terms: Public domain | W3C validator |