| 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 48335 | . 2 ⊢ (𝑍 ∈ GoldbachOddW ↔ (𝑍 ∈ Odd ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟))) | |
| 2 | 1 | simplbi 500 | 1 ⊢ (𝑍 ∈ GoldbachOddW → 𝑍 ∈ Odd ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1559 ∈ wcel 2141 ∃wrex 3085 (class class class)co 7391 + caddc 11070 ℙcprime 16696 Odd codd 48208 GoldbachOddW cgbow 48329 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1562 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-rex 3086 df-rab 3414 df-v 3455 df-gbow 48332 |
| This theorem is referenced by: gboodd 48340 |
| Copyright terms: Public domain | W3C validator |