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

Theorem grpsubpropdg 13658
Description: Weak property deduction for the group subtraction operation. (Contributed by Mario Carneiro, 27-Mar-2015.)
Hypotheses
Ref Expression
grpsubpropd.b (𝜑 → (Base‘𝐺) = (Base‘𝐻))
grpsubpropd.p (𝜑 → (+g𝐺) = (+g𝐻))
grpsubpropdg.g (𝜑𝐺𝑉)
grpsubpropdg.h (𝜑𝐻𝑊)
Assertion
Ref Expression
grpsubpropdg (𝜑 → (-g𝐺) = (-g𝐻))

Proof of Theorem grpsubpropdg
Dummy variables 𝑎 𝑏 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 grpsubpropd.b . . 3 (𝜑 → (Base‘𝐺) = (Base‘𝐻))
2 grpsubpropd.p . . . 4 (𝜑 → (+g𝐺) = (+g𝐻))
3 eqidd 2230 . . . 4 (𝜑𝑎 = 𝑎)
4 eqidd 2230 . . . . . 6 (𝜑 → (Base‘𝐺) = (Base‘𝐺))
5 grpsubpropdg.g . . . . . 6 (𝜑𝐺𝑉)
6 grpsubpropdg.h . . . . . 6 (𝜑𝐻𝑊)
72oveqdr 6038 . . . . . 6 ((𝜑 ∧ (𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺))) → (𝑥(+g𝐺)𝑦) = (𝑥(+g𝐻)𝑦))
84, 1, 5, 6, 7grpinvpropdg 13629 . . . . 5 (𝜑 → (invg𝐺) = (invg𝐻))
98fveq1d 5634 . . . 4 (𝜑 → ((invg𝐺)‘𝑏) = ((invg𝐻)‘𝑏))
102, 3, 9oveq123d 6031 . . 3 (𝜑 → (𝑎(+g𝐺)((invg𝐺)‘𝑏)) = (𝑎(+g𝐻)((invg𝐻)‘𝑏)))
111, 1, 10mpoeq123dv 6075 . 2 (𝜑 → (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g𝐺)((invg𝐺)‘𝑏))) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g𝐻)((invg𝐻)‘𝑏))))
12 eqid 2229 . . . 4 (Base‘𝐺) = (Base‘𝐺)
13 eqid 2229 . . . 4 (+g𝐺) = (+g𝐺)
14 eqid 2229 . . . 4 (invg𝐺) = (invg𝐺)
15 eqid 2229 . . . 4 (-g𝐺) = (-g𝐺)
1612, 13, 14, 15grpsubfvalg 13599 . . 3 (𝐺𝑉 → (-g𝐺) = (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g𝐺)((invg𝐺)‘𝑏))))
175, 16syl 14 . 2 (𝜑 → (-g𝐺) = (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g𝐺)((invg𝐺)‘𝑏))))
18 eqid 2229 . . . 4 (Base‘𝐻) = (Base‘𝐻)
19 eqid 2229 . . . 4 (+g𝐻) = (+g𝐻)
20 eqid 2229 . . . 4 (invg𝐻) = (invg𝐻)
21 eqid 2229 . . . 4 (-g𝐻) = (-g𝐻)
2218, 19, 20, 21grpsubfvalg 13599 . . 3 (𝐻𝑊 → (-g𝐻) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g𝐻)((invg𝐻)‘𝑏))))
236, 22syl 14 . 2 (𝜑 → (-g𝐻) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g𝐻)((invg𝐻)‘𝑏))))
2411, 17, 233eqtr4d 2272 1 (𝜑 → (-g𝐺) = (-g𝐻))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1395  wcel 2200  cfv 5321  (class class class)co 6010  cmpo 6012  Basecbs 13053  +gcplusg 13131  invgcminusg 13555  -gcsg 13556
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 4259  ax-pr 4294  ax-un 4525  ax-cnex 8106  ax-resscn 8107  ax-1re 8109  ax-addrcl 8112
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 4385  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-inn 9127  df-ndx 13056  df-slot 13057  df-base 13059  df-0g 13312  df-minusg 13558  df-sbg 13559
This theorem is referenced by:  rlmsubg  14443
  Copyright terms: Public domain W3C validator