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

Theorem reueq1 2626
Description: Equality theorem for restricted unique existential quantifier. (Contributed by NM, 5-Apr-2004.)
Assertion
Ref Expression
reueq1  |-  ( A  =  B  ->  ( E! x  e.  A  ph  <->  E! x  e.  B  ph ) )
Distinct variable groups:    x, A    x, B
Allowed substitution hint:    ph( x)

Proof of Theorem reueq1
StepHypRef Expression
1 nfcv 2279 . 2  |-  F/_ x A
2 nfcv 2279 . 2  |-  F/_ x B
31, 2reueq1f 2622 1  |-  ( A  =  B  ->  ( E! x  e.  A  ph  <->  E! x  e.  B  ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1331   E!wreu 2416
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-cleq 2130  df-clel 2133  df-nfc 2268  df-reu 2421
This theorem is referenced by:  reueqd  2634
  Copyright terms: Public domain W3C validator