| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Equivalence for an ordered pair equal to a singleton. |
| Ref | Expression |
|---|---|
| opeqsn.1 |
|
| opeqsn.2 |
|
| opeqsn.3 |
|
| Ref | Expression |
|---|---|
| opeqsn |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-op 2420 |
. . 3
| |
| 2 | 1 | eqeq1i 1485 |
. 2
|
| 3 | snex 2756 |
. . 3
| |
| 4 | prex 2787 |
. . 3
| |
| 5 | opeqsn.3 |
. . 3
| |
| 6 | 3, 4, 5 | preqsn 2490 |
. 2
|
| 7 | eqcom 1480 |
. . . . 5
| |
| 8 | opeqsn.1 |
. . . . . 6
| |
| 9 | opeqsn.2 |
. . . . . 6
| |
| 10 | 8, 9, 8 | preqsn 2490 |
. . . . 5
|
| 11 | eqcom 1480 |
. . . . . . 7
| |
| 12 | 11 | anbi2i 482 |
. . . . . 6
|
| 13 | anidm 434 |
. . . . . 6
| |
| 14 | 12, 13 | bitr 173 |
. . . . 5
|
| 15 | 7, 10, 14 | 3bitr 177 |
. . . 4
|
| 16 | 15 | anbi1i 483 |
. . 3
|
| 17 | preq2 2453 |
. . . . . . 7
| |
| 18 | dfsn2 2424 |
. . . . . . 7
| |
| 19 | 17, 18 | syl5req 1523 |
. . . . . 6
|
| 20 | 19 | eqeq1d 1486 |
. . . . 5
|
| 21 | eqcom 1480 |
. . . . 5
| |
| 22 | 20, 21 | syl6bb 538 |
. . . 4
|
| 23 | 22 | pm5.32i 647 |
. . 3
|
| 24 | 16, 23 | bitr 173 |
. 2
|
| 25 | 2, 6, 24 | 3bitr 177 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: relop 3281 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 964 ax-gen 965 ax-8 966 ax-10 968 ax-11 969 ax-12 970 ax-13 971 ax-14 972 ax-17 973 ax-4 975 ax-5o 977 ax-6o 980 ax-9o 1125 ax-10o 1142 ax-16 1212 ax-11o 1220 ax-ext 1462 ax-sep 2708 ax-pow 2748 ax-pr 2785 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 983 df-sb 1174 df-eu 1384 df-mo 1385 df-clab 1467 df-cleq 1472 df-clel 1475 df-ne 1590 df-v 1815 df-dif 2052 df-un 2053 df-in 2054 df-ss 2056 df-nul 2284 df-pw 2406 df-sn 2416 df-pr 2417 df-op 2420 |