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

Theorem grpid 13111
Description: Two ways of saying that an element of a group is the identity element. Provides a convenient way to compute the value of the identity element. (Contributed by NM, 24-Aug-2011.)
Hypotheses
Ref Expression
grpinveu.b 𝐵 = (Base‘𝐺)
grpinveu.p + = (+g𝐺)
grpinveu.o 0 = (0g𝐺)
Assertion
Ref Expression
grpid ((𝐺 ∈ Grp ∧ 𝑋𝐵) → ((𝑋 + 𝑋) = 𝑋0 = 𝑋))

Proof of Theorem grpid
StepHypRef Expression
1 eqcom 2195 . 2 ( 0 = 𝑋𝑋 = 0 )
2 grpinveu.b . . . . . . 7 𝐵 = (Base‘𝐺)
3 grpinveu.o . . . . . . 7 0 = (0g𝐺)
42, 3grpidcl 13101 . . . . . 6 (𝐺 ∈ Grp → 0𝐵)
5 grpinveu.p . . . . . . . 8 + = (+g𝐺)
62, 5grprcan 13109 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑋𝐵0𝐵𝑋𝐵)) → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 ))
763exp2 1227 . . . . . 6 (𝐺 ∈ Grp → (𝑋𝐵 → ( 0𝐵 → (𝑋𝐵 → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 )))))
84, 7mpid 42 . . . . 5 (𝐺 ∈ Grp → (𝑋𝐵 → (𝑋𝐵 → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 ))))
98pm2.43d 50 . . . 4 (𝐺 ∈ Grp → (𝑋𝐵 → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 )))
109imp 124 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵) → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ 𝑋 = 0 ))
112, 5, 3grplid 13103 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋𝐵) → ( 0 + 𝑋) = 𝑋)
1211eqeq2d 2205 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵) → ((𝑋 + 𝑋) = ( 0 + 𝑋) ↔ (𝑋 + 𝑋) = 𝑋))
1310, 12bitr3d 190 . 2 ((𝐺 ∈ Grp ∧ 𝑋𝐵) → (𝑋 = 0 ↔ (𝑋 + 𝑋) = 𝑋))
141, 13bitr2id 193 1 ((𝐺 ∈ Grp ∧ 𝑋𝐵) → ((𝑋 + 𝑋) = 𝑋0 = 𝑋))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1364  wcel 2164  cfv 5254  (class class class)co 5918  Basecbs 12618  +gcplusg 12695  0gc0g 12867  Grpcgrp 13072
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-cnex 7963  ax-resscn 7964  ax-1re 7966  ax-addrcl 7969
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-iota 5215  df-fun 5256  df-fn 5257  df-fv 5262  df-riota 5873  df-ov 5921  df-inn 8983  df-2 9041  df-ndx 12621  df-slot 12622  df-base 12624  df-plusg 12708  df-0g 12869  df-mgm 12939  df-sgrp 12985  df-mnd 12998  df-grp 13075
This theorem is referenced by:  isgrpid2  13112  grpidd2  13113  subg0  13250  qus0  13305  ghmid  13319  lmod0vid  13816  cnfld0  14059
  Copyright terms: Public domain W3C validator