Theorem mndlactf1 33633

Description: If an element 𝑋 of a monoid 𝐸 is right-invertible, with inverse 𝑌, then its left-translation 𝐹 is injective. See also grplactf1o 19259. 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 486	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝐸 ∈ Mnd)
5		mndlactfo.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6	5	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑋 ∈ 𝐵)
7		simpr 490	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → 𝑎 ∈ 𝐵)
8	1, 2, 4, 6, 7	mndcld 33629	. . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝑋 + 𝑎) ∈ 𝐵)
9		mndlactfo.f	. . 3 ⊢ 𝐹 = (𝑎 ∈ 𝐵 ↦ (𝑋 + 𝑎))
10	8, 9	fmptd 7114	. 2 ⊢ (𝜑 → 𝐹:𝐵⟶𝐵)
11		simpr 490	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝐹‘𝑖) = (𝐹‘𝑗))
12		oveq2 7428	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑖 → (𝑋 + 𝑎) = (𝑋 + 𝑖))
13		simpllr 788	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → 𝑖 ∈ 𝐵)
14		ovexd 7455	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝑋 + 𝑖) ∈ V)
15	9, 12, 13, 14	fvmptd3 7017	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝐹‘𝑖) = (𝑋 + 𝑖))
16		oveq2 7428	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑗 → (𝑋 + 𝑎) = (𝑋 + 𝑗))
17		simplr 781	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → 𝑗 ∈ 𝐵)
18		ovexd 7455	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝑋 + 𝑗) ∈ V)
19	9, 16, 17, 18	fvmptd3 7017	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝐹‘𝑗) = (𝑋 + 𝑗))
20	11, 15, 19	3eqtr3d 2803	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝑋 + 𝑖) = (𝑋 + 𝑗))
21	20	oveq2d 7436	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝑌 + (𝑋 + 𝑖)) = (𝑌 + (𝑋 + 𝑗)))
22	3	ad3antrrr 743	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → 𝐸 ∈ Mnd)
23		mndlactf1.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
24	23	ad3antrrr 743	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → 𝑌 ∈ 𝐵)
25	5	ad3antrrr 743	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → 𝑋 ∈ 𝐵)
26	1, 2, 22, 24, 25, 13	mndassd 33630	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ((𝑌 + 𝑋) + 𝑖) = (𝑌 + (𝑋 + 𝑖)))
27	1, 2, 22, 24, 25, 17	mndassd 33630	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ((𝑌 + 𝑋) + 𝑗) = (𝑌 + (𝑋 + 𝑗)))
28	21, 26, 27	3eqtr4d 2805	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ((𝑌 + 𝑋) + 𝑖) = ((𝑌 + 𝑋) + 𝑗))
29		mndlactf1.2	. . . . . . . . 9 ⊢ (𝜑 → (𝑌 + 𝑋) = 0 )
30	29	ad3antrrr 743	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → (𝑌 + 𝑋) = 0 )
31	30	oveq1d 7435	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ((𝑌 + 𝑋) + 𝑖) = ( 0 + 𝑖))
32	30	oveq1d 7435	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ((𝑌 + 𝑋) + 𝑗) = ( 0 + 𝑗))
33	28, 31, 32	3eqtr3d 2803	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ( 0 + 𝑖) = ( 0 + 𝑗))
34		mndlactfo.z	. . . . . . . 8 ⊢ 0 = (0g‘𝐸)
35	1, 2, 34	mndlid 18949	. . . . . . 7 ⊢ ((𝐸 ∈ Mnd ∧ 𝑖 ∈ 𝐵) → ( 0 + 𝑖) = 𝑖)
36	22, 13, 35	syl2anc 596	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ( 0 + 𝑖) = 𝑖)
37	1, 2, 34	mndlid 18949	. . . . . . 7 ⊢ ((𝐸 ∈ Mnd ∧ 𝑗 ∈ 𝐵) → ( 0 + 𝑗) = 𝑗)
38	22, 17, 37	syl2anc 596	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → ( 0 + 𝑗) = 𝑗)
39	33, 36, 38	3eqtr3d 2803	. . . . 5 ⊢ ((((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) ∧ (𝐹‘𝑖) = (𝐹‘𝑗)) → 𝑖 = 𝑗)
40	39	ex 418	. . . 4 ⊢ (((𝜑 ∧ 𝑖 ∈ 𝐵) ∧ 𝑗 ∈ 𝐵) → ((𝐹‘𝑖) = (𝐹‘𝑗) → 𝑖 = 𝑗))
41	40	anasss 472	. . 3 ⊢ ((𝜑 ∧ (𝑖 ∈ 𝐵 ∧ 𝑗 ∈ 𝐵)) → ((𝐹‘𝑖) = (𝐹‘𝑗) → 𝑖 = 𝑗))
42	41	ralrimivva 3205	. 2 ⊢ (𝜑 → ∀𝑖 ∈ 𝐵 ∀𝑗 ∈ 𝐵 ((𝐹‘𝑖) = (𝐹‘𝑗) → 𝑖 = 𝑗))
43		dff13 7258	. 2 ⊢ (𝐹:𝐵–1-1→𝐵 ↔ (𝐹:𝐵⟶𝐵 ∧ ∀𝑖 ∈ 𝐵 ∀𝑗 ∈ 𝐵 ((𝐹‘𝑖) = (𝐹‘𝑗) → 𝑖 = 𝑗)))
44	10, 42, 43	sylanbrc 595	1 ⊢ (𝜑 → 𝐹:𝐵–1-1→𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  Vcvv 3450   ↦ cmpt 5185  ⟶wf 6534  –1-1→wf1 6535  ‘cfv 6538  (class class class)co 7420  Basecbs 17392  +_gcplusg 17433  0_gc0g 17615  Mndcmnd 18928

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fv 6546  df-riota 7377  df-ov 7423  df-0g 17617  df-mgm 18821  df-sgrp 18913  df-mnd 18929

This theorem is used by:  mndlactf1o  33637