MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  grpsubfvalALT Structured version   Visualization version   GIF version

Theorem grpsubfvalALT 18755
Description: Shorter proof of grpsubfval 18754 using ax-rep 5240. (Contributed by NM, 31-Mar-2014.) (Revised by Stefan O'Rear, 27-Mar-2015.) (Proof shortened by AV, 19-Feb-2024.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
grpsubval.b 𝐵 = (Base‘𝐺)
grpsubval.p + = (+g𝐺)
grpsubval.i 𝐼 = (invg𝐺)
grpsubval.m = (-g𝐺)
Assertion
Ref Expression
grpsubfvalALT = (𝑥𝐵, 𝑦𝐵 ↦ (𝑥 + (𝐼𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐺,𝑦   𝑥,𝐼,𝑦   𝑥, + ,𝑦
Allowed substitution hints:   (𝑥,𝑦)

Proof of Theorem grpsubfvalALT
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 grpsubval.m . . 3 = (-g𝐺)
2 fveq2 6839 . . . . . 6 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3 grpsubval.b . . . . . 6 𝐵 = (Base‘𝐺)
42, 3eqtr4di 2795 . . . . 5 (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
5 fveq2 6839 . . . . . . 7 (𝑔 = 𝐺 → (+g𝑔) = (+g𝐺))
6 grpsubval.p . . . . . . 7 + = (+g𝐺)
75, 6eqtr4di 2795 . . . . . 6 (𝑔 = 𝐺 → (+g𝑔) = + )
8 eqidd 2738 . . . . . 6 (𝑔 = 𝐺𝑥 = 𝑥)
9 fveq2 6839 . . . . . . . 8 (𝑔 = 𝐺 → (invg𝑔) = (invg𝐺))
10 grpsubval.i . . . . . . . 8 𝐼 = (invg𝐺)
119, 10eqtr4di 2795 . . . . . . 7 (𝑔 = 𝐺 → (invg𝑔) = 𝐼)
1211fveq1d 6841 . . . . . 6 (𝑔 = 𝐺 → ((invg𝑔)‘𝑦) = (𝐼𝑦))
137, 8, 12oveq123d 7372 . . . . 5 (𝑔 = 𝐺 → (𝑥(+g𝑔)((invg𝑔)‘𝑦)) = (𝑥 + (𝐼𝑦)))
144, 4, 13mpoeq123dv 7426 . . . 4 (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g𝑔)((invg𝑔)‘𝑦))) = (𝑥𝐵, 𝑦𝐵 ↦ (𝑥 + (𝐼𝑦))))
15 df-sbg 18713 . . . 4 -g = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g𝑔)((invg𝑔)‘𝑦))))
163fvexi 6853 . . . . 5 𝐵 ∈ V
1716, 16mpoex 8004 . . . 4 (𝑥𝐵, 𝑦𝐵 ↦ (𝑥 + (𝐼𝑦))) ∈ V
1814, 15, 17fvmpt 6945 . . 3 (𝐺 ∈ V → (-g𝐺) = (𝑥𝐵, 𝑦𝐵 ↦ (𝑥 + (𝐼𝑦))))
191, 18eqtrid 2789 . 2 (𝐺 ∈ V → = (𝑥𝐵, 𝑦𝐵 ↦ (𝑥 + (𝐼𝑦))))
20 fvprc 6831 . . . 4 𝐺 ∈ V → (-g𝐺) = ∅)
211, 20eqtrid 2789 . . 3 𝐺 ∈ V → = ∅)
22 fvprc 6831 . . . . . 6 𝐺 ∈ V → (Base‘𝐺) = ∅)
233, 22eqtrid 2789 . . . . 5 𝐺 ∈ V → 𝐵 = ∅)
2423olcd 872 . . . 4 𝐺 ∈ V → (𝐵 = ∅ ∨ 𝐵 = ∅))
25 0mpo0 7434 . . . 4 ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑥𝐵, 𝑦𝐵 ↦ (𝑥 + (𝐼𝑦))) = ∅)
2624, 25syl 17 . . 3 𝐺 ∈ V → (𝑥𝐵, 𝑦𝐵 ↦ (𝑥 + (𝐼𝑦))) = ∅)
2721, 26eqtr4d 2780 . 2 𝐺 ∈ V → = (𝑥𝐵, 𝑦𝐵 ↦ (𝑥 + (𝐼𝑦))))
2819, 27pm2.61i 182 1 = (𝑥𝐵, 𝑦𝐵 ↦ (𝑥 + (𝐼𝑦)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wo 845   = wceq 1541  wcel 2106  Vcvv 3443  c0 4280  cfv 6493  (class class class)co 7351  cmpo 7353  Basecbs 17043  +gcplusg 17093  invgcminusg 18709  -gcsg 18710
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2708  ax-rep 5240  ax-sep 5254  ax-nul 5261  ax-pow 5318  ax-pr 5382  ax-un 7664
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3352  df-rab 3406  df-v 3445  df-sbc 3738  df-csb 3854  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4281  df-if 4485  df-pw 4560  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4864  df-iun 4954  df-br 5104  df-opab 5166  df-mpt 5187  df-id 5529  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6445  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7354  df-oprab 7355  df-mpo 7356  df-1st 7913  df-2nd 7914  df-sbg 18713
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator