Theorem grpinvpropd 19205

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 18822	. . . . . . . 8 ⊢ (𝜑 → (0g‘𝐾) = (0g‘𝐿))
5	4	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (0g‘𝐾) = (0g‘𝐿))
6	1, 5	eqeq12d 2777	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
7	6	anass1rs 668	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
8	7	riotabidva 7388	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)) = (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
9	8	mpteq2dva 5198	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
10	2	riotaeqdv 7370	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)) = (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
11	2, 10	mpteq12dv 5192	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))))
12	3	riotaeqdv 7370	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)) = (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
13	3, 12	mpteq12dv 5192	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
14	9, 11, 13	3eqtr3d 2804	. 2 ⊢ (𝜑 → (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
15		eqid 2761	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
16		eqid 2761	. . 3 ⊢ (+g‘𝐾) = (+g‘𝐾)
17		eqid 2761	. . 3 ⊢ (0g‘𝐾) = (0g‘𝐾)
18		eqid 2761	. . 3 ⊢ (invg‘𝐾) = (invg‘𝐾)
19	15, 16, 17, 18	grpinvfval 19169	. 2 ⊢ (invg‘𝐾) = (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
20		eqid 2761	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
21		eqid 2761	. . 3 ⊢ (+g‘𝐿) = (+g‘𝐿)
22		eqid 2761	. . 3 ⊢ (0g‘𝐿) = (0g‘𝐿)
23		eqid 2761	. . 3 ⊢ (invg‘𝐿) = (invg‘𝐿)
24	20, 21, 22, 23	grpinvfval 19169	. 2 ⊢ (invg‘𝐿) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
25	14, 19, 24	3eqtr4g 2821	1 ⊢ (𝜑 → (invg‘𝐾) = (invg‘𝐿))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ↦ cmpt 5186  ‘cfv 6531  ℩crio 7368  (class class class)co 7412  Basecbs 17367  +_gcplusg 17408  0_gc0g 17590  inv_gcminusg 19125

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 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  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-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539  df-riota 7369  df-ov 7415  df-0g 17592  df-minusg 19128

This theorem is used by:  grpsubpropd  19235  grpsubpropd2  19236  mulgpropd  19306  invrpropd  20628  rlmvneg  21461  matinvg  22713  tngngp3  24955