Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvral | Unicode version |
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 31-Jul-2003.) |
Ref | Expression |
---|---|
cbvral.1 | |
cbvral.2 | |
cbvral.3 |
Ref | Expression |
---|---|
cbvral |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2306 | . 2 | |
2 | nfcv 2306 | . 2 | |
3 | cbvral.1 | . 2 | |
4 | cbvral.2 | . 2 | |
5 | cbvral.3 | . 2 | |
6 | 1, 2, 3, 4, 5 | cbvralf 2682 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wnf 1447 wral 2442 |
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-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-ext 2146 |
This theorem depends on definitions: df-bi 116 df-nf 1448 df-sb 1750 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ral 2447 |
This theorem is referenced by: cbvralv 2689 cbvralsv 2703 cbviin 3898 frind 4324 ralxpf 4744 eqfnfv2f 5581 ralrnmpt 5621 dff13f 5732 ofrfval2 6060 fmpox 6160 cbvixp 6672 mptelixpg 6691 xpf1o 6801 indstr 9522 fsum3 11314 fsum00 11389 mertenslem2 11463 fprodcl2lem 11532 fprodle 11567 ctiunctal 12317 cnmpt11 12830 cnmpt21 12838 bj-bdfindes 13672 bj-findes 13704 |
Copyright terms: Public domain | W3C validator |