Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  issubmgm Structured version   Visualization version   GIF version

Theorem issubmgm 41789
Description: Expand definition of a submagma. (Contributed by AV, 25-Feb-2020.)
Hypotheses
Ref Expression
issubmgm.b 𝐵 = (Base‘𝑀)
issubmgm.p + = (+g𝑀)
Assertion
Ref Expression
issubmgm (𝑀 ∈ Mgm → (𝑆 ∈ (SubMgm‘𝑀) ↔ (𝑆𝐵 ∧ ∀𝑥𝑆𝑦𝑆 (𝑥 + 𝑦) ∈ 𝑆)))
Distinct variable groups:   𝑥,𝑀,𝑦   𝑥,𝑆,𝑦
Allowed substitution hints:   𝐵(𝑥,𝑦)   + (𝑥,𝑦)

Proof of Theorem issubmgm
Dummy variables 𝑚 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6191 . . . . . 6 (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀))
21pweqd 4163 . . . . 5 (𝑚 = 𝑀 → 𝒫 (Base‘𝑚) = 𝒫 (Base‘𝑀))
3 fveq2 6191 . . . . . . . 8 (𝑚 = 𝑀 → (+g𝑚) = (+g𝑀))
43oveqd 6667 . . . . . . 7 (𝑚 = 𝑀 → (𝑥(+g𝑚)𝑦) = (𝑥(+g𝑀)𝑦))
54eleq1d 2686 . . . . . 6 (𝑚 = 𝑀 → ((𝑥(+g𝑚)𝑦) ∈ 𝑡 ↔ (𝑥(+g𝑀)𝑦) ∈ 𝑡))
652ralbidv 2989 . . . . 5 (𝑚 = 𝑀 → (∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑚)𝑦) ∈ 𝑡 ↔ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡))
72, 6rabeqbidv 3195 . . . 4 (𝑚 = 𝑀 → {𝑡 ∈ 𝒫 (Base‘𝑚) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑚)𝑦) ∈ 𝑡} = {𝑡 ∈ 𝒫 (Base‘𝑀) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡})
8 df-submgm 41780 . . . 4 SubMgm = (𝑚 ∈ Mgm ↦ {𝑡 ∈ 𝒫 (Base‘𝑚) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑚)𝑦) ∈ 𝑡})
9 fvex 6201 . . . . . 6 (Base‘𝑀) ∈ V
109pwex 4848 . . . . 5 𝒫 (Base‘𝑀) ∈ V
1110rabex 4813 . . . 4 {𝑡 ∈ 𝒫 (Base‘𝑀) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡} ∈ V
127, 8, 11fvmpt 6282 . . 3 (𝑀 ∈ Mgm → (SubMgm‘𝑀) = {𝑡 ∈ 𝒫 (Base‘𝑀) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡})
1312eleq2d 2687 . 2 (𝑀 ∈ Mgm → (𝑆 ∈ (SubMgm‘𝑀) ↔ 𝑆 ∈ {𝑡 ∈ 𝒫 (Base‘𝑀) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡}))
149elpw2 4828 . . . 4 (𝑆 ∈ 𝒫 (Base‘𝑀) ↔ 𝑆 ⊆ (Base‘𝑀))
1514anbi1i 731 . . 3 ((𝑆 ∈ 𝒫 (Base‘𝑀) ∧ ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆) ↔ (𝑆 ⊆ (Base‘𝑀) ∧ ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆))
16 eleq2 2690 . . . . . 6 (𝑡 = 𝑆 → ((𝑥(+g𝑀)𝑦) ∈ 𝑡 ↔ (𝑥(+g𝑀)𝑦) ∈ 𝑆))
1716raleqbi1dv 3146 . . . . 5 (𝑡 = 𝑆 → (∀𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡 ↔ ∀𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆))
1817raleqbi1dv 3146 . . . 4 (𝑡 = 𝑆 → (∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡 ↔ ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆))
1918elrab 3363 . . 3 (𝑆 ∈ {𝑡 ∈ 𝒫 (Base‘𝑀) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡} ↔ (𝑆 ∈ 𝒫 (Base‘𝑀) ∧ ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆))
20 issubmgm.b . . . . 5 𝐵 = (Base‘𝑀)
2120sseq2i 3630 . . . 4 (𝑆𝐵𝑆 ⊆ (Base‘𝑀))
22 issubmgm.p . . . . . . 7 + = (+g𝑀)
2322oveqi 6663 . . . . . 6 (𝑥 + 𝑦) = (𝑥(+g𝑀)𝑦)
2423eleq1i 2692 . . . . 5 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑥(+g𝑀)𝑦) ∈ 𝑆)
25242ralbii 2981 . . . 4 (∀𝑥𝑆𝑦𝑆 (𝑥 + 𝑦) ∈ 𝑆 ↔ ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆)
2621, 25anbi12i 733 . . 3 ((𝑆𝐵 ∧ ∀𝑥𝑆𝑦𝑆 (𝑥 + 𝑦) ∈ 𝑆) ↔ (𝑆 ⊆ (Base‘𝑀) ∧ ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆))
2715, 19, 263bitr4i 292 . 2 (𝑆 ∈ {𝑡 ∈ 𝒫 (Base‘𝑀) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡} ↔ (𝑆𝐵 ∧ ∀𝑥𝑆𝑦𝑆 (𝑥 + 𝑦) ∈ 𝑆))
2813, 27syl6bb 276 1 (𝑀 ∈ Mgm → (𝑆 ∈ (SubMgm‘𝑀) ↔ (𝑆𝐵 ∧ ∀𝑥𝑆𝑦𝑆 (𝑥 + 𝑦) ∈ 𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  wral 2912  {crab 2916  wss 3574  𝒫 cpw 4158  cfv 5888  (class class class)co 6650  Basecbs 15857  +gcplusg 15941  Mgmcmgm 17240  SubMgmcsubmgm 41778
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-iota 5851  df-fun 5890  df-fv 5896  df-ov 6653  df-submgm 41780
This theorem is referenced by:  issubmgm2  41790  rabsubmgmd  41791  submgmcl  41794  mgmhmima  41802  mgmhmeql  41803  submgmacs  41804
  Copyright terms: Public domain W3C validator