| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Theorem for inferring "at most one". |
| Ref | Expression |
|---|---|
| mo2icl |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cleq2 1110 |
. . . . . 6
| |
| 2 | 1 | imbi2d 464 |
. . . . 5
|
| 3 | 2 | bialdv 935 |
. . . 4
|
| 4 | 3 | imbi1d 465 |
. . 3
|
| 5 | 19.8a 712 |
. . . 4
| |
| 6 | ax-17 925 |
. . . . 5
| |
| 7 | 6 | mo2 1026 |
. . . 4
|
| 8 | 5, 7 | sylibr 175 |
. . 3
|
| 9 | 4, 8 | vtoclg 1383 |
. 2
|
| 10 | visset 1350 |
. . . . . . . 8
| |
| 11 | eleq1 1149 |
. . . . . . . 8
| |
| 12 | 10, 11 | mpbii 168 |
. . . . . . 7
|
| 13 | 12 | syl3 18 |
. . . . . 6
|
| 14 | 13 | con3d 87 |
. . . . 5
|
| 15 | 14 | com12 13 |
. . . 4
|
| 16 | 15 | 19.20dv 946 |
. . 3
|
| 17 | alnex 716 |
. . . 4
| |
| 18 | exmo 1042 |
. . . . 5
| |
| 19 | 18 | ori 200 |
. . . 4
|
| 20 | 17, 19 | sylbi 174 |
. . 3
|
| 21 | 16, 20 | syl6 23 |
. 2
|
| 22 | 9, 21 | pm2.61i 110 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: aceq6b 3565 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-16 922 ax-17 925 ax-ext 1074 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-eu 1009 df-mo 1010 df-clab 1093 df-cleq 1097 df-clel 1099 df-v 1349 |