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

Theorem grprinvd 5724
Description: Deduce right inverse from left inverse and left identity in an associative structure (such as a group). (Contributed by NM, 10-Aug-2013.) (Proof shortened by Mario Carneiro, 6-Jan-2015.)
Hypotheses
Ref Expression
grprinvlem.c  |-  ( (
ph  /\  x  e.  B  /\  y  e.  B
)  ->  ( x  .+  y )  e.  B
)
grprinvlem.o  |-  ( ph  ->  O  e.  B )
grprinvlem.i  |-  ( (
ph  /\  x  e.  B )  ->  ( O  .+  x )  =  x )
grprinvlem.a  |-  ( (
ph  /\  ( x  e.  B  /\  y  e.  B  /\  z  e.  B ) )  -> 
( ( x  .+  y )  .+  z
)  =  ( x 
.+  ( y  .+  z ) ) )
grprinvlem.n  |-  ( (
ph  /\  x  e.  B )  ->  E. y  e.  B  ( y  .+  x )  =  O )
grprinvd.x  |-  ( (
ph  /\  ps )  ->  X  e.  B )
grprinvd.n  |-  ( (
ph  /\  ps )  ->  N  e.  B )
grprinvd.e  |-  ( (
ph  /\  ps )  ->  ( N  .+  X
)  =  O )
Assertion
Ref Expression
grprinvd  |-  ( (
ph  /\  ps )  ->  ( X  .+  N
)  =  O )
Distinct variable groups:    x, y, z, B    x, O, y, z    ph, x, y, z   
y, N, z    x,  .+ , y, z    y, X, z    ps, y
Allowed substitution hints:    ps( x, z)    N( x)    X( x)

