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

Theorem 2ralbidv 2568
Description: Formula-building rule for restricted universal quantifiers (deduction form). (Contributed by NM, 28-Jan-2006.) (Revised by Szymon Jaroszewicz, 16-Mar-2007.)
Hypothesis
Ref Expression
2ralbidv.1  |-  ( ph  ->  ( ps  <->  ch )
)
Assertion
Ref Expression
2ralbidv  |-  ( ph  ->  ( A. x  e.  A  A. y  e.  B  ps  <->  A. 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 2ralbidv
StepHypRef Expression
1 2ralbidv.1 . . 3  |-  ( ph  ->  ( ps  <->  ch )
)
21ralbidv 2544 . 2  |-  ( ph  ->  ( A. y  e.  B  ps  <->  A. y  e.  B  ch )
)
32ralbidv 2544 1  |-  ( ph  ->  ( A. x  e.  A  A. y  e.  B  ps  <->  A. x  e.  A  A. y  e.  B  ch )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105   A.wral 2522
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-4 1559  ax-17 1575
This theorem depends on definitions:  df-bi 117  df-nf 1510  df-ral 2527
This theorem is referenced by:  cbvral3v  2795  poeq1  4425  soeq1  4441  isoeq1  5980  isoeq2  5981  isoeq3  5982  fnmpoovd  6424  smoeq  6534  xpf1o  7110  papeq1  7573  papcotr  7577  tapeq1  7582  elinp  7805  cauappcvgpr  7993  seq3caopr2  10879  seqcaopr2g  10880  wrd2ind  11440  addcn2  12020  mulcn2  12022  sgrp1  13708  ismhm  13758  mhmex  13759  issubm  13769  isnsg  14003  nmznsg  14014  isghm  14044  iscmn  14094  ring1  14287  opprsubrngg  14442  issubrg3  14478  islmod  14551  lmodlema  14552  lsssetm  14616  islssmd  14619  islidlm  14739  ispsmet  15300  ismet  15321  isxmet  15322  addcncntoplem  15538  elcncf  15550  mpodvdsmulf1o  15970
  Copyright terms: Public domain W3C validator