| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Elimination of a restricted existential quantifier, using implicit substitution. |
| Ref | Expression |
|---|---|
| ceqsrexv.1 |
|
| Ref | Expression |
|---|---|
| ceqsrexv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 1531 |
. . . . 5
| |
| 2 | ceqsrexv.1 |
. . . . 5
| |
| 3 | 1, 2 | anbi12d 627 |
. . . 4
|
| 4 | 3 | ceqsexgv 1884 |
. . 3
|
| 5 | 4 | bianabs 652 |
. 2
|
| 6 | df-rex 1647 |
. . 3
| |
| 7 | an12 484 |
. . . 4
| |
| 8 | 7 | exbii 1049 |
. . 3
|
| 9 | 6, 8 | bitr4 176 |
. 2
|
| 10 | 5, 9 | syl5bb 531 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ceqsrex2v 1886 reuxfr2 2898 f1oiso 3895 dfisum 7135 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 960 ax-gen 961 ax-8 962 ax-12 966 ax-17 969 ax-4 971 ax-5o 973 ax-6o 976 ax-9o 1121 ax-16 1208 ax-11o 1216 ax-ext 1457 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 979 df-sb 1170 df-clab 1462 df-cleq 1467 df-clel 1470 df-rex 1647 df-v 1808 |