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

Theorem cbvex2v 1911
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 26-Jul-1995.)
Hypothesis
Ref Expression
cbval2v.1  |-  ( ( x  =  z  /\  y  =  w )  ->  ( ph  <->  ps )
)
Assertion
Ref Expression
cbvex2v  |-  ( E. x E. y ph  <->  E. z E. w ps )
Distinct variable groups:    z, w, ph    x, y, ps    x, w    y, z
Allowed substitution hints:    ph( x, y)    ps( z, w)

Proof of Theorem cbvex2v
StepHypRef Expression
1 nfv 1515 . 2  |-  F/ z
ph
2 nfv 1515 . 2  |-  F/ w ph
3 nfv 1515 . 2  |-  F/ x ps
4 nfv 1515 . 2  |-  F/ y ps
5 cbval2v.1 . 2  |-  ( ( x  =  z  /\  y  =  w )  ->  ( ph  <->  ps )
)
61, 2, 3, 4, 5cbvex2 1909 1  |-  ( E. x E. y ph  <->  E. z E. w ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104   E.wex 1479
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 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521
This theorem depends on definitions:  df-bi 116  df-nf 1448
This theorem is referenced by:  cbvex4v  1917  th3qlem1  6594
  Copyright terms: Public domain W3C validator