| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Change of bound variable using implicit substitution. |
| Ref | Expression |
|---|---|
| gencbvex.1 |
|
| gencbvex.2 |
|
| gencbvex.3 |
|
| gencbvex.4 |
|
| Ref | Expression |
|---|---|
| gencbvex |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | excom 1045 |
. 2
| |
| 2 | gencbvex.1 |
. . . 4
| |
| 3 | gencbvex.3 |
. . . . . . 7
| |
| 4 | gencbvex.2 |
. . . . . . 7
| |
| 5 | 3, 4 | anbi12d 627 |
. . . . . 6
|
| 6 | 5 | bicomd 520 |
. . . . 5
|
| 7 | 6 | eqcoms 1476 |
. . . 4
|
| 8 | 2, 7 | ceqsexv 1832 |
. . 3
|
| 9 | 8 | exbii 1050 |
. 2
|
| 10 | anass 439 |
. . . 4
| |
| 11 | gencbvex.4 |
. . . . . 6
| |
| 12 | 3 | pm5.32i 644 |
. . . . . . . 8
|
| 13 | ancom 435 |
. . . . . . . 8
| |
| 14 | eqcom 1475 |
. . . . . . . . 9
| |
| 15 | 14 | anbi1i 481 |
. . . . . . . 8
|
| 16 | 12, 13, 15 | 3bitr3 181 |
. . . . . . 7
|
| 17 | 16 | exbii 1050 |
. . . . . 6
|
| 18 | 19.41v 1304 |
. . . . . 6
| |
| 19 | 11, 17, 18 | 3bitr 177 |
. . . . 5
|
| 20 | 19 | anbi1i 481 |
. . . 4
|
| 21 | 19.41v 1304 |
. . . 4
| |
| 22 | 10, 20, 21 | 3bitr4r 184 |
. . 3
|
| 23 | 22 | exbii 1050 |
. 2
|
| 24 | 1, 9, 23 | 3bitr3 181 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: gencbvex2 1836 gencbval 1837 suppsr 5205 supsrlem6 5213 supre 5243 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 961 ax-gen 962 ax-12 967 ax-17 970 ax-4 972 ax-5o 974 ax-6o 977 ax-9o 1122 ax-ext 1458 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 980 df-sb 1171 df-clab 1463 df-cleq 1468 df-clel 1471 df-v 1809 |