| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > opabm | GIF version | ||
| Description: Inhabited ordered pair class abstraction. (Contributed by Jim Kingdon, 29-Sep-2018.) |
| Ref | Expression |
|---|---|
| opabm | ⊢ (∃𝑧 𝑧 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elopab 4398 | . . 3 ⊢ (𝑧 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 2 | 1 | exbii 1658 | . 2 ⊢ (∃𝑧 𝑧 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑧∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)) |
| 3 | exrot3 1742 | . 2 ⊢ (∃𝑧∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦∃𝑧(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 4 | vex 2824 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 5 | vex 2824 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 6 | 4, 5 | opex 4367 | . . . . 5 ⊢ 〈𝑥, 𝑦〉 ∈ V |
| 7 | 6 | isseti 2830 | . . . 4 ⊢ ∃𝑧 𝑧 = 〈𝑥, 𝑦〉 |
| 8 | 19.41v 1958 | . . . 4 ⊢ (∃𝑧(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (∃𝑧 𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 9 | 7, 8 | mpbiran 953 | . . 3 ⊢ (∃𝑧(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ 𝜑) |
| 10 | 9 | 2exbii 1659 | . 2 ⊢ (∃𝑥∃𝑦∃𝑧(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦𝜑) |
| 11 | 2, 3, 10 | 3bitri 206 | 1 ⊢ (∃𝑧 𝑧 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦𝜑) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1402 ∃wex 1545 ∈ wcel 2209 〈cop 3711 {copab 4189 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-opab 4191 |
| This theorem is referenced by: mptmex 5939 lgsquadlem3 16181 |
| Copyright terms: Public domain | W3C validator |