| 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 6226, 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 6104 | . 2 ⊢ Rel ◡◡{〈𝐴, 𝐵〉} | |
| 2 | relcnv 6104 | . 2 ⊢ Rel ◡{〈𝐵, 𝐴〉} | |
| 3 | vex 3457 | . . . 4 ⊢ 𝑥 ∈ V | |
| 4 | vex 3457 | . . . 4 ⊢ 𝑦 ∈ V | |
| 5 | 3, 4 | opelcnv 5865 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ◡◡{〈𝐴, 𝐵〉} ↔ 〈𝑦, 𝑥〉 ∈ ◡{〈𝐴, 𝐵〉}) |
| 6 | ancom 466 | . . . . . 6 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑦 = 𝐵 ∧ 𝑥 = 𝐴)) | |
| 7 | 3, 4 | opth 5456 | . . . . . 6 ⊢ (〈𝑥, 𝑦〉 = 〈𝐴, 𝐵〉 ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) |
| 8 | 4, 3 | opth 5456 | . . . . . 6 ⊢ (〈𝑦, 𝑥〉 = 〈𝐵, 𝐴〉 ↔ (𝑦 = 𝐵 ∧ 𝑥 = 𝐴)) |
| 9 | 6, 7, 8 | 3bitr4i 306 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 = 〈𝐴, 𝐵〉 ↔ 〈𝑦, 𝑥〉 = 〈𝐵, 𝐴〉) |
| 10 | opex 5443 | . . . . . 6 ⊢ 〈𝑥, 𝑦〉 ∈ V | |
| 11 | 10 | elsn 4602 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ {〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 = 〈𝐴, 𝐵〉) |
| 12 | opex 5443 | . . . . . 6 ⊢ 〈𝑦, 𝑥〉 ∈ V | |
| 13 | 12 | elsn 4602 | . . . . 5 ⊢ (〈𝑦, 𝑥〉 ∈ {〈𝐵, 𝐴〉} ↔ 〈𝑦, 𝑥〉 = 〈𝐵, 𝐴〉) |
| 14 | 9, 11, 13 | 3bitr4i 306 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ {〈𝐴, 𝐵〉} ↔ 〈𝑦, 𝑥〉 ∈ {〈𝐵, 𝐴〉}) |
| 15 | 4, 3 | opelcnv 5865 | . . . 4 ⊢ (〈𝑦, 𝑥〉 ∈ ◡{〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 ∈ {〈𝐴, 𝐵〉}) |
| 16 | 3, 4 | opelcnv 5865 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ ◡{〈𝐵, 𝐴〉} ↔ 〈𝑦, 𝑥〉 ∈ {〈𝐵, 𝐴〉}) |
| 17 | 14, 15, 16 | 3bitr4i 306 | . . 3 ⊢ (〈𝑦, 𝑥〉 ∈ ◡{〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 ∈ ◡{〈𝐵, 𝐴〉}) |
| 18 | 5, 17 | bitri 278 | . 2 ⊢ (〈𝑥, 𝑦〉 ∈ ◡◡{〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 ∈ ◡{〈𝐵, 𝐴〉}) |
| 19 | 1, 2, 18 | eqrelriiv 5774 | 1 ⊢ ◡◡{〈𝐴, 𝐵〉} = ◡{〈𝐵, 𝐴〉} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∈ wcel 2145 {csn 4587 〈cop 4593 ◡ccnv 5658 |
| 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-ext 2734 ax-sep 5255 ax-pr 5402 |
| 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 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-xp 5665 df-rel 5666 df-cnv 5667 |
| This theorem is used by: rnsnopg 6221 cnvsng 6223 |
| Copyright terms: Public domain | W3C validator |