Theorem gboodd 49128

Description: An odd Goldbach number is odd. (Contributed by AV, 26-Jul-2020.)

Assertion

Ref	Expression
gboodd	⊢ (𝑍 ∈ GoldbachOdd → 𝑍 ∈ Odd )

Proof of Theorem gboodd

Step	Hyp	Ref	Expression
1		gbogbow 49127	. 2 ⊢ (𝑍 ∈ GoldbachOdd → 𝑍 ∈ GoldbachOddW )
2		gbowodd 49126	. 2 ⊢ (𝑍 ∈ GoldbachOddW → 𝑍 ∈ Odd )
3	1, 2	syl 18	1 ⊢ (𝑍 ∈ GoldbachOdd → 𝑍 ∈ Odd )

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2147   Odd codd 48996   GoldbachOddW cgbow 49117   GoldbachOdd cgbo 49118

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rex 3091  df-rab 3417  df-v 3456  df-gbow 49120  df-gbo 49121

This theorem is used by: (None)