| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Introduce a disjunct into a uniqueness quantifier. |
| Ref | Expression |
|---|---|
| euor.1 |
|
| Ref | Expression |
|---|---|
| euor |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | euor.1 |
. . . 4
| |
| 2 | 1 | hbn 1004 |
. . 3
|
| 3 | biorf 735 |
. . 3
| |
| 4 | 2, 3 | eubid 1385 |
. 2
|
| 5 | 4 | biimpa 416 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: euorv 1399 euor2 1437 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 963 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 981 df-eu 1382 |