| 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 968 |
. . . 4
| |
| 2 | hbs1 1327 |
. . . . 5
| |
| 3 | hbs1 1327 |
. . . . 5
| |
| 4 | 2, 3 | hban 1006 |
. . . 4
|
| 5 | sbequ12 1177 |
. . . . 5
| |
| 6 | sbequ12 1177 |
. . . . 5
| |
| 7 | 5, 6 | anbi12d 626 |
. . . 4
|
| 8 | 1, 4, 7 | cbvex 1162 |
. . 3
|
| 9 | sbequ2 1175 |
. . . . . . . . 9
| |
| 10 | 9 | imim2i 17 |
. . . . . . . 8
|
| 11 | 10 | exp3a 375 |
. . . . . . 7
|
| 12 | 11 | com4t 40 |
. . . . . 6
|
| 13 | 12 | imp 350 |
. . . . 5
|
| 14 | ax-17 968 |
. . . . . . 7
| |
| 15 | 14 | mo3 1394 |
. . . . . 6
|
| 16 | ax-4 970 |
. . . . . . 7
| |
| 17 | 16 | a4s 981 |
. . . . . 6
|
| 18 | 15, 17 | sylbi 199 |
. . . . 5
|
| 19 | 13, 18 | syl5 21 |
. . . 4
|
| 20 | 19 | 19.23aiv 1290 |
. . 3
|
| 21 | 8, 20 | sylbi 199 |
. 2
|
| 22 | 21 | impcom 351 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: eupick 1427 mopick2 1429 moexex 1431 imadif 3560 |
| 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-17 968 ax-4 970 ax-5o 972 ax-6o 975 ax-9o 1119 ax-10o 1136 ax-16 1206 ax-11o 1213 |
| 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 |