| 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 1565 |
. 2
|
| 3 | cbval.2 |
. . 3
| |
| 4 | 3 | nfri 1565 |
. 2
|
| 5 | cbval.3 |
. 2
| |
| 6 | 2, 4, 5 | cbvalh 1799 |
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 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 |
| This theorem depends on definitions: df-bi 117 df-nf 1507 |
| This theorem is referenced by: sb8 1902 cbval2 1968 sb8eu 2090 abbi 2343 cleqf 2397 cbvralf 2756 ralab2 2967 cbvralcsf 3187 dfss2f 3215 elintab 3933 cbviota 5282 sb8iota 5285 dffun6f 5330 dffun4f 5333 mptfvex 5719 findcard2 7047 findcard2s 7048 |
| Copyright terms: Public domain | W3C validator |