ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  spsbcd Unicode version

Theorem spsbcd 2967
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 1768 and rspsbc 3037. (Contributed by Mario Carneiro, 9-Feb-2017.)
Hypotheses
Ref Expression
spsbcd.1  |-  ( ph  ->  A  e.  V )
spsbcd.2  |-  ( ph  ->  A. x ps )
Assertion
Ref Expression
spsbcd  |-  ( ph  ->  [. A  /  x ]. ps )

Proof of Theorem spsbcd
StepHypRef Expression
1 spsbcd.1 . 2  |-  ( ph  ->  A  e.  V )
2 spsbcd.2 . 2  |-  ( ph  ->  A. x ps )
3 spsbc 2966 . 2  |-  ( A  e.  V  ->  ( A. x ps  ->  [. A  /  x ]. ps )
)
41, 2, 3sylc 62 1  |-  ( ph  ->  [. A  /  x ]. ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1346    e. wcel 2141   [.wsbc 2955
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 1440  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-v 2732  df-sbc 2956
This theorem is referenced by:  ovmpodxf  5978
  Copyright terms: Public domain W3C validator