Theorem grprida 18759

Description: Deduce right identity from left inverse and left identity in an associative structure (such as a group). (Contributed by NM, 10-Aug-2013.) (Proof shortened by Mario Carneiro, 6-Jan-2015.)

Hypotheses

Ref	Expression
grpinva.c	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
grpinva.o	⊢ (𝜑 → 𝑂 ∈ 𝐵)
grpinva.i	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑂 + 𝑥) = 𝑥)
grpinva.a	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
grpinva.r	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 𝑂)

Assertion

Ref	Expression
grprida	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 + 𝑂) = 𝑥)

Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝑂,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥, + ,𝑦,𝑧

Proof of Theorem grprida

Dummy variables 𝑢 𝑛 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		grpinva.r	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 𝑂)
2		oveq1 7430	. . . . . 6 ⊢ (𝑦 = 𝑛 → (𝑦 + 𝑥) = (𝑛 + 𝑥))
3	2	eqeq1d 2768	. . . . 5 ⊢ (𝑦 = 𝑛 → ((𝑦 + 𝑥) = 𝑂 ↔ (𝑛 + 𝑥) = 𝑂))
4	3	cbvrexvw 3247	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 𝑂 ↔ ∃𝑛 ∈ 𝐵 (𝑛 + 𝑥) = 𝑂)
5	1, 4	sylib 221	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∃𝑛 ∈ 𝐵 (𝑛 + 𝑥) = 𝑂)
6		grpinva.a	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
7	6	caovassg 7621	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢 + 𝑣) + 𝑤) = (𝑢 + (𝑣 + 𝑤)))
8	7	adantlr 728	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ (𝑛 ∈ 𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑢 + 𝑣) + 𝑤) = (𝑢 + (𝑣 + 𝑤)))
9		simprl 783	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ (𝑛 ∈ 𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → 𝑥 ∈ 𝐵)
10		simprrl 793	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ (𝑛 ∈ 𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → 𝑛 ∈ 𝐵)
11	8, 9, 10, 9	caovassd 7622	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ (𝑛 ∈ 𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → ((𝑥 + 𝑛) + 𝑥) = (𝑥 + (𝑛 + 𝑥)))
12		grpinva.c	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
13		grpinva.o	. . . . . . 7 ⊢ (𝜑 → 𝑂 ∈ 𝐵)
14		grpinva.i	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑂 + 𝑥) = 𝑥)
15		simprrr 794	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ (𝑛 ∈ 𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → (𝑛 + 𝑥) = 𝑂)
16	12, 13, 14, 6, 1, 9, 10, 15	grpinva 18758	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ (𝑛 ∈ 𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → (𝑥 + 𝑛) = 𝑂)
17	16	oveq1d 7438	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ (𝑛 ∈ 𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → ((𝑥 + 𝑛) + 𝑥) = (𝑂 + 𝑥))
18	15	oveq2d 7439	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ (𝑛 ∈ 𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → (𝑥 + (𝑛 + 𝑥)) = (𝑥 + 𝑂))
19	11, 17, 18	3eqtr3d 2809	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ (𝑛 ∈ 𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → (𝑂 + 𝑥) = (𝑥 + 𝑂))
20	19	anassrs 473	. . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (𝑛 ∈ 𝐵 ∧ (𝑛 + 𝑥) = 𝑂)) → (𝑂 + 𝑥) = (𝑥 + 𝑂))
21	5, 20	rexlimddv 3175	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑂 + 𝑥) = (𝑥 + 𝑂))
22	21, 14	eqtr3d 2803	1 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 + 𝑂) = 𝑥)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∃wrex 3092  (class class class)co 7423

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 2148  ax-9 2156  ax-ext 2738

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-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-iota 6499  df-fv 6551  df-ov 7426

This theorem is used by:  isgrpde  19055