Theorem grpinvpropd 19254

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 18871	. . . . . . . 8 ⊢ (𝜑 → (0g‘𝐾) = (0g‘𝐿))
5	4	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (0g‘𝐾) = (0g‘𝐿))
6	1, 5	eqeq12d 2779	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
7	6	anass1rs 668	. . . . 5 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
8	7	riotabidva 7419	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)) = (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
9	8	mpteq2dva 5201	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
10	2	riotaeqdv 7401	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)) = (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
11	2, 10	mpteq12dv 5195	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))))
12	3	riotaeqdv 7401	. . . 4 ⊢ (𝜑 → (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)) = (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
13	3, 12	mpteq12dv 5195	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ (℩𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
14	9, 11, 13	3eqtr3d 2806	. 2 ⊢ (𝜑 → (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾))) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
15		eqid 2763	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
16		eqid 2763	. . 3 ⊢ (+g‘𝐾) = (+g‘𝐾)
17		eqid 2763	. . 3 ⊢ (0g‘𝐾) = (0g‘𝐾)
18		eqid 2763	. . 3 ⊢ (invg‘𝐾) = (invg‘𝐾)
19	15, 16, 17, 18	grpinvfval 19218	. 2 ⊢ (invg‘𝐾) = (𝑦 ∈ (Base‘𝐾) ↦ (℩𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
20		eqid 2763	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
21		eqid 2763	. . 3 ⊢ (+g‘𝐿) = (+g‘𝐿)
22		eqid 2763	. . 3 ⊢ (0g‘𝐿) = (0g‘𝐿)
23		eqid 2763	. . 3 ⊢ (invg‘𝐿) = (invg‘𝐿)
24	20, 21, 22, 23	grpinvfval 19218	. 2 ⊢ (invg‘𝐿) = (𝑦 ∈ (Base‘𝐿) ↦ (℩𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
25	14, 19, 24	3eqtr4g 2823	1 ⊢ (𝜑 → (invg‘𝐾) = (invg‘𝐿))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ↦ cmpt 5189  ‘cfv 6558  ℩crio 7399  (class class class)co 7443  Basecbs 17416  +_gcplusg 17457  0_gc0g 17639  inv_gcminusg 19174

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  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 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566  df-riota 7400  df-ov 7446  df-0g 17641  df-minusg 19177

This theorem is used by:  grpsubpropd  19284  grpsubpropd2  19285  mulgpropd  19355  invrpropd  20678  rlmvneg  21511  matinvg  22763  tngngp3  25005