Theorem mndractf1 33659

Description: If an element 𝑋 of a monoid 𝐸 is right-invertible, with inverse 𝑌, then its left-translation 𝐺 is injective. See also grplactf1o 19283. Remark in chapter I. of [BourbakiAlg1] p. 17 . (Contributed by Thierry Arnoux, 3-Aug-2025.)

Hypotheses

Ref	Expression
mndractfo.b	⊢ 𝐵 = (Base‘𝐸)
mndractfo.z	⊢ 0 = (0g‘𝐸)
mndractfo.p	⊢ + = (+g‘𝐸)
mndractfo.f	⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ (𝑎 + 𝑋))
mndractfo.e	⊢ (𝜑 → 𝐸 ∈ Mnd)
mndractfo.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
mndractf1.1	⊢ (𝜑 → 𝑌 ∈ 𝐵)
mndractf1.2	⊢ (𝜑 → (𝑋 + 𝑌) = 0 )

Assertion

Ref	Expression
mndractf1	⊢ (𝜑 → 𝐺:𝐵⟶1-1𝐵)

Distinct variable groups:   + ,𝑎   0 ,𝑎   𝐵,𝑎   𝐺,𝑎   𝑋,𝑎   𝜑,𝑎

Allowed substitution hints:   𝐸(𝑎)   𝑌(𝑎)

Proof of Theorem mndractf1

Dummy variables 𝑖 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mndractfo.b	. . . 4 ⊢ 𝐵 = (Base‘𝐸)
2		mndractfo.p	. . . 4 ⊢ + = (+g‘𝐸)
3		mndractfo.e	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ Mnd)
4	3	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝐸 ∈ Mnd)
5		simpr 490	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑎 ∈ 𝐵)
6		mndractfo.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
7	6	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑋 ∈ 𝐵)
8	1, 2, 4, 5, 7	mndcld 33653	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑎 + 𝑋) ∈ 𝐵)
9		mndractfo.f	. . 3 ⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ (𝑎 + 𝑋))
10	8, 9	fmptd 7138	. 2 ⊢ (𝜑 → 𝐺:𝐵⟶𝐵)
11		simpr 490	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝐺‘𝑖) = (𝐺‘𝑗))
12		oveq1 7450	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑖 → (𝑎 + 𝑋) = (𝑖 + 𝑋))
13		simpllr 788	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → 𝑖 ∈ 𝐵)
14		ovexd 7478	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝑖 + 𝑋) ∈ V)
15	9, 12, 13, 14	fvmptd3 7040	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝐺‘𝑖) = (𝑖 + 𝑋))
16		oveq1 7450	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑗 → (𝑎 + 𝑋) = (𝑗 + 𝑋))
17		simplr 781	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → 𝑗 ∈ 𝐵)
18		ovexd 7478	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝑗 + 𝑋) ∈ V)
19	9, 16, 17, 18	fvmptd3 7040	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝐺‘𝑗) = (𝑗 + 𝑋))
20	11, 15, 19	3eqtr3d 2806	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝑖 + 𝑋) = (𝑗 + 𝑋))
21	20	oveq1d 7458	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → ((𝑖 + 𝑋) + 𝑌) = ((𝑗 + 𝑋) + 𝑌))
22	3	ad3antrrr 743	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → 𝐸 ∈ Mnd)
23	6	ad3antrrr 743	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → 𝑋 ∈ 𝐵)
24		mndractf1.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
25	24	ad3antrrr 743	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → 𝑌 ∈ 𝐵)
26	1, 2, 22, 13, 23, 25	mndassd 33654	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → ((𝑖 + 𝑋) + 𝑌) = (𝑖 + (𝑋 + 𝑌)))
27	1, 2, 22, 17, 23, 25	mndassd 33654	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → ((𝑗 + 𝑋) + 𝑌) = (𝑗 + (𝑋 + 𝑌)))
28	21, 26, 27	3eqtr3d 2806	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝑖 + (𝑋 + 𝑌)) = (𝑗 + (𝑋 + 𝑌)))
29		mndractf1.2	. . . . . . . . 9 ⊢ (𝜑 → (𝑋 + 𝑌) = 0 )
30	29	ad3antrrr 743	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝑋 + 𝑌) = 0 )
31	30	oveq2d 7459	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝑖 + (𝑋 + 𝑌)) = (𝑖 + 0 ))
32	30	oveq2d 7459	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝑗 + (𝑋 + 𝑌)) = (𝑗 + 0 ))
33	28, 31, 32	3eqtr3d 2806	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝑖 + 0 ) = (𝑗 + 0 ))
34		mndractfo.z	. . . . . . . 8 ⊢ 0 = (0g‘𝐸)
35	1, 2, 34	mndrid 18974	. . . . . . 7 ⊢ ((𝐸 ∈ Mnd ∧ 𝑖 ∈ 𝐵) → (𝑖 + 0 ) = 𝑖)
36	22, 13, 35	syl2anc 596	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝑖 + 0 ) = 𝑖)
37	1, 2, 34	mndrid 18974	. . . . . . 7 ⊢ ((𝐸 ∈ Mnd ∧ 𝑗 ∈ 𝐵) → (𝑗 + 0 ) = 𝑗)
38	22, 17, 37	syl2anc 596	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → (𝑗 + 0 ) = 𝑗)
39	33, 36, 38	3eqtr3d 2806	. . . . 5 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐺‘𝑖) = (𝐺‘𝑗)) → 𝑖 = 𝑗)
40	39	ex 418	. . . 4 ⊢ (((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) → ((𝐺‘𝑖) = (𝐺‘𝑗) → 𝑖 = 𝑗))
41	40	anasss 472	. . 3 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝐵 ∧ 𝑗 ∈ 𝐵)) → ((𝐺‘𝑖) = (𝐺‘𝑗) → 𝑖 = 𝑗))
42	41	ralrimivva 3209	. 2 ⊢ (𝜑 → ∀𝑖 ∈ 𝐵 ∀𝑗 ∈ 𝐵 ((𝐺‘𝑖) = (𝐺‘𝑗) → 𝑖 = 𝑗))
43		dff13 7281	. 2 ⊢ (𝐺:𝐵⟶1-1𝐵 ↔ (𝐺:𝐵⟶𝐵 ∧ ∀𝑖 ∈ 𝐵 ∀𝑗 ∈ 𝐵 ((𝐺‘𝑖) = (𝐺‘𝑗) → 𝑖 = 𝑗)))
44	10, 42, 43	sylanbrc 595	1 ⊢ (𝜑 → 𝐺:𝐵⟶1-1𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ↦ cmpt 5189  ⟶wf 6554  ⟶1-1wf1 6555  ‘cfv 6558  (class class class)co 7443  Basecbs 17416  +_gcplusg 17457  0_gc0g 17639  Mndcmnd 18952

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fv 6566  df-riota 7400  df-ov 7446  df-0g 17641  df-mgm 18845  df-sgrp 18937  df-mnd 18953

This theorem is used by:  mndractf1o  33662