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

Theorem spcgft 2964
Description: A closed version of spcgf 2967. (Contributed by Andrew Salmon, 6-Jun-2011.) (Revised by Mario Carneiro, 4-Jan-2017.)
Hypotheses
Ref Expression
spcimgft.1  |-  F/ x ps
spcimgft.2  |-  F/_ x A
Assertion
Ref Expression
spcgft  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  ( A  e.  B  ->  ( A. x ph  ->  ps ) ) )

Proof of Theorem spcgft
StepHypRef Expression
1 bi1 179 . . . 4  |-  ( (
ph 
<->  ps )  ->  ( ph  ->  ps ) )
21imim2i 14 . . 3  |-  ( ( x  =  A  -> 
( ph  <->  ps ) )  -> 
( x  =  A  ->  ( ph  ->  ps ) ) )
32alimi 1565 . 2  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  A. x
( x  =  A  ->  ( ph  ->  ps ) ) )
4 spcimgft.1 . . 3  |-  F/ x ps
5 spcimgft.2 . . 3  |-  F/_ x A
64, 5spcimgft 2963 . 2  |-  ( A. x ( x  =  A  ->  ( ph  ->  ps ) )  -> 
( A  e.  B  ->  ( A. x ph  ->  ps ) ) )
73, 6syl 16 1  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  ( A  e.  B  ->  ( A. x ph  ->  ps ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177   A.wal 1546   F/wnf 1550    = wceq 1649    e. wcel 1717   F/_wnfc 2503
This theorem is referenced by:  spcgf  2967  rspct  2981
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2361
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2367  df-cleq 2373  df-clel 2376  df-nfc 2505  df-v 2894
  Copyright terms: Public domain W3C validator