Theorem lidrididd 18831

Description: If there is a left and right identity element for any binary operation (group operation) +, the left identity element (and therefore also the right identity element according to lidrideqd 18830) is equal to the two-sided identity element. (Contributed by AV, 26-Dec-2023.)

Hypotheses

Ref	Expression
lidrideqd.l	⊢ (𝜑 → 𝐿 ∈ 𝐵)
lidrideqd.r	⊢ (𝜑 → 𝑅 ∈ 𝐵)
lidrideqd.li	⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝐿 + 𝑥) = 𝑥)
lidrideqd.ri	⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥)
lidrideqd.b	⊢ 𝐵 = (Base‘𝐺)
lidrideqd.p	⊢ + = (+g‘𝐺)
lidrididd.o	⊢ 0 = (0g‘𝐺)

Assertion

Ref	Expression
lidrididd	⊢ (𝜑 → 𝐿 = 0 )

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

Allowed substitution hints:   𝜑(𝑥)   𝐺(𝑥)   0 (𝑥)

Proof of Theorem lidrididd

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lidrideqd.b	. 2 ⊢ 𝐵 = (Base‘𝐺)
2		lidrididd.o	. 2 ⊢ 0 = (0g‘𝐺)
3		lidrideqd.p	. 2 ⊢ + = (+g‘𝐺)
4		lidrideqd.l	. 2 ⊢ (𝜑 → 𝐿 ∈ 𝐵)
5		lidrideqd.li	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝐿 + 𝑥) = 𝑥)
6		oveq2 7420	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝐿 + 𝑥) = (𝐿 + 𝑦))
7		id 23	. . . . 5 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
8	6, 7	eqeq12d 2777	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝐿 + 𝑥) = 𝑥 ↔ (𝐿 + 𝑦) = 𝑦))
9	8	rspcv 3573	. . 3 ⊢ (𝑦 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝐿 + 𝑥) = 𝑥 → (𝐿 + 𝑦) = 𝑦))
10	5, 9	mpan9 516	. 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐿 + 𝑦) = 𝑦)
11		lidrideqd.ri	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥)
12		lidrideqd.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ 𝐵)
13	4, 12, 5, 11	lidrideqd 18830	. . . 4 ⊢ (𝜑 → 𝐿 = 𝑅)
14		oveq1 7419	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 + 𝑅) = (𝑦 + 𝑅))
15	14, 7	eqeq12d 2777	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ((𝑥 + 𝑅) = 𝑥 ↔ (𝑦 + 𝑅) = 𝑦))
16	15	rspcv 3573	. . . . . 6 ⊢ (𝑦 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥 → (𝑦 + 𝑅) = 𝑦))
17		oveq2 7420	. . . . . . . . 9 ⊢ (𝐿 = 𝑅 → (𝑦 + 𝐿) = (𝑦 + 𝑅))
18	17	adantl 487	. . . . . . . 8 ⊢ (((𝑦 + 𝑅) = 𝑦 ∧ 𝐿 = 𝑅) → (𝑦 + 𝐿) = (𝑦 + 𝑅))
19		simpl 488	. . . . . . . 8 ⊢ (((𝑦 + 𝑅) = 𝑦 ∧ 𝐿 = 𝑅) → (𝑦 + 𝑅) = 𝑦)
20	18, 19	eqtrd 2796	. . . . . . 7 ⊢ (((𝑦 + 𝑅) = 𝑦 ∧ 𝐿 = 𝑅) → (𝑦 + 𝐿) = 𝑦)
21	20	ex 418	. . . . . 6 ⊢ ((𝑦 + 𝑅) = 𝑦 → (𝐿 = 𝑅 → (𝑦 + 𝐿) = 𝑦))
22	16, 21	syl6com 38	. . . . 5 ⊢ (∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥 → (𝑦 ∈ 𝐵 → (𝐿 = 𝑅 → (𝑦 + 𝐿) = 𝑦)))
23	22	com23 87	. . . 4 ⊢ (∀𝑥 ∈ 𝐵 (𝑥 + 𝑅) = 𝑥 → (𝐿 = 𝑅 → (𝑦 ∈ 𝐵 → (𝑦 + 𝐿) = 𝑦)))
24	11, 13, 23	sylc 66	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 → (𝑦 + 𝐿) = 𝑦))
25	24	imp 412	. 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑦 + 𝐿) = 𝑦)
26	1, 2, 3, 4, 10, 25	ismgmid2 18829	1 ⊢ (𝜑 → 𝐿 = 0 )

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  +_gcplusg 17408  0_gc0g 17590

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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fv 6539  df-riota 7369  df-ov 7415  df-0g 17592

This theorem is used by: (None)