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

Theorem 2exbidv 1861
Description: Formula-building rule for 2 existential quantifiers (deduction form). (Contributed by NM, 1-May-1995.)
Hypothesis
Ref Expression
2albidv.1  |-  ( ph  ->  ( ps  <->  ch )
)
Assertion
Ref Expression
2exbidv  |-  ( ph  ->  ( E. x E. y ps  <->  E. x E. y ch ) )
Distinct variable groups:    ph, x    ph, y
Allowed substitution hints:    ps( x, y)    ch( x, y)

Proof of Theorem 2exbidv
StepHypRef Expression
1 2albidv.1 . . 3  |-  ( ph  ->  ( ps  <->  ch )
)
21exbidv 1818 . 2  |-  ( ph  ->  ( E. y ps  <->  E. y ch ) )
32exbidv 1818 1  |-  ( ph  ->  ( E. x E. y ps  <->  E. x E. y ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104   E.wex 1485
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1440  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-4 1503  ax-17 1519  ax-ial 1527
This theorem depends on definitions:  df-bi 116
This theorem is referenced by:  3exbidv  1862  4exbidv  1863  cbvex4v  1923  ceqsex3v  2772  ceqsex4v  2773  copsexg  4229  euotd  4239  elopab  4243  elxpi  4627  relop  4761  cbvoprab3  5929  ov6g  5990  th3qlem1  6615  ltresr  7801  fisumcom2  11401  fprodcom2fi  11589
  Copyright terms: Public domain W3C validator