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

Theorem reueq1 2742
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 2384 . 2  |-  F/_ x A
2 nfcv 2384 . 2  |-  F/_ x B
31, 2reueq1f 2738 1  |-  ( A  =  B  ->  ( E! x  e.  A  ph  <->  E! x  e.  B  ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1398   E!wreu 2522
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-cleq 2225  df-clel 2228  df-nfc 2373  df-reu 2527
This theorem is referenced by:  reueqd  2754  ringideu  14150  uspgredg2vlem  16202  uspgredg2v  16203
  Copyright terms: Public domain W3C validator