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 142 | . 2 |
4 | 1, 3 | rspcimdv 2702 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 102 wb 103 wceq 1284 wcel 1433 wral 2348 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-v 2603 |
This theorem is referenced by: rspcdva 2707 ralxfrd 4212 prloc 6681 zindd 8465 |
Copyright terms: Public domain | W3C validator |