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

Theorem caovmo 6057
Description: Uniqueness of inverse element in commutative, associative operation with identity. Remark in proof of Proposition 9-2.4 of [Gleason] p. 119. (Contributed by NM, 4-Mar-1996.)
Hypotheses
Ref Expression
caovmo.2  |-  B  e.  S
caovmo.dom  |-  dom  F  =  ( S  X.  S )
caovmo.3  |-  -.  (/)  e.  S
caovmo.com  |-  ( x F y )  =  ( y F x )
caovmo.ass  |-  ( ( x F y ) F z )  =  ( x F ( y F z ) )
caovmo.id  |-  ( x  e.  S  ->  (
x F B )  =  x )
Assertion
Ref Expression
caovmo  |-  E* w
( A F w )  =  B
Distinct variable groups:    x, y,
z, A    x, B, y, z    x, F, y, z    x, S, y, z    w, A, x, y    w, B, z   
w, F    w, S

Proof of Theorem caovmo
Dummy variables  u  v are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 5865 . . . . . 6  |-  ( u  =  A  ->  (
u F w )  =  ( A F w ) )
21eqeq1d 2291 . . . . 5  |-  ( u  =  A  ->  (
( u F w )  =  B  <->  ( A F w )  =  B ) )
32mobidv 2178 . . . 4  |-  ( u  =  A  ->  ( E* w ( u F w )  =  B  <->  E* w ( A F w )  =  B ) )
4 oveq2 5866 . . . . . . 7  |-  ( w  =  v  ->  (
u F w )  =  ( u F v ) )
54eqeq1d 2291 . . . . . 6  |-  ( w  =  v  ->  (
( u F w )  =  B  <->  ( u F v )  =  B ) )
65mo4 2176 . . . . 5  |-  ( E* w ( u F w )  =  B  <->  A. w A. v ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  w  =  v ) )
7 simpr 447 . . . . . . . . 9  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  ( u F v )  =  B )
87oveq2d 5874 . . . . . . . 8  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  ( w F ( u F v ) )  =  ( w F B ) )
9 simpl 443 . . . . . . . . . 10  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  ( u F w )  =  B )
109oveq1d 5873 . . . . . . . . 9  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  ( ( u F w ) F v )  =  ( B F v ) )
11 vex 2791 . . . . . . . . . . 11  |-  u  e. 
_V
12 vex 2791 . . . . . . . . . . 11  |-  w  e. 
_V
13 vex 2791 . . . . . . . . . . 11  |-  v  e. 
_V
14 caovmo.ass . . . . . . . . . . 11  |-  ( ( x F y ) F z )  =  ( x F ( y F z ) )
1511, 12, 13, 14caovass 6020 . . . . . . . . . 10  |-  ( ( u F w ) F v )  =  ( u F ( w F v ) )
16 caovmo.com . . . . . . . . . . 11  |-  ( x F y )  =  ( y F x )
1711, 12, 13, 16, 14caov12 6048 . . . . . . . . . 10  |-  ( u F ( w F v ) )  =  ( w F ( u F v ) )
1815, 17eqtri 2303 . . . . . . . . 9  |-  ( ( u F w ) F v )  =  ( w F ( u F v ) )
19 caovmo.2 . . . . . . . . . . 11  |-  B  e.  S
2019elexi 2797 . . . . . . . . . 10  |-  B  e. 
_V
2120, 13, 16caovcom 6017 . . . . . . . . 9  |-  ( B F v )  =  ( v F B )
2210, 18, 213eqtr3g 2338 . . . . . . . 8  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  ( w F ( u F v ) )  =  ( v F B ) )
238, 22eqtr3d 2317 . . . . . . 7  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  ( w F B )  =  ( v F B ) )
249, 19syl6eqel 2371 . . . . . . . . . 10  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  ( u F w )  e.  S
)
25 caovmo.dom . . . . . . . . . . 11  |-  dom  F  =  ( S  X.  S )
26 caovmo.3 . . . . . . . . . . 11  |-  -.  (/)  e.  S
2725, 26ndmovrcl 6006 . . . . . . . . . 10  |-  ( ( u F w )  e.  S  ->  (
u  e.  S  /\  w  e.  S )
)
2824, 27syl 15 . . . . . . . . 9  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  ( u  e.  S  /\  w  e.  S ) )
2928simprd 449 . . . . . . . 8  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  w  e.  S
)
30 oveq1 5865 . . . . . . . . . 10  |-  ( x  =  w  ->  (
x F B )  =  ( w F B ) )
31 id 19 . . . . . . . . . 10  |-  ( x  =  w  ->  x  =  w )
3230, 31eqeq12d 2297 . . . . . . . . 9  |-  ( x  =  w  ->  (
( x F B )  =  x  <->  ( w F B )  =  w ) )
33 caovmo.id . . . . . . . . 9  |-  ( x  e.  S  ->  (
x F B )  =  x )
3432, 33vtoclga 2849 . . . . . . . 8  |-  ( w  e.  S  ->  (
w F B )  =  w )
3529, 34syl 15 . . . . . . 7  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  ( w F B )  =  w )
367, 19syl6eqel 2371 . . . . . . . . . 10  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  ( u F v )  e.  S
)
3725, 26ndmovrcl 6006 . . . . . . . . . 10  |-  ( ( u F v )  e.  S  ->  (
u  e.  S  /\  v  e.  S )
)
3836, 37syl 15 . . . . . . . . 9  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  ( u  e.  S  /\  v  e.  S ) )
3938simprd 449 . . . . . . . 8  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  v  e.  S
)
40 oveq1 5865 . . . . . . . . . 10  |-  ( x  =  v  ->  (
x F B )  =  ( v F B ) )
41 id 19 . . . . . . . . . 10  |-  ( x  =  v  ->  x  =  v )
4240, 41eqeq12d 2297 . . . . . . . . 9  |-  ( x  =  v  ->  (
( x F B )  =  x  <->  ( v F B )  =  v ) )
4342, 33vtoclga 2849 . . . . . . . 8  |-  ( v  e.  S  ->  (
v F B )  =  v )
4439, 43syl 15 . . . . . . 7  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  ( v F B )  =  v )
4523, 35, 443eqtr3d 2323 . . . . . 6  |-  ( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  w  =  v )
4645ax-gen 1533 . . . . 5  |-  A. v
( ( ( u F w )  =  B  /\  ( u F v )  =  B )  ->  w  =  v )
476, 46mpgbir 1537 . . . 4  |-  E* w
( u F w )  =  B
483, 47vtoclg 2843 . . 3  |-  ( A  e.  S  ->  E* w ( A F w )  =  B )
49 moanimv 2201 . . 3  |-  ( E* w ( A  e.  S  /\  ( A F w )  =  B )  <->  ( A  e.  S  ->  E* w
( A F w )  =  B ) )
5048, 49mpbir 200 . 2  |-  E* w
( A  e.  S  /\  ( A F w )  =  B )
51 eleq1 2343 . . . . . . 7  |-  ( ( A F w )  =  B  ->  (
( A F w )  e.  S  <->  B  e.  S ) )
5219, 51mpbiri 224 . . . . . 6  |-  ( ( A F w )  =  B  ->  ( A F w )  e.  S )
5325, 26ndmovrcl 6006 . . . . . 6  |-  ( ( A F w )  e.  S  ->  ( A  e.  S  /\  w  e.  S )
)
5452, 53syl 15 . . . . 5  |-  ( ( A F w )  =  B  ->  ( A  e.  S  /\  w  e.  S )
)
5554simpld 445 . . . 4  |-  ( ( A F w )  =  B  ->  A  e.  S )
5655ancri 535 . . 3  |-  ( ( A F w )  =  B  ->  ( A  e.  S  /\  ( A F w )  =  B ) )
5756moimi 2190 . 2  |-  ( E* w ( A  e.  S  /\  ( A F w )  =  B )  ->  E* w ( A F w )  =  B )
5850, 57ax-mp 8 1  |-  E* w
( A F w )  =  B
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358   A.wal 1527    = wceq 1623    e. wcel 1684   E*wmo 2144   (/)c0 3455    X. cxp 4687   dom cdm 4689  (class class class)co 5858
This theorem is referenced by:  recmulnq  8588
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-br 4024  df-opab 4078  df-xp 4695  df-dm 4699  df-iota 5219  df-fv 5263  df-ov 5861
  Copyright terms: Public domain W3C validator