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

Theorem rinvmod 14062
Description: Uniqueness of a right inverse element in a commutative monoid, if it exists. Corresponds to caovimo 6256. (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 14055 . . . . . . . 8  |-  ( ( G  e. CMnd  /\  w  e.  B  /\  A  e.  B )  ->  (
w  .+  A )  =  ( A  .+  w ) )
92, 3, 5, 8syl3anc 1274 . . . . . . 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 2267 . . . . 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 2617 . 2  |-  ( ph  ->  A. w  e.  B  ( ( A  .+  w )  =  .0. 
->  ( ( w  .+  A )  =  .0. 
/\  ( A  .+  w )  =  .0.  ) ) )
16 rinvmod.0 . . 3  |-  .0.  =  ( 0g `  G )
17 cmnmnd 14054 . . . 4  |-  ( G  e. CMnd  ->  G  e.  Mnd )
181, 17syl 14 . . 3  |-  ( ph  ->  G  e.  Mnd )
196, 16, 7, 18, 4mndinvmod 13706 . 2  |-  ( ph  ->  E* w  e.  B  ( ( w  .+  A )  =  .0. 
/\  ( A  .+  w )  =  .0.  ) )
20 rmoim 3021 . 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 1398    e. wcel 2205   A.wral 2522   E*wrmo 2525   ` cfv 5357  (class class class)co 6058   Basecbs 13296   +g cplusg 13374   0gc0g 13553   Mndcmnd 13677  CMndccmn 14037
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365  df-riota 6011  df-ov 6061  df-inn 9255  df-2 9313  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-cmn 14039
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator