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

Theorem cbvrexw 2733
Description: Rule used to change bound variables, using implicit substitution. Version of cbvrexfw 2729 with more disjoint variable conditions. Although we don't do so yet, we expect the disjoint variable conditions will allow us to remove reliance on ax-i12 1530 and ax-bndl 1532 in the proof. (Contributed by NM, 31-Jul-2003.) (Revised by GG, 10-Jan-2024.)
Hypotheses
Ref Expression
cbvralw.1  |-  F/ y
ph
cbvralw.2  |-  F/ x ps
cbvralw.3  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
cbvrexw  |-  ( E. x  e.  A  ph  <->  E. y  e.  A  ps )
Distinct variable group:    x, y, A
Allowed substitution hints:    ph( x, y)    ps( x, y)

Proof of Theorem cbvrexw
StepHypRef Expression
1 nfcv 2348 . 2  |-  F/_ x A
2 nfcv 2348 . 2  |-  F/_ y A
3 cbvralw.1 . 2  |-  F/ y
ph
4 cbvralw.2 . 2  |-  F/ x ps
5 cbvralw.3 . 2  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
61, 2, 3, 4, 5cbvrexfw 2729 1  |-  ( E. x  e.  A  ph  <->  E. y  e.  A  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105   F/wnf 1483   E.wrex 2485
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187
This theorem depends on definitions:  df-bi 117  df-nf 1484  df-sb 1786  df-cleq 2198  df-clel 2201  df-nfc 2337  df-rex 2490
This theorem is referenced by:  elabrexg  5827
  Copyright terms: Public domain W3C validator