| 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 1493 |
. . . 4
| |
| 2 | visset 1813 |
. . . . 5
| |
| 3 | visset 1813 |
. . . . 5
| |
| 4 | 2, 3 | opth2 2800 |
. . . 4
|
| 5 | 1, 4 | syl 10 |
. . 3
|
| 6 | 5 | gen2 983 |
. 2
|
| 7 | ax-17 971 |
. . . 4
| |
| 8 | hbs1 1332 |
. . . . . 6
| |
| 9 | 8 | hbab 1467 |
. . . . 5
|
| 10 | ax-17 971 |
. . . . 5
| |
| 11 | 9, 10 | hbop 2496 |
. . . 4
|
| 12 | 7, 11 | hbeq 1565 |
. . 3
|
| 13 | sbab 1583 |
. . . . . 6
| |
| 14 | 13 | opeq1d 2493 |
. . . . 5
|
| 15 | opeq2 2488 |
. . . . 5
| |
| 16 | 14, 15 | eqtrd 1507 |
. . . 4
|
| 17 | 16 | eqeq2d 1486 |
. . 3
|
| 18 | 12, 17 | mo4f 1402 |
. 2
|
| 19 | 6, 18 | mpbir 190 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: euop2 2806 |
| 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-nul 2710 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 |