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

Theorem 2exbidv 1892
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 1849 . 2  |-  ( ph  ->  ( E. y ps  <->  E. y ch ) )
32exbidv 1849 1  |-  ( ph  ->  ( E. x E. y ps  <->  E. x E. y ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105   E.wex 1516
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 1471  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-4 1534  ax-17 1550  ax-ial 1558
This theorem depends on definitions:  df-bi 117
This theorem is referenced by:  3exbidv  1893  4exbidv  1894  cbvex4v  1959  ceqsex3v  2820  ceqsex4v  2821  copsexg  4306  euotd  4317  elopab  4322  elxpi  4709  relop  4846  cbvoprab3  6044  ov6g  6107  th3qlem1  6747  ltresr  7987  fisumcom2  11864  fprodcom2fi  12052
  Copyright terms: Public domain W3C validator