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

Theorem rexralbidv 2568
Description: Formula-building rule for restricted quantifiers (deduction form). (Contributed by NM, 28-Jan-2006.)
Hypothesis
Ref Expression
2ralbidv.1  |-  ( ph  ->  ( ps  <->  ch )
)
Assertion
Ref Expression
rexralbidv  |-  ( ph  ->  ( E. x  e.  A  A. y  e.  B  ps  <->  E. x  e.  A  A. y  e.  B  ch )
)
Distinct variable groups:    ph, x    ph, y
Allowed substitution hints:    ps( x, y)    ch( x, y)    A( x, y)    B( x, y)

Proof of Theorem rexralbidv
StepHypRef Expression
1 2ralbidv.1 . . 3  |-  ( ph  ->  ( ps  <->  ch )
)
21ralbidv 2542 . 2  |-  ( ph  ->  ( A. y  e.  B  ps  <->  A. y  e.  B  ch )
)
32rexbidv 2543 1  |-  ( ph  ->  ( E. x  e.  A  A. y  e.  B  ps  <->  E. x  e.  A  A. y  e.  B  ch )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105   A.wral 2520   E.wrex 2521
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 1496  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-4 1559  ax-17 1575  ax-ial 1583
This theorem depends on definitions:  df-bi 117  df-nf 1510  df-ral 2525  df-rex 2526
This theorem is referenced by:  caucvgpr  7997  caucvgprpr  8027  caucvgsrlemgt1  8110  caucvgsrlemoffres  8115  axcaucvglemres  8214  cvg1nlemres  11670  rexfiuz  11674  resqrexlemgt0  11705  resqrexlemoverl  11706  resqrexlemglsq  11707  resqrexlemsqa  11709  resqrexlemex  11710  cau3lem  11799  caubnd2  11802  climi  11972  2clim  11986  ennnfonelemim  13175  mplelbascoe  14847  lmcvg  15082  lmss  15111  txlm  15144  metcnpi  15380  metcnpi2  15381  elcncf  15438  cncfi  15443  limcimo  15530  cnplimclemr  15534  limccoap  15543
  Copyright terms: Public domain W3C validator