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

Theorem spcgft 3285
Description: A closed version of spcgf 3288. (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 biimp 205 . . . 4  |-  ( (
ph 
<->  ps )  ->  ( ph  ->  ps ) )
21imim2i 16 . . 3  |-  ( ( x  =  A  -> 
( ph  <->  ps ) )  -> 
( x  =  A  ->  ( ph  ->  ps ) ) )
32alimi 1739 . 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 3284 . 2  |-  ( A. x ( x  =  A  ->  ( ph  ->  ps ) )  -> 
( A  e.  B  ->  ( A. x ph  ->  ps ) ) )
73, 6syl 17 1  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  ( A  e.  B  ->  ( 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:  spcgf  3288  rspct  3302
  Copyright terms: Public domain W3C validator