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

Theorem grpidinv2 18634
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 18609 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ( 0 + 𝐴) = 𝐴)
51, 2, 3grprid 18610 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → (𝐴 + 0 ) = 𝐴)
61, 2, 3grplrinv 18633 . . 3 (𝐺 ∈ Grp → ∀𝑧𝐵𝑦𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ))
7 oveq2 7283 . . . . . . 7 (𝑧 = 𝐴 → (𝑦 + 𝑧) = (𝑦 + 𝐴))
87eqeq1d 2740 . . . . . 6 (𝑧 = 𝐴 → ((𝑦 + 𝑧) = 0 ↔ (𝑦 + 𝐴) = 0 ))
9 oveq1 7282 . . . . . . 7 (𝑧 = 𝐴 → (𝑧 + 𝑦) = (𝐴 + 𝑦))
109eqeq1d 2740 . . . . . 6 (𝑧 = 𝐴 → ((𝑧 + 𝑦) = 0 ↔ (𝐴 + 𝑦) = 0 ))
118, 10anbi12d 631 . . . . 5 (𝑧 = 𝐴 → (((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) ↔ ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
1211rexbidv 3226 . . . 4 (𝑧 = 𝐴 → (∃𝑦𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) ↔ ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
1312rspcv 3557 . . 3 (𝐴𝐵 → (∀𝑧𝐵𝑦𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) → ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
146, 13mpan9 507 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))
154, 5, 14jca31 515 1 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ((( 0 + 𝐴) = 𝐴 ∧ (𝐴 + 0 ) = 𝐴) ∧ ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1539  wcel 2106  wral 3064  wrex 3065  cfv 6433  (class class class)co 7275  Basecbs 16912  +gcplusg 16962  0gc0g 17150  Grpcgrp 18577
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fv 6441  df-riota 7232  df-ov 7278  df-0g 17152  df-mgm 18326  df-sgrp 18375  df-mnd 18386  df-grp 18580  df-minusg 18581
This theorem is referenced by:  grpidinv  18635
  Copyright terms: Public domain W3C validator