Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rspcdv | Unicode version |
Description: Restricted specialization, using implicit substitution. (Contributed by NM, 17-Feb-2007.) (Revised by Mario Carneiro, 4-Jan-2017.) |
Ref | Expression |
---|---|
rspcdv.1 | |
rspcdv.2 |
Ref | Expression |
---|---|
rspcdv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rspcdv.1 | . 2 | |
2 | rspcdv.2 | . . 3 | |
3 | 2 | biimpd 144 | . 2 |
4 | 1, 3 | rspcimdv 2840 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 104 wb 105 wceq 1353 wcel 2146 wral 2453 |
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 709 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-ext 2157 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1459 df-sb 1761 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-ral 2458 df-v 2737 |
This theorem is referenced by: ralxfrd 4456 prloc 7465 zindd 9342 |
Copyright terms: Public domain | W3C validator |