Theorem grpsubpropd2 19169

Description: Strong property deduction for the group subtraction operation. (Contributed by Mario Carneiro, 4-Oct-2015.)

Hypotheses

Ref	Expression
grpsubpropd2.1	⊢ (𝜑 → 𝐵 = (Base‘𝐺))
grpsubpropd2.2	⊢ (𝜑 → 𝐵 = (Base‘𝐻))
grpsubpropd2.3	⊢ (𝜑 → 𝐺 ∈ Grp)
grpsubpropd2.4	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐺)𝑦) = (𝑥(+g‘𝐻)𝑦))

Assertion

Ref	Expression
grpsubpropd2	⊢ (𝜑 → (-g‘𝐺) = (-g‘𝐻))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐺,𝑦   𝑥,𝐻,𝑦   𝜑,𝑥,𝑦

Proof of Theorem grpsubpropd2

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 1154	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → 𝜑)
2		simp2 1155	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → 𝑎 ∈ (Base‘𝐺))
3		grpsubpropd2.1	. . . . . . . 8 ⊢ (𝜑 → 𝐵 = (Base‘𝐺))
4	3	3ad2ant1 1151	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → 𝐵 = (Base‘𝐺))
5	2, 4	eleqtrrd 2863	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → 𝑎 ∈ 𝐵)
6		grpsubpropd2.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ Grp)
7	6	3ad2ant1 1151	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → 𝐺 ∈ Grp)
8		simp3 1156	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → 𝑏 ∈ (Base‘𝐺))
9		eqid 2760	. . . . . . . . 9 ⊢ (Base‘𝐺) = (Base‘𝐺)
10		eqid 2760	. . . . . . . . 9 ⊢ (invg‘𝐺) = (invg‘𝐺)
11	9, 10	grpinvcl 19111	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑏 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑏) ∈ (Base‘𝐺))
12	7, 8, 11	syl2anc 596	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑏) ∈ (Base‘𝐺))
13	12, 4	eleqtrrd 2863	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑏) ∈ 𝐵)
14		grpsubpropd2.4	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐺)𝑦) = (𝑥(+g‘𝐻)𝑦))
15	14	oveqrspc2v 7440	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ ((invg‘𝐺)‘𝑏) ∈ 𝐵)) → (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏)) = (𝑎(+g‘𝐻)((invg‘𝐺)‘𝑏)))
16	1, 5, 13, 15	syl12anc 850	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏)) = (𝑎(+g‘𝐻)((invg‘𝐺)‘𝑏)))
17		grpsubpropd2.2	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 = (Base‘𝐻))
18	3, 17, 14	grpinvpropd 19138	. . . . . . . 8 ⊢ (𝜑 → (invg‘𝐺) = (invg‘𝐻))
19	18	fveq1d 6880	. . . . . . 7 ⊢ (𝜑 → ((invg‘𝐺)‘𝑏) = ((invg‘𝐻)‘𝑏))
20	19	oveq2d 7429	. . . . . 6 ⊢ (𝜑 → (𝑎(+g‘𝐻)((invg‘𝐺)‘𝑏)) = (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏)))
21	20	3ad2ant1 1151	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → (𝑎(+g‘𝐻)((invg‘𝐺)‘𝑏)) = (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏)))
22	16, 21	eqtrd 2795	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ (Base‘𝐺) ∧ 𝑏 ∈ (Base‘𝐺)) → (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏)) = (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏)))
23	22	mpoeq3dva 7490	. . 3 ⊢ (𝜑 → (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏))) = (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏))))
24	3, 17	eqtr3d 2797	. . . 4 ⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐻))
25		mpoeq12 7486	. . . 4 ⊢ (((Base‘𝐺) = (Base‘𝐻) ∧ (Base‘𝐺) = (Base‘𝐻)) → (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏))) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏))))
26	24, 24, 25	syl2anc 596	. . 3 ⊢ (𝜑 → (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏))) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏))))
27	23, 26	eqtrd 2795	. 2 ⊢ (𝜑 → (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏))) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏))))
28		eqid 2760	. . 3 ⊢ (+g‘𝐺) = (+g‘𝐺)
29		eqid 2760	. . 3 ⊢ (-g‘𝐺) = (-g‘𝐺)
30	9, 28, 10, 29	grpsubfval 19107	. 2 ⊢ (-g‘𝐺) = (𝑎 ∈ (Base‘𝐺), 𝑏 ∈ (Base‘𝐺) ↦ (𝑎(+g‘𝐺)((invg‘𝐺)‘𝑏)))
31		eqid 2760	. . 3 ⊢ (Base‘𝐻) = (Base‘𝐻)
32		eqid 2760	. . 3 ⊢ (+g‘𝐻) = (+g‘𝐻)
33		eqid 2760	. . 3 ⊢ (invg‘𝐻) = (invg‘𝐻)
34		eqid 2760	. . 3 ⊢ (-g‘𝐻) = (-g‘𝐻)
35	31, 32, 33, 34	grpsubfval 19107	. 2 ⊢ (-g‘𝐻) = (𝑎 ∈ (Base‘𝐻), 𝑏 ∈ (Base‘𝐻) ↦ (𝑎(+g‘𝐻)((invg‘𝐻)‘𝑏)))
36	27, 30, 35	3eqtr4g 2820	1 ⊢ (𝜑 → (-g‘𝐺) = (-g‘𝐻))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ‘cfv 6533  (class class class)co 7413   ∈ cmpo 7415  Basecbs 17301  +_gcplusg 17342  Grpcgrp 19057  inv_gcminusg 19058  -_gcsg 19059

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-1st 7986  df-2nd 7987  df-0g 17526  df-mgm 18730  df-sgrp 18821  df-mnd 18837  df-grp 19060  df-minusg 19061  df-sbg 19062

This theorem is used by:  ngppropd  24863