Theorem grpinvpropd 19112

Description: If two structures have the same group components (properties), they have the same group inversion function. (Contributed by Mario Carneiro, 27-Nov-2014.) (Revised by Stefan O'Rear, 21-Mar-2015.)

Hypotheses

Ref	Expression
grpinvpropd.1	⊢ (𝜑 → 𝐵 = (Base‘𝐾))
grpinvpropd.2	⊢ (𝜑 → 𝐵 = (Base‘𝐿))
grpinvpropd.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))

Assertion

Ref	Expression
grpinvpropd	⊢ (𝜑 → (invg‘𝐾) = (invg‘𝐿))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝑥,𝐿,𝑦   𝜑,𝑥,𝑦

Proof of Theorem grpinvpropd

Step	Hyp	Ref	Expression
1		grpinvpropd.3	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
2		grpinvpropd.1	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
3		grpinvpropd.2	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
4	2, 3, 1	grpidpropd 18745	. . . . . . . 8 ⊢ (𝜑 → (0g‘𝐾) = (0g‘𝐿))
5	4	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (0g‘𝐾) = (0g‘𝐿))
6	1, 5	eqeq12d 2782	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
7	6	anass1rs 668	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
8	7	riotabidva 7399	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)) = (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
9	8	mpteq2dva 5209	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
10	2	riotaeqdv 7381	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)) = (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
11	2, 10	mpteq12dv 5203	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))))
12	3	riotaeqdv 7381	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)) = (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
13	3, 12	mpteq12dv 5203	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
14	9, 11, 13	3eqtr3d 2809	. 2 ⊢ (𝜑 → (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
15		eqid 2766	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
16		eqid 2766	. . 3 ⊢ (+g‘𝐾) = (+g‘𝐾)
17		eqid 2766	. . 3 ⊢ (0g‘𝐾) = (0g‘𝐾)
18		eqid 2766	. . 3 ⊢ (invg‘𝐾) = (invg‘𝐾)
19	15, 16, 17, 18	grpinvfval 19076	. 2 ⊢ (invg‘𝐾) = (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
20		eqid 2766	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
21		eqid 2766	. . 3 ⊢ (+g‘𝐿) = (+g‘𝐿)
22		eqid 2766	. . 3 ⊢ (0g‘𝐿) = (0g‘𝐿)
23		eqid 2766	. . 3 ⊢ (invg‘𝐿) = (invg‘𝐿)
24	20, 21, 22, 23	grpinvfval 19076	. 2 ⊢ (invg‘𝐿) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
25	14, 19, 24	3eqtr4g 2826	1 ⊢ (𝜑 → (invg‘𝐾) = (invg‘𝐿))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146   ↦ cmpt 5197  ‘cfv 6543  ℩crio 7379  (class class class)co 7423  Basecbs 17294  +_gcplusg 17335  0_gc0g 17517  inv_gcminusg 19032

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-riota 7380  df-ov 7426  df-0g 17519  df-minusg 19035

This theorem is used by:  grpsubpropd  19142  grpsubpropd2  19143  mulgpropd  19213  invrpropd  20533  rlmvneg  21364  matinvg  22612  tngngp3  24850