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

Theorem reurmo 2764
Description: Restricted existential uniqueness implies restricted "at most one." (Contributed by NM, 16-Jun-2017.)
Assertion
Ref Expression
reurmo  |-  ( E! x  e.  A  ph  ->  E* x  e.  A  ph )

Proof of Theorem reurmo
StepHypRef Expression
1 reu5 2762 . 2  |-  ( E! x  e.  A  ph  <->  ( E. x  e.  A  ph 
/\  E* x  e.  A  ph ) )
21simprbi 275 1  |-  ( E! x  e.  A  ph  ->  E* x  e.  A  ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4   E.wrex 2521   E!wreu 2522   E*wrmo 2523
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
This theorem depends on definitions:  df-bi 117  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-rex 2526  df-reu 2527  df-rmo 2528
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator