Theorem rinvmod 14113

Description: Uniqueness of a right inverse element in a commutative monoid, if it exists. Corresponds to caovimo 6283. (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

Step	Hyp	Ref	Expression
1		rinvmod.m	. . . . . . . . 9 |- ( ph -> G e. CMnd )
2	1	adantr 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 )
5	4	adantr 276	. . . . . . . 8 |- ( ( ph /\ w e. B ) -> A e. B )
6		rinvmod.b	. . . . . . . . 9 |- B = ( Base ` G )
7		rinvmod.p	. . . . . . . . 9 |- .+ = ( +g ` G )
8	6, 7	cmncom 14105	. . . . . . . 8 |- ( ( G e. CMnd /\ w e. B /\ A e. B ) -> ( w .+ A ) = ( A .+ w ) )
9	2, 3, 5, 8	syl3anc 1278	. . . . . . 7 |- ( ( ph /\ w e. B ) -> ( w .+ A ) = ( A .+ w ) )
10	9	adantr 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. )
12	10, 11	eqtrd 2271	. . . . 5 |- ( ( ( ph /\ w e. B ) /\ ( A .+ w ) = .0. ) -> ( w .+ A ) = .0. )
13	12, 11	jca 306	. . . 4 |- ( ( ( ph /\ w e. B ) /\ ( A .+ w ) = .0. ) -> ( ( w .+ A ) = .0. /\ ( A .+ w ) = .0. ) )
14	13	ex 115	. . 3 |- ( ( ph /\ w e. B ) -> ( ( A .+ w ) = .0. -> ( ( w .+ A ) = .0. /\ ( A .+ w ) = .0. ) ) )
15	14	ralrimiva 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 14104	. . . 4 |- ( G e. CMnd -> G e. Mnd )
18	1, 17	syl 14	. . 3 |- ( ph -> G e. Mnd )
19	6, 16, 7, 18, 4	mndinvmod 13758	. 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. ) )
21	15, 19, 20	sylc 62	1 |- ( ph -> E* w e. B ( A .+ w ) = .0. )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   A.wral 2528   E*wrmo 2531   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   0gc0g 13610   Mndcmnd 13729  CMndccmn 14087

This proof depends on 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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof 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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-riota 6038  df-ov 6088  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-cmn 14089

This theorem is used by: (None)