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

Theorem nrexrmo 2715
Description: Nonexistence implies restricted "at most one". (Contributed by NM, 17-Jun-2017.)
Assertion
Ref Expression
nrexrmo  |-  ( -. 
E. x  e.  A  ph 
->  E* x  e.  A  ph )

Proof of Theorem nrexrmo
StepHypRef Expression
1 pm2.21 618 . 2  |-  ( -. 
E. x  e.  A  ph 
->  ( E. x  e.  A  ph  ->  E! x  e.  A  ph )
)
2 rmo5 2714 . 2  |-  ( E* x  e.  A  ph  <->  ( E. x  e.  A  ph 
->  E! x  e.  A  ph ) )
31, 2sylibr 134 1  |-  ( -. 
E. x  e.  A  ph 
->  E* x  e.  A  ph )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4   E.wrex 2473   E!wreu 2474   E*wrmo 2475
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-in2 616
This theorem depends on definitions:  df-bi 117  df-mo 2046  df-rex 2478  df-reu 2479  df-rmo 2480
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator