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

Theorem cbvrexfw 2717
Description: Rule used to change bound variables, using implicit substitution. Version of cbvrexf 2719 with a disjoint variable condition. Although we don't do so yet, we expect this disjoint variable condition will allow us to remove reliance on ax-i12 1518 and ax-bndl 1520 in the proof. (Contributed by FL, 27-Apr-2008.) (Revised by GG, 10-Jan-2024.)
Hypotheses
Ref Expression
cbvrexfw.1  |-  F/_ x A
cbvrexfw.2  |-  F/_ y A
cbvrexfw.3  |-  F/ y
ph
cbvrexfw.4  |-  F/ x ps
cbvrexfw.5  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
cbvrexfw  |-  ( E. x  e.  A  ph  <->  E. y  e.  A  ps )
Distinct variable group:    x, y
Allowed substitution hints:    ph( x, y)    ps( x, y)    A( x, y)

Proof of Theorem cbvrexfw
StepHypRef Expression
1 cbvrexfw.2 . . . . 5  |-  F/_ y A
21nfcri 2330 . . . 4  |-  F/ y  x  e.  A
3 cbvrexfw.3 . . . 4  |-  F/ y
ph
42, 3nfan 1576 . . 3  |-  F/ y ( x  e.  A  /\  ph )
5 cbvrexfw.1 . . . . 5  |-  F/_ x A
65nfcri 2330 . . . 4  |-  F/ x  y  e.  A
7 cbvrexfw.4 . . . 4  |-  F/ x ps
86, 7nfan 1576 . . 3  |-  F/ x
( y  e.  A  /\  ps )
9 eleq1w 2254 . . . 4  |-  ( x  =  y  ->  (
x  e.  A  <->  y  e.  A ) )
10 cbvrexfw.5 . . . 4  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
119, 10anbi12d 473 . . 3  |-  ( x  =  y  ->  (
( x  e.  A  /\  ph )  <->  ( y  e.  A  /\  ps )
) )
124, 8, 11cbvexv1 1763 . 2  |-  ( E. x ( x  e.  A  /\  ph )  <->  E. y ( y  e.  A  /\  ps )
)
13 df-rex 2478 . 2  |-  ( E. x  e.  A  ph  <->  E. x ( x  e.  A  /\  ph )
)
14 df-rex 2478 . 2  |-  ( E. y  e.  A  ps  <->  E. y ( y  e.  A  /\  ps )
)
1512, 13, 143bitr4i 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 1471   E.wex 1503    e. wcel 2164   F/_wnfc 2323   E.wrex 2473
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-nf 1472  df-sb 1774  df-cleq 2186  df-clel 2189  df-nfc 2325  df-rex 2478
This theorem is referenced by:  cbvrexw  2721  nnwofdc  12175
  Copyright terms: Public domain W3C validator