| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Formula-building rule for uniqueness quantifier (deduction rule). |
| Ref | Expression |
|---|---|
| eubid.1 |
|
| eubid.2 |
|
| Ref | Expression |
|---|---|
| eubid |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eubid.1 |
. . . 4
| |
| 2 | eubid.2 |
. . . . 5
| |
| 3 | 2 | bibi1d 617 |
. . . 4
|
| 4 | 1, 3 | albid 1080 |
. . 3
|
| 5 | 4 | exbidv 1261 |
. 2
|
| 6 | df-eu 1359 |
. 2
| |
| 7 | df-eu 1359 |
. 2
| |
| 8 | 5, 6, 7 | 3bitr4g 553 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: eubidv 1363 eubii 1364 euor 1375 mobid 1381 reueq1f 1761 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-4 951 ax-5 952 ax-gen 955 ax-17 1190 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 957 df-eu 1359 |