MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  spsbcd Structured version   Visualization version   Unicode version

Theorem spsbcd 3449
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 2353 and rspsbc 3518. (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 3448 . 2  |-  ( A  e.  V  ->  ( A. x ps  ->  [. A  /  x ]. ps )
)
41, 2, 3sylc 65 1  |-  ( ph  ->  [. A  /  x ]. ps )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4   A.wal 1481    e. wcel 1990   [.wsbc 3435
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-an 386  df-tru 1486  df-ex 1705  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-v 3202  df-sbc 3436
This theorem is referenced by:  ovmpt2dxf  6786  ex-natded9.26  27276  spsbcdi  33923  ovmpt2rdxf  42117
  Copyright terms: Public domain W3C validator