| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Theorem to move a substitution in and out of a class abstraction. (Unnecessary distinct variable restrictions were removed by Andrew Salmon, 11-Jul-2011.) |
| Ref | Expression |
|---|---|
| sbabel.1 |
|
| Ref | Expression |
|---|---|
| sbabel |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbex 1739 |
. . 3
| |
| 2 | sban 1607 |
. . . . 5
| |
| 3 | sbal 1738 |
. . . . . . . 8
| |
| 4 | ax-17 1317 |
. . . . . . . . . . 11
| |
| 5 | 4 | sbf 1551 |
. . . . . . . . . 10
|
| 6 | 5 | sbrbis 1611 |
. . . . . . . . 9
|
| 7 | 6 | albii 1346 |
. . . . . . . 8
|
| 8 | 3, 7 | bitri 190 |
. . . . . . 7
|
| 9 | abeq2 1999 |
. . . . . . . 8
| |
| 10 | 9 | sbbii 1538 |
. . . . . . 7
|
| 11 | abeq2 1999 |
. . . . . . 7
| |
| 12 | 8, 10, 11 | 3bitr4i 200 |
. . . . . 6
|
| 13 | sbabel.1 |
. . . . . . . 8
| |
| 14 | 13 | hblem 1993 |
. . . . . . 7
|
| 15 | 14 | sbf 1551 |
. . . . . 6
|
| 16 | 12, 15 | anbi12i 540 |
. . . . 5
|
| 17 | 2, 16 | bitri 190 |
. . . 4
|
| 18 | 17 | exbii 1398 |
. . 3
|
| 19 | 1, 18 | bitri 190 |
. 2
|
| 20 | df-clel 1880 |
. . 3
| |
| 21 | 20 | sbbii 1538 |
. 2
|
| 22 | df-clel 1880 |
. 2
| |
| 23 | 19, 21, 22 | 3bitr4i 200 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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-8 1306 ax-9 1307 ax-10 1308 ax-11 1309 ax-12 1310 ax-17 1317 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-10o 1500 ax-16 1580 ax-11o 1588 ax-ext 1865 |
| This theorem depends on definitions: df-bi 164 df-or 241 df-an 242 df-ex 1327 df-sb 1536 df-clab 1872 df-cleq 1877 df-clel 1880 |