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

Theorem cbvrexf 2528
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 1421 . . . 4  |-  F/ z ( x  e.  A  /\  ph )
2 cbvralf.1 . . . . . 6  |-  F/_ x A
32nfcri 2172 . . . . 5  |-  F/ x  z  e.  A
4 nfs1v 1815 . . . . 5  |-  F/ x [ z  /  x ] ph
53, 4nfan 1457 . . . 4  |-  F/ x
( z  e.  A  /\  [ z  /  x ] ph )
6 eleq1 2100 . . . . 5  |-  ( x  =  z  ->  (
x  e.  A  <->  z  e.  A ) )
7 sbequ12 1654 . . . . 5  |-  ( x  =  z  ->  ( ph 
<->  [ z  /  x ] ph ) )
86, 7anbi12d 442 . . . 4  |-  ( x  =  z  ->  (
( x  e.  A  /\  ph )  <->  ( z  e.  A  /\  [ z  /  x ] ph ) ) )
91, 5, 8cbvex 1639 . . 3  |-  ( E. x ( x  e.  A  /\  ph )  <->  E. z ( z  e.  A  /\  [ z  /  x ] ph ) )
10 cbvralf.2 . . . . . 6  |-  F/_ y A
1110nfcri 2172 . . . . 5  |-  F/ y  z  e.  A
12 cbvralf.3 . . . . . 6  |-  F/ y
ph
1312nfsb 1822 . . . . 5  |-  F/ y [ z  /  x ] ph
1411, 13nfan 1457 . . . 4  |-  F/ y ( z  e.  A  /\  [ z  /  x ] ph )
15 nfv 1421 . . . 4  |-  F/ z ( y  e.  A  /\  ps )
16 eleq1 2100 . . . . 5  |-  ( z  =  y  ->  (
z  e.  A  <->  y  e.  A ) )
17 sbequ 1721 . . . . . 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 1674 . . . . . 6  |-  ( [ y  /  x ] ph 
<->  ps )
2117, 20syl6bb 185 . . . . 5  |-  ( z  =  y  ->  ( [ z  /  x ] ph  <->  ps ) )
2216, 21anbi12d 442 . . . 4  |-  ( z  =  y  ->  (
( z  e.  A  /\  [ z  /  x ] ph )  <->  ( y  e.  A  /\  ps )
) )
2314, 15, 22cbvex 1639 . . 3  |-  ( E. z ( z  e.  A  /\  [ z  /  x ] ph ) 
<->  E. y ( y  e.  A  /\  ps ) )
249, 23bitri 173 . 2  |-  ( E. x ( x  e.  A  /\  ph )  <->  E. y ( y  e.  A  /\  ps )
)
25 df-rex 2312 . 2  |-  ( E. x  e.  A  ph  <->  E. x ( x  e.  A  /\  ph )
)
26 df-rex 2312 . 2  |-  ( E. y  e.  A  ps  <->  E. y ( y  e.  A  /\  ps )
)
2724, 25, 263bitr4i 201 1  |-  ( E. x  e.  A  ph  <->  E. y  e.  A  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98   F/wnf 1349   E.wex 1381    e. wcel 1393   [wsb 1645   F/_wnfc 2165   E.wrex 2307
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-nf 1350  df-sb 1646  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rex 2312
This theorem is referenced by:  cbvrex  2530
  Copyright terms: Public domain W3C validator