| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: "At most one"
property of an ordered pair. The proof is a little tricky
because we do not place any restrictions on class |
| Ref | Expression |
|---|---|
| moop2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqtr2t 1485 |
. . . 4
| |
| 2 | visset 1804 |
. . . . 5
| |
| 3 | visset 1804 |
. . . . 5
| |
| 4 | 2, 3 | opth2 2789 |
. . . 4
|
| 5 | 1, 4 | syl 10 |
. . 3
|
| 6 | 5 | gen2 980 |
. 2
|
| 7 | ax-17 968 |
. . . 4
| |
| 8 | hbs1 1327 |
. . . . . 6
| |
| 9 | 8 | hbab 1460 |
. . . . 5
|
| 10 | ax-17 968 |
. . . . 5
| |
| 11 | 9, 10 | hbop 2487 |
. . . 4
|
| 12 | 7, 11 | hbeq 1557 |
. . 3
|
| 13 | sbab 1575 |
. . . . . 6
| |
| 14 | 13 | opeq1d 2484 |
. . . . 5
|
| 15 | opeq2 2479 |
. . . . 5
| |
| 16 | 14, 15 | eqtrd 1499 |
. . . 4
|
| 17 | 16 | eqeq2d 1478 |
. . 3
|
| 18 | 12, 17 | mo4f 1395 |
. 2
|
| 19 | 6, 18 | mpbir 190 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: euop2 2795 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 959 ax-gen 960 ax-8 961 ax-10 963 ax-11 964 ax-12 965 ax-13 966 ax-14 967 ax-17 968 ax-4 970 ax-5o 972 ax-6o 975 ax-9o 1119 ax-10o 1136 ax-16 1206 ax-11o 1213 ax-ext 1452 ax-sep 2693 ax-nul 2700 ax-pow 2732 ax-pr 2769 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 978 df-sb 1168 df-eu 1375 df-mo 1376 df-clab 1457 df-cleq 1462 df-clel 1465 df-ne 1579 df-v 1803 df-dif 2039 df-un 2040 df-in 2041 df-ss 2043 df-nul 2271 df-pw 2392 df-sn 2402 df-pr 2403 df-op 2406 |