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

Theorem grpinvval 13831
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 13395 . . . 4 (𝑋𝐵𝐺 ∈ V)
3 grpinvval.p . . . . 5 + = (+g𝐺)
4 grpinvval.o . . . . 5 0 = (0g𝐺)
5 grpinvval.n . . . . 5 𝑁 = (invg𝐺)
61, 3, 4, 5grpinvfvalg 13830 . . . 4 (𝐺 ∈ V → 𝑁 = (𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 )))
72, 6syl 14 . . 3 (𝑋𝐵𝑁 = (𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 )))
87fveq1d 5695 . 2 (𝑋𝐵 → (𝑁𝑋) = ((𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 ))‘𝑋))
9 eqid 2238 . . 3 (𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 )) = (𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 ))
10 oveq2 6087 . . . . 5 (𝑥 = 𝑋 → (𝑦 + 𝑥) = (𝑦 + 𝑋))
1110eqeq1d 2247 . . . 4 (𝑥 = 𝑋 → ((𝑦 + 𝑥) = 0 ↔ (𝑦 + 𝑋) = 0 ))
1211riotabidv 6034 . . 3 (𝑥 = 𝑋 → (𝑦𝐵 (𝑦 + 𝑥) = 0 ) = (𝑦𝐵 (𝑦 + 𝑋) = 0 ))
13 id 19 . . 3 (𝑋𝐵𝑋𝐵)
14 basfn 13394 . . . . . 6 Base Fn V
15 funfvex 5710 . . . . . . 7 ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
1615funfni 5481 . . . . . 6 ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
1714, 2, 16sylancr 418 . . . . 5 (𝑋𝐵 → (Base‘𝐺) ∈ V)
181, 17eqeltrid 2325 . . . 4 (𝑋𝐵𝐵 ∈ V)
19 riotaexg 6036 . . . 4 (𝐵 ∈ V → (𝑦𝐵 (𝑦 + 𝑋) = 0 ) ∈ V)
2018, 19syl 14 . . 3 (𝑋𝐵 → (𝑦𝐵 (𝑦 + 𝑋) = 0 ) ∈ V)
219, 12, 13, 20fvmptd3 5796 . 2 (𝑋𝐵 → ((𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 ))‘𝑋) = (𝑦𝐵 (𝑦 + 𝑋) = 0 ))
228, 21eqtrd 2271 1 (𝑋𝐵 → (𝑁𝑋) = (𝑦𝐵 (𝑦 + 𝑋) = 0 ))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1402  wcel 2209  Vcvv 2821  cmpt 4190   Fn wfn 5370  cfv 5375  crio 6031  (class class class)co 6079  Basecbs 13335  +gcplusg 13414  0gc0g 13593  invgcminusg 13789
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-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-ndx 13338  df-slot 13339  df-base 13341  df-minusg 13792
This theorem is referenced by:  grplinv  13838  isgrpinv  13842
  Copyright terms: Public domain W3C validator