| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Existence in terms of "at most one" and uniqueness. |
| Ref | Expression |
|---|---|
| exmoeu |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-mo 1376 |
. . . 4
| |
| 2 | 1 | biimp 151 |
. . 3
|
| 3 | 2 | com12 11 |
. 2
|
| 4 | 1 | biimpr 152 |
. . . 4
|
| 5 | euex 1387 |
. . . 4
| |
| 6 | 4, 5 | imim12i 18 |
. . 3
|
| 7 | peirce 82 |
. . 3
| |
| 8 | 6, 7 | syl 10 |
. 2
|
| 9 | 3, 8 | impbi 157 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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 |