Theorem isgbow 45092

Description: The predicate "is a weak odd Goldbach number". A weak odd Goldbach number is an odd integer having a Goldbach partition, i.e. which can be written as a sum of three primes. (Contributed by AV, 20-Jul-2020.)

Assertion

Ref	Expression
isgbow	⊢ (𝑍 ∈ GoldbachOddW ↔ (𝑍 ∈ Odd ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟)))

Distinct variable group:   𝑍,𝑝,𝑞,𝑟

Proof of Theorem isgbow

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2742	. . . 4 ⊢ (𝑧 = 𝑍 → (𝑧 = ((𝑝 + 𝑞) + 𝑟) ↔ 𝑍 = ((𝑝 + 𝑞) + 𝑟)))
2	1	rexbidv 3225	. . 3 ⊢ (𝑧 = 𝑍 → (∃𝑟 ∈ ℙ 𝑧 = ((𝑝 + 𝑞) + 𝑟) ↔ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟)))
3	2	2rexbidv 3228	. 2 ⊢ (𝑧 = 𝑍 → (∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑧 = ((𝑝 + 𝑞) + 𝑟) ↔ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟)))
4		df-gbow 45089	. 2 ⊢ GoldbachOddW = {𝑧 ∈ Odd ∣ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑧 = ((𝑝 + 𝑞) + 𝑟)}
5	3, 4	elrab2 3620	1 ⊢ (𝑍 ∈ GoldbachOddW ↔ (𝑍 ∈ Odd ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟)))

Syntax hints:   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ∃wrex 3064  (class class class)co 7255   + caddc 10805  ℙcprime 16304   Odd codd 44965   GoldbachOddW cgbow 45086

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1542  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-rex 3069  df-rab 3072  df-v 3424  df-gbow 45089

This theorem is referenced by:  gbowodd  45095  gbogbow  45096  gbowpos  45099  gbowgt5  45102  gbowge7  45103  7gbow  45112  sbgoldbwt  45117  sbgoldbm  45124  nnsum4primesodd  45136