| 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 969 |
. . . 4
| |
| 2 | cbvral.1 |
. . . 4
| |
| 3 | 1, 2 | hban 1007 |
. . 3
|
| 4 | ax-17 969 |
. . . 4
| |
| 5 | cbvral.2 |
. . . 4
| |
| 6 | 4, 5 | hban 1007 |
. . 3
|
| 7 | eleq1 1531 |
. . . 4
| |
| 8 | cbvral.3 |
. . . 4
| |
| 9 | 7, 8 | anbi12d 627 |
. . 3
|
| 10 | 3, 6, 9 | cbvex 1164 |
. 2
|
| 11 | df-rex 1647 |
. 2
| |
| 12 | df-rex 1647 |
. 2
| |
| 13 | 10, 11, 12 | 3bitr4 183 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: cbvrexv 1797 cbvrexsv 1964 cbviun 2584 isarep1 3569 elrnopabg 3791 abrexexlem2 3850 elrnoprabg 4114 cau3i 6859 |
| 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-ext 1457 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 979 df-cleq 1467 df-clel 1470 df-rex 1647 |