![]() |
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 2801 | . . . 4 ⊢ (𝑧 = 𝑍 → (𝑧 = (𝑝 + 𝑞) ↔ 𝑍 = (𝑝 + 𝑞))) | |
2 | 1 | 3anbi3d 1567 | . . 3 ⊢ (𝑧 = 𝑍 → ((𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑧 = (𝑝 + 𝑞)) ↔ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)))) |
3 | 2 | 2rexbidv 3236 | . 2 ⊢ (𝑧 = 𝑍 → (∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑧 = (𝑝 + 𝑞)) ↔ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)))) |
4 | df-gbe 42406 | . 2 ⊢ GoldbachEven = {𝑧 ∈ Even ∣ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑧 = (𝑝 + 𝑞))} | |
5 | 3, 4 | elrab2 3558 | 1 ⊢ (𝑍 ∈ GoldbachEven ↔ (𝑍 ∈ Even ∧ ∃𝑝 ∈ ℙ ∃𝑞 ∈ ℙ (𝑝 ∈ Odd ∧ 𝑞 ∈ Odd ∧ 𝑍 = (𝑝 + 𝑞)))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 198 ∧ wa 385 ∧ w3a 1108 = wceq 1653 ∈ wcel 2157 ∃wrex 3088 (class class class)co 6876 + caddc 10225 ℙcprime 15716 Even ceven 42307 Odd codd 42308 GoldbachEven cgbe 42403 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-ext 2775 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-clab 2784 df-cleq 2790 df-clel 2793 df-nfc 2928 df-rex 3093 df-rab 3096 df-v 3385 df-gbe 42406 |
This theorem is referenced by: gbeeven 42412 gbepos 42416 gbegt5 42419 6gbe 42429 8gbe 42431 sbgoldbwt 42435 sbgoldbst 42436 sbgoldbalt 42439 nnsum3primesgbe 42450 bgoldbtbndlem4 42466 bgoldbtbnd 42467 |
Copyright terms: Public domain | W3C validator |