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

Theorem rexralbidv 2556
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 2530 . 2  |-  ( ph  ->  ( A. y  e.  B  ps  <->  A. y  e.  B  ch )
)
32rexbidv 2531 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 2508   E.wrex 2509
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 1493  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-4 1556  ax-17 1572  ax-ial 1580
This theorem depends on definitions:  df-bi 117  df-nf 1507  df-ral 2513  df-rex 2514
This theorem is referenced by:  caucvgpr  7880  caucvgprpr  7910  caucvgsrlemgt1  7993  caucvgsrlemoffres  7998  axcaucvglemres  8097  cvg1nlemres  11512  rexfiuz  11516  resqrexlemgt0  11547  resqrexlemoverl  11548  resqrexlemglsq  11549  resqrexlemsqa  11551  resqrexlemex  11552  cau3lem  11641  caubnd2  11644  climi  11814  2clim  11828  ennnfonelemim  13011  mplelbascoe  14672  lmcvg  14907  lmss  14936  txlm  14969  metcnpi  15205  metcnpi2  15206  elcncf  15263  cncfi  15268  limcimo  15355  cnplimclemr  15359  limccoap  15368
  Copyright terms: Public domain W3C validator