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

Theorem rexeqf 2662
Description: Equality theorem for restricted existential quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by NM, 9-Oct-2003.) (Revised by Andrew Salmon, 11-Jul-2011.)
Hypotheses
Ref Expression
raleq1f.1  |-  F/_ x A
raleq1f.2  |-  F/_ x B
Assertion
Ref Expression
rexeqf  |-  ( A  =  B  ->  ( E. x  e.  A  ph  <->  E. x  e.  B  ph ) )

Proof of Theorem rexeqf
StepHypRef Expression
1 raleq1f.1 . . . 4  |-  F/_ x A
2 raleq1f.2 . . . 4  |-  F/_ x B
31, 2nfeq 2320 . . 3  |-  F/ x  A  =  B
4 eleq2 2234 . . . 4  |-  ( A  =  B  ->  (
x  e.  A  <->  x  e.  B ) )
54anbi1d 462 . . 3  |-  ( A  =  B  ->  (
( x  e.  A  /\  ph )  <->  ( x  e.  B  /\  ph )
) )
63, 5exbid 1609 . 2  |-  ( A  =  B  ->  ( E. x ( x  e.  A  /\  ph )  <->  E. x ( x  e.  B  /\  ph )
) )
7 df-rex 2454 . 2  |-  ( E. x  e.  A  ph  <->  E. x ( x  e.  A  /\  ph )
)
8 df-rex 2454 . 2  |-  ( E. x  e.  B  ph  <->  E. x ( x  e.  B  /\  ph )
)
96, 7, 83bitr4g 222 1  |-  ( A  =  B  ->  ( E. x  e.  A  ph  <->  E. x  e.  B  ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1348   E.wex 1485    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-tru 1351  df-nf 1454  df-sb 1756  df-cleq 2163  df-clel 2166  df-nfc 2301  df-rex 2454
This theorem is referenced by:  rexeq  2666
  Copyright terms: Public domain W3C validator