| 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 4375 | . . 3 ⊢ (𝑧 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 2 | 1 | exbii 1654 | . 2 ⊢ (∃𝑧 𝑧 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑧∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)) |
| 3 | exrot3 1738 | . 2 ⊢ (∃𝑧∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦∃𝑧(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 4 | vex 2815 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 5 | vex 2815 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 6 | 4, 5 | opex 4344 | . . . . 5 ⊢ 〈𝑥, 𝑦〉 ∈ V |
| 7 | 6 | isseti 2821 | . . . 4 ⊢ ∃𝑧 𝑧 = 〈𝑥, 𝑦〉 |
| 8 | 19.41v 1952 | . . . 4 ⊢ (∃𝑧(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (∃𝑧 𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 9 | 7, 8 | mpbiran 949 | . . 3 ⊢ (∃𝑧(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ 𝜑) |
| 10 | 9 | 2exbii 1655 | . 2 ⊢ (∃𝑥∃𝑦∃𝑧(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦𝜑) |
| 11 | 2, 3, 10 | 3bitri 206 | 1 ⊢ (∃𝑧 𝑧 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦𝜑) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1398 ∃wex 1541 ∈ wcel 2203 〈cop 3691 {copab 4169 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2206 ax-ext 2214 ax-sep 4227 ax-pow 4286 ax-pr 4321 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-v 2814 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-opab 4171 |
| This theorem is referenced by: lgsquadlem3 15939 |
| Copyright terms: Public domain | W3C validator |