| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Formula-building rule for uniqueness quantifier (deduction rule). |
| Ref | Expression |
|---|---|
| eubidv.1 |
|
| Ref | Expression |
|---|---|
| eubidv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-17 971 |
. 2
| |
| 2 | eubidv.1 |
. 2
| |
| 3 | 1, 2 | eubid 1385 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: reubidva 1779 eueq2 1918 eueq3 1919 moeq3 1921 reuhyp 2905 fneu 3592 feu 3647 tz6.12-2 3739 fnbrfvb 3753 dff2 3817 dff3 3818 aceq5lem5 4739 aceq5 4740 kmlem2 4766 kmlem12 4776 kmlem13 4777 supxrre 6083 pjtheut 9236 |
| 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 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 981 df-eu 1382 |