Theorem mndlactf1 33012

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

Hypotheses

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

Assertion

Ref	Expression
mndlactf1	⊢ (𝜑 → 𝐹:𝐵–1-1→𝐵)

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

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

Proof of Theorem mndlactf1

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

Step	Hyp	Ref	Expression
1		mndlactfo.b	. . . 4 ⊢ 𝐵 = (Base‘𝐸)
2		mndlactfo.p	. . . 4 ⊢ + = (+g‘𝐸)
3		mndlactfo.e	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ Mnd)
4	3	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝐸 ∈ Mnd)
5		mndlactfo.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6	5	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑋 ∈ 𝐵)
7		simpr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑎 ∈ 𝐵)
8	1, 2, 4, 6, 7	mndcld 33008	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑋 + 𝑎) ∈ 𝐵)
9		mndlactfo.f	. . 3 ⊢ 𝐹 = (𝑎 ∈ 𝐵 ↦ (𝑋 + 𝑎))
10	8, 9	fmptd 7148	. 2 ⊢ (𝜑 → 𝐹:𝐵⟶𝐵)
11		simpr 484	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝐹‘𝑖) = (𝐹‘𝑗))
12		oveq2 7456	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑖 → (𝑋 + 𝑎) = (𝑋 + 𝑖))
13		simpllr 775	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → 𝑖 ∈ 𝐵)
14		ovexd 7483	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝑋 + 𝑖) ∈ V)
15	9, 12, 13, 14	fvmptd3 7052	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝐹‘𝑖) = (𝑋 + 𝑖))
16		oveq2 7456	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑗 → (𝑋 + 𝑎) = (𝑋 + 𝑗))
17		simplr 768	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → 𝑗 ∈ 𝐵)
18		ovexd 7483	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝑋 + 𝑗) ∈ V)
19	9, 16, 17, 18	fvmptd3 7052	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝐹‘𝑗) = (𝑋 + 𝑗))
20	11, 15, 19	3eqtr3d 2788	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝑋 + 𝑖) = (𝑋 + 𝑗))
21	20	oveq2d 7464	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝑌 + (𝑋 + 𝑖)) = (𝑌 + (𝑋 + 𝑗)))
22	3	ad3antrrr 729	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → 𝐸 ∈ Mnd)
23		mndlactf1.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
24	23	ad3antrrr 729	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → 𝑌 ∈ 𝐵)
25	5	ad3antrrr 729	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → 𝑋 ∈ 𝐵)
26	1, 2, 22, 24, 25, 13	mndassd 33009	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ((𝑌 + 𝑋) + 𝑖) = (𝑌 + (𝑋 + 𝑖)))
27	1, 2, 22, 24, 25, 17	mndassd 33009	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ((𝑌 + 𝑋) + 𝑗) = (𝑌 + (𝑋 + 𝑗)))
28	21, 26, 27	3eqtr4d 2790	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ((𝑌 + 𝑋) + 𝑖) = ((𝑌 + 𝑋) + 𝑗))
29		mndlactf1.2	. . . . . . . . 9 ⊢ (𝜑 → (𝑌 + 𝑋) = 0 )
30	29	ad3antrrr 729	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝑌 + 𝑋) = 0 )
31	30	oveq1d 7463	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ((𝑌 + 𝑋) + 𝑖) = ( 0 + 𝑖))
32	30	oveq1d 7463	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ((𝑌 + 𝑋) + 𝑗) = ( 0 + 𝑗))
33	28, 31, 32	3eqtr3d 2788	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ( 0 + 𝑖) = ( 0 + 𝑗))
34		mndlactfo.z	. . . . . . . 8 ⊢ 0 = (0g‘𝐸)
35	1, 2, 34	mndlid 18792	. . . . . . 7 ⊢ ((𝐸 ∈ Mnd ∧ 𝑖 ∈ 𝐵) → ( 0 + 𝑖) = 𝑖)
36	22, 13, 35	syl2anc 583	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ( 0 + 𝑖) = 𝑖)
37	1, 2, 34	mndlid 18792	. . . . . . 7 ⊢ ((𝐸 ∈ Mnd ∧ 𝑗 ∈ 𝐵) → ( 0 + 𝑗) = 𝑗)
38	22, 17, 37	syl2anc 583	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ( 0 + 𝑗) = 𝑗)
39	33, 36, 38	3eqtr3d 2788	. . . . 5 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → 𝑖 = 𝑗)
40	39	ex 412	. . . 4 ⊢ (((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) → ((𝐹‘𝑖) = (𝐹‘𝑗) → 𝑖 = 𝑗))
41	40	anasss 466	. . 3 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝐵 ∧ 𝑗 ∈ 𝐵)) → ((𝐹‘𝑖) = (𝐹‘𝑗) → 𝑖 = 𝑗))
42	41	ralrimivva 3208	. 2 ⊢ (𝜑 → ∀𝑖 ∈ 𝐵 ∀𝑗 ∈ 𝐵 ((𝐹‘𝑖) = (𝐹‘𝑗) → 𝑖 = 𝑗))
43		dff13 7292	. 2 ⊢ (𝐹:𝐵–1-1→𝐵 ↔ (𝐹:𝐵⟶𝐵 ∧ ∀𝑖 ∈ 𝐵 ∀𝑗 ∈ 𝐵 ((𝐹‘𝑖) = (𝐹‘𝑗) → 𝑖 = 𝑗)))
44	10, 42, 43	sylanbrc 582	1 ⊢ (𝜑 → 𝐹:𝐵–1-1→𝐵)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2108  ∀wral 3067  Vcvv 3488   ↦ cmpt 5249  ⟶wf 6569  –1-1→wf1 6570  ‘cfv 6573  (class class class)co 7448  Basecbs 17258  +_gcplusg 17311  0_gc0g 17499  Mndcmnd 18772

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fv 6581  df-riota 7404  df-ov 7451  df-0g 17501  df-mgm 18678  df-sgrp 18757  df-mnd 18773

This theorem is referenced by:  mndlactf1o  33016