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 6083, 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 5967 | . 2 ⊢ Rel ◡◡{〈𝐴, 𝐵〉} | |
2 | relcnv 5967 | . 2 ⊢ Rel ◡{〈𝐵, 𝐴〉} | |
3 | vex 3497 | . . . 4 ⊢ 𝑥 ∈ V | |
4 | vex 3497 | . . . 4 ⊢ 𝑦 ∈ V | |
5 | 3, 4 | opelcnv 5752 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ◡◡{〈𝐴, 𝐵〉} ↔ 〈𝑦, 𝑥〉 ∈ ◡{〈𝐴, 𝐵〉}) |
6 | ancom 463 | . . . . . 6 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑦 = 𝐵 ∧ 𝑥 = 𝐴)) | |
7 | 3, 4 | opth 5368 | . . . . . 6 ⊢ (〈𝑥, 𝑦〉 = 〈𝐴, 𝐵〉 ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) |
8 | 4, 3 | opth 5368 | . . . . . 6 ⊢ (〈𝑦, 𝑥〉 = 〈𝐵, 𝐴〉 ↔ (𝑦 = 𝐵 ∧ 𝑥 = 𝐴)) |
9 | 6, 7, 8 | 3bitr4i 305 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 = 〈𝐴, 𝐵〉 ↔ 〈𝑦, 𝑥〉 = 〈𝐵, 𝐴〉) |
10 | opex 5356 | . . . . . 6 ⊢ 〈𝑥, 𝑦〉 ∈ V | |
11 | 10 | elsn 4582 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ {〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 = 〈𝐴, 𝐵〉) |
12 | opex 5356 | . . . . . 6 ⊢ 〈𝑦, 𝑥〉 ∈ V | |
13 | 12 | elsn 4582 | . . . . 5 ⊢ (〈𝑦, 𝑥〉 ∈ {〈𝐵, 𝐴〉} ↔ 〈𝑦, 𝑥〉 = 〈𝐵, 𝐴〉) |
14 | 9, 11, 13 | 3bitr4i 305 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ {〈𝐴, 𝐵〉} ↔ 〈𝑦, 𝑥〉 ∈ {〈𝐵, 𝐴〉}) |
15 | 4, 3 | opelcnv 5752 | . . . 4 ⊢ (〈𝑦, 𝑥〉 ∈ ◡{〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 ∈ {〈𝐴, 𝐵〉}) |
16 | 3, 4 | opelcnv 5752 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ ◡{〈𝐵, 𝐴〉} ↔ 〈𝑦, 𝑥〉 ∈ {〈𝐵, 𝐴〉}) |
17 | 14, 15, 16 | 3bitr4i 305 | . . 3 ⊢ (〈𝑦, 𝑥〉 ∈ ◡{〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 ∈ ◡{〈𝐵, 𝐴〉}) |
18 | 5, 17 | bitri 277 | . 2 ⊢ (〈𝑥, 𝑦〉 ∈ ◡◡{〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 ∈ ◡{〈𝐵, 𝐴〉}) |
19 | 1, 2, 18 | eqrelriiv 5663 | 1 ⊢ ◡◡{〈𝐴, 𝐵〉} = ◡{〈𝐵, 𝐴〉} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 398 = wceq 1537 ∈ wcel 2114 {csn 4567 〈cop 4573 ◡ccnv 5554 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-br 5067 df-opab 5129 df-xp 5561 df-rel 5562 df-cnv 5563 |
This theorem is referenced by: rnsnopg 6078 cnvsng 6080 |
Copyright terms: Public domain | W3C validator |