Theorem grpidpropdg 13450

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 2238	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥(+g‘𝐾)𝑦) = 𝑦 ↔ (𝑥(+g‘𝐿)𝑦) = 𝑦))
3	1	oveqrspc2v 6040	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
4	3	oveqrspc2v 6040	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵)) → (𝑦(+g‘𝐾)𝑥) = (𝑦(+g‘𝐿)𝑥))
5	4	ancom2s 566	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑦(+g‘𝐾)𝑥) = (𝑦(+g‘𝐿)𝑥))
6	5	eqeq1d 2238	. . . . . . . 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 2526	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (∀𝑦 ∈ 𝐵 ((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦) ↔ ∀𝑦 ∈ 𝐵 ((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦)))
10	9	pm5.32da 452	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦)) ↔ (𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦))))
11		grpidpropd.1	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
12	11	eleq2d 2299	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (Base‘𝐾)))
13	11	raleqdv 2734	. . . . 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 2299	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (Base‘𝐿)))
17	15	raleqdv 2734	. . . . 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 5307	. 2 ⊢ (𝜑 → (℩𝑥(𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦))) = (℩𝑥(𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦))))
21		grpidproddg.k	. . 3 ⊢ (𝜑 → 𝐾 ∈ 𝑉)
22		eqid 2229	. . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾)
23		eqid 2229	. . . 4 ⊢ (+g‘𝐾) = (+g‘𝐾)
24		eqid 2229	. . . 4 ⊢ (0g‘𝐾) = (0g‘𝐾)
25	22, 23, 24	grpidvalg 13449	. . 3 ⊢ (𝐾 ∈ 𝑉 → (0g‘𝐾) = (℩𝑥(𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦))))
26	21, 25	syl 14	. 2 ⊢ (𝜑 → (0g‘𝐾) = (℩𝑥(𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g‘𝐾)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐾)𝑥) = 𝑦))))
27		grpidproddg.l	. . 3 ⊢ (𝜑 → 𝐿 ∈ 𝑊)
28		eqid 2229	. . . 4 ⊢ (Base‘𝐿) = (Base‘𝐿)
29		eqid 2229	. . . 4 ⊢ (+g‘𝐿) = (+g‘𝐿)
30		eqid 2229	. . . 4 ⊢ (0g‘𝐿) = (0g‘𝐿)
31	28, 29, 30	grpidvalg 13449	. . 3 ⊢ (𝐿 ∈ 𝑊 → (0g‘𝐿) = (℩𝑥(𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦))))
32	27, 31	syl 14	. 2 ⊢ (𝜑 → (0g‘𝐿) = (℩𝑥(𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g‘𝐿)𝑦) = 𝑦 ∧ (𝑦(+g‘𝐿)𝑥) = 𝑦))))
33	20, 26, 32	3eqtr4d 2272	1 ⊢ (𝜑 → (0g‘𝐾) = (0g‘𝐿))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1395   ∈ wcel 2200  ∀wral 2508  ℩cio 5282  ‘cfv 5324  (class class class)co 6013  Basecbs 13075  +_gcplusg 13153  0_gc0g 13332

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-cnex 8116  ax-resscn 8117  ax-1re 8119  ax-addrcl 8122

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-sbc 3030  df-csb 3126  df-un 3202  df-in 3204  df-ss 3211  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-iota 5284  df-fun 5326  df-fn 5327  df-fv 5332  df-riota 5966  df-ov 6016  df-inn 9137  df-ndx 13078  df-slot 13079  df-base 13081  df-0g 13334

This theorem is referenced by:  gsumpropd  13468  gsumpropd2  13469  mhmpropd  13542  grppropd  13593  grpinvpropdg  13651  mulgpropdg  13744  rngidpropdg  14153  sralmod0g  14458