Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbvrabv | Unicode version |
Description: Rule to change the bound variable in a restricted class abstraction, using implicit substitution. (Contributed by NM, 26-May-1999.) |
Ref | Expression |
---|---|
cbvrabv.1 |
Ref | Expression |
---|---|
cbvrabv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcv 2308 | . 2 | |
2 | nfcv 2308 | . 2 | |
3 | nfv 1516 | . 2 | |
4 | nfv 1516 | . 2 | |
5 | cbvrabv.1 | . 2 | |
6 | 1, 2, 3, 4, 5 | cbvrab 2724 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wceq 1343 crab 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 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-rab 2453 |
This theorem is referenced by: pwnss 4138 acexmidlemv 5840 exmidac 7165 genipv 7450 ltexpri 7554 suplocsrlempr 7748 suplocsr 7750 zsupssdc 11887 sqne2sq 12109 eulerth 12165 odzval 12173 pcprecl 12221 pcprendvds 12222 pcpremul 12225 pceulem 12226 |
Copyright terms: Public domain | W3C validator |