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 2219 | . 2 | |
2 | nfcv 2219 | . 2 | |
3 | cbvral.1 | . 2 | |
4 | cbvral.2 | . 2 | |
5 | cbvral.3 | . 2 | |
6 | 1, 2, 3, 4, 5 | cbvralf 2571 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 103 wnf 1389 wral 2348 |
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-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-nf 1390 df-sb 1686 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 |
This theorem is referenced by: cbvralv 2577 cbvralsv 2588 cbviin 3716 frind 4107 ralxpf 4500 eqfnfv2f 5290 ralrnmpt 5330 dff13f 5430 ofrfval2 5747 fmpt2x 5846 indstr 8681 bj-bdfindes 10744 bj-findes 10776 |
Copyright terms: Public domain | W3C validator |