![]() |
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 1453 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
3 | cbval.2 |
. . 3
![]() ![]() ![]() ![]() | |
4 | 3 | nfri 1453 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
5 | cbval.3 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
6 | 2, 4, 5 | cbvalh 1677 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() ![]() |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1377 ax-7 1378 ax-gen 1379 ax-ie1 1423 ax-ie2 1424 ax-8 1436 ax-4 1441 ax-17 1460 ax-i9 1464 ax-ial 1468 |
This theorem depends on definitions: df-bi 115 df-nf 1391 |
This theorem is referenced by: sb8 1778 cbval2 1838 sb8eu 1955 abbi 2193 cleqf 2243 cbvralf 2572 ralab2 2757 cbvralcsf 2965 dfss2f 2991 elintab 3655 cbviota 4902 sb8iota 4904 dffun6f 4945 dffun4f 4948 mptfvex 5288 findcard2 6423 findcard2s 6424 |
Copyright terms: Public domain | W3C validator |