Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > spsbc | Unicode version |
Description: Specialization: if a formula is true for all sets, it is true for any class which is a set. Similar to Theorem 6.11 of [Quine] p. 44. See also stdpc4 1698 and rspsbc 2896. (Contributed by NM, 16-Jan-2004.) |
Ref | Expression |
---|---|
spsbc |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | stdpc4 1698 | . . . 4 | |
2 | sbsbc 2819 | . . . 4 | |
3 | 1, 2 | sylib 120 | . . 3 |
4 | dfsbcq 2817 | . . 3 | |
5 | 3, 4 | syl5ib 152 | . 2 |
6 | 5 | vtocleg 2669 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wal 1282 wceq 1284 wcel 1433 wsb 1685 wsbc 2815 |
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-5 1376 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-v 2603 df-sbc 2816 |
This theorem is referenced by: spsbcd 2827 sbcth 2828 sbcthdv 2829 sbceqal 2869 sbcimdv 2879 csbiebt 2942 csbexga 3906 |
Copyright terms: Public domain | W3C validator |