Theorem mndlrinv 33106

Description: In a monoid, if an element 𝑋 has both a left inverse 𝑀 and a right inverse 𝑁, they are equal. (Contributed by Thierry Arnoux, 3-Aug-2025.)

Hypotheses

Ref	Expression
mndlrinv.b	⊢ 𝐵 = (Base‘𝐸)
mndlrinv.z	⊢ 0 = (0g‘𝐸)
mndlrinv.p	⊢ + = (+g‘𝐸)
mndlrinv.e	⊢ (𝜑 → 𝐸 ∈ Mnd)
mndlrinv.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
mndlrinv.m	⊢ (𝜑 → 𝑀 ∈ 𝐵)
mndlrinv.n	⊢ (𝜑 → 𝑁 ∈ 𝐵)
mndlrinv.1	⊢ (𝜑 → (𝑀 + 𝑋) = 0 )
mndlrinv.2	⊢ (𝜑 → (𝑋 + 𝑁) = 0 )

Assertion

Ref	Expression
mndlrinv	⊢ (𝜑 → 𝑀 = 𝑁)

Proof of Theorem mndlrinv

Step	Hyp	Ref	Expression
1		mndlrinv.b	. . . 4 ⊢ 𝐵 = (Base‘𝐸)
2		mndlrinv.p	. . . 4 ⊢ + = (+g‘𝐸)
3		mndlrinv.e	. . . 4 ⊢ (𝜑 → 𝐸 ∈ Mnd)
4		mndlrinv.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝐵)
5		mndlrinv.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6		mndlrinv.n	. . . 4 ⊢ (𝜑 → 𝑁 ∈ 𝐵)
7	1, 2, 3, 4, 5, 6	mndassd 33105	. . 3 ⊢ (𝜑 → ((𝑀 + 𝑋) + 𝑁) = (𝑀 + (𝑋 + 𝑁)))
8		mndlrinv.1	. . . 4 ⊢ (𝜑 → (𝑀 + 𝑋) = 0 )
9	8	oveq1d 7373	. . 3 ⊢ (𝜑 → ((𝑀 + 𝑋) + 𝑁) = ( 0 + 𝑁))
10		mndlrinv.2	. . . 4 ⊢ (𝜑 → (𝑋 + 𝑁) = 0 )
11	10	oveq2d 7374	. . 3 ⊢ (𝜑 → (𝑀 + (𝑋 + 𝑁)) = (𝑀 + 0 ))
12	7, 9, 11	3eqtr3rd 2780	. 2 ⊢ (𝜑 → (𝑀 + 0 ) = ( 0 + 𝑁))
13		mndlrinv.z	. . . 4 ⊢ 0 = (0g‘𝐸)
14	1, 2, 13	mndrid 18680	. . 3 ⊢ ((𝐸 ∈ Mnd ∧ 𝑀 ∈ 𝐵) → (𝑀 + 0 ) = 𝑀)
15	3, 4, 14	syl2anc 584	. 2 ⊢ (𝜑 → (𝑀 + 0 ) = 𝑀)
16	1, 2, 13	mndlid 18679	. . 3 ⊢ ((𝐸 ∈ Mnd ∧ 𝑁 ∈ 𝐵) → ( 0 + 𝑁) = 𝑁)
17	3, 6, 16	syl2anc 584	. 2 ⊢ (𝜑 → ( 0 + 𝑁) = 𝑁)
18	12, 15, 17	3eqtr3d 2779	1 ⊢ (𝜑 → 𝑀 = 𝑁)

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2113  ‘cfv 6492  (class class class)co 7358  Basecbs 17136  +_gcplusg 17177  0_gc0g 17359  Mndcmnd 18659

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-iota 6448  df-fun 6494  df-fv 6500  df-riota 7315  df-ov 7361  df-0g 17361  df-mgm 18565  df-sgrp 18644  df-mnd 18660

This theorem is referenced by:  mndlrinvb  33107  mndlactf1o  33112