MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cbvmo Unicode version

Theorem cbvmo 2193
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 9-Mar-1995.) (Revised by Andrew Salmon, 8-Jun-2011.)
Hypotheses
Ref Expression
cbvmo.1  |-  F/ y
ph
cbvmo.2  |-  F/ x ps
cbvmo.3  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
cbvmo  |-  ( E* x ph  <->  E* y ps )

Proof of Theorem cbvmo
StepHypRef Expression
1 cbvmo.1 . . . 4  |-  F/ y
ph
2 cbvmo.2 . . . 4  |-  F/ x ps
3 cbvmo.3 . . . 4  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
41, 2, 3cbvex 1938 . . 3  |-  ( E. x ph  <->  E. y ps )
51, 2, 3cbveu 2176 . . 3  |-  ( E! x ph  <->  E! y ps )
64, 5imbi12i 316 . 2  |-  ( ( E. x ph  ->  E! x ph )  <->  ( E. y ps  ->  E! y ps ) )
7 df-mo 2161 . 2  |-  ( E* x ph  <->  ( E. x ph  ->  E! x ph ) )
8 df-mo 2161 . 2  |-  ( E* y ps  <->  ( E. y ps  ->  E! y ps ) )
96, 7, 83bitr4i 268 1  |-  ( E* x ph  <->  E* y ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176   E.wex 1531   F/wnf 1534   E!weu 2156   E*wmo 2157
This theorem is referenced by:  dffun6f  5285  opabiotafun  6307  2ndcdisj  17198  cbvdisjf  23365
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161
  Copyright terms: Public domain W3C validator