| 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 728 |
. 2
| |
| 2 | gencbvex.1 |
. . . 4
| |
| 3 | gencbvex.3 |
. . . . . . 7
| |
| 4 | gencbvex.2 |
. . . . . . 7
| |
| 5 | 3, 4 | anbi12d 476 |
. . . . . 6
|
| 6 | 5 | bicomd 399 |
. . . . 5
|
| 7 | 6 | cleqcoms 1104 |
. . . 4
|
| 8 | 2, 7 | ceqsexv 1371 |
. . 3
|
| 9 | 8 | biex 733 |
. 2
|
| 10 | anass 336 |
. . . 4
| |
| 11 | gencbvex.4 |
. . . . . 6
| |
| 12 | 3 | pm5.32i 489 |
. . . . . . . 8
|
| 13 | ancom 333 |
. . . . . . . 8
| |
| 14 | cleqcom 1103 |
. . . . . . . . 9
| |
| 15 | 14 | anbi1i 368 |
. . . . . . . 8
|
| 16 | 12, 13, 15 | 3bitr3 156 |
. . . . . . 7
|
| 17 | 16 | biex 733 |
. . . . . 6
|
| 18 | 19.41v 963 |
. . . . . 6
| |
| 19 | 11, 17, 18 | 3bitr 155 |
. . . . 5
|
| 20 | 19 | anbi1i 368 |
. . . 4
|
| 21 | 19.41v 963 |
. . . 4
| |
| 22 | 10, 20, 21 | 3bitr4r 159 |
. . 3
|
| 23 | 22 | biex 733 |
. 2
|
| 24 | 1, 9, 23 | 3bitr3 156 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: gencbval 1373 suppsr 4016 supsrlem6 4024 supre 4054 |
| 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-9 799 ax-12 802 ax-17 925 ax-ext 1074 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-v 1349 |