Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  nexmo Structured version   Visualization version   Unicode version

Theorem nexmo 34011
Description: If there is no case where wff is true, it is true for at most one case. (Contributed by Peter Mazsa, 27-Sep-2021.)
Assertion
Ref Expression
nexmo  |-  ( -. 
E. x ph  ->  E* x ph )

Proof of Theorem nexmo
StepHypRef Expression
1 pm2.21 120 . 2  |-  ( -. 
E. x ph  ->  ( E. x ph  ->  E! x ph ) )
2 df-mo 2475 . 2  |-  ( E* x ph  <->  ( E. x ph  ->  E! x ph ) )
31, 2sylibr 224 1  |-  ( -. 
E. x ph  ->  E* x ph )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4   E.wex 1704   E!weu 2470   E*wmo 2471
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8
This theorem depends on definitions:  df-bi 197  df-mo 2475
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator