| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sbciegft | Unicode version | ||
| Description: Conversion of implicit substitution to explicit class substitution, using a bound-variable hypothesis instead of distinct variables. (Closed theorem version of sbciegf 3029.) (Contributed by NM, 10-Nov-2005.) (Revised by Mario Carneiro, 13-Oct-2016.) |
| Ref | Expression |
|---|---|
| sbciegft |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbc5 3021 |
. . 3
| |
| 2 | biimp 118 |
. . . . . . . 8
| |
| 3 | 2 | imim2i 12 |
. . . . . . 7
|
| 4 | 3 | impd 254 |
. . . . . 6
|
| 5 | 4 | alimi 1477 |
. . . . 5
|
| 6 | 19.23t 1699 |
. . . . . 6
| |
| 7 | 6 | biimpa 296 |
. . . . 5
|
| 8 | 5, 7 | sylan2 286 |
. . . 4
|
| 9 | 8 | 3adant1 1017 |
. . 3
|
| 10 | 1, 9 | biimtrid 152 |
. 2
|
| 11 | biimpr 130 |
. . . . . . . 8
| |
| 12 | 11 | imim2i 12 |
. . . . . . 7
|
| 13 | 12 | com23 78 |
. . . . . 6
|
| 14 | 13 | alimi 1477 |
. . . . 5
|
| 15 | 19.21t 1604 |
. . . . . 6
| |
| 16 | 15 | biimpa 296 |
. . . . 5
|
| 17 | 14, 16 | sylan2 286 |
. . . 4
|
| 18 | 17 | 3adant1 1017 |
. . 3
|
| 19 | sbc6g 3022 |
. . . 4
| |
| 20 | 19 | 3ad2ant1 1020 |
. . 3
|
| 21 | 18, 20 | sylibrd 169 |
. 2
|
| 22 | 10, 21 | impbid 129 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-ext 2186 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-nf 1483 df-sb 1785 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-v 2773 df-sbc 2998 |
| This theorem is referenced by: sbciegf 3029 sbciedf 3033 |
| Copyright terms: Public domain | W3C validator |