Theorem mndlrinv 33257

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 33256	. . 3 ⊢ (𝜑 → ((𝑀 + 𝑋) + 𝑁) = (𝑀 + (𝑋 + 𝑁)))
8		mndlrinv.1	. . . 4 ⊢ (𝜑 → (𝑀 + 𝑋) = 0 )
9	8	oveq1d 7415	. . 3 ⊢ (𝜑 → ((𝑀 + 𝑋) + 𝑁) = ( 0 + 𝑁))
10		mndlrinv.2	. . . 4 ⊢ (𝜑 → (𝑋 + 𝑁) = 0 )
11	10	oveq2d 7416	. . 3 ⊢ (𝜑 → (𝑀 + (𝑋 + 𝑁)) = (𝑀 + 0 ))
12	7, 9, 11	3eqtr3rd 2809	. 2 ⊢ (𝜑 → (𝑀 + 0 ) = ( 0 + 𝑁))
13		mndlrinv.z	. . . 4 ⊢ 0 = (0g‘𝐸)
14	1, 2, 13	mndrid 18803	. . 3 ⊢ ((𝐸 ∈ Mnd ∧ 𝑀 ∈ 𝐵) → (𝑀 + 0 ) = 𝑀)
15	3, 4, 14	syl2anc 595	. 2 ⊢ (𝜑 → (𝑀 + 0 ) = 𝑀)
16	1, 2, 13	mndlid 18802	. . 3 ⊢ ((𝐸 ∈ Mnd ∧ 𝑁 ∈ 𝐵) → ( 0 + 𝑁) = 𝑁)
17	3, 6, 16	syl2anc 595	. 2 ⊢ (𝜑 → ( 0 + 𝑁) = 𝑁)
18	12, 15, 17	3eqtr3d 2808	1 ⊢ (𝜑 → 𝑀 = 𝑁)

Syntax hints:   → wi 4   = wceq 1563   ∈ wcel 2145  ‘cfv 6525  (class class class)co 7400  Basecbs 17259  +_gcplusg 17300  0_gc0g 17482  Mndcmnd 18782

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-iota 6481  df-fun 6527  df-fv 6533  df-riota 7357  df-ov 7403  df-0g 17484  df-mgm 18688  df-sgrp 18767  df-mnd 18783

This theorem is referenced by:  mndlrinvb  33258  mndlactf1o  33263