| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cnvcnvsn | GIF version | ||
| Description: Double converse of a singleton of an ordered pair. (Unlike cnvsn 5153, 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 5048 | . 2 ⊢ Rel ◡◡{〈𝐴, 𝐵〉} | |
| 2 | relcnv 5048 | . 2 ⊢ Rel ◡{〈𝐵, 𝐴〉} | |
| 3 | vex 2766 | . . . 4 ⊢ 𝑦 ∈ V | |
| 4 | vex 2766 | . . . 4 ⊢ 𝑥 ∈ V | |
| 5 | 3, 4 | opelcnv 4849 | . . 3 ⊢ (〈𝑦, 𝑥〉 ∈ ◡◡{〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 ∈ ◡{〈𝐴, 𝐵〉}) |
| 6 | ancom 266 | . . . . . 6 ⊢ ((𝑦 = 𝐴 ∧ 𝑥 = 𝐵) ↔ (𝑥 = 𝐵 ∧ 𝑦 = 𝐴)) | |
| 7 | 3, 4 | opth 4271 | . . . . . 6 ⊢ (〈𝑦, 𝑥〉 = 〈𝐴, 𝐵〉 ↔ (𝑦 = 𝐴 ∧ 𝑥 = 𝐵)) |
| 8 | 4, 3 | opth 4271 | . . . . . 6 ⊢ (〈𝑥, 𝑦〉 = 〈𝐵, 𝐴〉 ↔ (𝑥 = 𝐵 ∧ 𝑦 = 𝐴)) |
| 9 | 6, 7, 8 | 3bitr4i 212 | . . . . 5 ⊢ (〈𝑦, 𝑥〉 = 〈𝐴, 𝐵〉 ↔ 〈𝑥, 𝑦〉 = 〈𝐵, 𝐴〉) |
| 10 | 3, 4 | opex 4263 | . . . . . 6 ⊢ 〈𝑦, 𝑥〉 ∈ V |
| 11 | 10 | elsn 3639 | . . . . 5 ⊢ (〈𝑦, 𝑥〉 ∈ {〈𝐴, 𝐵〉} ↔ 〈𝑦, 𝑥〉 = 〈𝐴, 𝐵〉) |
| 12 | 4, 3 | opex 4263 | . . . . . 6 ⊢ 〈𝑥, 𝑦〉 ∈ V |
| 13 | 12 | elsn 3639 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ {〈𝐵, 𝐴〉} ↔ 〈𝑥, 𝑦〉 = 〈𝐵, 𝐴〉) |
| 14 | 9, 11, 13 | 3bitr4i 212 | . . . 4 ⊢ (〈𝑦, 𝑥〉 ∈ {〈𝐴, 𝐵〉} ↔ 〈𝑥, 𝑦〉 ∈ {〈𝐵, 𝐴〉}) |
| 15 | 4, 3 | opelcnv 4849 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ ◡{〈𝐴, 𝐵〉} ↔ 〈𝑦, 𝑥〉 ∈ {〈𝐴, 𝐵〉}) |
| 16 | 3, 4 | opelcnv 4849 | . . . 4 ⊢ (〈𝑦, 𝑥〉 ∈ ◡{〈𝐵, 𝐴〉} ↔ 〈𝑥, 𝑦〉 ∈ {〈𝐵, 𝐴〉}) |
| 17 | 14, 15, 16 | 3bitr4i 212 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ◡{〈𝐴, 𝐵〉} ↔ 〈𝑦, 𝑥〉 ∈ ◡{〈𝐵, 𝐴〉}) |
| 18 | 5, 17 | bitri 184 | . 2 ⊢ (〈𝑦, 𝑥〉 ∈ ◡◡{〈𝐴, 𝐵〉} ↔ 〈𝑦, 𝑥〉 ∈ ◡{〈𝐵, 𝐴〉}) |
| 19 | 1, 2, 18 | eqrelriiv 4758 | 1 ⊢ ◡◡{〈𝐴, 𝐵〉} = ◡{〈𝐵, 𝐴〉} |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 = wceq 1364 ∈ wcel 2167 {csn 3623 〈cop 3626 ◡ccnv 4663 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-v 2765 df-un 3161 df-in 3163 df-ss 3170 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-br 4035 df-opab 4096 df-xp 4670 df-rel 4671 df-cnv 4672 |
| This theorem is referenced by: rnsnopg 5149 cnvsn 5153 |
| Copyright terms: Public domain | W3C validator |