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

Theorem mgmsscl 18570
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 19062. (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 7575 . . 3 ((𝑋𝑆𝑌𝑆) → (𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) = (𝑋(+g𝐺)𝑌))
213ad2ant3 1133 . 2 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) = (𝑋(+g𝐺)𝑌))
3 simp1r 1196 . . . . 5 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → 𝐻 ∈ Mgm)
4 simp3 1136 . . . . 5 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝑋𝑆𝑌𝑆))
5 3anass 1093 . . . . 5 ((𝐻 ∈ Mgm ∧ 𝑋𝑆𝑌𝑆) ↔ (𝐻 ∈ Mgm ∧ (𝑋𝑆𝑌𝑆)))
63, 4, 5sylanbrc 581 . . . 4 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝐻 ∈ Mgm ∧ 𝑋𝑆𝑌𝑆))
7 mgmsscl.s . . . . 5 𝑆 = (Base‘𝐻)
8 eqid 2730 . . . . 5 (+g𝐻) = (+g𝐻)
97, 8mgmcl 18568 . . . 4 ((𝐻 ∈ Mgm ∧ 𝑋𝑆𝑌𝑆) → (𝑋(+g𝐻)𝑌) ∈ 𝑆)
106, 9syl 17 . . 3 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝑋(+g𝐻)𝑌) ∈ 𝑆)
11 oveq 7417 . . . . . . 7 (((+g𝐺) ↾ (𝑆 × 𝑆)) = (+g𝐻) → (𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) = (𝑋(+g𝐻)𝑌))
1211eleq1d 2816 . . . . . 6 (((+g𝐺) ↾ (𝑆 × 𝑆)) = (+g𝐻) → ((𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) ∈ 𝑆 ↔ (𝑋(+g𝐻)𝑌) ∈ 𝑆))
1312eqcoms 2738 . . . . 5 ((+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆)) → ((𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) ∈ 𝑆 ↔ (𝑋(+g𝐻)𝑌) ∈ 𝑆))
1413adantl 480 . . . 4 ((𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) → ((𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) ∈ 𝑆 ↔ (𝑋(+g𝐻)𝑌) ∈ 𝑆))
15143ad2ant2 1132 . . 3 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → ((𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) ∈ 𝑆 ↔ (𝑋(+g𝐻)𝑌) ∈ 𝑆))
1610, 15mpbird 256 . 2 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝑋((+g𝐺) ↾ (𝑆 × 𝑆))𝑌) ∈ 𝑆)
172, 16eqeltrrd 2832 1 (((𝐺 ∈ Mgm ∧ 𝐻 ∈ Mgm) ∧ (𝑆𝐵 ∧ (+g𝐻) = ((+g𝐺) ↾ (𝑆 × 𝑆))) ∧ (𝑋𝑆𝑌𝑆)) → (𝑋(+g𝐺)𝑌) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  w3a 1085   = wceq 1539  wcel 2104  wss 3947   × cxp 5673  cres 5677  cfv 6542  (class class class)co 7411  Basecbs 17148  +gcplusg 17201  Mgmcmgm 18563
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-ext 2701  ax-sep 5298  ax-nul 5305  ax-pr 5426
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2722  df-clel 2808  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3431  df-v 3474  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-xp 5681  df-res 5687  df-iota 6494  df-fv 6550  df-ov 7414  df-mgm 18565
This theorem is referenced by:  mndissubm  18724  grpissubg  19062
  Copyright terms: Public domain W3C validator