Theorem grpidpropdg 13459

Description: If two structures have the same base set, and the values of their group (addition) operations are equal for all pairs of elements of the base set, they have the same identity element. (Contributed by Mario Carneiro, 27-Nov-2014.)

Hypotheses

Ref	Expression
grpidpropd.1	⊢ (𝜑 → 𝐵 = (Base‘𝐾))
grpidpropd.2	⊢ (𝜑 → 𝐵 = (Base‘𝐿))
grpidproddg.k	⊢ (𝜑 → 𝐾 ∈ 𝑉)
grpidproddg.l	⊢ (𝜑 → 𝐿 ∈ 𝑊)
grpidpropd.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))

Assertion

Ref	Expression
grpidpropdg	⊢ (𝜑 → (0g‘𝐾) = (0g‘𝐿))

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

Allowed substitution hints:   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem grpidpropdg

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		grpidpropd.3	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
2	1	eqeq1d 2240	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥(+g‘𝐾)𝑦) = 𝑦 ↔ (𝑥(+g‘𝐿)𝑦) = 𝑦))
3	1	oveqrspc2v 6045	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
4	3	oveqrspc2v 6045	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → (𝑦(+g‘𝐾)𝑥) = (𝑦(+g‘𝐿)𝑥))
5	4	ancom2s 568	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑦(+g‘𝐾)𝑥) = (𝑦(+g‘𝐿)𝑥))
6	5	eqeq1d 2240	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑦(+g‘𝐾)𝑥) = 𝑦 ↔ (𝑦(+g‘𝐿)𝑥) = 𝑦))
7	2, 6	anbi12d 473	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦) ↔ ((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦)))
8	7	anassrs 400	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦) ↔ ((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦)))
9	8	ralbidva 2528	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (∀𝑦 ∈ 𝐵 ((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦) ↔ ∀𝑦 ∈ 𝐵 ((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦)))
10	9	pm5.32da 452	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦)) ↔ (𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦))))
11		grpidpropd.1	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
12	11	eleq2d 2301	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (Base‘𝐾)))
13	11	raleqdv 2736	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦) ↔ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦)))
14	12, 13	anbi12d 473	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦)) ↔ (𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦))))
15		grpidpropd.2	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
16	15	eleq2d 2301	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (Base‘𝐿)))
17	15	raleqdv 2736	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦) ↔ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦)))
18	16, 17	anbi12d 473	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦)) ↔ (𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦))))
19	10, 14, 18	3bitr3d 218	. . 3 ⊢ (𝜑 → ((𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦)) ↔ (𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦))))
20	19	iotabidv 5309	. 2 ⊢ (𝜑 → (℩𝑥(𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦))) = (℩𝑥(𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦))))
21		grpidproddg.k	. . 3 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
22		eqid 2231	. . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾)
23		eqid 2231	. . . 4 ⊢ (+g‘𝐾) = (+g‘𝐾)
24		eqid 2231	. . . 4 ⊢ (0g‘𝐾) = (0g‘𝐾)
25	22, 23, 24	grpidvalg 13458	. . 3 ⊢ (𝐾 ∈ 𝑉 → (0g‘𝐾) = (℩𝑥(𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦))))
26	21, 25	syl 14	. 2 ⊢ (𝜑 → (0g‘𝐾) = (℩𝑥(𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦))))
27		grpidproddg.l	. . 3 ⊢ (𝜑 → 𝐿 ∈ 𝑊)
28		eqid 2231	. . . 4 ⊢ (Base‘𝐿) = (Base‘𝐿)
29		eqid 2231	. . . 4 ⊢ (+g‘𝐿) = (+g‘𝐿)
30		eqid 2231	. . . 4 ⊢ (0g‘𝐿) = (0g‘𝐿)
31	28, 29, 30	grpidvalg 13458	. . 3 ⊢ (𝐿 ∈ 𝑊 → (0g‘𝐿) = (℩𝑥(𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦))))
32	27, 31	syl 14	. 2 ⊢ (𝜑 → (0g‘𝐿) = (℩𝑥(𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦))))
33	20, 26, 32	3eqtr4d 2274	1 ⊢ (𝜑 → (0g‘𝐾) = (0g‘𝐿))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1397   ∈ wcel 2202  ∀wral 2510  ℩cio 5284  ‘cfv 5326  (class class class)co 6018  Basecbs 13084  +_gcplusg 13162  0_gc0g 13341

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-cnex 8123  ax-resscn 8124  ax-1re 8126  ax-addrcl 8129

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-riota 5971  df-ov 6021  df-inn 9144  df-ndx 13087  df-slot 13088  df-base 13090  df-0g 13343

This theorem is referenced by:  gsumpropd  13477  gsumpropd2  13478  mhmpropd  13551  grppropd  13602  grpinvpropdg  13660  mulgpropdg  13753  rngidpropdg  14163  sralmod0g  14468