Theorem gboodd 48580

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 48579	. 2 ⊢ (𝑍 ∈ GoldbachOdd → 𝑍 ∈ GoldbachOddW )
2		gbowodd 48578	. 2 ⊢ (𝑍 ∈ GoldbachOddW → 𝑍 ∈ Odd )
3	1, 2	syl 18	1 ⊢ (𝑍 ∈ GoldbachOdd → 𝑍 ∈ Odd )

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2146   Odd codd 48448   GoldbachOddW cgbow 48569   GoldbachOdd cgbo 48570

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-rex 3092  df-rab 3419  df-v 3459  df-gbow 48572  df-gbo 48573

This theorem is used by: (None)