| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > gbowodd | Structured version Visualization version GIF version | ||
| Description: A weak odd Goldbach number is odd. (Contributed by AV, 25-Jul-2020.) |
| Ref | Expression |
|---|---|
| gbowodd | ⊢ (𝑍 ∈ GoldbachOddW → 𝑍 ∈ Odd ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isgbow 47783 | . 2 ⊢ (𝑍 ∈ GoldbachOddW ↔ (𝑍 ∈ Odd ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟))) | |
| 2 | 1 | simplbi 497 | 1 ⊢ (𝑍 ∈ GoldbachOddW → 𝑍 ∈ Odd ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2111 ∃wrex 3056 (class class class)co 7341 + caddc 11004 ℙcprime 16577 Odd codd 47656 GoldbachOddW cgbow 47777 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-rex 3057 df-rab 3396 df-v 3438 df-gbow 47780 |
| This theorem is referenced by: gboodd 47788 |
| Copyright terms: Public domain | W3C validator |