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

Theorem reueq1 2551
Description: Equality theorem for restricted uniqueness 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 2219 . 2  |-  F/_ x A
2 nfcv 2219 . 2  |-  F/_ x B
31, 2reueq1f 2547 1  |-  ( A  =  B  ->  ( E! x  e.  A  ph  <->  E! x  e.  B  ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 103    = wceq 1284   E!wreu 2350
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-cleq 2074  df-clel 2077  df-nfc 2208  df-reu 2355
This theorem is referenced by:  reueqd  2559
  Copyright terms: Public domain W3C validator