| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Change of bound variable using implicit substitution. (The proof was shortened by Andrew Salmon, 8-Jun-2011.) |
| Ref | Expression |
|---|---|
| gencbvex.1 |
|
| gencbvex.2 |
|
| gencbvex.3 |
|
| gencbvex.4 |
|
| Ref | Expression |
|---|---|
| gencbvex |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | excom 1393 |
. 2
| |
| 2 | gencbvex.1 |
. . . 4
| |
| 3 | gencbvex.3 |
. . . . . . 7
| |
| 4 | gencbvex.2 |
. . . . . . 7
| |
| 5 | 3, 4 | anbi12d 690 |
. . . . . 6
|
| 6 | 5 | bicomd 580 |
. . . . 5
|
| 7 | 6 | eqcoms 1887 |
. . . 4
|
| 8 | 2, 7 | ceqsexv 2325 |
. . 3
|
| 9 | 8 | exbii 1398 |
. 2
|
| 10 | 19.41v 1685 |
. . . 4
| |
| 11 | simpr 350 |
. . . . 5
| |
| 12 | gencbvex.4 |
. . . . . . . 8
| |
| 13 | eqcom 1886 |
. . . . . . . . . . 11
| |
| 14 | 13 | biimpi 168 |
. . . . . . . . . 10
|
| 15 | 14 | adantl 424 |
. . . . . . . . 9
|
| 16 | 15 | eximi 1387 |
. . . . . . . 8
|
| 17 | 12, 16 | sylbi 216 |
. . . . . . 7
|
| 18 | 17 | adantr 425 |
. . . . . 6
|
| 19 | 18 | ancri 321 |
. . . . 5
|
| 20 | 11, 19 | impbii 174 |
. . . 4
|
| 21 | 10, 20 | bitri 190 |
. . 3
|
| 22 | 21 | exbii 1398 |
. 2
|
| 23 | 1, 9, 22 | 3bitr3i 198 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: gencbvex2 2336 gencbval 2337 suppsr 6374 supsrlem6 6382 supre 6412 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1304 ax-gen 1305 ax-12 1310 ax-17 1317 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-ext 1865 |
| This theorem depends on definitions: df-bi 164 df-an 242 df-ex 1327 df-sb 1536 df-clab 1872 df-cleq 1877 df-clel 1880 df-v 2294 |