Theorem lidrideqd 18683

Description: If there is a left and right identity element for any binary operation (group operation) +, both identity elements are equal. Generalization of statement in [Lang] p. 3: it is sufficient that "e" is a left identity element and "e`" is a right identity element instead of both being (two-sided) identity elements. (Contributed by AV, 26-Dec-2023.)

Hypotheses

Ref	Expression
lidrideqd.l	⊢ (𝜑 → 𝐿 ∈ 𝐵)
lidrideqd.r	⊢ (𝜑 → 𝑅 ∈ 𝐵)
lidrideqd.li	⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝐿 + 𝑥) = 𝑥)
lidrideqd.ri	⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥)

Assertion

Ref	Expression
lidrideqd	⊢ (𝜑 → 𝐿 = 𝑅)

Distinct variable groups:   𝑥,𝐵   𝑥,𝐿   𝑥,𝑅   𝑥, +

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem lidrideqd

Step	Hyp	Ref	Expression
1		oveq1 7439	. . . 4 ⊢ (𝑥 = 𝐿 → (𝑥 + 𝑅) = (𝐿 + 𝑅))
2		id 22	. . . 4 ⊢ (𝑥 = 𝐿 → 𝑥 = 𝐿)
3	1, 2	eqeq12d 2752	. . 3 ⊢ (𝑥 = 𝐿 → ((𝑥 + 𝑅) = 𝑥 ↔ (𝐿 + 𝑅) = 𝐿))
4		lidrideqd.ri	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥)
5		lidrideqd.l	. . 3 ⊢ (𝜑 → 𝐿 ∈ 𝐵)
6	3, 4, 5	rspcdva 3622	. 2 ⊢ (𝜑 → (𝐿 + 𝑅) = 𝐿)
7		oveq2 7440	. . . 4 ⊢ (𝑥 = 𝑅 → (𝐿 + 𝑥) = (𝐿 + 𝑅))
8		id 22	. . . 4 ⊢ (𝑥 = 𝑅 → 𝑥 = 𝑅)
9	7, 8	eqeq12d 2752	. . 3 ⊢ (𝑥 = 𝑅 → ((𝐿 + 𝑥) = 𝑥 ↔ (𝐿 + 𝑅) = 𝑅))
10		lidrideqd.li	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝐿 + 𝑥) = 𝑥)
11		lidrideqd.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ 𝐵)
12	9, 10, 11	rspcdva 3622	. 2 ⊢ (𝜑 → (𝐿 + 𝑅) = 𝑅)
13	6, 12	eqtr3d 2778	1 ⊢ (𝜑 → 𝐿 = 𝑅)

Syntax hints:   → wi 4   = wceq 1539   ∈ wcel 2107  ∀wral 3060  (class class class)co 7432

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2714  df-cleq 2728  df-clel 2815  df-ral 3061  df-rab 3436  df-v 3481  df-dif 3953  df-un 3955  df-ss 3967  df-nul 4333  df-if 4525  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-br 5143  df-iota 6513  df-fv 6568  df-ov 7435

This theorem is referenced by:  lidrididd  18684