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

Theorem isgrpid2 13905
Description: Properties showing that an element 𝑍 is the identity element of a group. (Contributed by NM, 7-Aug-2013.)
Hypotheses
Ref Expression
grpinveu.b 𝐵 = (Base‘𝐺)
grpinveu.p + = (+g‘𝐺)
grpinveu.o 0 = (0g‘𝐺)
Assertion
Ref Expression
isgrpid2 (𝐺 ∈ Grp → ((𝑍 ∈ 𝐵 ∧ (𝑍 + 𝑍) = 𝑍) ↔ 0 = 𝑍))

Proof of Theorem isgrpid2
StepHypRef Expression
1 grpinveu.b . . . . 5 𝐵 = (Base‘𝐺)
2 grpinveu.p . . . . 5 + = (+g‘𝐺)
3 grpinveu.o . . . . 5 0 = (0g‘𝐺)
41, 2, 3grpid 13904 . . . 4 ((𝐺 ∈ Grp ∧ 𝑍 ∈ 𝐵) → ((𝑍 + 𝑍) = 𝑍 ↔ 0 = 𝑍))
54biimpd 144 . . 3 ((𝐺 ∈ Grp ∧ 𝑍 ∈ 𝐵) → ((𝑍 + 𝑍) = 𝑍 → 0 = 𝑍))
65expimpd 363 . 2 (𝐺 ∈ Grp → ((𝑍 ∈ 𝐵 ∧ (𝑍 + 𝑍) = 𝑍) → 0 = 𝑍))
71, 3grpidcl 13894 . . . 4 (𝐺 ∈ Grp → 0 ∈ 𝐵)
81, 2, 3grplid 13896 . . . . 5 ((𝐺 ∈ Grp ∧ 0 ∈ 𝐵) → ( 0 + 0 ) = 0 )
97, 8mpdan 425 . . . 4 (𝐺 ∈ Grp → ( 0 + 0 ) = 0 )
107, 9jca 306 . . 3 (𝐺 ∈ Grp → ( 0 ∈ 𝐵 ∧ ( 0 + 0 ) = 0 ))
11 eleq1 2301 . . . 4 ( 0 = 𝑍 → ( 0 ∈ 𝐵 ↔ 𝑍 ∈ 𝐵))
12 id 19 . . . . . 6 ( 0 = 𝑍 → 0 = 𝑍)
1312, 12oveq12d 6106 . . . . 5 ( 0 = 𝑍 → ( 0 + 0 ) = (𝑍 + 𝑍))
1413, 12eqeq12d 2253 . . . 4 ( 0 = 𝑍 → (( 0 + 0 ) = 0 ↔ (𝑍 + 𝑍) = 𝑍))
1511, 14anbi12d 477 . . 3 ( 0 = 𝑍 → (( 0 ∈ 𝐵 ∧ ( 0 + 0 ) = 0 ) ↔ (𝑍 ∈ 𝐵 ∧ (𝑍 + 𝑍) = 𝑍)))
1610, 15syl5ibcom 155 . 2 (𝐺 ∈ Grp → ( 0 = 𝑍 → (𝑍 ∈ 𝐵 ∧ (𝑍 + 𝑍) = 𝑍)))
176, 16impbid 129 1 (𝐺 ∈ Grp → ((𝑍 ∈ 𝐵 ∧ (𝑍 + 𝑍) = 𝑍) ↔ 0 = 𝑍))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ‘cfv 5380  (class class class)co 6088  Basecbs 13411  +gcplusg 13491  0gc0g 13670  Grpcgrp 13865
This proof depends on 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-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-cnex 8277  ax-resscn 8278  ax-1re 8280  ax-addrcl 8283
This proof 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 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-iota 5340  df-fun 5382  df-fn 5383  df-fv 5388  df-riota 6041  df-ov 6091  df-inn 9315  df-2 9373  df-ndx 13414  df-slot 13415  df-base 13417  df-plusg 13504  df-0g 13672  df-mgm 13736  df-sgrp 13777  df-mnd 13790  df-grp 13868
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator