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

Theorem spcdv 2866
Description: Rule of specialization, using implicit substitution. Analogous to rspcdv 2887. (Contributed by David Moews, 1-May-2017.)
Hypotheses
Ref Expression
spcimdv.1  |-  ( ph  ->  A  e.  B )
spcdv.2  |-  ( (
ph  /\  x  =  A )  ->  ( ps 
<->  ch ) )
Assertion
Ref Expression
spcdv  |-  ( ph  ->  ( A. x ps 
->  ch ) )
Distinct variable groups:    x, A    ph, x    ch, x
Allowed substitution hints:    ps( x)    B( x)

Proof of Theorem spcdv
StepHypRef Expression
1 spcimdv.1 . 2  |-  ( ph  ->  A  e.  B )
2 spcdv.2 . . 3  |-  ( (
ph  /\  x  =  A )  ->  ( ps 
<->  ch ) )
32biimpd 198 . 2  |-  ( (
ph  /\  x  =  A )  ->  ( ps  ->  ch ) )
41, 3spcimdv 2865 1  |-  ( ph  ->  ( A. x ps 
->  ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358   A.wal 1527    = wceq 1623    e. wcel 1684
This theorem is referenced by:  mrissmrcd  13542
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-v 2790
  Copyright terms: Public domain W3C validator