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

Theorem rinvmod 14090
Description: Uniqueness of a right inverse element in a commutative monoid, if it exists. Corresponds to caovimo 6273. (Contributed by AV, 31-Dec-2023.)
Hypotheses
Ref Expression
rinvmod.b  |-  B  =  ( Base `  G
)
rinvmod.0  |-  .0.  =  ( 0g `  G )
rinvmod.p  |-  .+  =  ( +g  `  G )
rinvmod.m  |-  ( ph  ->  G  e. CMnd )
rinvmod.a  |-  ( ph  ->  A  e.  B )
Assertion
Ref Expression
rinvmod  |-  ( ph  ->  E* w  e.  B  ( A  .+  w )  =  .0.  )
Distinct variable groups:    w, A    w, B    w,  .0.    w,  .+    ph, w
Allowed substitution hint:    G( w)

Proof of Theorem rinvmod
StepHypRef Expression
1 rinvmod.m . . . . . . . . 9  |-  ( ph  ->  G  e. CMnd )
21adantr 276 . . . . . . . 8  |-  ( (
ph  /\  w  e.  B )  ->  G  e. CMnd )
3 simpr 110 . . . . . . . 8  |-  ( (
ph  /\  w  e.  B )  ->  w  e.  B )
4 rinvmod.a . . . . . . . . 9  |-  ( ph  ->  A  e.  B )
54adantr 276 . . . . . . . 8  |-  ( (
ph  /\  w  e.  B )  ->  A  e.  B )
6 rinvmod.b . . . . . . . . 9  |-  B  =  ( Base `  G
)
7 rinvmod.p . . . . . . . . 9  |-  .+  =  ( +g  `  G )
86, 7cmncom 14082 . . . . . . . 8  |-  ( ( G  e. CMnd  /\  w  e.  B  /\  A  e.  B )  ->  (
w  .+  A )  =  ( A  .+  w ) )
92, 3, 5, 8syl3anc 1278 . . . . . . 7  |-  ( (
ph  /\  w  e.  B )  ->  (
w  .+  A )  =  ( A  .+  w ) )
109adantr 276 . . . . . 6  |-  ( ( ( ph  /\  w  e.  B )  /\  ( A  .+  w )  =  .0.  )  ->  (
w  .+  A )  =  ( A  .+  w ) )
11 simpr 110 . . . . . 6  |-  ( ( ( ph  /\  w  e.  B )  /\  ( A  .+  w )  =  .0.  )  ->  ( A  .+  w )  =  .0.  )
1210, 11eqtrd 2271 . . . . 5  |-  ( ( ( ph  /\  w  e.  B )  /\  ( A  .+  w )  =  .0.  )  ->  (
w  .+  A )  =  .0.  )
1312, 11jca 306 . . . 4  |-  ( ( ( ph  /\  w  e.  B )  /\  ( A  .+  w )  =  .0.  )  ->  (
( w  .+  A
)  =  .0.  /\  ( A  .+  w )  =  .0.  ) )
1413ex 115 . . 3  |-  ( (
ph  /\  w  e.  B )  ->  (
( A  .+  w
)  =  .0.  ->  ( ( w  .+  A
)  =  .0.  /\  ( A  .+  w )  =  .0.  ) ) )
1514ralrimiva 2623 . 2  |-  ( ph  ->  A. w  e.  B  ( ( A  .+  w )  =  .0. 
->  ( ( w  .+  A )  =  .0. 
/\  ( A  .+  w )  =  .0.  ) ) )
16 rinvmod.0 . . 3  |-  .0.  =  ( 0g `  G )
17 cmnmnd 14081 . . . 4  |-  ( G  e. CMnd  ->  G  e.  Mnd )
181, 17syl 14 . . 3  |-  ( ph  ->  G  e.  Mnd )
196, 16, 7, 18, 4mndinvmod 13735 . 2  |-  ( ph  ->  E* w  e.  B  ( ( w  .+  A )  =  .0. 
/\  ( A  .+  w )  =  .0.  ) )
20 rmoim 3027 . 2  |-  ( A. w  e.  B  (
( A  .+  w
)  =  .0.  ->  ( ( w  .+  A
)  =  .0.  /\  ( A  .+  w )  =  .0.  ) )  ->  ( E* w  e.  B  ( (
w  .+  A )  =  .0.  /\  ( A 
.+  w )  =  .0.  )  ->  E* w  e.  B  ( A  .+  w )  =  .0.  ) )
2115, 19, 20sylc 62 1  |-  ( ph  ->  E* w  e.  B  ( A  .+  w )  =  .0.  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   A.wral 2528   E*wrmo 2531   ` cfv 5372  (class class class)co 6075   Basecbs 13330   +g cplusg 13408   0gc0g 13587   Mndcmnd 13706  CMndccmn 14064
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380  df-riota 6028  df-ov 6078  df-inn 9284  df-2 9342  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-0g 13589  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-cmn 14066
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator