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

Theorem rexralbidv 2570
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 2544 . 2  |-  ( ph  ->  ( A. y  e.  B  ps  <->  A. y  e.  B  ch )
)
32rexbidv 2545 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 2522   E.wrex 2523
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 2527  df-rex 2528
This theorem is referenced by:  caucvgpr  8013  caucvgprpr  8043  caucvgsrlemgt1  8126  caucvgsrlemoffres  8131  axcaucvglemres  8230  cvg1nlemres  11695  rexfiuz  11699  resqrexlemgt0  11730  resqrexlemoverl  11731  resqrexlemglsq  11732  resqrexlemsqa  11734  resqrexlemex  11735  cau3lem  11824  caubnd2  11827  climi  11997  2clim  12011  ennnfonelemim  13259  mplelbascoe  14973  lmcvg  15208  lmss  15237  txlm  15270  metcnpi  15506  metcnpi2  15507  elcncf  15564  cncfi  15569  limcimo  15656  cnplimclemr  15660  limccoap  15669
  Copyright terms: Public domain W3C validator