![]() |
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 2329 |
. 2
![]() ![]() ![]() ![]() | |
2 | nfcv 2329 |
. 2
![]() ![]() ![]() ![]() | |
3 | nfv 1538 |
. 2
![]() ![]() ![]() ![]() | |
4 | nfv 1538 |
. 2
![]() ![]() ![]() ![]() | |
5 | cbvrabv.1 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
6 | 1, 2, 3, 4, 5 | cbvrab 2747 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() ![]() |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-ext 2169 |
This theorem depends on definitions: df-bi 117 df-nf 1471 df-sb 1773 df-clab 2174 df-cleq 2180 df-clel 2183 df-nfc 2318 df-rab 2474 |
This theorem is referenced by: pwnss 4171 acexmidlemv 5886 exmidac 7222 genipv 7522 ltexpri 7626 suplocsrlempr 7820 suplocsr 7822 zsupssdc 11969 sqne2sq 12191 eulerth 12247 odzval 12255 pcprecl 12303 pcprendvds 12304 pcpremul 12307 pceulem 12308 |
Copyright terms: Public domain | W3C validator |