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

Theorem rexralbidv 2576
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 2550 . 2  |-  ( ph  ->  ( A. y  e.  B  ps  <->  A. y  e.  B  ch )
)
32rexbidv 2551 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
This proof depends on syntax axioms:    -> wi 4    <-> wb 105   A.wral 2528   E.wrex 2529
This proof depends on 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-17 1579  ax-ial 1587
This proof depends on definitions:  df-bi 117  df-nf 1514  df-ral 2533  df-rex 2534
This theorem is used by:  caucvgpr  8055  caucvgprpr  8085  caucvgsrlemgt1  8168  caucvgsrlemoffres  8173  axcaucvglemres  8272  cvg1nlemres  11772  rexfiuz  11776  resqrexlemgt0  11807  resqrexlemoverl  11808  resqrexlemglsq  11809  resqrexlemsqa  11811  resqrexlemex  11812  cau3lem  11902  caubnd2  11905  climi  12077  2clim  12091  ennnfonelemim  13372  lmcvg  15460  lmss  15489  txlm  15522  metcnpi  15758  metcnpi2  15759  elcncf  15816  cncfi  15821  limcimo  15908  cnplimclemr  15912  limccoap  15921
  Copyright terms: Public domain W3C validator