Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvsbc | Unicode version |
Description: Change bound variables in a wff substitution. (Contributed by Jeff Hankins, 19-Sep-2009.) (Proof shortened by Andrew Salmon, 8-Jun-2011.) |
Ref | Expression |
---|---|
cbvsbc.1 | |
cbvsbc.2 | |
cbvsbc.3 |
Ref | Expression |
---|---|
cbvsbc |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvsbc.1 | . . . 4 | |
2 | cbvsbc.2 | . . . 4 | |
3 | cbvsbc.3 | . . . 4 | |
4 | 1, 2, 3 | cbvab 2290 | . . 3 |
5 | 4 | eleq2i 2233 | . 2 |
6 | df-sbc 2952 | . 2 | |
7 | df-sbc 2952 | . 2 | |
8 | 5, 6, 7 | 3bitr4i 211 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wnf 1448 wcel 2136 cab 2151 wsbc 2951 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-sbc 2952 |
This theorem is referenced by: cbvsbcv 2980 cbvcsb 3050 |
Copyright terms: Public domain | W3C validator |