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

Theorem grpinvval 13584
Description: The inverse of a group element. (Contributed by NM, 24-Aug-2011.) (Revised by Mario Carneiro, 7-Aug-2013.)
Hypotheses
Ref Expression
grpinvval.b 𝐵 = (Base‘𝐺)
grpinvval.p + = (+g𝐺)
grpinvval.o 0 = (0g𝐺)
grpinvval.n 𝑁 = (invg𝐺)
Assertion
Ref Expression
grpinvval (𝑋𝐵 → (𝑁𝑋) = (𝑦𝐵 (𝑦 + 𝑋) = 0 ))
Distinct variable groups:   𝑦,𝐵   𝑦,𝐺   𝑦,𝑋
Allowed substitution hints:   + (𝑦)   𝑁(𝑦)   0 (𝑦)

Proof of Theorem grpinvval
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 grpinvval.b . . . . 5 𝐵 = (Base‘𝐺)
21basmex 13100 . . . 4 (𝑋𝐵𝐺 ∈ V)
3 grpinvval.p . . . . 5 + = (+g𝐺)
4 grpinvval.o . . . . 5 0 = (0g𝐺)
5 grpinvval.n . . . . 5 𝑁 = (invg𝐺)
61, 3, 4, 5grpinvfvalg 13583 . . . 4 (𝐺 ∈ V → 𝑁 = (𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 )))
72, 6syl 14 . . 3 (𝑋𝐵𝑁 = (𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 )))
87fveq1d 5631 . 2 (𝑋𝐵 → (𝑁𝑋) = ((𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 ))‘𝑋))
9 eqid 2229 . . 3 (𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 )) = (𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 ))
10 oveq2 6015 . . . . 5 (𝑥 = 𝑋 → (𝑦 + 𝑥) = (𝑦 + 𝑋))
1110eqeq1d 2238 . . . 4 (𝑥 = 𝑋 → ((𝑦 + 𝑥) = 0 ↔ (𝑦 + 𝑋) = 0 ))
1211riotabidv 5962 . . 3 (𝑥 = 𝑋 → (𝑦𝐵 (𝑦 + 𝑥) = 0 ) = (𝑦𝐵 (𝑦 + 𝑋) = 0 ))
13 id 19 . . 3 (𝑋𝐵𝑋𝐵)
14 basfn 13099 . . . . . 6 Base Fn V
15 funfvex 5646 . . . . . . 7 ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
1615funfni 5423 . . . . . 6 ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
1714, 2, 16sylancr 414 . . . . 5 (𝑋𝐵 → (Base‘𝐺) ∈ V)
181, 17eqeltrid 2316 . . . 4 (𝑋𝐵𝐵 ∈ V)
19 riotaexg 5964 . . . 4 (𝐵 ∈ V → (𝑦𝐵 (𝑦 + 𝑋) = 0 ) ∈ V)
2018, 19syl 14 . . 3 (𝑋𝐵 → (𝑦𝐵 (𝑦 + 𝑋) = 0 ) ∈ V)
219, 12, 13, 20fvmptd3 5730 . 2 (𝑋𝐵 → ((𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 ))‘𝑋) = (𝑦𝐵 (𝑦 + 𝑋) = 0 ))
228, 21eqtrd 2262 1 (𝑋𝐵 → (𝑁𝑋) = (𝑦𝐵 (𝑦 + 𝑋) = 0 ))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1395  wcel 2200  Vcvv 2799  cmpt 4145   Fn wfn 5313  cfv 5318  crio 5959  (class class class)co 6007  Basecbs 13040  +gcplusg 13118  0gc0g 13297  invgcminusg 13542
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-cnex 8098  ax-resscn 8099  ax-1re 8101  ax-addrcl 8104
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-inn 9119  df-ndx 13043  df-slot 13044  df-base 13046  df-minusg 13545
This theorem is referenced by:  grplinv  13591  isgrpinv  13595
  Copyright terms: Public domain W3C validator