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

Theorem rexlimd 2665
Description: Deduction from Theorem 19.23 of [Margaris] p. 90 (restricted quantifier version). (Contributed by NM, 27-May-1998.) (Proof shortened by Andrew Salmon, 30-May-2011.)
Hypotheses
Ref Expression
rexlimd.1  |-  F/ x ph
rexlimd.2  |-  F/ x ch
rexlimd.3  |-  ( ph  ->  ( x  e.  A  ->  ( ps  ->  ch ) ) )
Assertion
Ref Expression
rexlimd  |-  ( ph  ->  ( E. x  e.  A  ps  ->  ch ) )

Proof of Theorem rexlimd
StepHypRef Expression
1 rexlimd.1 . . 3  |-  F/ x ph
2 rexlimd.3 . . 3  |-  ( ph  ->  ( x  e.  A  ->  ( ps  ->  ch ) ) )
31, 2ralrimi 2621 . 2  |-  ( ph  ->  A. x  e.  A  ( ps  ->  ch )
)
4 rexlimd.2 . . 3  |-  F/ x ch
54r19.23 2659 . 2  |-  ( A. x  e.  A  ( ps  ->  ch )  <->  ( E. x  e.  A  ps  ->  ch ) )
63, 5sylib 122 1  |-  ( ph  ->  ( E. x  e.  A  ps  ->  ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4   F/wnf 1513    e. wcel 2209   A.wral 2528   E.wrex 2529
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-5 1500  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-4 1563  ax-ial 1587  ax-i5r 1588
This theorem depends on definitions:  df-bi 117  df-nf 1514  df-ral 2533  df-rex 2534
This theorem is referenced by:  rexlimdv  2667  ralxfrALT  4608  fvmptt  5791  ffnfv  5857  elabreximd  6346  nneneq  7148  ac6sfi  7192  prarloclem3step  7853  prmuloc2  7924  caucvgprprlemaddq  8065  axpre-suploclemres  8258  lbzbi  9995  reuccatpfxs1  11497  divalglemeunn  12666  divalglemeuneg  12668  oddpwdclemdvds  12926  oddpwdclemndvds  12927  trirec0  16998
  Copyright terms: Public domain W3C validator