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

Theorem mgmsscl 18331
Description: If the base set of a magma is contained in the base set of another magma, and the group operation of the magma is the restriction of the group operation of the other magma to its base set, then the base set of the magma is closed under the group operation of the other magma. Formerly part of proof of grpissubg 18775. (Contributed by AV, 17-Feb-2024.)
Hypotheses
Ref Expression
mgmsscl.b 𝐵 = (Base‘𝐺)
mgmsscl.s 𝑆 = (Base‘𝐻)
Assertion
Ref Expression
mgmsscl (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝑋(+g𝐺)𝑌) ∈ 𝑆)

Proof of Theorem mgmsscl
StepHypRef Expression
1 ovres 7438 . . 3 ((𝑋𝑆𝑌𝑆) → (𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) = (𝑋(+g𝐺)𝑌))
213ad2ant3 1134 . 2 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) = (𝑋(+g𝐺)𝑌))
3 simp1r 1197 . . . . 5 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → 𝐻 ∈ Mgm)
4 simp3 1137 . . . . 5 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝑋𝑆𝑌𝑆))
5 3anass 1094 . . . . 5 ((𝐻 ∈ Mgm ∧ 𝑋𝑆𝑌𝑆) ↔ (𝐻 ∈ Mgm ∧ (𝑋𝑆𝑌𝑆)))
63, 4, 5sylanbrc 583 . . . 4 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝐻 ∈ Mgm ∧ 𝑋𝑆𝑌𝑆))
7 mgmsscl.s . . . . 5 𝑆 = (Base‘𝐻)
8 eqid 2738 . . . . 5 (+g𝐻) = (+g𝐻)
97, 8mgmcl 18329 . . . 4 ((𝐻 ∈ Mgm ∧ 𝑋𝑆𝑌𝑆) → (𝑋(+g𝐻)𝑌) ∈ 𝑆)
106, 9syl 17 . . 3 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝑋(+g𝐻)𝑌) ∈ 𝑆)
11 oveq 7281 . . . . . . 7 (((+g𝐺) ↾ (𝑆 × 𝑆)) = (+g𝐻) → (𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) = (𝑋(+g𝐻)𝑌))
1211eleq1d 2823 . . . . . 6 (((+g𝐺) ↾ (𝑆 × 𝑆)) = (+g𝐻) → ((𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) ∈ 𝑆 ↔ (𝑋(+g𝐻)𝑌) ∈ 𝑆))
1312eqcoms 2746 . . . . 5 ((+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)) → ((𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) ∈ 𝑆 ↔ (𝑋(+g𝐻)𝑌) ∈ 𝑆))
1413adantl 482 . . . 4 ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → ((𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) ∈ 𝑆 ↔ (𝑋(+g𝐻)𝑌) ∈ 𝑆))
15143ad2ant2 1133 . . 3 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → ((𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) ∈ 𝑆 ↔ (𝑋(+g𝐻)𝑌) ∈ 𝑆))
1610, 15mpbird 256 . 2 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) ∈ 𝑆)
172, 16eqeltrrd 2840 1 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝑋(+g𝐺)𝑌) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1086   = wceq 1539  wcel 2106  wss 3887   × cxp 5587  cres 5591  cfv 6433  (class class class)co 7275  Basecbs 16912  +gcplusg 16962  Mgmcmgm 18324
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-xp 5595  df-res 5601  df-iota 6391  df-fv 6441  df-ov 7278  df-mgm 18326
This theorem is referenced by:  mndissubm  18446  grpissubg  18775
  Copyright terms: Public domain W3C validator