ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  spcegft Unicode version

Theorem spcegft 2765
Description: A closed version of spcegf 2769. (Contributed by Jim Kingdon, 22-Jun-2018.)
Hypotheses
Ref Expression
spcimgft.1  |-  F/ x ps
spcimgft.2  |-  F/_ x A
Assertion
Ref Expression
spcegft  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  ( A  e.  B  ->  ( ps  ->  E. x ph ) ) )

Proof of Theorem spcegft
StepHypRef Expression
1 bi2 129 . . . 4  |-  ( (
ph 
<->  ps )  ->  ( ps  ->  ph ) )
21imim2i 12 . . 3  |-  ( ( x  =  A  -> 
( ph  <->  ps ) )  -> 
( x  =  A  ->  ( ps  ->  ph ) ) )
32alimi 1431 . 2  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  A. x
( x  =  A  ->  ( ps  ->  ph ) ) )
4 spcimgft.1 . . 3  |-  F/ x ps
5 spcimgft.2 . . 3  |-  F/_ x A
64, 5spcimegft 2764 . 2  |-  ( A. x ( x  =  A  ->  ( ps  ->  ph ) )  -> 
( A  e.  B  ->  ( ps  ->  E. x ph ) ) )
73, 6syl 14 1  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  ( A  e.  B  ->  ( ps  ->  E. x ph ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104   A.wal 1329    = wceq 1331   F/wnf 1436   E.wex 1468    e. wcel 1480   F/_wnfc 2268
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-v 2688
This theorem is referenced by:  spcegf  2769
  Copyright terms: Public domain W3C validator