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

Theorem cbvrexf 2730
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 1550 . . . 4  |-  F/ z ( x  e.  A  /\  ph )
2 cbvralf.1 . . . . . 6  |-  F/_ x A
32nfcri 2341 . . . . 5  |-  F/ x  z  e.  A
4 nfs1v 1966 . . . . 5  |-  F/ x [ z  /  x ] ph
53, 4nfan 1587 . . . 4  |-  F/ x
( z  e.  A  /\  [ z  /  x ] ph )
6 eleq1 2267 . . . . 5  |-  ( x  =  z  ->  (
x  e.  A  <->  z  e.  A ) )
7 sbequ12 1793 . . . . 5  |-  ( x  =  z  ->  ( ph 
<->  [ z  /  x ] ph ) )
86, 7anbi12d 473 . . . 4  |-  ( x  =  z  ->  (
( x  e.  A  /\  ph )  <->  ( z  e.  A  /\  [ z  /  x ] ph ) ) )
91, 5, 8cbvex 1778 . . 3  |-  ( E. x ( x  e.  A  /\  ph )  <->  E. z ( z  e.  A  /\  [ z  /  x ] ph ) )
10 cbvralf.2 . . . . . 6  |-  F/_ y A
1110nfcri 2341 . . . . 5  |-  F/ y  z  e.  A
12 cbvralf.3 . . . . . 6  |-  F/ y
ph
1312nfsb 1973 . . . . 5  |-  F/ y [ z  /  x ] ph
1411, 13nfan 1587 . . . 4  |-  F/ y ( z  e.  A  /\  [ z  /  x ] ph )
15 nfv 1550 . . . 4  |-  F/ z ( y  e.  A  /\  ps )
16 eleq1 2267 . . . . 5  |-  ( z  =  y  ->  (
z  e.  A  <->  y  e.  A ) )
17 sbequ 1862 . . . . . 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 1813 . . . . . 6  |-  ( [ y  /  x ] ph 
<->  ps )
2117, 20bitrdi 196 . . . . 5  |-  ( z  =  y  ->  ( [ z  /  x ] ph  <->  ps ) )
2216, 21anbi12d 473 . . . 4  |-  ( z  =  y  ->  (
( z  e.  A  /\  [ z  /  x ] ph )  <->  ( y  e.  A  /\  ps )
) )
2314, 15, 22cbvex 1778 . . 3  |-  ( E. z ( z  e.  A  /\  [ z  /  x ] ph ) 
<->  E. y ( y  e.  A  /\  ps ) )
249, 23bitri 184 . 2  |-  ( E. x ( x  e.  A  /\  ph )  <->  E. y ( y  e.  A  /\  ps )
)
25 df-rex 2489 . 2  |-  ( E. x  e.  A  ph  <->  E. x ( x  e.  A  /\  ph )
)
26 df-rex 2489 . 2  |-  ( E. y  e.  A  ps  <->  E. y ( y  e.  A  /\  ps )
)
2724, 25, 263bitr4i 212 1  |-  ( E. x  e.  A  ph  <->  E. y  e.  A  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   F/wnf 1482   E.wex 1514   [wsb 1784    e. wcel 2175   F/_wnfc 2334   E.wrex 2484
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-ext 2186
This theorem depends on definitions:  df-bi 117  df-nf 1483  df-sb 1785  df-cleq 2197  df-clel 2200  df-nfc 2336  df-rex 2489
This theorem is referenced by:  cbvrex  2734
  Copyright terms: Public domain W3C validator