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 2279 | . 2 | |
2 | nfcv 2279 | . 2 | |
3 | cbvral.1 | . 2 | |
4 | cbvral.2 | . 2 | |
5 | cbvral.3 | . 2 | |
6 | 1, 2, 3, 4, 5 | cbvralf 2646 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wnf 1436 wral 2414 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-sb 1736 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ral 2419 |
This theorem is referenced by: cbvralv 2652 cbvralsv 2663 cbviin 3846 frind 4269 ralxpf 4680 eqfnfv2f 5515 ralrnmpt 5555 dff13f 5664 ofrfval2 5991 fmpox 6091 cbvixp 6602 mptelixpg 6621 xpf1o 6731 indstr 9381 fsum3 11149 fsum00 11224 mertenslem2 11298 cnmpt11 12441 cnmpt21 12449 bj-bdfindes 13136 bj-findes 13168 |
Copyright terms: Public domain | W3C validator |