| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Rule used to change bound variables with implicit substitution. |
| Ref | Expression |
|---|---|
| cbvral.1 |
|
| cbvral.2 |
|
| cbvral.3 |
|
| Ref | Expression |
|---|---|
| cbvrex |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-17 973 |
. . . 4
| |
| 2 | cbvral.1 |
. . . 4
| |
| 3 | 1, 2 | hban 1011 |
. . 3
|
| 4 | ax-17 973 |
. . . 4
| |
| 5 | cbvral.2 |
. . . 4
| |
| 6 | 4, 5 | hban 1011 |
. . 3
|
| 7 | eleq1 1537 |
. . . 4
| |
| 8 | cbvral.3 |
. . . 4
| |
| 9 | 7, 8 | anbi12d 630 |
. . 3
|
| 10 | 3, 6, 9 | cbvex 1168 |
. 2
|
| 11 | df-rex 1653 |
. 2
| |
| 12 | df-rex 1653 |
. 2
| |
| 13 | 10, 11, 12 | 3bitr4 183 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: cbvrexv 1804 cbvrexsv 1971 cbviun 2593 isarep1 3583 elrnopabg 3806 abrexexlem2 3865 elrnoprabg 4130 cau3i 6914 |
| 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-ext 1462 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 983 df-cleq 1472 df-clel 1475 df-rex 1653 |