| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvab | Unicode version | ||
| Description: Rule used to change bound variables, using implicit substitution. (Contributed by Andrew Salmon, 11-Jul-2011.) |
| Ref | Expression |
|---|---|
| cbvab.1 |
|
| cbvab.2 |
|
| cbvab.3 |
|
| Ref | Expression |
|---|---|
| cbvab |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvab.2 |
. . . . 5
| |
| 2 | 1 | nfsb 2006 |
. . . 4
|
| 3 | cbvab.1 |
. . . . . 6
| |
| 4 | cbvab.3 |
. . . . . . . 8
| |
| 5 | 4 | equcoms 1760 |
. . . . . . 7
|
| 6 | 5 | bicomd 141 |
. . . . . 6
|
| 7 | 3, 6 | sbie 1844 |
. . . . 5
|
| 8 | sbequ 1893 |
. . . . 5
| |
| 9 | 7, 8 | bitr3id 194 |
. . . 4
|
| 10 | 2, 9 | sbie 1844 |
. . 3
|
| 11 | df-clab 2225 |
. . 3
| |
| 12 | df-clab 2225 |
. . 3
| |
| 13 | 10, 11, 12 | 3bitr4i 212 |
. 2
|
| 14 | 13 | eqriv 2235 |
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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 |
| This theorem is referenced by: cbvabv 2365 cbvrab 2819 cbvsbc 3080 cbvrabcsf 3213 dfdmf 4969 dfrnf 5018 funfvdm2f 5762 abrexex2g 6339 abrexex2 6343 |
| Copyright terms: Public domain | W3C validator |