Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > exopxfr | Structured version Visualization version GIF version |
Description: Transfer ordered-pair existence from/to single variable existence. (Contributed by NM, 26-Feb-2014.) (Proof shortened by Mario Carneiro, 31-Aug-2015.) |
Ref | Expression |
---|---|
exopxfr.1 | ⊢ (𝑥 = 〈𝑦, 𝑧〉 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
exopxfr | ⊢ (∃𝑥 ∈ (V × V)𝜑 ↔ ∃𝑦∃𝑧𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | exopxfr.1 | . . 3 ⊢ (𝑥 = 〈𝑦, 𝑧〉 → (𝜑 ↔ 𝜓)) | |
2 | 1 | rexxp 5785 | . 2 ⊢ (∃𝑥 ∈ (V × V)𝜑 ↔ ∃𝑦 ∈ V ∃𝑧 ∈ V 𝜓) |
3 | rexv 3466 | . 2 ⊢ (∃𝑦 ∈ V ∃𝑧 ∈ V 𝜓 ↔ ∃𝑦∃𝑧 ∈ V 𝜓) | |
4 | rexv 3466 | . . 3 ⊢ (∃𝑧 ∈ V 𝜓 ↔ ∃𝑧𝜓) | |
5 | 4 | exbii 1849 | . 2 ⊢ (∃𝑦∃𝑧 ∈ V 𝜓 ↔ ∃𝑦∃𝑧𝜓) |
6 | 2, 3, 5 | 3bitri 296 | 1 ⊢ (∃𝑥 ∈ (V × V)𝜑 ↔ ∃𝑦∃𝑧𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1540 ∃wex 1780 ∃wrex 3070 Vcvv 3441 〈cop 4580 × cxp 5619 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-sep 5244 ax-nul 5251 ax-pr 5373 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ral 3062 df-rex 3071 df-rab 3404 df-v 3443 df-sbc 3728 df-csb 3844 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4271 df-if 4475 df-sn 4575 df-pr 4577 df-op 4581 df-iun 4944 df-opab 5156 df-xp 5627 df-rel 5628 |
This theorem is referenced by: exopxfr2 5787 |
Copyright terms: Public domain | W3C validator |