Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvalv | Unicode version |
Description: Rule used to change bound variables, using implicit substitition. (Contributed by NM, 5-Aug-1993.) |
Ref | Expression |
---|---|
cbvalv.1 |
Ref | Expression |
---|---|
cbvalv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-17 1506 | . 2 | |
2 | ax-17 1506 | . 2 | |
3 | cbvalv.1 | . 2 | |
4 | 1, 2, 3 | cbvalh 1733 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wal 1333 |
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 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 |
This theorem depends on definitions: df-bi 116 df-nf 1441 |
This theorem is referenced by: nfcjust 2287 cdeqal1 2928 dfss4st 3340 zfpow 4136 tfisi 4546 acexmid 5823 tfrlem3-2d 6259 tfrlemi1 6279 tfrexlem 6281 tfr1onlemaccex 6295 tfrcllemaccex 6308 findcard 6833 fisseneq 6876 genprndl 7441 genprndu 7442 zfz1iso 10712 |
Copyright terms: Public domain | W3C validator |