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

Theorem grpinva 13414
Description: Deduce right inverse 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 ((𝜑𝑥𝐵) → ∃𝑦𝐵 (𝑦 + 𝑥) = 𝑂)
grpinva.x ((𝜑𝜓) → 𝑋𝐵)
grpinva.n ((𝜑𝜓) → 𝑁𝐵)
grpinva.e ((𝜑𝜓) → (𝑁 + 𝑋) = 𝑂)
Assertion
Ref Expression
grpinva ((𝜑𝜓) → (𝑋 + 𝑁) = 𝑂)
Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝑂,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑦,𝑁,𝑧   𝑥, + ,𝑦,𝑧   𝑦,𝑋,𝑧   𝜓,𝑦
Allowed substitution hints:   𝜓(𝑥,𝑧)   𝑁(𝑥)   𝑋(𝑥)

Proof of Theorem grpinva
Dummy variables 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 grpinva.c . 2 ((𝜑𝑥𝐵𝑦𝐵) → (𝑥 + 𝑦) ∈ 𝐵)
2 grpinva.o . 2 (𝜑𝑂𝐵)
3 grpinva.i . 2 ((𝜑𝑥𝐵) → (𝑂 + 𝑥) = 𝑥)
4 grpinva.a . 2 ((𝜑 ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
5 grpinva.r . 2 ((𝜑𝑥𝐵) → ∃𝑦𝐵 (𝑦 + 𝑥) = 𝑂)
613expb 1228 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥 + 𝑦) ∈ 𝐵)
76caovclg 6157 . . . 4 ((𝜑 ∧ (𝑢𝐵𝑣𝐵)) → (𝑢 + 𝑣) ∈ 𝐵)
87adantlr 477 . . 3 (((𝜑𝜓) ∧ (𝑢𝐵𝑣𝐵)) → (𝑢 + 𝑣) ∈ 𝐵)
9 grpinva.x . . 3 ((𝜑𝜓) → 𝑋𝐵)
10 grpinva.n . . 3 ((𝜑𝜓) → 𝑁𝐵)
118, 9, 10caovcld 6158 . 2 ((𝜑𝜓) → (𝑋 + 𝑁) ∈ 𝐵)
124caovassg 6163 . . . . 5 ((𝜑 ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢 + 𝑣) + 𝑤) = (𝑢 + (𝑣 + 𝑤)))
1312adantlr 477 . . . 4 (((𝜑𝜓) ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢 + 𝑣) + 𝑤) = (𝑢 + (𝑣 + 𝑤)))
1413, 9, 10, 11caovassd 6164 . . 3 ((𝜑𝜓) → ((𝑋 + 𝑁) + (𝑋 + 𝑁)) = (𝑋 + (𝑁 + (𝑋 + 𝑁))))
15 grpinva.e . . . . . 6 ((𝜑𝜓) → (𝑁 + 𝑋) = 𝑂)
1615oveq1d 6015 . . . . 5 ((𝜑𝜓) → ((𝑁 + 𝑋) + 𝑁) = (𝑂 + 𝑁))
1713, 10, 9, 10caovassd 6164 . . . . 5 ((𝜑𝜓) → ((𝑁 + 𝑋) + 𝑁) = (𝑁 + (𝑋 + 𝑁)))
18 oveq2 6008 . . . . . . 7 (𝑦 = 𝑁 → (𝑂 + 𝑦) = (𝑂 + 𝑁))
19 id 19 . . . . . . 7 (𝑦 = 𝑁𝑦 = 𝑁)
2018, 19eqeq12d 2244 . . . . . 6 (𝑦 = 𝑁 → ((𝑂 + 𝑦) = 𝑦 ↔ (𝑂 + 𝑁) = 𝑁))
213ralrimiva 2603 . . . . . . . 8 (𝜑 → ∀𝑥𝐵 (𝑂 + 𝑥) = 𝑥)
22 oveq2 6008 . . . . . . . . . 10 (𝑥 = 𝑦 → (𝑂 + 𝑥) = (𝑂 + 𝑦))
23 id 19 . . . . . . . . . 10 (𝑥 = 𝑦𝑥 = 𝑦)
2422, 23eqeq12d 2244 . . . . . . . . 9 (𝑥 = 𝑦 → ((𝑂 + 𝑥) = 𝑥 ↔ (𝑂 + 𝑦) = 𝑦))
2524cbvralvw 2769 . . . . . . . 8 (∀𝑥𝐵 (𝑂 + 𝑥) = 𝑥 ↔ ∀𝑦𝐵 (𝑂 + 𝑦) = 𝑦)
2621, 25sylib 122 . . . . . . 7 (𝜑 → ∀𝑦𝐵 (𝑂 + 𝑦) = 𝑦)
2726adantr 276 . . . . . 6 ((𝜑𝜓) → ∀𝑦𝐵 (𝑂 + 𝑦) = 𝑦)
2820, 27, 10rspcdva 2912 . . . . 5 ((𝜑𝜓) → (𝑂 + 𝑁) = 𝑁)
2916, 17, 283eqtr3d 2270 . . . 4 ((𝜑𝜓) → (𝑁 + (𝑋 + 𝑁)) = 𝑁)
3029oveq2d 6016 . . 3 ((𝜑𝜓) → (𝑋 + (𝑁 + (𝑋 + 𝑁))) = (𝑋 + 𝑁))
3114, 30eqtrd 2262 . 2 ((𝜑𝜓) → ((𝑋 + 𝑁) + (𝑋 + 𝑁)) = (𝑋 + 𝑁))
321, 2, 3, 4, 5, 11, 31grpinvalem 13413 1 ((𝜑𝜓) → (𝑋 + 𝑁) = 𝑂)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1002   = wceq 1395  wcel 2200  wral 2508  wrex 2509  (class class class)co 6000
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-iota 5277  df-fv 5325  df-ov 6003
This theorem is referenced by:  grprida  13415  grprcan  13565  grprinv  13579
  Copyright terms: Public domain W3C validator