Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  grpinvssd Structured version   Visualization version   GIF version

Theorem grpinvssd 18172
 Description: If the base set of a group is contained in the base set of another group, and the group operation of the group is the restriction of the group operation of the other group to its base set, then the elements of the first group have the same inverses in both groups. (Contributed by AV, 15-Mar-2019.)
Hypotheses
Ref Expression
grpidssd.m (𝜑𝑀 ∈ Grp)
grpidssd.s (𝜑𝑆 ∈ Grp)
grpidssd.b 𝐵 = (Base‘𝑆)
grpidssd.c (𝜑𝐵 ⊆ (Base‘𝑀))
grpidssd.o (𝜑 → ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦))
Assertion
Ref Expression
grpinvssd (𝜑 → (𝑋𝐵 → ((invg𝑆)‘𝑋) = ((invg𝑀)‘𝑋)))
Distinct variable groups:   𝑥,𝐵,𝑦   𝑥,𝑀,𝑦   𝑥,𝑆,𝑦   𝑥,𝑋,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem grpinvssd
StepHypRef Expression
1 grpidssd.s . . . . . 6 (𝜑𝑆 ∈ Grp)
2 grpidssd.b . . . . . . 7 𝐵 = (Base‘𝑆)
3 eqid 2824 . . . . . . 7 (invg𝑆) = (invg𝑆)
42, 3grpinvcl 18147 . . . . . 6 ((𝑆 ∈ Grp ∧ 𝑋𝐵) → ((invg𝑆)‘𝑋) ∈ 𝐵)
51, 4sylan 583 . . . . 5 ((𝜑𝑋𝐵) → ((invg𝑆)‘𝑋) ∈ 𝐵)
6 simpr 488 . . . . 5 ((𝜑𝑋𝐵) → 𝑋𝐵)
7 grpidssd.o . . . . . 6 (𝜑 → ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦))
87adantr 484 . . . . 5 ((𝜑𝑋𝐵) → ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦))
9 oveq1 7152 . . . . . . 7 (𝑥 = ((invg𝑆)‘𝑋) → (𝑥(+g𝑀)𝑦) = (((invg𝑆)‘𝑋)(+g𝑀)𝑦))
10 oveq1 7152 . . . . . . 7 (𝑥 = ((invg𝑆)‘𝑋) → (𝑥(+g𝑆)𝑦) = (((invg𝑆)‘𝑋)(+g𝑆)𝑦))
119, 10eqeq12d 2840 . . . . . 6 (𝑥 = ((invg𝑆)‘𝑋) → ((𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦) ↔ (((invg𝑆)‘𝑋)(+g𝑀)𝑦) = (((invg𝑆)‘𝑋)(+g𝑆)𝑦)))
12 oveq2 7153 . . . . . . 7 (𝑦 = 𝑋 → (((invg𝑆)‘𝑋)(+g𝑀)𝑦) = (((invg𝑆)‘𝑋)(+g𝑀)𝑋))
13 oveq2 7153 . . . . . . 7 (𝑦 = 𝑋 → (((invg𝑆)‘𝑋)(+g𝑆)𝑦) = (((invg𝑆)‘𝑋)(+g𝑆)𝑋))
1412, 13eqeq12d 2840 . . . . . 6 (𝑦 = 𝑋 → ((((invg𝑆)‘𝑋)(+g𝑀)𝑦) = (((invg𝑆)‘𝑋)(+g𝑆)𝑦) ↔ (((invg𝑆)‘𝑋)(+g𝑀)𝑋) = (((invg𝑆)‘𝑋)(+g𝑆)𝑋)))
1511, 14rspc2va 3620 . . . . 5 (((((invg𝑆)‘𝑋) ∈ 𝐵𝑋𝐵) ∧ ∀𝑥𝐵𝑦𝐵 (𝑥(+g𝑀)𝑦) = (𝑥(+g𝑆)𝑦)) → (((invg𝑆)‘𝑋)(+g𝑀)𝑋) = (((invg𝑆)‘𝑋)(+g𝑆)𝑋))
165, 6, 8, 15syl21anc 836 . . . 4 ((𝜑𝑋𝐵) → (((invg𝑆)‘𝑋)(+g𝑀)𝑋) = (((invg𝑆)‘𝑋)(+g𝑆)𝑋))
17 eqid 2824 . . . . . 6 (+g𝑆) = (+g𝑆)
18 eqid 2824 . . . . . 6 (0g𝑆) = (0g𝑆)
192, 17, 18, 3grplinv 18148 . . . . 5 ((𝑆 ∈ Grp ∧ 𝑋𝐵) → (((invg𝑆)‘𝑋)(+g𝑆)𝑋) = (0g𝑆))
201, 19sylan 583 . . . 4 ((𝜑𝑋𝐵) → (((invg𝑆)‘𝑋)(+g𝑆)𝑋) = (0g𝑆))
21 grpidssd.m . . . . . 6 (𝜑𝑀 ∈ Grp)
22 grpidssd.c . . . . . . 7 (𝜑𝐵 ⊆ (Base‘𝑀))
2322sselda 3952 . . . . . 6 ((𝜑𝑋𝐵) → 𝑋 ∈ (Base‘𝑀))
24 eqid 2824 . . . . . . 7 (Base‘𝑀) = (Base‘𝑀)
25 eqid 2824 . . . . . . 7 (+g𝑀) = (+g𝑀)
26 eqid 2824 . . . . . . 7 (0g𝑀) = (0g𝑀)
27 eqid 2824 . . . . . . 7 (invg𝑀) = (invg𝑀)
2824, 25, 26, 27grplinv 18148 . . . . . 6 ((𝑀 ∈ Grp ∧ 𝑋 ∈ (Base‘𝑀)) → (((invg𝑀)‘𝑋)(+g𝑀)𝑋) = (0g𝑀))
2921, 23, 28syl2an2r 684 . . . . 5 ((𝜑𝑋𝐵) → (((invg𝑀)‘𝑋)(+g𝑀)𝑋) = (0g𝑀))
3021, 1, 2, 22, 7grpidssd 18171 . . . . . 6 (𝜑 → (0g𝑀) = (0g𝑆))
3130adantr 484 . . . . 5 ((𝜑𝑋𝐵) → (0g𝑀) = (0g𝑆))
3229, 31eqtr2d 2860 . . . 4 ((𝜑𝑋𝐵) → (0g𝑆) = (((invg𝑀)‘𝑋)(+g𝑀)𝑋))
3316, 20, 323eqtrd 2863 . . 3 ((𝜑𝑋𝐵) → (((invg𝑆)‘𝑋)(+g𝑀)𝑋) = (((invg𝑀)‘𝑋)(+g𝑀)𝑋))
3421adantr 484 . . . 4 ((𝜑𝑋𝐵) → 𝑀 ∈ Grp)
3522adantr 484 . . . . 5 ((𝜑𝑋𝐵) → 𝐵 ⊆ (Base‘𝑀))
3635, 5sseldd 3953 . . . 4 ((𝜑𝑋𝐵) → ((invg𝑆)‘𝑋) ∈ (Base‘𝑀))
3724, 27grpinvcl 18147 . . . . 5 ((𝑀 ∈ Grp ∧ 𝑋 ∈ (Base‘𝑀)) → ((invg𝑀)‘𝑋) ∈ (Base‘𝑀))
3821, 23, 37syl2an2r 684 . . . 4 ((𝜑𝑋𝐵) → ((invg𝑀)‘𝑋) ∈ (Base‘𝑀))
3924, 25grprcan 18133 . . . 4 ((𝑀 ∈ Grp ∧ (((invg𝑆)‘𝑋) ∈ (Base‘𝑀) ∧ ((invg𝑀)‘𝑋) ∈ (Base‘𝑀) ∧ 𝑋 ∈ (Base‘𝑀))) → ((((invg𝑆)‘𝑋)(+g𝑀)𝑋) = (((invg𝑀)‘𝑋)(+g𝑀)𝑋) ↔ ((invg𝑆)‘𝑋) = ((invg𝑀)‘𝑋)))
4034, 36, 38, 23, 39syl13anc 1369 . . 3 ((𝜑𝑋𝐵) → ((((invg𝑆)‘𝑋)(+g𝑀)𝑋) = (((invg𝑀)‘𝑋)(+g𝑀)𝑋) ↔ ((invg𝑆)‘𝑋) = ((invg𝑀)‘𝑋)))
4133, 40mpbid 235 . 2 ((𝜑𝑋𝐵) → ((invg𝑆)‘𝑋) = ((invg𝑀)‘𝑋))
4241ex 416 1 (𝜑 → (𝑋𝐵 → ((invg𝑆)‘𝑋) = ((invg𝑀)‘𝑋)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2115  ∀wral 3133   ⊆ wss 3919  ‘cfv 6343  (class class class)co 7145  Basecbs 16479  +gcplusg 16561  0gc0g 16709  Grpcgrp 18099  invgcminusg 18100 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-sep 5189  ax-nul 5196  ax-pow 5253  ax-pr 5317  ax-un 7451 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3015  df-ral 3138  df-rex 3139  df-reu 3140  df-rmo 3141  df-rab 3142  df-v 3482  df-sbc 3759  df-dif 3922  df-un 3924  df-in 3926  df-ss 3936  df-nul 4276  df-if 4450  df-pw 4523  df-sn 4550  df-pr 4552  df-op 4556  df-uni 4825  df-br 5053  df-opab 5115  df-mpt 5133  df-id 5447  df-xp 5548  df-rel 5549  df-cnv 5550  df-co 5551  df-dm 5552  df-rn 5553  df-res 5554  df-ima 5555  df-iota 6302  df-fun 6345  df-fn 6346  df-f 6347  df-fv 6351  df-riota 7103  df-ov 7148  df-0g 16711  df-mgm 17848  df-sgrp 17897  df-mnd 17908  df-grp 18102  df-minusg 18103 This theorem is referenced by:  grpissubg  18295
 Copyright terms: Public domain W3C validator