Proof of Theorem grprinvd
Dummy variables  u  v  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 grprinvlem.c . 2  |-  ( (
ph  /\  x  e.  B  /\  y  e.  B
)  ->  ( x  .+  y )  e.  B
)
2 grprinvlem.o . 2  |-  ( ph  ->  O  e.  B )
3 grprinvlem.i . 2  |-  ( (
ph  /\  x  e.  B )  ->  ( O  .+  x )  =  x )
4 grprinvlem.a . 2  |-  ( (
ph  /\  ( x  e.  B  /\  y  e.  B  /\  z  e.  B ) )  -> 
( ( x  .+  y )  .+  z
)  =  ( x 
.+  ( y  .+  z ) ) )
5 grprinvlem.n . 2  |-  ( (
ph  /\  x  e.  B )  ->  E. y  e.  B  ( y  .+  x )  =  O )
613expb 1116 . . . . 5  |-  ( (
ph  /\  ( x  e.  B  /\  y  e.  B ) )  -> 
( x  .+  y
)  e.  B )
76caovclg 5681 . . . 4  |-  ( (
ph  /\  ( u  e.  B  /\  v  e.  B ) )  -> 
( u  .+  v
)  e.  B )
87adantlr 454 . . 3  |-  ( ( ( ph  /\  ps )  /\  ( u  e.  B  /\  v  e.  B ) )  -> 
( u  .+  v
)  e.  B )
9 grprinvd.x . . 3  |-  ( (
ph  /\  ps )  ->  X  e.  B )
10 grprinvd.n . . 3  |-  ( (
ph  /\  ps )  ->  N  e.  B )
118, 9, 10caovcld 5682 . 2  |-  ( (
ph  /\  ps )  ->  ( X  .+  N
)  e.  B )
124caovassg 5687 . . . . 5  |-  ( (
ph  /\  ( u  e.  B  /\  v  e.  B  /\  w  e.  B ) )  -> 
( ( u  .+  v )  .+  w
)  =  ( u 
.+  ( v  .+  w ) ) )
1312adantlr 454 . . . 4  |-  ( ( ( ph  /\  ps )  /\  ( u  e.  B  /\  v  e.  B  /\  w  e.  B ) )  -> 
( ( u  .+  v )  .+  w
)  =  ( u 
.+  ( v  .+  w ) ) )
1413, 9, 10, 11caovassd 5688 . . 3  |-  ( (
ph  /\  ps )  ->  ( ( X  .+  N )  .+  ( X  .+  N ) )  =  ( X  .+  ( N  .+  ( X 
.+  N ) ) ) )
15 grprinvd.e . . . . . 6  |-  ( (
ph  /\  ps )  ->  ( N  .+  X
)  =  O )
1615oveq1d 5555 . . . . 5  |-  ( (
ph  /\  ps )  ->  ( ( N  .+  X )  .+  N
)  =  ( O 
.+  N ) )
1713, 10, 9, 10caovassd 5688 . . . . 5  |-  ( (
ph  /\  ps )  ->  ( ( N  .+  X )  .+  N
)  =  ( N 
.+  ( X  .+  N ) ) )
183ralrimiva 2409 . . . . . . . 8  |-  ( ph  ->  A. x  e.  B  ( O  .+  x )  =  x )
19 oveq2 5548 . . . . . . . . . 10  |-  ( x  =  y  ->  ( O  .+  x )  =  ( O  .+  y
) )
20 id 19 . . . . . . . . . 10  |-  ( x  =  y  ->  x  =  y )
2119, 20eqeq12d 2070 . . . . . . . . 9  |-  ( x  =  y  ->  (
( O  .+  x
)  =  x  <->  ( O  .+  y )  =  y ) )
2221cbvralv 2550 . . . . . . . 8  |-  ( A. x  e.  B  ( O  .+  x )  =  x  <->  A. y  e.  B  ( O  .+  y )  =  y )
2318, 22sylib 131 . . . . . . 7  |-  ( ph  ->  A. y  e.  B  ( O  .+  y )  =  y )
2423adantr 265 . . . . . 6  |-  ( (
ph  /\  ps )  ->  A. y  e.  B  ( O  .+  y )  =  y )
25 oveq2 5548 . . . . . . . 8  |-  ( y  =  N  ->  ( O  .+  y )  =  ( O  .+  N
) )
26 id 19 . . . . . . . 8  |-  ( y  =  N  ->  y  =  N )
2725, 26eqeq12d 2070 . . . . . . 7  |-  ( y  =  N  ->  (
( O  .+  y
)  =  y  <->  ( O  .+  N )  =  N ) )
2827rspcv 2669 . . . . . 6  |-  ( N  e.  B  ->  ( A. y  e.  B  ( O  .+  y )  =  y  ->  ( O  .+  N )  =  N ) )
2910, 24, 28sylc 60 . . . . 5  |-  ( (
ph  /\  ps )  ->  ( O  .+  N
)  =  N )
3016, 17, 293eqtr3d 2096 . . . 4  |-  ( (
ph  /\  ps )  ->  ( N  .+  ( X  .+  N ) )  =  N )
3130oveq2d 5556 . . 3  |-  ( (
ph  /\  ps )  ->  ( X  .+  ( N  .+  ( X  .+  N ) ) )  =  ( X  .+  N ) )
3214, 31eqtrd 2088 . 2  |-  ( (
ph  /\  ps )  ->  ( ( X  .+  N )  .+  ( X  .+  N ) )  =  ( X  .+  N ) )
331, 2, 3, 4, 5, 11, 32grprinvlem 5723 1  |-  ( (
ph  /\  ps )  ->  ( X  .+  N
)  =  O )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 101    /\ w3a 896    = wceq 1259    e. wcel 1409   A.wral 2323   E.wrex 2324  (class class class)co 5540
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-v 2576  df-un 2950  df-sn 3409  df-pr 3410  df-op 3412  df-uni 3609  df-br 3793  df-iota 4895  df-fv 4938  df-ov 5543
This theorem is referenced by:  grpridd  5725
  Copyright terms: Public domain W3C validator