Theorem mndlrinv 33472

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 33471	. . 3 ⊢ (𝜑 → ((𝑀 + 𝑋) + 𝑁) = (𝑀 + (𝑋 + 𝑁)))
8		mndlrinv.1	. . . 4 ⊢ (𝜑 → (𝑀 + 𝑋) = 0 )
9	8	oveq1d 7432	. . 3 ⊢ (𝜑 → ((𝑀 + 𝑋) + 𝑁) = ( 0 + 𝑁))
10		mndlrinv.2	. . . 4 ⊢ (𝜑 → (𝑋 + 𝑁) = 0 )
11	10	oveq2d 7433	. . 3 ⊢ (𝜑 → (𝑀 + (𝑋 + 𝑁)) = (𝑀 + 0 ))
12	7, 9, 11	3eqtr3rd 2806	. 2 ⊢ (𝜑 → (𝑀 + 0 ) = ( 0 + 𝑁))
13		mndlrinv.z	. . . 4 ⊢ 0 = (0g‘𝐸)
14	1, 2, 13	mndrid 18864	. . 3 ⊢ ((𝐸 ∈ Mnd ∧ 𝑀 ∈ 𝐵) → (𝑀 + 0 ) = 𝑀)
15	3, 4, 14	syl2anc 596	. 2 ⊢ (𝜑 → (𝑀 + 0 ) = 𝑀)
16	1, 2, 13	mndlid 18863	. . 3 ⊢ ((𝐸 ∈ Mnd ∧ 𝑁 ∈ 𝐵) → ( 0 + 𝑁) = 𝑁)
17	3, 6, 16	syl2anc 596	. 2 ⊢ (𝜑 → ( 0 + 𝑁) = 𝑁)
18	12, 15, 17	3eqtr3d 2805	1 ⊢ (𝜑 → 𝑀 = 𝑁)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ‘cfv 6537  (class class class)co 7417  Basecbs 17307  +_gcplusg 17348  0_gc0g 17530  Mndcmnd 18842

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-riota 7374  df-ov 7420  df-0g 17532  df-mgm 18736  df-sgrp 18827  df-mnd 18843

This theorem is used by:  mndlrinvb  33473  mndlactf1o  33478