Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > gbowpos | Structured version Visualization version GIF version |
Description: Any weak odd Goldbach number is positive. (Contributed by AV, 20-Jul-2020.) |
Ref | Expression |
---|---|
gbowpos | ⊢ (𝑍 ∈ GoldbachOddW → 𝑍 ∈ ℕ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isgbow 43916 | . 2 ⊢ (𝑍 ∈ GoldbachOddW ↔ (𝑍 ∈ Odd ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟))) | |
2 | prmnn 16017 | . . . . . . . . . . 11 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℕ) | |
3 | prmnn 16017 | . . . . . . . . . . 11 ⊢ (𝑞 ∈ ℙ → 𝑞 ∈ ℕ) | |
4 | 2, 3 | anim12i 614 | . . . . . . . . . 10 ⊢ ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) → (𝑝 ∈ ℕ ∧ 𝑞 ∈ ℕ)) |
5 | 4 | adantr 483 | . . . . . . . . 9 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → (𝑝 ∈ ℕ ∧ 𝑞 ∈ ℕ)) |
6 | nnaddcl 11659 | . . . . . . . . 9 ⊢ ((𝑝 ∈ ℕ ∧ 𝑞 ∈ ℕ) → (𝑝 + 𝑞) ∈ ℕ) | |
7 | 5, 6 | syl 17 | . . . . . . . 8 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → (𝑝 + 𝑞) ∈ ℕ) |
8 | prmnn 16017 | . . . . . . . . 9 ⊢ (𝑟 ∈ ℙ → 𝑟 ∈ ℕ) | |
9 | 8 | adantl 484 | . . . . . . . 8 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → 𝑟 ∈ ℕ) |
10 | 7, 9 | nnaddcld 11688 | . . . . . . 7 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → ((𝑝 + 𝑞) + 𝑟) ∈ ℕ) |
11 | eleq1 2900 | . . . . . . 7 ⊢ (𝑍 = ((𝑝 + 𝑞) + 𝑟) → (𝑍 ∈ ℕ ↔ ((𝑝 + 𝑞) + 𝑟) ∈ ℕ)) | |
12 | 10, 11 | syl5ibrcom 249 | . . . . . 6 ⊢ (((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) ∧ 𝑟 ∈ ℙ) → (𝑍 = ((𝑝 + 𝑞) + 𝑟) → 𝑍 ∈ ℕ)) |
13 | 12 | rexlimdva 3284 | . . . . 5 ⊢ ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) → (∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟) → 𝑍 ∈ ℕ)) |
14 | 13 | a1i 11 | . . . 4 ⊢ (𝑍 ∈ Odd → ((𝑝 ∈ ℙ ∧ 𝑞 ∈ ℙ) → (∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟) → 𝑍 ∈ ℕ))) |
15 | 14 | rexlimdvv 3293 | . . 3 ⊢ (𝑍 ∈ Odd → (∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟) → 𝑍 ∈ ℕ)) |
16 | 15 | imp 409 | . 2 ⊢ ((𝑍 ∈ Odd ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟)) → 𝑍 ∈ ℕ) |
17 | 1, 16 | sylbi 219 | 1 ⊢ (𝑍 ∈ GoldbachOddW → 𝑍 ∈ ℕ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∃wrex 3139 (class class class)co 7155 + caddc 10539 ℕcn 11637 ℙcprime 16014 Odd codd 43789 GoldbachOddW cgbow 43910 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-1cn 10594 ax-addcl 10596 ax-addass 10601 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-ov 7158 df-om 7580 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-nn 11638 df-prm 16015 df-gbow 43913 |
This theorem is referenced by: gbopos 43924 gbowge7 43927 |
Copyright terms: Public domain | W3C validator |