| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > isgbe | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| isgbe | ⊢ (𝑍 ∈ GoldbachEven ↔ (𝑍 ∈ Even ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2765 | . . . 4 ⊢ (𝑧 = 𝑍 → (𝑧 = (𝑝 + 𝑞) ↔ 𝑍 = (𝑝 + 𝑞))) | |
| 2 | 1 | 3anbi3d 1470 | . . 3 ⊢ (𝑧 = 𝑍 → ((𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑧 = (𝑝 + 𝑞)) ↔ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)))) |
| 3 | 2 | 2rexbidv 3228 | . 2 ⊢ (𝑧 = 𝑍 → (∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑧 = (𝑝 + 𝑞)) ↔ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)))) |
| 4 | df-gbe 48815 | . 2 ⊢ GoldbachEven = {𝑧 ∈ Even ∣ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑧 = (𝑝 + 𝑞))} | |
| 5 | 3, 4 | elrab2 3649 | 1 ⊢ (𝑍 ∈ GoldbachEven ↔ (𝑍 ∈ Even ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∃wrex 3087 (class class class)co 7418 + caddc 11196 ℙcprime 16839 Even ceven 48691 Odd codd 48692 GoldbachEven cgbe 48812 |
| 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-3an 1105 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-gbe 48815 |
| This theorem is used by: gbeeven 48821 gbepos 48825 gbegt5 48828 6gbe 48838 8gbe 48840 sbgoldbwt 48844 sbgoldbst 48845 sbgoldbalt 48848 nnsum3primesgbe 48859 bgoldbtbndlem4 48875 bgoldbtbnd 48876 |
| Copyright terms: Public domain | W3C validator |