![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > spsbcd | 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 1749 and rspsbc 2995. (Contributed by Mario Carneiro, 9-Feb-2017.) |
Ref | Expression |
---|---|
spsbcd.1 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
spsbcd.2 |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
spsbcd |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | spsbcd.1 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | spsbcd.2 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
3 | spsbc 2924 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
4 | 1, 2, 3 | sylc 62 |
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 105 ax-ia2 106 ax-ia3 107 ax-5 1424 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-v 2691 df-sbc 2914 |
This theorem is referenced by: ovmpodxf 5904 |
Copyright terms: Public domain | W3C validator |