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

Theorem rexralbidv 2559
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 2533 . 2  |-  ( ph  ->  ( A. y  e.  B  ps  <->  A. y  e.  B  ch )
)
32rexbidv 2534 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 2511   E.wrex 2512
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 2516  df-rex 2517
This theorem is referenced by:  caucvgpr  7962  caucvgprpr  7992  caucvgsrlemgt1  8075  caucvgsrlemoffres  8080  axcaucvglemres  8179  cvg1nlemres  11625  rexfiuz  11629  resqrexlemgt0  11660  resqrexlemoverl  11661  resqrexlemglsq  11662  resqrexlemsqa  11664  resqrexlemex  11665  cau3lem  11754  caubnd2  11757  climi  11927  2clim  11941  ennnfonelemim  13125  mplelbascoe  14793  lmcvg  15028  lmss  15057  txlm  15090  metcnpi  15326  metcnpi2  15327  elcncf  15384  cncfi  15389  limcimo  15476  cnplimclemr  15480  limccoap  15489
  Copyright terms: Public domain W3C validator