Theorem grpinvpropd 19144

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 18761	. . . . . . . 8 ⊢ (𝜑 → (0g‘𝐾) = (0g‘𝐿))
5	4	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (0g‘𝐾) = (0g‘𝐿))
6	1, 5	eqeq12d 2778	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
7	6	anass1rs 668	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
8	7	riotabidva 7393	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)) = (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
9	8	mpteq2dva 5202	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
10	2	riotaeqdv 7375	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)) = (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
11	2, 10	mpteq12dv 5196	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))))
12	3	riotaeqdv 7375	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)) = (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
13	3, 12	mpteq12dv 5196	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
14	9, 11, 13	3eqtr3d 2805	. 2 ⊢ (𝜑 → (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
15		eqid 2762	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
16		eqid 2762	. . 3 ⊢ (+g‘𝐾) = (+g‘𝐾)
17		eqid 2762	. . 3 ⊢ (0g‘𝐾) = (0g‘𝐾)
18		eqid 2762	. . 3 ⊢ (invg‘𝐾) = (invg‘𝐾)
19	15, 16, 17, 18	grpinvfval 19108	. 2 ⊢ (invg‘𝐾) = (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
20		eqid 2762	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
21		eqid 2762	. . 3 ⊢ (+g‘𝐿) = (+g‘𝐿)
22		eqid 2762	. . 3 ⊢ (0g‘𝐿) = (0g‘𝐿)
23		eqid 2762	. . 3 ⊢ (invg‘𝐿) = (invg‘𝐿)
24	20, 21, 22, 23	grpinvfval 19108	. 2 ⊢ (invg‘𝐿) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
25	14, 19, 24	3eqtr4g 2822	1 ⊢ (𝜑 → (invg‘𝐾) = (invg‘𝐿))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ↦ cmpt 5190  ‘cfv 6537  ℩crio 7373  (class class class)co 7417  Basecbs 17307  +_gcplusg 17348  0_gc0g 17530  inv_gcminusg 19064

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-riota 7374  df-ov 7420  df-0g 17532  df-minusg 19067

This theorem is used by:  grpsubpropd  19174  grpsubpropd2  19175  mulgpropd  19245  invrpropd  20565  rlmvneg  21396  matinvg  22646  tngngp3  24888