ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  grpidpropdg GIF version

Theorem grpidpropdg 12657
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.
StepHypRef Expression
1 grpidpropd.3 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦))
21eqeq1d 2184 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝑥(+g𝐾)𝑦) = 𝑦 ↔ (𝑥(+g𝐿)𝑦) = 𝑦))
31oveqrspc2v 5892 . . . . . . . . . . 11 ((𝜑 ∧ (𝑧𝐵𝑤𝐵)) → (𝑧(+g𝐾)𝑤) = (𝑧(+g𝐿)𝑤))
43oveqrspc2v 5892 . . . . . . . . . 10 ((𝜑 ∧ (𝑦𝐵𝑥𝐵)) → (𝑦(+g𝐾)𝑥) = (𝑦(+g𝐿)𝑥))
54ancom2s 566 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑦(+g𝐾)𝑥) = (𝑦(+g𝐿)𝑥))
65eqeq1d 2184 . . . . . . . 8 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → ((𝑦(+g𝐾)𝑥) = 𝑦 ↔ (𝑦(+g𝐿)𝑥) = 𝑦))
72, 6anbi12d 473 . . . . . . 7 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (((𝑥(+g𝐾)𝑦) = 𝑦 ∧ (𝑦(+g𝐾)𝑥) = 𝑦) ↔ ((𝑥(+g𝐿)𝑦) = 𝑦 ∧ (𝑦(+g𝐿)𝑥) = 𝑦)))
87anassrs 400 . . . . . 6 (((𝜑𝑥𝐵) ∧ 𝑦𝐵) → (((𝑥(+g𝐾)𝑦) = 𝑦 ∧ (𝑦(+g𝐾)𝑥) = 𝑦) ↔ ((𝑥(+g𝐿)𝑦) = 𝑦 ∧ (𝑦(+g𝐿)𝑥) = 𝑦)))
98ralbidva 2471 . . . . 5 ((𝜑𝑥𝐵) → (∀𝑦𝐵 ((𝑥(+g𝐾)𝑦) = 𝑦 ∧ (𝑦(+g𝐾)𝑥) = 𝑦) ↔ ∀𝑦𝐵 ((𝑥(+g𝐿)𝑦) = 𝑦 ∧ (𝑦(+g𝐿)𝑥) = 𝑦)))
109pm5.32da 452 . . . 4 (𝜑 → ((𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥(+g𝐾)𝑦) = 𝑦 ∧ (𝑦(+g𝐾)𝑥) = 𝑦)) ↔ (𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥(+g𝐿)𝑦) = 𝑦 ∧ (𝑦(+g𝐿)𝑥) = 𝑦))))
11 grpidpropd.1 . . . . . 6 (𝜑𝐵 = (Base‘𝐾))
1211eleq2d 2245 . . . . 5 (𝜑 → (𝑥𝐵𝑥 ∈ (Base‘𝐾)))
1311raleqdv 2676 . . . . 5 (𝜑 → (∀𝑦𝐵 ((𝑥(+g𝐾)𝑦) = 𝑦 ∧ (𝑦(+g𝐾)𝑥) = 𝑦) ↔ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g𝐾)𝑦) = 𝑦 ∧ (𝑦(+g𝐾)𝑥) = 𝑦)))
1412, 13anbi12d 473 . . . 4 (𝜑 → ((𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥(+g𝐾)𝑦) = 𝑦 ∧ (𝑦(+g𝐾)𝑥) = 𝑦)) ↔ (𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g𝐾)𝑦) = 𝑦 ∧ (𝑦(+g𝐾)𝑥) = 𝑦))))
15 grpidpropd.2 . . . . . 6 (𝜑𝐵 = (Base‘𝐿))
1615eleq2d 2245 . . . . 5 (𝜑 → (𝑥𝐵𝑥 ∈ (Base‘𝐿)))
1715raleqdv 2676 . . . . 5 (𝜑 → (∀𝑦𝐵 ((𝑥(+g𝐿)𝑦) = 𝑦 ∧ (𝑦(+g𝐿)𝑥) = 𝑦) ↔ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g𝐿)𝑦) = 𝑦 ∧ (𝑦(+g𝐿)𝑥) = 𝑦)))
1816, 17anbi12d 473 . . . 4 (𝜑 → ((𝑥𝐵 ∧ ∀𝑦𝐵 ((𝑥(+g𝐿)𝑦) = 𝑦 ∧ (𝑦(+g𝐿)𝑥) = 𝑦)) ↔ (𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g𝐿)𝑦) = 𝑦 ∧ (𝑦(+g𝐿)𝑥) = 𝑦))))
1910, 14, 183bitr3d 218 . . 3 (𝜑 → ((𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g𝐾)𝑦) = 𝑦 ∧ (𝑦(+g𝐾)𝑥) = 𝑦)) ↔ (𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g𝐿)𝑦) = 𝑦 ∧ (𝑦(+g𝐿)𝑥) = 𝑦))))
2019iotabidv 5191 . 2 (𝜑 → (℩𝑥(𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g𝐾)𝑦) = 𝑦 ∧ (𝑦(+g𝐾)𝑥) = 𝑦))) = (℩𝑥(𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g𝐿)𝑦) = 𝑦 ∧ (𝑦(+g𝐿)𝑥) = 𝑦))))
21 grpidproddg.k . . 3 (𝜑𝐾𝑉)
22 eqid 2175 . . . 4 (Base‘𝐾) = (Base‘𝐾)
23 eqid 2175 . . . 4 (+g𝐾) = (+g𝐾)
24 eqid 2175 . . . 4 (0g𝐾) = (0g𝐾)
2522, 23, 24grpidvalg 12656 . . 3 (𝐾𝑉 → (0g𝐾) = (℩𝑥(𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g𝐾)𝑦) = 𝑦 ∧ (𝑦(+g𝐾)𝑥) = 𝑦))))
2621, 25syl 14 . 2 (𝜑 → (0g𝐾) = (℩𝑥(𝑥 ∈ (Base‘𝐾) ∧ ∀𝑦 ∈ (Base‘𝐾)((𝑥(+g𝐾)𝑦) = 𝑦 ∧ (𝑦(+g𝐾)𝑥) = 𝑦))))
27 grpidproddg.l . . 3 (𝜑𝐿𝑊)
28 eqid 2175 . . . 4 (Base‘𝐿) = (Base‘𝐿)
29 eqid 2175 . . . 4 (+g𝐿) = (+g𝐿)
30 eqid 2175 . . . 4 (0g𝐿) = (0g𝐿)
3128, 29, 30grpidvalg 12656 . . 3 (𝐿𝑊 → (0g𝐿) = (℩𝑥(𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g𝐿)𝑦) = 𝑦 ∧ (𝑦(+g𝐿)𝑥) = 𝑦))))
3227, 31syl 14 . 2 (𝜑 → (0g𝐿) = (℩𝑥(𝑥 ∈ (Base‘𝐿) ∧ ∀𝑦 ∈ (Base‘𝐿)((𝑥(+g𝐿)𝑦) = 𝑦 ∧ (𝑦(+g𝐿)𝑥) = 𝑦))))
3320, 26, 323eqtr4d 2218 1 (𝜑 → (0g𝐾) = (0g𝐿))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1353  wcel 2146  wral 2453  cio 5168  cfv 5208  (class class class)co 5865  Basecbs 12427  +gcplusg 12491  0gc0g 12625
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 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203  ax-un 4427  ax-cnex 7877  ax-resscn 7878  ax-1re 7880  ax-addrcl 7883
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ral 2458  df-rex 2459  df-v 2737  df-sbc 2961  df-csb 3056  df-un 3131  df-in 3133  df-ss 3140  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-int 3841  df-br 3999  df-opab 4060  df-mpt 4061  df-id 4287  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-iota 5170  df-fun 5210  df-fn 5211  df-fv 5216  df-riota 5821  df-ov 5868  df-inn 8891  df-ndx 12430  df-slot 12431  df-base 12433  df-0g 12627
This theorem is referenced by:  mhmpropd  12718  grppropd  12753  grpinvpropdg  12804
  Copyright terms: Public domain W3C validator