| Mathbox for BJ | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > bdsbc | Unicode version | ||
| Description: A formula resulting from proper substitution of a setvar for a setvar in a bounded formula is bounded. See also bdsbcALT 15505. (Contributed by BJ, 16-Oct-2019.) | 
| Ref | Expression | 
|---|---|
| bdcsbc.1 | 
 | 
| Ref | Expression | 
|---|---|
| bdsbc | 
 | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | bdcsbc.1 | 
. . 3
 | |
| 2 | 1 | ax-bdsb 15468 | 
. 2
 | 
| 3 | sbsbc 2993 | 
. 2
 | |
| 4 | 2, 3 | bd0 15470 | 
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-5 1461 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-4 1524 ax-17 1540 ax-ial 1548 ax-ext 2178 ax-bd0 15459 ax-bdsb 15468 | 
| This theorem depends on definitions: df-bi 117 df-clab 2183 df-cleq 2189 df-clel 2192 df-sbc 2990 | 
| This theorem is referenced by: bdccsb 15506 | 
| Copyright terms: Public domain | W3C validator |