| 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 6094 | . 2 ⊢ Rel ◡{〈𝑥, 𝑦〉 ∣ 𝜑} | |
| 2 | relopabv 5795 | . 2 ⊢ Rel {〈𝑦, 𝑥〉 ∣ 𝜑} | |
| 3 | elopab 5497 | . . . 4 ⊢ (〈𝑤, 𝑧〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦(〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 4 | excom 2199 | . . . 4 ⊢ (∃𝑥∃𝑦(〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑦∃𝑥(〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 5 | ancom 466 | . . . . . . 7 ⊢ ((𝑤 = 𝑥 ∧ 𝑧 = 𝑦) ↔ (𝑧 = 𝑦 ∧ 𝑤 = 𝑥)) | |
| 6 | vex 3454 | . . . . . . . 8 ⊢ 𝑤 ∈ V | |
| 7 | vex 3454 | . . . . . . . 8 ⊢ 𝑧 ∈ V | |
| 8 | 6, 7 | opth 5444 | . . . . . . 7 ⊢ (〈𝑤, 𝑧〉 = 〈𝑥, 𝑦〉 ↔ (𝑤 = 𝑥 ∧ 𝑧 = 𝑦)) |
| 9 | 7, 6 | opth 5444 | . . . . . . 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 5855 | . . 3 ⊢ (〈𝑧, 𝑤〉 ∈ ◡{〈𝑥, 𝑦〉 ∣ 𝜑} ↔ 〈𝑤, 𝑧〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑}) |
| 15 | elopab 5497 | . . 3 ⊢ (〈𝑧, 𝑤〉 ∈ {〈𝑦, 𝑥〉 ∣ 𝜑} ↔ ∃𝑦∃𝑥(〈𝑧, 𝑤〉 = 〈𝑦, 𝑥〉 ∧ 𝜑)) | |
| 16 | 13, 14, 15 | 3bitr4i 306 | . 2 ⊢ (〈𝑧, 𝑤〉 ∈ ◡{〈𝑥, 𝑦〉 ∣ 𝜑} ↔ 〈𝑧, 𝑤〉 ∈ {〈𝑦, 𝑥〉 ∣ 𝜑}) |
| 17 | 1, 2, 16 | eqrelriiv 5762 | 1 ⊢ ◡{〈𝑥, 𝑦〉 ∣ 𝜑} = {〈𝑦, 𝑥〉 ∣ 𝜑} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2145 〈cop 4589 {copab 5166 ◡ccnv 5646 |
| 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 2732 ax-sep 5248 ax-pr 5390 |
| 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 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-br 5103 df-opab 5167 df-xp 5653 df-rel 5654 df-cnv 5655 |
| This theorem is used by: mptcnv 6126 cnvxpOLD 6143 mptpreima 6228 f1ocnvd 7660 cnvoprab 8054 mapsncnv 8899 cnvepnep 9587 compsscnv 10420 dfiso2 17908 xkocnv 24094 lgsquadlem3 27672 axcontlem2 29476 cnvadj 32427 f1o3d 33153 vxp 39115 xrninxp 39267 prjspeclsp 43562 fsovrfovd 44953 |
| Copyright terms: Public domain | W3C validator |