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

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

Proof of Theorem rmob
StepHypRef Expression
1 df-rmo 2475 . 2  |-  ( E* x  e.  A  ph  <->  E* x ( x  e.  A  /\  ph )
)
2 simprl 529 . . . 4  |-  ( ( E* x ( x  e.  A  /\  ph )  /\  ( B  e.  A  /\  ps )
)  ->  B  e.  A )
3 eleq1 2251 . . . 4  |-  ( B  =  C  ->  ( B  e.  A  <->  C  e.  A ) )
42, 3syl5ibcom 155 . . 3  |-  ( ( E* x ( x  e.  A  /\  ph )  /\  ( B  e.  A  /\  ps )
)  ->  ( B  =  C  ->  C  e.  A ) )
5 simpl 109 . . . 4  |-  ( ( C  e.  A  /\  ch )  ->  C  e.  A )
65a1i 9 . . 3  |-  ( ( E* x ( x  e.  A  /\  ph )  /\  ( B  e.  A  /\  ps )
)  ->  ( ( C  e.  A  /\  ch )  ->  C  e.  A ) )
7 simplrl 535 . . . . 5  |-  ( ( ( E* x ( x  e.  A  /\  ph )  /\  ( B  e.  A  /\  ps ) )  /\  C  e.  A )  ->  B  e.  A )
8 simpr 110 . . . . 5  |-  ( ( ( E* x ( x  e.  A  /\  ph )  /\  ( B  e.  A  /\  ps ) )  /\  C  e.  A )  ->  C  e.  A )
9 simpll 527 . . . . 5  |-  ( ( ( E* x ( x  e.  A  /\  ph )  /\  ( B  e.  A  /\  ps ) )  /\  C  e.  A )  ->  E* x ( x  e.  A  /\  ph )
)
10 simplrr 536 . . . . 5  |-  ( ( ( E* x ( x  e.  A  /\  ph )  /\  ( B  e.  A  /\  ps ) )  /\  C  e.  A )  ->  ps )
11 eleq1 2251 . . . . . . 7  |-  ( x  =  B  ->  (
x  e.  A  <->  B  e.  A ) )
12 rmoi.b . . . . . . 7  |-  ( x  =  B  ->  ( ph 
<->  ps ) )
1311, 12anbi12d 473 . . . . . 6  |-  ( x  =  B  ->  (
( x  e.  A  /\  ph )  <->  ( B  e.  A  /\  ps )
) )
14 eleq1 2251 . . . . . . 7  |-  ( x  =  C  ->  (
x  e.  A  <->  C  e.  A ) )
15 rmoi.c . . . . . . 7  |-  ( x  =  C  ->  ( ph 
<->  ch ) )
1614, 15anbi12d 473 . . . . . 6  |-  ( x  =  C  ->  (
( x  e.  A  /\  ph )  <->  ( C  e.  A  /\  ch )
) )
1713, 16mob 2933 . . . . 5  |-  ( ( ( B  e.  A  /\  C  e.  A
)  /\  E* x
( x  e.  A  /\  ph )  /\  ( B  e.  A  /\  ps ) )  ->  ( B  =  C  <->  ( C  e.  A  /\  ch )
) )
187, 8, 9, 7, 10, 17syl212anc 1258 . . . 4  |-  ( ( ( E* x ( x  e.  A  /\  ph )  /\  ( B  e.  A  /\  ps ) )  /\  C  e.  A )  ->  ( B  =  C  <->  ( C  e.  A  /\  ch )
) )
1918ex 115 . . 3  |-  ( ( E* x ( x  e.  A  /\  ph )  /\  ( B  e.  A  /\  ps )
)  ->  ( C  e.  A  ->  ( B  =  C  <->  ( C  e.  A  /\  ch )
) ) )
204, 6, 19pm5.21ndd 706 . 2  |-  ( ( E* x ( x  e.  A  /\  ph )  /\  ( B  e.  A  /\  ps )
)  ->  ( B  =  C  <->  ( C  e.  A  /\  ch )
) )
211, 20sylanb 284 1  |-  ( ( E* x  e.  A  ph 
/\  ( B  e.  A  /\  ps )
)  ->  ( B  =  C  <->  ( C  e.  A  /\  ch )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1363   E*wmo 2038    e. wcel 2159   E*wrmo 2470
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 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-ext 2170
This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-nf 1471  df-sb 1773  df-eu 2040  df-mo 2041  df-clab 2175  df-cleq 2181  df-clel 2184  df-nfc 2320  df-rmo 2475  df-v 2753
This theorem is referenced by:  rmoi  3070
  Copyright terms: Public domain W3C validator