| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: "At most one" picks a variable value, eliminating an existential quantifier. |
| Ref | Expression |
|---|---|
| mopick |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-17 925 |
. . . . 5
| |
| 2 | hbs1 986 |
. . . . . 6
| |
| 3 | hbs1 986 |
. . . . . 6
| |
| 4 | 2, 3 | hban 704 |
. . . . 5
|
| 5 | sbequ12 865 |
. . . . . 6
| |
| 6 | sbequ12 865 |
. . . . . 6
| |
| 7 | 5, 6 | anbi12d 476 |
. . . . 5
|
| 8 | 1, 4, 7 | cbvex 849 |
. . . 4
|
| 9 | sbequ2 864 |
. . . . . . . . . 10
| |
| 10 | 9 | syl3 18 |
. . . . . . . . 9
|
| 11 | 10 | exp3a 292 |
. . . . . . . 8
|
| 12 | 11 | com4t 40 |
. . . . . . 7
|
| 13 | 12 | imp 277 |
. . . . . 6
|
| 14 | ax-17 925 |
. . . . . . . 8
| |
| 15 | 14 | mo3 1027 |
. . . . . . 7
|
| 16 | ax-4 673 |
. . . . . . . 8
| |
| 17 | 16 | a4s 682 |
. . . . . . 7
|
| 18 | 15, 17 | sylbi 174 |
. . . . . 6
|
| 19 | 13, 18 | syl5 22 |
. . . . 5
|
| 20 | 19 | 19.23aiv 952 |
. . . 4
|
| 21 | 8, 20 | sylbi 174 |
. . 3
|
| 22 | 21 | com12 13 |
. 2
|
| 23 | 22 | imp 277 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: eupick 1055 mopick2 1057 moexex 1058 imadif 2714 |
| 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 |
| 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 |