MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rmoi Structured version   Visualization version   Unicode version

Theorem rmoi 3530
Description: Consequence of "at most one", using implicit substitution. (Contributed by NM, 4-Nov-2012.) (Revised by NM, 16-Jun-2017.)
Hypotheses
Ref Expression
rmoi.b  |-  ( x  =  B  ->  ( ph 
<->  ps ) )
rmoi.c  |-  ( x  =  C  ->  ( ph 
<->  ch ) )
Assertion
Ref Expression
rmoi  |-  ( ( E* x  e.  A  ph 
/\  ( B  e.  A  /\  ps )  /\  ( C  e.  A  /\  ch ) )  ->  B  =  C )
Distinct variable groups:    x, A    x, B    x, C    ps, x    ch, x
Allowed substitution hint:    ph( x)

Proof of Theorem rmoi
StepHypRef Expression
1 rmoi.b . . 3  |-  ( x  =  B  ->  ( ph 
<->  ps ) )
2 rmoi.c . . 3  |-  ( x  =  C  ->  ( ph 
<->  ch ) )
31, 2rmob 3529 . 2  |-  ( ( E* x  e.  A  ph 
/\  ( B  e.  A  /\  ps )
)  ->  ( B  =  C  <->  ( C  e.  A  /\  ch )
) )
43biimp3ar 1433 1  |-  ( ( E* x  e.  A  ph 
/\  ( B  e.  A  /\  ps )  /\  ( C  e.  A  /\  ch ) )  ->  B  =  C )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    /\ w3a 1037    = wceq 1483    e. wcel 1990   E*wrmo 2915
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rmo 2920  df-v 3202
This theorem is referenced by:  eqsqrtd  14107  efgred2  18166  0frgp  18192  frgpnabllem2  18277  frgpcyg  19922  cdleme0moN  35512  proot1mul  37777
  Copyright terms: Public domain W3C validator