Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  grpridd GIF version

Theorem grpridd 5697
 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
grprinvlem.c ((𝜑𝑥𝐵𝑦𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
grprinvlem.o (𝜑𝑂𝐵)
grprinvlem.i ((𝜑𝑥𝐵) → (𝑂 + 𝑥) = 𝑥)
grprinvlem.a ((𝜑 ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
grprinvlem.n ((𝜑𝑥𝐵) → ∃𝑦𝐵 (𝑦 + 𝑥) = 𝑂)
Assertion
Ref Expression
grpridd ((𝜑𝑥𝐵) → (𝑥 + 𝑂) = 𝑥)
Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝑂,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥, + ,𝑦,𝑧

Proof of Theorem grpridd
Dummy variables 𝑢 𝑛 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 grprinvlem.n . . . 4 ((𝜑𝑥𝐵) → ∃𝑦𝐵 (𝑦 + 𝑥) = 𝑂)
2 oveq1 5519 . . . . . 6 (𝑦 = 𝑛 → (𝑦 + 𝑥) = (𝑛 + 𝑥))
32eqeq1d 2048 . . . . 5 (𝑦 = 𝑛 → ((𝑦 + 𝑥) = 𝑂 ↔ (𝑛 + 𝑥) = 𝑂))
43cbvrexv 2534 . . . 4 (∃𝑦𝐵 (𝑦 + 𝑥) = 𝑂 ↔ ∃𝑛𝐵 (𝑛 + 𝑥) = 𝑂)
51, 4sylib 127 . . 3 ((𝜑𝑥𝐵) → ∃𝑛𝐵 (𝑛 + 𝑥) = 𝑂)
6 grprinvlem.a . . . . . . . 8 ((𝜑 ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
76caovassg 5659 . . . . . . 7 ((𝜑 ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢 + 𝑣) + 𝑤) = (𝑢 + (𝑣 + 𝑤)))
87adantlr 446 . . . . . 6 (((𝜑 ∧ (𝑥𝐵 ∧ (𝑛𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢 + 𝑣) + 𝑤) = (𝑢 + (𝑣 + 𝑤)))
9 simprl 483 . . . . . 6 ((𝜑 ∧ (𝑥𝐵 ∧ (𝑛𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → 𝑥𝐵)
10 simprrl 491 . . . . . 6 ((𝜑 ∧ (𝑥𝐵 ∧ (𝑛𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → 𝑛𝐵)
118, 9, 10, 9caovassd 5660 . . . . 5 ((𝜑 ∧ (𝑥𝐵 ∧ (𝑛𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → ((𝑥 + 𝑛) + 𝑥) = (𝑥 + (𝑛 + 𝑥)))
12 grprinvlem.c . . . . . . 7 ((𝜑𝑥𝐵𝑦𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
13 grprinvlem.o . . . . . . 7 (𝜑𝑂𝐵)
14 grprinvlem.i . . . . . . 7 ((𝜑𝑥𝐵) → (𝑂 + 𝑥) = 𝑥)
15 simprrr 492 . . . . . . 7 ((𝜑 ∧ (𝑥𝐵 ∧ (𝑛𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → (𝑛 + 𝑥) = 𝑂)
1612, 13, 14, 6, 1, 9, 10, 15grprinvd 5696 . . . . . 6 ((𝜑 ∧ (𝑥𝐵 ∧ (𝑛𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → (𝑥 + 𝑛) = 𝑂)
1716oveq1d 5527 . . . . 5 ((𝜑 ∧ (𝑥𝐵 ∧ (𝑛𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → ((𝑥 + 𝑛) + 𝑥) = (𝑂 + 𝑥))
1815oveq2d 5528 . . . . 5 ((𝜑 ∧ (𝑥𝐵 ∧ (𝑛𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → (𝑥 + (𝑛 + 𝑥)) = (𝑥 + 𝑂))
1911, 17, 183eqtr3d 2080 . . . 4 ((𝜑 ∧ (𝑥𝐵 ∧ (𝑛𝐵 ∧ (𝑛 + 𝑥) = 𝑂))) → (𝑂 + 𝑥) = (𝑥 + 𝑂))
2019anassrs 380 . . 3 (((𝜑𝑥𝐵) ∧ (𝑛𝐵 ∧ (𝑛 + 𝑥) = 𝑂)) → (𝑂 + 𝑥) = (𝑥 + 𝑂))
215, 20rexlimddv 2437 . 2 ((𝜑𝑥𝐵) → (𝑂 + 𝑥) = (𝑥 + 𝑂))
2221, 14eqtr3d 2074 1 ((𝜑𝑥𝐵) → (𝑥 + 𝑂) = 𝑥)
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 97   ∧ w3a 885   = wceq 1243   ∈ wcel 1393  ∃wrex 2307  (class class class)co 5512 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022 This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-un 2922  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-iota 4867  df-fv 4910  df-ov 5515 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator