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

Theorem rspct 2900
Description: A closed version of rspc 2901. (Contributed by Andrew Salmon, 6-Jun-2011.)
Hypothesis
Ref Expression
rspct.1  |-  F/ x ps
Assertion
Ref Expression
rspct  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  ( A  e.  B  ->  ( A. x  e.  B  ph 
->  ps ) ) )
Distinct variable groups:    x, A    x, B
Allowed substitution hints:    ph( x)    ps( x)

Proof of Theorem rspct
StepHypRef Expression
1 df-ral 2513 . . . 4  |-  ( A. x  e.  B  ph  <->  A. x
( x  e.  B  ->  ph ) )
2 eleq1 2292 . . . . . . . . . 10  |-  ( x  =  A  ->  (
x  e.  B  <->  A  e.  B ) )
32adantr 276 . . . . . . . . 9  |-  ( ( x  =  A  /\  ( ph  <->  ps ) )  -> 
( x  e.  B  <->  A  e.  B ) )
4 simpr 110 . . . . . . . . 9  |-  ( ( x  =  A  /\  ( ph  <->  ps ) )  -> 
( ph  <->  ps ) )
53, 4imbi12d 234 . . . . . . . 8  |-  ( ( x  =  A  /\  ( ph  <->  ps ) )  -> 
( ( x  e.  B  ->  ph )  <->  ( A  e.  B  ->  ps )
) )
65ex 115 . . . . . . 7  |-  ( x  =  A  ->  (
( ph  <->  ps )  ->  (
( x  e.  B  ->  ph )  <->  ( A  e.  B  ->  ps )
) ) )
76a2i 11 . . . . . 6  |-  ( ( x  =  A  -> 
( ph  <->  ps ) )  -> 
( x  =  A  ->  ( ( x  e.  B  ->  ph )  <->  ( A  e.  B  ->  ps ) ) ) )
87alimi 1501 . . . . 5  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  A. x
( x  =  A  ->  ( ( x  e.  B  ->  ph )  <->  ( A  e.  B  ->  ps ) ) ) )
9 nfv 1574 . . . . . . 7  |-  F/ x  A  e.  B
10 rspct.1 . . . . . . 7  |-  F/ x ps
119, 10nfim 1618 . . . . . 6  |-  F/ x
( A  e.  B  ->  ps )
12 nfcv 2372 . . . . . 6  |-  F/_ x A
1311, 12spcgft 2880 . . . . 5  |-  ( A. x ( x  =  A  ->  ( (
x  e.  B  ->  ph )  <->  ( A  e.  B  ->  ps )
) )  ->  ( A  e.  B  ->  ( A. x ( x  e.  B  ->  ph )  ->  ( A  e.  B  ->  ps ) ) ) )
148, 13syl 14 . . . 4  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  ( A  e.  B  ->  ( A. x ( x  e.  B  ->  ph )  ->  ( A  e.  B  ->  ps ) ) ) )
151, 14syl7bi 165 . . 3  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  ( A  e.  B  ->  ( A. x  e.  B  ph 
->  ( A  e.  B  ->  ps ) ) ) )
1615com34 83 . 2  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  ( A  e.  B  ->  ( A  e.  B  -> 
( A. x  e.  B  ph  ->  ps ) ) ) )
1716pm2.43d 50 1  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  ( A  e.  B  ->  ( A. x  e.  B  ph 
->  ps ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1393    = wceq 1395   F/wnf 1506    e. wcel 2200   A.wral 2508
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-v 2801
This theorem is referenced by:  sumdc2  16163
  Copyright terms: Public domain W3C validator