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 1499 | . 2 |
3 | cbval.2 | . . 3 | |
4 | 3 | nfri 1499 | . 2 |
5 | cbval.3 | . 2 | |
6 | 2, 4, 5 | cbvalh 1726 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wal 1329 wnf 1436 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 |
This theorem depends on definitions: df-bi 116 df-nf 1437 |
This theorem is referenced by: sb8 1828 cbval2 1893 sb8eu 2012 abbi 2253 cleqf 2305 cbvralf 2648 ralab2 2848 cbvralcsf 3062 dfss2f 3088 elintab 3782 cbviota 5093 sb8iota 5095 dffun6f 5136 dffun4f 5139 mptfvex 5506 findcard2 6783 findcard2s 6784 |
Copyright terms: Public domain | W3C validator |