New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > rspccv | Unicode version |
Description: Restricted specialization, using implicit substitution. (Contributed by NM, 2-Feb-2006.) |
Ref | Expression |
---|---|
rspcv.1 |
Ref | Expression |
---|---|
rspccv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rspcv.1 | . . 3 | |
2 | 1 | rspcv 2952 | . 2 |
3 | 2 | com12 27 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 176 wceq 1642 wcel 1710 wral 2615 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-5 1557 ax-17 1616 ax-9 1654 ax-8 1675 ax-6 1729 ax-7 1734 ax-11 1746 ax-12 1925 ax-ext 2334 |
This theorem depends on definitions: df-bi 177 df-or 359 df-an 360 df-tru 1319 df-ex 1542 df-nf 1545 df-sb 1649 df-clab 2340 df-cleq 2346 df-clel 2349 df-nfc 2479 df-ral 2620 df-v 2862 |
This theorem is referenced by: elinti 3936 pw1disj 4168 peano2 4404 nndisjeq 4430 nnadjoin 4521 tfinnn 4535 fvun1 5380 refd 5928 nclenn 6250 nnc3n3p1 6279 nchoicelem12 6301 nchoicelem17 6306 |
Copyright terms: Public domain | W3C validator |