| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Elimination of a restricted existential quantifier, using implicit substitution. |
| Ref | Expression |
|---|---|
| ceqsrex2v.1 |
|
| ceqsrex2v.2 |
|
| Ref | Expression |
|---|---|
| ceqsrex2v |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ceqsrex2v.1 |
. . . . . 6
| |
| 2 | 1 | anbi2d 618 |
. . . . 5
|
| 3 | 2 | rexbidv 1667 |
. . . 4
|
| 4 | 3 | ceqsrexv 1892 |
. . 3
|
| 5 | anass 441 |
. . . . . 6
| |
| 6 | 5 | rexbii 1671 |
. . . . 5
|
| 7 | r19.42v 1767 |
. . . . 5
| |
| 8 | 6, 7 | bitr 173 |
. . . 4
|
| 9 | 8 | rexbii 1671 |
. . 3
|
| 10 | 4, 9 | syl5bb 534 |
. 2
|
| 11 | ceqsrex2v.2 |
. . 3
| |
| 12 | 11 | ceqsrexv 1892 |
. 2
|
| 13 | 10, 12 | sylan9bb 542 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: brdom7disj 4814 brdom6disj 4815 dffsum 6998 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 964 ax-gen 965 ax-8 966 ax-12 970 ax-17 973 ax-4 975 ax-5o 977 ax-6o 980 ax-9o 1125 ax-16 1212 ax-11o 1220 ax-ext 1462 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 983 df-sb 1174 df-clab 1467 df-cleq 1472 df-clel 1475 df-rex 1653 df-v 1815 |