| 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 15757. (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 15720 |
. 2
|
| 3 | sbsbc 3001 |
. 2
| |
| 4 | 2, 3 | bd0 15722 |
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 1469 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-4 1532 ax-17 1548 ax-ial 1556 ax-ext 2186 ax-bd0 15711 ax-bdsb 15720 |
| This theorem depends on definitions: df-bi 117 df-clab 2191 df-cleq 2197 df-clel 2200 df-sbc 2998 |
| This theorem is referenced by: bdccsb 15758 |
| Copyright terms: Public domain | W3C validator |