| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Converse of a singleton of an ordered pair. |
| Ref | Expression |
|---|---|
| cnvsn.1 |
|
| cnvsn.2 |
|
| Ref | Expression |
|---|---|
| cnvsn |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relcnv 3435 |
. 2
| |
| 2 | cnvsn.2 |
. . 3
| |
| 3 | 2 | relsn 3254 |
. 2
|
| 4 | ancom 435 |
. . 3
| |
| 5 | opex 2782 |
. . . . 5
| |
| 6 | 5 | elsnc 2431 |
. . . 4
|
| 7 | visset 1813 |
. . . . 5
| |
| 8 | visset 1813 |
. . . . 5
| |
| 9 | cnvsn.1 |
. . . . 5
| |
| 10 | 7, 8, 9 | opth 2787 |
. . . 4
|
| 11 | 6, 10 | bitr 173 |
. . 3
|
| 12 | 7, 8 | opelcnv 3298 |
. . . 4
|
| 13 | opex 2782 |
. . . . 5
| |
| 14 | 13 | elsnc 2431 |
. . . 4
|
| 15 | 8, 7, 2 | opth 2787 |
. . . 4
|
| 16 | 12, 14, 15 | 3bitr 177 |
. . 3
|
| 17 | 4, 11, 16 | 3bitr4r 184 |
. 2
|
| 18 | 1, 3, 17 | eqrelriv 3251 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: rnsnop 3450 op2ndb 3451 op2nda 3452 f1osn 3719 xpcomen 4439 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 962 ax-gen 963 ax-8 964 ax-10 966 ax-11 967 ax-12 968 ax-13 969 ax-14 970 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 ax-10o 1140 ax-16 1210 ax-11o 1218 ax-ext 1459 ax-sep 2703 ax-pow 2742 ax-pr 2779 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 981 df-sb 1172 df-eu 1382 df-mo 1383 df-clab 1464 df-cleq 1469 df-clel 1472 df-ne 1587 df-v 1812 df-dif 2049 df-un 2050 df-in 2051 df-ss 2053 df-nul 2281 df-pw 2402 df-sn 2412 df-pr 2413 df-op 2416 df-br 2620 df-opab 2667 df-xp 3184 df-rel 3185 df-cnv 3186 |