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

Theorem cbvrexf 2690
Description: Rule used to change bound variables, using implicit substitution. (Contributed by FL, 27-Apr-2008.) (Revised by Mario Carneiro, 9-Oct-2016.) (Proof rewritten by Jim Kingdon, 10-Jun-2018.)
Hypotheses
Ref Expression
cbvralf.1  |-  F/_ x A
cbvralf.2  |-  F/_ y A
cbvralf.3  |-  F/ y
ph
cbvralf.4  |-  F/ x ps
cbvralf.5  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
cbvrexf  |-  ( E. x  e.  A  ph  <->  E. y  e.  A  ps )

Proof of Theorem cbvrexf
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 nfv 1521 . . . 4  |-  F/ z ( x  e.  A  /\  ph )
2 cbvralf.1 . . . . . 6  |-  F/_ x A
32nfcri 2306 . . . . 5  |-  F/ x  z  e.  A
4 nfs1v 1932 . . . . 5  |-  F/ x [ z  /  x ] ph
53, 4nfan 1558 . . . 4  |-  F/ x
( z  e.  A  /\  [ z  /  x ] ph )
6 eleq1 2233 . . . . 5  |-  ( x  =  z  ->  (
x  e.  A  <->  z  e.  A ) )
7 sbequ12 1764 . . . . 5  |-  ( x  =  z  ->  ( ph 
<->  [ z  /  x ] ph ) )
86, 7anbi12d 470 . . . 4  |-  ( x  =  z  ->  (
( x  e.  A  /\  ph )  <->  ( z  e.  A  /\  [ z  /  x ] ph ) ) )
91, 5, 8cbvex 1749 . . 3  |-  ( E. x ( x  e.  A  /\  ph )  <->  E. z ( z  e.  A  /\  [ z  /  x ] ph ) )
10 cbvralf.2 . . . . . 6  |-  F/_ y A
1110nfcri 2306 . . . . 5  |-  F/ y  z  e.  A
12 cbvralf.3 . . . . . 6  |-  F/ y
ph
1312nfsb 1939 . . . . 5  |-  F/ y [ z  /  x ] ph
1411, 13nfan 1558 . . . 4  |-  F/ y ( z  e.  A  /\  [ z  /  x ] ph )
15 nfv 1521 . . . 4  |-  F/ z ( y  e.  A  /\  ps )
16 eleq1 2233 . . . . 5  |-  ( z  =  y  ->  (
z  e.  A  <->  y  e.  A ) )
17 sbequ 1833 . . . . . 6  |-  ( z  =  y  ->  ( [ z  /  x ] ph  <->  [ y  /  x ] ph ) )
18 cbvralf.4 . . . . . . 7  |-  F/ x ps
19 cbvralf.5 . . . . . . 7  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
2018, 19sbie 1784 . . . . . 6  |-  ( [ y  /  x ] ph 
<->  ps )
2117, 20bitrdi 195 . . . . 5  |-  ( z  =  y  ->  ( [ z  /  x ] ph  <->  ps ) )
2216, 21anbi12d 470 . . . 4  |-  ( z  =  y  ->  (
( z  e.  A  /\  [ z  /  x ] ph )  <->  ( y  e.  A  /\  ps )
) )
2314, 15, 22cbvex 1749 . . 3  |-  ( E. z ( z  e.  A  /\  [ z  /  x ] ph ) 
<->  E. y ( y  e.  A  /\  ps ) )
249, 23bitri 183 . 2  |-  ( E. x ( x  e.  A  /\  ph )  <->  E. y ( y  e.  A  /\  ps )
)
25 df-rex 2454 . 2  |-  ( E. x  e.  A  ph  <->  E. x ( x  e.  A  /\  ph )
)
26 df-rex 2454 . 2  |-  ( E. y  e.  A  ps  <->  E. y ( y  e.  A  /\  ps )
)
2724, 25, 263bitr4i 211 1  |-  ( E. x  e.  A  ph  <->  E. y  e.  A  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104   F/wnf 1453   E.wex 1485   [wsb 1755    e. wcel 2141   F/_wnfc 2299   E.wrex 2449
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-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-nf 1454  df-sb 1756  df-cleq 2163  df-clel 2166  df-nfc 2301  df-rex 2454
This theorem is referenced by:  cbvrex  2693
  Copyright terms: Public domain W3C validator