| 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 2183, ax-12 2219. (Revised by SN, 7-Jun-2025.) |
| Ref | Expression |
|---|---|
| cnvopab | ⊢ ◡{〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑦, 𝑥〉 ∣ 𝜑} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relcnv 6117 | . 2 ⊢ Rel ◡{〈𝑥, 𝑦〉 ∣ 𝜑} | |
| 2 | relopab 5811 | . 2 ⊢ Rel {〈𝑦, 𝑥〉 ∣ 𝜑} | |
| 3 | elopab 5507 | . . . 4 ⊢ (〈𝑤, 𝑧〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦(〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 4 | excom 2205 | . . . 4 ⊢ (∃𝑥∃𝑦(〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑦∃𝑥(〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 5 | ancom 466 | . . . . . . 7 ⊢ ((𝑤 = 𝑥 ∧ 𝑧 = 𝑦) ↔ (𝑧 = 𝑦 ∧ 𝑤 = 𝑥)) | |
| 6 | vex 3457 | . . . . . . . 8 ⊢ 𝑤 ∈ V | |
| 7 | vex 3457 | . . . . . . . 8 ⊢ 𝑧 ∈ V | |
| 8 | 6, 7 | opth 5451 | . . . . . . 7 ⊢ (〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ↔ (𝑤 = 𝑥 ∧ 𝑧 = 𝑦)) |
| 9 | 7, 6 | opth 5451 | . . . . . . 7 ⊢ (〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉 ↔ (𝑧 = 𝑦 ∧ 𝑤 = 𝑥)) |
| 10 | 5, 8, 9 | 3bitr4i 306 | . . . . . 6 ⊢ (〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ↔ 〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉) |
| 11 | 10 | anbi1i 636 | . . . . 5 ⊢ ((〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉 ∧ 𝜑)) |
| 12 | 11 | 2exbii 1884 | . . . 4 ⊢ (∃𝑦∃𝑥(〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑦∃𝑥(〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉 ∧ 𝜑)) |
| 13 | 3, 4, 12 | 3bitri 300 | . . 3 ⊢ (〈𝑤, 𝑧〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑦∃𝑥(〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉 ∧ 𝜑)) |
| 14 | 7, 6 | opelcnv 5870 | . . 3 ⊢ (〈𝑧, 𝑤〉 ∈ ◡{〈𝑥, 𝑦〉 ∣ 𝜑} ↔ 〈𝑤, 𝑧〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑}) |
| 15 | elopab 5507 | . . 3 ⊢ (〈𝑧, 𝑤〉 ∈ {〈𝑦, 𝑥〉 ∣ 𝜑} ↔ ∃𝑦∃𝑥(〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉 ∧ 𝜑)) | |
| 16 | 13, 14, 15 | 3bitr4i 306 | . 2 ⊢ (〈𝑧, 𝑤〉 ∈ ◡{〈𝑥, 𝑦〉 ∣ 𝜑} ↔ 〈𝑧, 𝑤〉 ∈ {〈𝑦, 𝑥〉 ∣ 𝜑}) |
| 17 | 1, 2, 16 | eqrelriiv 5774 | 1 ⊢ ◡{〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑦, 𝑥〉 ∣ 𝜑} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1572 ∃wex 1814 ∈ wcel 2150 〈cop 4839 {copab 5172 ◡ccnv 5656 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-11 2200 ax-ext 2738 ax-sep 5254 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-br 5108 df-opab 5173 df-xp 5663 df-rel 5664 df-cnv 5665 |
| This theorem is used by: mptcnv 6149 cnvxpOLD 6165 mptpreima 6257 f1ocnvd 7703 cnvoprab 8105 mapsncnv 8958 cnvepnep 9645 compsscnv 10487 dfiso2 17999 xkocnv 24190 lgsquadlem3 27768 axcontlem2 29602 cnvadj 32553 f1o3d 33320 vxp 39463 xrninxp 39615 prjspeclsp 43905 fsovrfovd 45330 |
| Copyright terms: Public domain | W3C validator |