Theorem isgbow 48819

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 2765	. . . 4 ⊢ (𝑧 = 𝑍 → (𝑧 = ((𝑝 + 𝑞) + 𝑟) ↔ 𝑍 = ((𝑝 + 𝑞) + 𝑟)))
2	1	rexbidv 3187	. . 3 ⊢ (𝑧 = 𝑍 → (∃𝑟 ∈ ℙ 𝑧 = ((𝑝 + 𝑞) + 𝑟) ↔ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟)))
3	2	2rexbidv 3228	. 2 ⊢ (𝑧 = 𝑍 → (∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑧 = ((𝑝 + 𝑞) + 𝑟) ↔ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟)))
4		df-gbow 48816	. 2 ⊢ GoldbachOddW = {𝑧 ∈ Odd ∣ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑧 = ((𝑝 + 𝑞) + 𝑟)}
5	3, 4	elrab2 3649	1 ⊢ (𝑍 ∈ GoldbachOddW ↔ (𝑍 ∈ Odd ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ ∃𝑟 ∈ ℙ 𝑍 = ((𝑝 + 𝑞) + 𝑟)))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  (class class class)co 7418   + caddc 11196  ℙcprime 16839   Odd codd 48692   GoldbachOddW cgbow 48813

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 2147  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rex 3088  df-rab 3414  df-v 3453  df-gbow 48816

This theorem is used by:  gbowodd  48822  gbogbow  48823  gbowpos  48826  gbowgt5  48829  gbowge7  48830  7gbow  48839  sbgoldbwt  48844  sbgoldbm  48851  nnsum4primesodd  48863