| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Rule used to change bound variables with implicit substitution. |
| Ref | Expression |
|---|---|
| cbval2.1 |
|
| cbval2.2 |
|
| cbval2.3 |
|
| cbval2.4 |
|
| cbval2.5 |
|
| Ref | Expression |
|---|---|
| cbval2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbval2.1 |
. . 3
| |
| 2 | 1 | hbal 1005 |
. 2
|
| 3 | cbval2.3 |
. . 3
| |
| 4 | 3 | hbal 1005 |
. 2
|
| 5 | ax-17 971 |
. . . . . 6
| |
| 6 | cbval2.2 |
. . . . . 6
| |
| 7 | 5, 6 | hban 1009 |
. . . . 5
|
| 8 | ax-17 971 |
. . . . . 6
| |
| 9 | cbval2.4 |
. . . . . 6
| |
| 10 | 8, 9 | hban 1009 |
. . . . 5
|
| 11 | cbval2.5 |
. . . . . . 7
| |
| 12 | 11 | expcom 374 |
. . . . . 6
|
| 13 | 12 | pm5.32d 647 |
. . . . 5
|
| 14 | 7, 10, 13 | cbval 1165 |
. . . 4
|
| 15 | 8 | 19.28 1070 |
. . . 4
|
| 16 | 5 | 19.28 1070 |
. . . 4
|
| 17 | 14, 15, 16 | 3bitr3 181 |
. . 3
|
| 18 | pm5.32 644 |
. . 3
| |
| 19 | 17, 18 | mpbir 190 |
. 2
|
| 20 | 2, 4, 19 | cbval 1165 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: cbval2v 1318 2mo 1447 2eu6 1454 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 962 ax-gen 963 ax-8 964 ax-12 968 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 |
| This theorem depends on definitions: df-bi 147 df-an 225 |