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

Theorem grpidinv2 18152
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 18127 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ( 0 + 𝐴) = 𝐴)
51, 2, 3grprid 18128 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → (𝐴 + 0 ) = 𝐴)
61, 2, 3grplrinv 18151 . . 3 (𝐺 ∈ Grp → ∀𝑧𝐵𝑦𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ))
7 oveq2 7158 . . . . . . 7 (𝑧 = 𝐴 → (𝑦 + 𝑧) = (𝑦 + 𝐴))
87eqeq1d 2823 . . . . . 6 (𝑧 = 𝐴 → ((𝑦 + 𝑧) = 0 ↔ (𝑦 + 𝐴) = 0 ))
9 oveq1 7157 . . . . . . 7 (𝑧 = 𝐴 → (𝑧 + 𝑦) = (𝐴 + 𝑦))
109eqeq1d 2823 . . . . . 6 (𝑧 = 𝐴 → ((𝑧 + 𝑦) = 0 ↔ (𝐴 + 𝑦) = 0 ))
118, 10anbi12d 632 . . . . 5 (𝑧 = 𝐴 → (((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) ↔ ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
1211rexbidv 3297 . . . 4 (𝑧 = 𝐴 → (∃𝑦𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) ↔ ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
1312rspcv 3618 . . 3 (𝐴𝐵 → (∀𝑧𝐵𝑦𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) → ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
146, 13mpan9 509 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))
154, 5, 14jca31 517 1 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ((( 0 + 𝐴) = 𝐴 ∧ (𝐴 + 0 ) = 𝐴) ∧ ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1533  wcel 2110  wral 3138  wrex 3139  cfv 6350  (class class class)co 7150  Basecbs 16477  +gcplusg 16559  0gc0g 16707  Grpcgrp 18097
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3497  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4833  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5455  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-fv 6358  df-riota 7108  df-ov 7153  df-0g 16709  df-mgm 17846  df-sgrp 17895  df-mnd 17906  df-grp 18100  df-minusg 18101
This theorem is referenced by:  grpidinv  18153
  Copyright terms: Public domain W3C validator