Theorem isgbe 48574

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

Assertion

Ref	Expression
isgbe	⊢ (𝑍 ∈ GoldbachEven ↔ (𝑍 ∈ Even ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞))))

Distinct variable group:   𝑍,𝑝,𝑞

Proof of Theorem isgbe

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2769	. . . 4 ⊢ (𝑧 = 𝑍 → (𝑧 = (𝑝 + 𝑞) ↔ 𝑍 = (𝑝 + 𝑞)))
2	1	3anbi3d 1470	. . 3 ⊢ (𝑧 = 𝑍 → ((𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑧 = (𝑝 + 𝑞)) ↔ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞))))
3	2	2rexbidv 3232	. 2 ⊢ (𝑧 = 𝑍 → (∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑧 = (𝑝 + 𝑞)) ↔ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞))))
4		df-gbe 48571	. 2 ⊢ GoldbachEven = {𝑧 ∈ Even ∣ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑧 = (𝑝 + 𝑞))}
5	3, 4	elrab2 3656	1 ⊢ (𝑍 ∈ GoldbachEven ↔ (𝑍 ∈ Even ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞))))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∃wrex 3091  (class class class)co 7419   + caddc 11118  ℙcprime 16751   Even ceven 48447   Odd codd 48448   GoldbachEven cgbe 48568

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-3an 1105  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-gbe 48571

This theorem is used by:  gbeeven  48577  gbepos  48581  gbegt5  48584  6gbe  48594  8gbe  48596  sbgoldbwt  48600  sbgoldbst  48601  sbgoldbalt  48604  nnsum3primesgbe  48615  bgoldbtbndlem4  48631  bgoldbtbnd  48632