Theorem gbowodd 48115

Description: A weak odd Goldbach number is odd. (Contributed by AV, 25-Jul-2020.)

Assertion

Ref	Expression
gbowodd	⊢ (𝑍 ∈ GoldbachOddW → 𝑍 ∈ Odd )

Proof of Theorem gbowodd

Dummy variables 𝑝 𝑞 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isgbow 48112	. 2 ⊢ (𝑍 ∈ GoldbachOddW ↔ (𝑍 ∈ Odd ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟)))
2	1	simplbi 496	1 ⊢ (𝑍 ∈ GoldbachOddW → 𝑍 ∈ Odd )

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  ∃wrex 3062  (class class class)co 7368   + caddc 11041  ℙcprime 16610   Odd codd 47985   GoldbachOddW cgbow 48106

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rex 3063  df-rab 3402  df-v 3444  df-gbow 48109

This theorem is referenced by:  gboodd  48117