| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Theorem for inferring "at most one." |
| Ref | Expression |
|---|---|
| mo2icl |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq2 1460 |
. . . . . 6
| |
| 2 | 1 | imbi2d 610 |
. . . . 5
|
| 3 | 2 | albidv 1260 |
. . . 4
|
| 4 | 3 | imbi1d 611 |
. . 3
|
| 5 | 19.8a 1005 |
. . . 4
| |
| 6 | ax-17 1190 |
. . . . 5
| |
| 7 | 6 | mo2 1377 |
. . . 4
|
| 8 | 5, 7 | sylibr 200 |
. . 3
|
| 9 | 4, 8 | vtoclg 1822 |
. 2
|
| 10 | visset 1788 |
. . . . . . . 8
| |
| 11 | eleq1 1510 |
. . . . . . . 8
| |
| 12 | 10, 11 | mpbii 193 |
. . . . . . 7
|
| 13 | 12 | imim2i 17 |
. . . . . 6
|
| 14 | 13 | con3d 95 |
. . . . 5
|
| 15 | 14 | com12 11 |
. . . 4
|
| 16 | 15 | 19.20dv 1271 |
. . 3
|
| 17 | alnex 1009 |
. . . 4
| |
| 18 | exmo 1393 |
. . . . 5
| |
| 19 | 18 | ori 230 |
. . . 4
|
| 20 | 17, 19 | sylbi 199 |
. . 3
|
| 21 | 16, 20 | syl6 22 |
. 2
|
| 22 | 9, 21 | pm2.61i 126 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: aceq6b 4666 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-4 951 ax-5 952 ax-6 953 ax-7 954 ax-gen 955 ax-8 1101 ax-9 1102 ax-10 1103 ax-12 1104 ax-11 1180 ax-17 1190 ax-16 1194 ax-11o 1202 ax-ext 1436 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 957 df-sb 1155 df-eu 1359 df-mo 1360 df-clab 1441 df-cleq 1446 df-clel 1449 df-v 1787 |