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

Theorem rmo5 2685
Description: Restricted "at most one" in term of uniqueness. (Contributed by NM, 16-Jun-2017.)
Assertion
Ref Expression
rmo5  |-  ( E* x  e.  A  ph  <->  ( E. x  e.  A  ph 
->  E! x  e.  A  ph ) )

Proof of Theorem rmo5
StepHypRef Expression
1 df-mo 2023 . 2  |-  ( E* x ( x  e.  A  /\  ph )  <->  ( E. x ( x  e.  A  /\  ph )  ->  E! x ( x  e.  A  /\  ph ) ) )
2 df-rmo 2456 . 2  |-  ( E* x  e.  A  ph  <->  E* x ( x  e.  A  /\  ph )
)
3 df-rex 2454 . . 3  |-  ( E. x  e.  A  ph  <->  E. x ( x  e.  A  /\  ph )
)
4 df-reu 2455 . . 3  |-  ( E! x  e.  A  ph  <->  E! x ( x  e.  A  /\  ph )
)
53, 4imbi12i 238 . 2  |-  ( ( E. x  e.  A  ph 
->  E! x  e.  A  ph )  <->  ( E. x
( x  e.  A  /\  ph )  ->  E! x ( x  e.  A  /\  ph )
) )
61, 2, 53bitr4i 211 1  |-  ( E* x  e.  A  ph  <->  ( E. x  e.  A  ph 
->  E! x  e.  A  ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104   E.wex 1485   E!weu 2019   E*wmo 2020    e. wcel 2141   E.wrex 2449   E!wreu 2450   E*wrmo 2451
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107
This theorem depends on definitions:  df-bi 116  df-mo 2023  df-rex 2454  df-reu 2455  df-rmo 2456
This theorem is referenced by:  nrexrmo  2686  cbvrmo  2695  bdrmo  13813
  Copyright terms: Public domain W3C validator