| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnvopab | Structured version Visualization version GIF version | ||
| Description: The converse of a class abstraction of ordered pairs. (Contributed by NM, 11-Dec-2003.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) Avoid ax-10 2178, ax-12 2213. (Revised by SN, 7-Jun-2025.) |
| Ref | Expression |
|---|---|
| cnvopab | ⊢ ◡{〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑦, 𝑥〉 ∣ 𝜑} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relcnv 6100 | . 2 ⊢ Rel ◡{〈𝑥, 𝑦〉 ∣ 𝜑} | |
| 2 | relopabv 5799 | . 2 ⊢ Rel {〈𝑦, 𝑥〉 ∣ 𝜑} | |
| 3 | elopab 5501 | . . . 4 ⊢ (〈𝑤, 𝑧〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦(〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 4 | excom 2199 | . . . 4 ⊢ (∃𝑥∃𝑦(〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑦∃𝑥(〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 5 | ancom 466 | . . . . . . 7 ⊢ ((𝑤 = 𝑥 ∧ 𝑧 = 𝑦) ↔ (𝑧 = 𝑦 ∧ 𝑤 = 𝑥)) | |
| 6 | vex 3455 | . . . . . . . 8 ⊢ 𝑤 ∈ V | |
| 7 | vex 3455 | . . . . . . . 8 ⊢ 𝑧 ∈ V | |
| 8 | 6, 7 | opth 5445 | . . . . . . 7 ⊢ (〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ↔ (𝑤 = 𝑥 ∧ 𝑧 = 𝑦)) |
| 9 | 7, 6 | opth 5445 | . . . . . . 7 ⊢ (〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉 ↔ (𝑧 = 𝑦 ∧ 𝑤 = 𝑥)) |
| 10 | 5, 8, 9 | 3bitr4i 306 | . . . . . 6 ⊢ (〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ↔ 〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉) |
| 11 | 10 | anbi1i 636 | . . . . 5 ⊢ ((〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉 ∧ 𝜑)) |
| 12 | 11 | 2exbii 1882 | . . . 4 ⊢ (∃𝑦∃𝑥(〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑦∃𝑥(〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉 ∧ 𝜑)) |
| 13 | 3, 4, 12 | 3bitri 300 | . . 3 ⊢ (〈𝑤, 𝑧〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑦∃𝑥(〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉 ∧ 𝜑)) |
| 14 | 7, 6 | opelcnv 5859 | . . 3 ⊢ (〈𝑧, 𝑤〉 ∈ ◡{〈𝑥, 𝑦〉 ∣ 𝜑} ↔ 〈𝑤, 𝑧〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑}) |
| 15 | elopab 5501 | . . 3 ⊢ (〈𝑧, 𝑤〉 ∈ {〈𝑦, 𝑥〉 ∣ 𝜑} ↔ ∃𝑦∃𝑥(〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉 ∧ 𝜑)) | |
| 16 | 13, 14, 15 | 3bitr4i 306 | . 2 ⊢ (〈𝑧, 𝑤〉 ∈ ◡{〈𝑥, 𝑦〉 ∣ 𝜑} ↔ 〈𝑧, 𝑤〉 ∈ {〈𝑦, 𝑥〉 ∣ 𝜑}) |
| 17 | 1, 2, 16 | eqrelriiv 5766 | 1 ⊢ ◡{〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑦, 𝑥〉 ∣ 𝜑} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2145 〈cop 4590 {copab 5167 ◡ccnv 5650 |
| 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 ax-9 2155 ax-11 2194 ax-ext 2733 ax-sep 5249 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3453 df-dif 3900 df-un 3902 df-in 3904 df-ss 3915 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-xp 5657 df-rel 5658 df-cnv 5659 |
| This theorem is used by: mptcnv 6132 cnvxpOLD 6148 mptpreima 6240 f1ocnvd 7673 cnvoprab 8072 mapsncnv 8922 cnvepnep 9610 compsscnv 10450 dfiso2 17948 xkocnv 24134 lgsquadlem3 27710 axcontlem2 29544 cnvadj 32495 f1o3d 33221 vxp 39197 xrninxp 39349 prjspeclsp 43642 fsovrfovd 45010 |
| Copyright terms: Public domain | W3C validator |