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

Theorem grpidinv 13847
Description: A group has a left and right identity element, and every member has a left and right inverse. (Contributed by NM, 14-Oct-2006.) (Revised by AV, 1-Sep-2021.)
Hypotheses
Ref Expression
grpidinv.b 𝐵 = (Base‘𝐺)
grpidinv.p + = (+g𝐺)
Assertion
Ref Expression
grpidinv (𝐺 ∈ Grp → ∃𝑢𝐵𝑥𝐵 (((𝑢 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑢) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢)))
Distinct variable groups:   𝑢,𝐺,𝑥,𝑦   𝑢,𝐵,𝑦   𝑢, + ,𝑦
Allowed substitution hints:   𝐵(𝑥)   + (𝑥)

Proof of Theorem grpidinv
StepHypRef Expression
1 grpidinv.b . . 3 𝐵 = (Base‘𝐺)
2 eqid 2238 . . 3 (0g𝐺) = (0g𝐺)
31, 2grpidcl 13817 . 2 (𝐺 ∈ Grp → (0g𝐺) ∈ 𝐵)
4 oveq1 6086 . . . . . . 7 (𝑢 = (0g𝐺) → (𝑢 + 𝑥) = ((0g𝐺) + 𝑥))
54eqeq1d 2247 . . . . . 6 (𝑢 = (0g𝐺) → ((𝑢 + 𝑥) = 𝑥 ↔ ((0g𝐺) + 𝑥) = 𝑥))
6 oveq2 6087 . . . . . . 7 (𝑢 = (0g𝐺) → (𝑥 + 𝑢) = (𝑥 + (0g𝐺)))
76eqeq1d 2247 . . . . . 6 (𝑢 = (0g𝐺) → ((𝑥 + 𝑢) = 𝑥 ↔ (𝑥 + (0g𝐺)) = 𝑥))
85, 7anbi12d 477 . . . . 5 (𝑢 = (0g𝐺) → (((𝑢 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑢) = 𝑥) ↔ (((0g𝐺) + 𝑥) = 𝑥 ∧ (𝑥 + (0g𝐺)) = 𝑥)))
9 eqeq2 2248 . . . . . . 7 (𝑢 = (0g𝐺) → ((𝑦 + 𝑥) = 𝑢 ↔ (𝑦 + 𝑥) = (0g𝐺)))
10 eqeq2 2248 . . . . . . 7 (𝑢 = (0g𝐺) → ((𝑥 + 𝑦) = 𝑢 ↔ (𝑥 + 𝑦) = (0g𝐺)))
119, 10anbi12d 477 . . . . . 6 (𝑢 = (0g𝐺) → (((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢) ↔ ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺))))
1211rexbidv 2551 . . . . 5 (𝑢 = (0g𝐺) → (∃𝑦𝐵 ((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢) ↔ ∃𝑦𝐵 ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺))))
138, 12anbi12d 477 . . . 4 (𝑢 = (0g𝐺) → ((((𝑢 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑢) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢)) ↔ ((((0g𝐺) + 𝑥) = 𝑥 ∧ (𝑥 + (0g𝐺)) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺)))))
1413ralbidv 2550 . . 3 (𝑢 = (0g𝐺) → (∀𝑥𝐵 (((𝑢 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑢) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢)) ↔ ∀𝑥𝐵 ((((0g𝐺) + 𝑥) = 𝑥 ∧ (𝑥 + (0g𝐺)) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺)))))
1514adantl 277 . 2 ((𝐺 ∈ Grp ∧ 𝑢 = (0g𝐺)) → (∀𝑥𝐵 (((𝑢 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑢) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢)) ↔ ∀𝑥𝐵 ((((0g𝐺) + 𝑥) = 𝑥 ∧ (𝑥 + (0g𝐺)) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺)))))
16 grpidinv.p . . . 4 + = (+g𝐺)
171, 16, 2grpidinv2 13846 . . 3 ((𝐺 ∈ Grp ∧ 𝑥𝐵) → ((((0g𝐺) + 𝑥) = 𝑥 ∧ (𝑥 + (0g𝐺)) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺))))
1817ralrimiva 2623 . 2 (𝐺 ∈ Grp → ∀𝑥𝐵 ((((0g𝐺) + 𝑥) = 𝑥 ∧ (𝑥 + (0g𝐺)) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = (0g𝐺) ∧ (𝑥 + 𝑦) = (0g𝐺))))
193, 15, 18rspcedvd 2935 1 (𝐺 ∈ Grp → ∃𝑢𝐵𝑥𝐵 (((𝑢 + 𝑥) = 𝑥 ∧ (𝑥 + 𝑢) = 𝑥) ∧ ∃𝑦𝐵 ((𝑦 + 𝑥) = 𝑢 ∧ (𝑥 + 𝑦) = 𝑢)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1402  wcel 2209  wral 2528  wrex 2529  cfv 5375  (class class class)co 6079  Basecbs 13335  +gcplusg 13414  0gc0g 13593  Grpcgrp 13788
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4244  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-cnex 8264  ax-resscn 8265  ax-1re 8267  ax-addrcl 8270
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6032  df-ov 6082  df-inn 9288  df-2 9346  df-ndx 13338  df-slot 13339  df-base 13341  df-plusg 13427  df-0g 13595  df-mgm 13659  df-sgrp 13700  df-mnd 13713  df-grp 13791  df-minusg 13792
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator