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

Theorem mob 3122
Description: Equality implied by "at most one." (Contributed by NM, 18-Feb-2006.)
Hypotheses
Ref Expression
moi.1  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
moi.2  |-  ( x  =  B  ->  ( ph 
<->  ch ) )
Assertion
Ref Expression
mob  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  E* x ph  /\  ps )  -> 
( A  =  B  <->  ch ) )
Distinct variable groups:    x, A    x, B    ch, x    ps, x
Allowed substitution hints:    ph( x)    C( x)    D( x)

Proof of Theorem mob
StepHypRef Expression
1 elex 2970 . . . . 5  |-  ( B  e.  D  ->  B  e.  _V )
2 nfcv 2578 . . . . . . . 8  |-  F/_ x A
3 nfv 1630 . . . . . . . . . 10  |-  F/ x  B  e.  _V
4 nfmo1 2298 . . . . . . . . . 10  |-  F/ x E* x ph
5 nfv 1630 . . . . . . . . . 10  |-  F/ x ps
63, 4, 5nf3an 1851 . . . . . . . . 9  |-  F/ x
( B  e.  _V  /\ 
E* x ph  /\  ps )
7 nfv 1630 . . . . . . . . 9  |-  F/ x
( A  =  B  <->  ch )
86, 7nfim 1834 . . . . . . . 8  |-  F/ x
( ( B  e. 
_V  /\  E* x ph  /\  ps )  -> 
( A  =  B  <->  ch ) )
9 moi.1 . . . . . . . . . 10  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
1093anbi3d 1261 . . . . . . . . 9  |-  ( x  =  A  ->  (
( B  e.  _V  /\ 
E* x ph  /\  ph )  <->  ( B  e. 
_V  /\  E* x ph  /\  ps ) ) )
11 eqeq1 2448 . . . . . . . . . 10  |-  ( x  =  A  ->  (
x  =  B  <->  A  =  B ) )
1211bibi1d 312 . . . . . . . . 9  |-  ( x  =  A  ->  (
( x  =  B  <->  ch )  <->  ( A  =  B  <->  ch ) ) )
1310, 12imbi12d 313 . . . . . . . 8  |-  ( x  =  A  ->  (
( ( B  e. 
_V  /\  E* x ph  /\  ph )  -> 
( x  =  B  <->  ch ) )  <->  ( ( B  e.  _V  /\  E* x ph  /\  ps )  ->  ( A  =  B  <->  ch ) ) ) )
14 moi.2 . . . . . . . . 9  |-  ( x  =  B  ->  ( ph 
<->  ch ) )
1514mob2 3120 . . . . . . . 8  |-  ( ( B  e.  _V  /\  E* x ph  /\  ph )  ->  ( x  =  B  <->  ch ) )
162, 8, 13, 15vtoclgf 3016 . . . . . . 7  |-  ( A  e.  C  ->  (
( B  e.  _V  /\ 
E* x ph  /\  ps )  ->  ( A  =  B  <->  ch )
) )
1716com12 30 . . . . . 6  |-  ( ( B  e.  _V  /\  E* x ph  /\  ps )  ->  ( A  e.  C  ->  ( A  =  B  <->  ch ) ) )
18173expib 1157 . . . . 5  |-  ( B  e.  _V  ->  (
( E* x ph  /\ 
ps )  ->  ( A  e.  C  ->  ( A  =  B  <->  ch )
) ) )
191, 18syl 16 . . . 4  |-  ( B  e.  D  ->  (
( E* x ph  /\ 
ps )  ->  ( A  e.  C  ->  ( A  =  B  <->  ch )
) ) )
2019com3r 76 . . 3  |-  ( A  e.  C  ->  ( B  e.  D  ->  ( ( E* x ph  /\ 
ps )  ->  ( A  =  B  <->  ch )
) ) )
2120imp 420 . 2  |-  ( ( A  e.  C  /\  B  e.  D )  ->  ( ( E* x ph  /\  ps )  -> 
( A  =  B  <->  ch ) ) )
22213impib 1152 1  |-  ( ( ( A  e.  C  /\  B  e.  D
)  /\  E* x ph  /\  ps )  -> 
( A  =  B  <->  ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 178    /\ wa 360    /\ w3a 937    = wceq 1653    e. wcel 1727   E*wmo 2288   _Vcvv 2962
This theorem is referenced by:  moi  3123  rmob  3265
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1668  ax-8 1689  ax-6 1746  ax-7 1751  ax-11 1763  ax-12 1953  ax-ext 2423
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2291  df-mo 2292  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2567  df-v 2964
  Copyright terms: Public domain W3C validator