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

Theorem rinvmod 13959
Description: Uniqueness of a right inverse element in a commutative monoid, if it exists. Corresponds to caovimo 6226. (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 13952 . . . . . . . 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 2264 . . . . 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 2606 . 2  |-  ( ph  ->  A. w  e.  B  ( ( A  .+  w )  =  .0. 
->  ( ( w  .+  A )  =  .0. 
/\  ( A  .+  w )  =  .0.  ) ) )
16 rinvmod.0 . . 3  |-  .0.  =  ( 0g `  G )
17 cmnmnd 13951 . . . 4  |-  ( G  e. CMnd  ->  G  e.  Mnd )
181, 17syl 14 . . 3  |-  ( ph  ->  G  e.  Mnd )
196, 16, 7, 18, 4mndinvmod 13591 . 2  |-  ( ph  ->  E* w  e.  B  ( ( w  .+  A )  =  .0. 
/\  ( A  .+  w )  =  .0.  ) )
20 rmoim 3008 . 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 2202   A.wral 2511   E*wrmo 2514   ` cfv 5333  (class class class)co 6028   Basecbs 13145   +g cplusg 13223   0gc0g 13402   Mndcmnd 13562  CMndccmn 13934
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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-cnex 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-riota 5981  df-ov 6031  df-inn 9186  df-2 9244  df-ndx 13148  df-slot 13149  df-base 13151  df-plusg 13236  df-0g 13404  df-mgm 13502  df-sgrp 13548  df-mnd 13563  df-cmn 13936
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator