| 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 1567 |
. 2
|
| 3 | cbval.2 |
. . 3
| |
| 4 | 3 | nfri 1567 |
. 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 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 |
| This theorem depends on definitions: df-bi 117 df-nf 1509 |
| This theorem is referenced by: sb8 1904 cbval2 1970 sb8eu 2092 abbi 2345 cleqf 2399 cbvralf 2758 ralab2 2970 cbvralcsf 3190 dfss2f 3218 elintab 3939 cbviota 5291 sb8iota 5294 dffun6f 5339 dffun4f 5342 mptfvex 5732 findcard2 7077 findcard2s 7078 |
| Copyright terms: Public domain | W3C validator |