| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnvcnvsn | Structured version Visualization version GIF version | ||
| Description: Double converse of a singleton of an ordered pair. (Unlike cnvsn 6181, this does not need any sethood assumptions on 𝐴 and 𝐵.) (Contributed by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| cnvcnvsn | ⊢ ◡◡{〈𝐴, 𝐵〉} = ◡{〈𝐵, 𝐴〉} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relcnv 6063 | . 2 ⊢ Rel ◡◡{〈𝐴, 𝐵〉} | |
| 2 | relcnv 6063 | . 2 ⊢ Rel ◡{〈𝐵, 𝐴〉} | |
| 3 | vex 3437 | . . . 4 ⊢ 𝑥 ∈ V | |
| 4 | vex 3437 | . . . 4 ⊢ 𝑦 ∈ V | |
| 5 | 3, 4 | opelcnv 5826 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ◡◡{〈𝐴, 𝐵〉} ↔ 〈𝑦, 𝑥〉 ∈ ◡{〈𝐴, 𝐵〉}) |
| 6 | ancom 462 | . . . . . 6 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑦 = 𝐵 ∧ 𝑥 = 𝐴)) | |
| 7 | 3, 4 | opth 5419 | . . . . . 6 ⊢ (〈𝑥, 𝑦〉 = 〈𝐴, 𝐵〉 ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) |
| 8 | 4, 3 | opth 5419 | . . . . . 6 ⊢ (〈𝑦, 𝑥〉 = 〈𝐵, 𝐴〉 ↔ (𝑦 = 𝐵 ∧ 𝑥 = 𝐴)) |
| 9 | 6, 7, 8 | 3bitr4i 305 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 = 〈𝐴, 𝐵〉 ↔ 〈𝑦, 𝑥〉 = 〈𝐵, 𝐴〉) |
| 10 | opex 5406 | . . . . . 6 ⊢ 〈𝑥, 𝑦〉 ∈ V | |
| 11 | 10 | elsn 4573 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ {〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 = 〈𝐴, 𝐵〉) |
| 12 | opex 5406 | . . . . . 6 ⊢ 〈𝑦, 𝑥〉 ∈ V | |
| 13 | 12 | elsn 4573 | . . . . 5 ⊢ (〈𝑦, 𝑥〉 ∈ {〈𝐵, 𝐴〉} ↔ 〈𝑦, 𝑥〉 = 〈𝐵, 𝐴〉) |
| 14 | 9, 11, 13 | 3bitr4i 305 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ {〈𝐴, 𝐵〉} ↔ 〈𝑦, 𝑥〉 ∈ {〈𝐵, 𝐴〉}) |
| 15 | 4, 3 | opelcnv 5826 | . . . 4 ⊢ (〈𝑦, 𝑥〉 ∈ ◡{〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 ∈ {〈𝐴, 𝐵〉}) |
| 16 | 3, 4 | opelcnv 5826 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ ◡{〈𝐵, 𝐴〉} ↔ 〈𝑦, 𝑥〉 ∈ {〈𝐵, 𝐴〉}) |
| 17 | 14, 15, 16 | 3bitr4i 305 | . . 3 ⊢ (〈𝑦, 𝑥〉 ∈ ◡{〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 ∈ ◡{〈𝐵, 𝐴〉}) |
| 18 | 5, 17 | bitri 277 | . 2 ⊢ (〈𝑥, 𝑦〉 ∈ ◡◡{〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 ∈ ◡{〈𝐵, 𝐴〉}) |
| 19 | 1, 2, 18 | eqrelriiv 5736 | 1 ⊢ ◡◡{〈𝐴, 𝐵〉} = ◡{〈𝐵, 𝐴〉} |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 397 = wceq 1548 ∈ wcel 2121 {csn 4558 〈cop 4564 ◡ccnv 5620 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 ax-sep 5221 ax-pr 5365 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-rab 3394 df-v 3435 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-sn 4559 df-pr 4561 df-op 4565 df-br 5076 df-opab 5138 df-xp 5627 df-rel 5628 df-cnv 5629 |
| This theorem is referenced by: rnsnopg 6176 cnvsng 6178 |
| Copyright terms: Public domain | W3C validator |