| 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 3021.) (Contributed by NM, 10-Nov-2005.) (Revised by Mario Carneiro, 13-Oct-2016.) | 
| Ref | Expression | 
|---|---|
| sbciegft | 
 | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | sbc5 3013 | 
. . 3
 | |
| 2 | biimp 118 | 
. . . . . . . 8
 | |
| 3 | 2 | imim2i 12 | 
. . . . . . 7
 | 
| 4 | 3 | impd 254 | 
. . . . . 6
 | 
| 5 | 4 | alimi 1469 | 
. . . . 5
 | 
| 6 | 19.23t 1691 | 
. . . . . 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 1469 | 
. . . . 5
 | 
| 15 | 19.21t 1596 | 
. . . . . 6
 | |
| 16 | 15 | biimpa 296 | 
. . . . 5
 | 
| 17 | 14, 16 | sylan2 286 | 
. . . 4
 | 
| 18 | 17 | 3adant1 1017 | 
. . 3
 | 
| 19 | sbc6g 3014 | 
. . . 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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-ext 2178 | 
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-v 2765 df-sbc 2990 | 
| This theorem is referenced by: sbciegf 3021 sbciedf 3025 | 
| Copyright terms: Public domain | W3C validator |