| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Rule to change the bound variable in a restricted class abstraction, using implicit substitution. This version has bound variable hypotheses in place of distinct variable conditions. |
| Ref | Expression |
|---|---|
| cbvrab.1 |
|
| cbvrab.2 |
|
| cbvrab.3 |
|
| cbvrab.4 |
|
| cbvrab.5 |
|
| Ref | Expression |
|---|---|
| cbvrab |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-17 925 |
. . . . 5
| |
| 2 | cbvrab.2 |
. . . . 5
| |
| 3 | 1, 2 | hbel 1172 |
. . . 4
|
| 4 | cbvrab.3 |
. . . 4
| |
| 5 | 3, 4 | hban 704 |
. . 3
|
| 6 | ax-17 925 |
. . . . 5
| |
| 7 | cbvrab.1 |
. . . . 5
| |
| 8 | 6, 7 | hbel 1172 |
. . . 4
|
| 9 | cbvrab.4 |
. . . 4
| |
| 10 | 8, 9 | hban 704 |
. . 3
|
| 11 | eleq1 1149 |
. . . 4
| |
| 12 | cbvrab.5 |
. . . 4
| |
| 13 | 11, 12 | anbi12d 476 |
. . 3
|
| 14 | 5, 10, 13 | cbvab 1423 |
. 2
|
| 15 | df-rab 1208 |
. 2
| |
| 16 | df-rab 1208 |
. 2
| |
| 17 | 14, 15, 16 | 3eqtr4 1126 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: cbvrabv 1426 elrabsf 1456 iunrab 2022 scottexs 3543 scott0s 3544 hta 3619 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-16 922 ax-17 925 ax-ext 1074 |
| This theorem depends on definitions: df-bi 128 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-rab 1208 df-v 1349 |