| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbval | Unicode version | ||
| Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 3-Oct-2016.) |
| Ref | Expression |
|---|---|
| cbval.1 |
|
| cbval.2 |
|
| cbval.3 |
|
| Ref | Expression |
|---|---|
| cbval |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbval.1 |
. . 3
| |
| 2 | 1 | nfri 1568 |
. 2
|
| 3 | cbval.2 |
. . 3
| |
| 4 | 3 | nfri 1568 |
. 2
|
| 5 | cbval.3 |
. 2
| |
| 6 | 2, 4, 5 | cbvalh 1801 |
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 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 |
| This theorem depends on definitions: df-bi 117 df-nf 1510 |
| This theorem is referenced by: sb8 1904 cbval2 1970 sb8eu 2092 abbi 2345 cleqf 2400 cbvralf 2759 ralab2 2971 cbvralcsf 3191 dfss2f 3219 elintab 3944 cbviota 5298 sb8iota 5301 dffun6f 5346 dffun4f 5349 mptfvex 5741 findcard2 7121 findcard2s 7122 |
| Copyright terms: Public domain | W3C validator |