![]() |
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 4289 | . . 3 ⊢ (𝑧 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
2 | 1 | exbii 1616 | . 2 ⊢ (∃𝑧 𝑧 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑧∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)) |
3 | exrot3 1701 | . 2 ⊢ (∃𝑧∃𝑥∃𝑦(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦∃𝑧(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
4 | vex 2763 | . . . . . 6 ⊢ 𝑥 ∈ V | |
5 | vex 2763 | . . . . . 6 ⊢ 𝑦 ∈ V | |
6 | 4, 5 | opex 4259 | . . . . 5 ⊢ 〈𝑥, 𝑦〉 ∈ V |
7 | 6 | isseti 2768 | . . . 4 ⊢ ∃𝑧 𝑧 = 〈𝑥, 𝑦〉 |
8 | 19.41v 1914 | . . . 4 ⊢ (∃𝑧(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (∃𝑧 𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
9 | 7, 8 | mpbiran 942 | . . 3 ⊢ (∃𝑧(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ 𝜑) |
10 | 9 | 2exbii 1617 | . 2 ⊢ (∃𝑥∃𝑦∃𝑧(𝑧 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦𝜑) |
11 | 2, 3, 10 | 3bitri 206 | 1 ⊢ (∃𝑧 𝑧 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦𝜑) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1364 ∃wex 1503 ∈ wcel 2164 〈cop 3622 {copab 4090 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-v 2762 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-opab 4092 |
This theorem is referenced by: lgsquadlem3 15236 |
Copyright terms: Public domain | W3C validator |