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

Theorem grpidinv2 19127
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 19097 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ( 0 + 𝐴) = 𝐴)
51, 2, 3grprid 19098 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → (𝐴 + 0 ) = 𝐴)
61, 2, 3grplrinv 19126 . . 3 (𝐺 ∈ Grp → ∀𝑧𝐵𝑦𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ))
7 oveq2 7425 . . . . . . 7 (𝑧 = 𝐴 → (𝑦 + 𝑧) = (𝑦 + 𝐴))
87eqeq1d 2764 . . . . . 6 (𝑧 = 𝐴 → ((𝑦 + 𝑧) = 0 ↔ (𝑦 + 𝐴) = 0 ))
9 oveq1 7424 . . . . . . 7 (𝑧 = 𝐴 → (𝑧 + 𝑦) = (𝐴 + 𝑦))
109eqeq1d 2764 . . . . . 6 (𝑧 = 𝐴 → ((𝑧 + 𝑦) = 0 ↔ (𝐴 + 𝑦) = 0 ))
118, 10anbi12d 644 . . . . 5 (𝑧 = 𝐴 → (((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) ↔ ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
1211rexbidv 3188 . . . 4 (𝑧 = 𝐴 → (∃𝑦𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) ↔ ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
1312rspcv 3575 . . 3 (𝐴𝐵 → (∀𝑧𝐵𝑦𝐵 ((𝑦 + 𝑧) = 0 ∧ (𝑧 + 𝑦) = 0 ) → ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
146, 13mpan9 516 . 2 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 ))
154, 5, 14jca31 524 1 ((𝐺 ∈ Grp ∧ 𝐴𝐵) → ((( 0 + 𝐴) = 𝐴 ∧ (𝐴 + 0 ) = 𝐴) ∧ ∃𝑦𝐵 ((𝑦 + 𝐴) = 0 ∧ (𝐴 + 𝑦) = 0 )))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wral 3078  wrex 3088  cfv 6537  (class class class)co 7417  Basecbs 17307  +gcplusg 17348  0gc0g 17530  Grpcgrp 19063
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-riota 7374  df-ov 7420  df-0g 17532  df-mgm 18736  df-sgrp 18827  df-mnd 18843  df-grp 19066  df-minusg 19067
This theorem is used by:  grpidinv  19128
  Copyright terms: Public domain W3C validator