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

Theorem cbvreu 2775
Description: Change the bound variable of a restricted uniqueness quantifier using implicit substitution. (Contributed by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
cbvral.1  |-  F/ y
ph
cbvral.2  |-  F/ x ps
cbvral.3  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
cbvreu  |-  ( E! x  e.  A  ph  <->  E! y  e.  A  ps )
Distinct variable groups:    x, A    y, A
Allowed substitution hints:    ph( x, y)    ps( x, y)

Proof of Theorem cbvreu
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 nfv 1609 . . . 4  |-  F/ z ( x  e.  A  /\  ph )
21sb8eu 2174 . . 3  |-  ( E! x ( x  e.  A  /\  ph )  <->  E! z [ z  /  x ] ( x  e.  A  /\  ph )
)
3 sban 2022 . . . 4  |-  ( [ z  /  x ]
( x  e.  A  /\  ph )  <->  ( [
z  /  x ]
x  e.  A  /\  [ z  /  x ] ph ) )
43eubii 2165 . . 3  |-  ( E! z [ z  /  x ] ( x  e.  A  /\  ph )  <->  E! z ( [ z  /  x ] x  e.  A  /\  [ z  /  x ] ph ) )
5 clelsb3 2398 . . . . . 6  |-  ( [ z  /  x ]
x  e.  A  <->  z  e.  A )
65anbi1i 676 . . . . 5  |-  ( ( [ z  /  x ] x  e.  A  /\  [ z  /  x ] ph )  <->  ( z  e.  A  /\  [ z  /  x ] ph ) )
76eubii 2165 . . . 4  |-  ( E! z ( [ z  /  x ] x  e.  A  /\  [ z  /  x ] ph ) 
<->  E! z ( z  e.  A  /\  [
z  /  x ] ph ) )
8 nfv 1609 . . . . . 6  |-  F/ y  z  e.  A
9 cbvral.1 . . . . . . 7  |-  F/ y
ph
109nfsb 2061 . . . . . 6  |-  F/ y [ z  /  x ] ph
118, 10nfan 1783 . . . . 5  |-  F/ y ( z  e.  A  /\  [ z  /  x ] ph )
12 nfv 1609 . . . . 5  |-  F/ z ( y  e.  A  /\  ps )
13 eleq1 2356 . . . . . 6  |-  ( z  =  y  ->  (
z  e.  A  <->  y  e.  A ) )
14 sbequ 2013 . . . . . . 7  |-  ( z  =  y  ->  ( [ z  /  x ] ph  <->  [ y  /  x ] ph ) )
15 cbvral.2 . . . . . . . 8  |-  F/ x ps
16 cbvral.3 . . . . . . . 8  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
1715, 16sbie 1991 . . . . . . 7  |-  ( [ y  /  x ] ph 
<->  ps )
1814, 17syl6bb 252 . . . . . 6  |-  ( z  =  y  ->  ( [ z  /  x ] ph  <->  ps ) )
1913, 18anbi12d 691 . . . . 5  |-  ( z  =  y  ->  (
( z  e.  A  /\  [ z  /  x ] ph )  <->  ( y  e.  A  /\  ps )
) )
2011, 12, 19cbveu 2176 . . . 4  |-  ( E! z ( z  e.  A  /\  [ z  /  x ] ph ) 
<->  E! y ( y  e.  A  /\  ps ) )
217, 20bitri 240 . . 3  |-  ( E! z ( [ z  /  x ] x  e.  A  /\  [ z  /  x ] ph ) 
<->  E! y ( y  e.  A  /\  ps ) )
222, 4, 213bitri 262 . 2  |-  ( E! x ( x  e.  A  /\  ph )  <->  E! y ( y  e.  A  /\  ps )
)
23 df-reu 2563 . 2  |-  ( E! x  e.  A  ph  <->  E! x ( x  e.  A  /\  ph )
)
24 df-reu 2563 . 2  |-  ( E! y  e.  A  ps  <->  E! y ( y  e.  A  /\  ps )
)
2522, 23, 243bitr4i 268 1  |-  ( E! x  e.  A  ph  <->  E! y  e.  A  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358   F/wnf 1534    = wceq 1632   [wsb 1638    e. wcel 1696   E!weu 2156   E!wreu 2558
This theorem is referenced by:  cbvrmo  2776  cbvreuv  2779  cbvriota  6331
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  ax-ext 2277
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-cleq 2289  df-clel 2292  df-reu 2563
  Copyright terms: Public domain W3C validator