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

Theorem grpinvval 13628
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 13144 . . . 4 (𝑋𝐵𝐺 ∈ V)
3 grpinvval.p . . . . 5 + = (+g𝐺)
4 grpinvval.o . . . . 5 0 = (0g𝐺)
5 grpinvval.n . . . . 5 𝑁 = (invg𝐺)
61, 3, 4, 5grpinvfvalg 13627 . . . 4 (𝐺 ∈ V → 𝑁 = (𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 )))
72, 6syl 14 . . 3 (𝑋𝐵𝑁 = (𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 )))
87fveq1d 5641 . 2 (𝑋𝐵 → (𝑁𝑋) = ((𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 ))‘𝑋))
9 eqid 2231 . . 3 (𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 )) = (𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 ))
10 oveq2 6026 . . . . 5 (𝑥 = 𝑋 → (𝑦 + 𝑥) = (𝑦 + 𝑋))
1110eqeq1d 2240 . . . 4 (𝑥 = 𝑋 → ((𝑦 + 𝑥) = 0 ↔ (𝑦 + 𝑋) = 0 ))
1211riotabidv 5973 . . 3 (𝑥 = 𝑋 → (𝑦𝐵 (𝑦 + 𝑥) = 0 ) = (𝑦𝐵 (𝑦 + 𝑋) = 0 ))
13 id 19 . . 3 (𝑋𝐵𝑋𝐵)
14 basfn 13143 . . . . . 6 Base Fn V
15 funfvex 5656 . . . . . . 7 ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
1615funfni 5432 . . . . . 6 ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
1714, 2, 16sylancr 414 . . . . 5 (𝑋𝐵 → (Base‘𝐺) ∈ V)
181, 17eqeltrid 2318 . . . 4 (𝑋𝐵𝐵 ∈ V)
19 riotaexg 5975 . . . 4 (𝐵 ∈ V → (𝑦𝐵 (𝑦 + 𝑋) = 0 ) ∈ V)
2018, 19syl 14 . . 3 (𝑋𝐵 → (𝑦𝐵 (𝑦 + 𝑋) = 0 ) ∈ V)
219, 12, 13, 20fvmptd3 5740 . 2 (𝑋𝐵 → ((𝑥𝐵 ↦ (𝑦𝐵 (𝑦 + 𝑥) = 0 ))‘𝑋) = (𝑦𝐵 (𝑦 + 𝑋) = 0 ))
228, 21eqtrd 2264 1 (𝑋𝐵 → (𝑁𝑋) = (𝑦𝐵 (𝑦 + 𝑋) = 0 ))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1397  wcel 2202  Vcvv 2802  cmpt 4150   Fn wfn 5321  cfv 5326  crio 5970  (class class class)co 6018  Basecbs 13084  +gcplusg 13162  0gc0g 13341  invgcminusg 13586
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-cnex 8123  ax-resscn 8124  ax-1re 8126  ax-addrcl 8129
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-inn 9144  df-ndx 13087  df-slot 13088  df-base 13090  df-minusg 13589
This theorem is referenced by:  grplinv  13635  isgrpinv  13639
  Copyright terms: Public domain W3C validator