MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  grpidinv2 Structured version   Visualization version   GIF version

Theorem grpidinv2 18811
Description: A group's properties using the explicit identity element. (Contributed by NM, 5-Feb-2010.) (Revised by AV, 1-Sep-2021.)
Hypotheses
Ref Expression
grplrinv.b 𝐵 = (Base‘𝐺)
grplrinv.p + = (+g𝐺)
grplrinv.i 0 = (0g𝐺)
Assertion
Ref Expression
grpidinv2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ((( 0 + 𝐴) = 𝐴 ∧ (𝐴 + 0 ) = 𝐴) ∧ ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
Distinct variable groups:   𝑦,𝐵   𝑦,𝐺   𝑦, +   𝑦, 0   𝑦,𝐴

Proof of Theorem grpidinv2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 grplrinv.b . . 3 𝐵 = (Base‘𝐺)
2 grplrinv.p . . 3 + = (+g𝐺)
3 grplrinv.i . . 3 0 = (0g𝐺)
41, 2, 3grplid 18785 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ( 0 + 𝐴) = 𝐴)
51, 2, 3grprid 18786 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → (𝐴 + 0 ) = 𝐴)
61, 2, 3grplrinv 18810 . . 3 (𝐺 ∈ Grp → ∀𝑧𝐵𝑦𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ))
7 oveq2 7366 . . . . . . 7 (𝑧 = 𝐴 → (𝑦 + 𝑧) = (𝑦 + 𝐴))
87eqeq1d 2735 . . . . . 6 (𝑧 = 𝐴 → ((𝑦 + 𝑧) = 0 ↔ (𝑦 + 𝐴) = 0 ))
9 oveq1 7365 . . . . . . 7 (𝑧 = 𝐴 → (𝑧 + 𝑦) = (𝐴 + 𝑦))
109eqeq1d 2735 . . . . . 6 (𝑧 = 𝐴 → ((𝑧 + 𝑦) = 0 ↔ (𝐴 + 𝑦) = 0 ))
118, 10anbi12d 632 . . . . 5 (𝑧 = 𝐴 → (((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) ↔ ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
1211rexbidv 3172 . . . 4 (𝑧 = 𝐴 → (∃𝑦𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) ↔ ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
1312rspcv 3576 . . 3 (𝐴𝐵 → (∀𝑧𝐵𝑦𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) → ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
146, 13mpan9 508 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))
154, 5, 14jca31 516 1 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ((( 0 + 𝐴) = 𝐴 ∧ (𝐴 + 0 ) = 𝐴) ∧ ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397   = wceq 1542  wcel 2107  wral 3061  wrex 3070  cfv 6497  (class class class)co 7358  Basecbs 17088  +gcplusg 17138  0gc0g 17326  Grpcgrp 18753
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5257  ax-nul 5264  ax-pow 5321  ax-pr 5385  ax-un 7673
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3352  df-reu 3353  df-rab 3407  df-v 3446  df-sbc 3741  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4284  df-if 4488  df-pw 4563  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4867  df-br 5107  df-opab 5169  df-mpt 5190  df-id 5532  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6449  df-fun 6499  df-fn 6500  df-f 6501  df-fv 6505  df-riota 7314  df-ov 7361  df-0g 17328  df-mgm 18502  df-sgrp 18551  df-mnd 18562  df-grp 18756  df-minusg 18757
This theorem is referenced by:  grpidinv  18812
  Copyright terms: Public domain W3C validator