| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > spc2egv | Structured version Visualization version GIF version | ||
| Description: Existential specialization with two quantifiers, using implicit substitution. (Contributed by NM, 3-Aug-1995.) |
| Ref | Expression |
|---|---|
| spc2egv.1 | ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| spc2egv | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝜓 → ∃𝑥∃𝑦𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elisset 2842 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 = 𝐴) | |
| 2 | elisset 2842 | . . . 4 ⊢ (𝐵 ∈ 𝑊 → ∃𝑦 𝑦 = 𝐵) | |
| 3 | 1, 2 | anim12i 625 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)) |
| 4 | exdistrv 1988 | . . 3 ⊢ (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵)) | |
| 5 | 3, 4 | sylibr 237 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) |
| 6 | spc2egv.1 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜓)) | |
| 7 | 6 | biimprcd 253 | . . 3 ⊢ (𝜓 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝜑)) |
| 8 | 7 | 2eximdv 1952 | . 2 ⊢ (𝜓 → (∃𝑥∃𝑦(𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ∃𝑥∃𝑦𝜑)) |
| 9 | 5, 8 | syl5com 32 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝜓 → ∃𝑥∃𝑦𝜑)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2145 |
| 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 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2739 df-clel 2835 |
| This theorem is used by: spc2gv 3554 spc3egv 3557 spc2ev 3561 tpres 7201 addsrpr 11085 mulsrpr 11086 2pthon3v 30412 umgr2wlk 30418 0pthonv 30600 1pthon2v 30634 satfv1 35943 sat1el2xp 35959 dvnprodlem1 46775 dfatcolem 48144 fundcmpsurbijinj 48311 gpgprismgr4cyclex 49024 |
| Copyright terms: Public domain | W3C validator |