![]() |
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 2336 |
. 2
![]() ![]() ![]() ![]() | |
2 | nfcv 2336 |
. 2
![]() ![]() ![]() ![]() | |
3 | nfv 1539 |
. 2
![]() ![]() ![]() ![]() | |
4 | nfv 1539 |
. 2
![]() ![]() ![]() ![]() | |
5 | cbvrabv.1 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
6 | 1, 2, 3, 4, 5 | cbvrab 2758 |
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 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-ext 2175 |
This theorem depends on definitions: df-bi 117 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-rab 2481 |
This theorem is referenced by: pwnss 4189 acexmidlemv 5917 exmidac 7271 genipv 7571 ltexpri 7675 suplocsrlempr 7869 suplocsr 7871 zsupssdc 12094 nninfctlemfo 12180 sqne2sq 12318 eulerth 12374 odzval 12382 pcprecl 12430 pcprendvds 12431 pcpremul 12434 pceulem 12435 4sqlem19 12550 |
Copyright terms: Public domain | W3C validator |