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 2312 | . 2 | |
2 | nfcv 2312 | . 2 | |
3 | cbvral.1 | . 2 | |
4 | cbvral.2 | . 2 | |
5 | cbvral.3 | . 2 | |
6 | 1, 2, 3, 4, 5 | cbvralf 2689 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wnf 1453 wral 2448 |
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 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-ext 2152 |
This theorem depends on definitions: df-bi 116 df-nf 1454 df-sb 1756 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 |
This theorem is referenced by: cbvralv 2696 cbvralsv 2712 cbviin 3911 frind 4337 ralxpf 4757 eqfnfv2f 5597 ralrnmpt 5638 dff13f 5749 ofrfval2 6077 fmpox 6179 cbvixp 6693 mptelixpg 6712 xpf1o 6822 indstr 9552 fsum3 11350 fsum00 11425 mertenslem2 11499 fprodcl2lem 11568 fprodle 11603 ctiunctal 12396 cnmpt11 13077 cnmpt21 13085 bj-bdfindes 13984 bj-findes 14016 |
Copyright terms: Public domain | W3C validator |