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

Theorem 2exbidv 1789
Description: Formula-building rule for 2 existential quantifiers (deduction rule). (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 1746 . 2  |-  ( ph  ->  ( E. y ps  <->  E. y ch ) )
32exbidv 1746 1  |-  ( ph  ->  ( E. x E. y ps  <->  E. x E. y ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 103   E.wex 1421
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1376  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-4 1440  ax-17 1459  ax-ial 1467
This theorem depends on definitions:  df-bi 115
This theorem is referenced by:  3exbidv  1790  4exbidv  1791  cbvex4v  1846  ceqsex3v  2641  ceqsex4v  2642  copsexg  3999  euotd  4009  elopab  4013  elxpi  4379  relop  4504  cbvoprab3  5600  ov6g  5658  th3qlem1  6231  ltresr  7007
  Copyright terms: Public domain W3C validator