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

Theorem spcgf 3288
Description: Rule of specialization, using implicit substitution. Compare Theorem 7.3 of [Quine] p. 44. (Contributed by NM, 2-Feb-1997.) (Revised by Andrew Salmon, 12-Aug-2011.)
Hypotheses
Ref Expression
spcgf.1  |-  F/_ x A
spcgf.2  |-  F/ x ps
spcgf.3  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
spcgf  |-  ( A  e.  V  ->  ( A. x ph  ->  ps ) )

Proof of Theorem spcgf
StepHypRef Expression
1 spcgf.2 . . 3  |-  F/ x ps
2 spcgf.1 . . 3  |-  F/_ x A
31, 2spcgft 3285 . 2  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  ( A  e.  V  ->  ( A. x ph  ->  ps ) ) )
4 spcgf.3 . 2  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
53, 4mpg 1724 1  |-  ( A  e.  V  ->  ( A. x ph  ->  ps ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196   A.wal 1481    = wceq 1483   F/wnf 1708    e. wcel 1990   F/_wnfc 2751
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-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-v 3202
This theorem is referenced by:  spcegf  3289  spcgv  3293  rspc  3303  elabgt  3347  eusvnf  4861  gropd  25923  grstructd  25924
  Copyright terms: Public domain W3C validator