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

Theorem issubmgm 18763
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 6885 . . . . . 6 (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀))
21pweqd 4584 . . . . 5 (𝑚 = 𝑀 → 𝒫 (Base‘𝑚) = 𝒫 (Base‘𝑀))
3 fveq2 6885 . . . . . . . 8 (𝑚 = 𝑀 → (+g𝑚) = (+g𝑀))
43oveqd 7431 . . . . . . 7 (𝑚 = 𝑀 → (𝑥(+g𝑚)𝑦) = (𝑥(+g𝑀)𝑦))
54eleq1d 2855 . . . . . 6 (𝑚 = 𝑀 → ((𝑥(+g𝑚)𝑦) ∈ 𝑡 ↔ (𝑥(+g𝑀)𝑦) ∈ 𝑡))
652ralbidv 3236 . . . . 5 (𝑚 = 𝑀 → (∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑚)𝑦) ∈ 𝑡 ↔ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡))
72, 6rabeqbidv 3441 . . . 4 (𝑚 = 𝑀 → {𝑡 ∈ 𝒫 (Base‘𝑚) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑚)𝑦) ∈ 𝑡} = {𝑡 ∈ 𝒫 (Base‘𝑀) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡})
8 df-submgm 18754 . . . 4 SubMgm = (𝑚 ∈ Mgm ↦ {𝑡 ∈ 𝒫 (Base‘𝑚) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑚)𝑦) ∈ 𝑡})
9 fvex 6898 . . . . . 6 (Base‘𝑀) ∈ V
109pwex 5355 . . . . 5 𝒫 (Base‘𝑀) ∈ V
1110rabex 5313 . . . 4 {𝑡 ∈ 𝒫 (Base‘𝑀) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡} ∈ V
127, 8, 11fvmpt 6993 . . 3 (𝑀 ∈ Mgm → (SubMgm‘𝑀) = {𝑡 ∈ 𝒫 (Base‘𝑀) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡})
1312eleq2d 2856 . 2 (𝑀 ∈ Mgm → (𝑆 ∈ (SubMgm‘𝑀) ↔ 𝑆 ∈ {𝑡 ∈ 𝒫 (Base‘𝑀) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡}))
149elpw2 5308 . . . 4 (𝑆 ∈ 𝒫 (Base‘𝑀) ↔ 𝑆 ⊆ (Base‘𝑀))
1514anbi1i 635 . . 3 ((𝑆 ∈ 𝒫 (Base‘𝑀) ∧ ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆) ↔ (𝑆 ⊆ (Base‘𝑀) ∧ ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆))
16 eleq2 2859 . . . . . 6 (𝑡 = 𝑆 → ((𝑥(+g𝑀)𝑦) ∈ 𝑡 ↔ (𝑥(+g𝑀)𝑦) ∈ 𝑆))
1716raleqbi1dv 3340 . . . . 5 (𝑡 = 𝑆 → (∀𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡 ↔ ∀𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆))
1817raleqbi1dv 3340 . . . 4 (𝑡 = 𝑆 → (∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡 ↔ ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆))
1918elrab 3658 . . 3 (𝑆 ∈ {𝑡 ∈ 𝒫 (Base‘𝑀) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡} ↔ (𝑆 ∈ 𝒫 (Base‘𝑀) ∧ ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆))
20 issubmgm.b . . . . 5 𝐵 = (Base‘𝑀)
2120sseq2i 3974 . . . 4 (𝑆𝐵𝑆 ⊆ (Base‘𝑀))
22 issubmgm.p . . . . . . 7 + = (+g𝑀)
2322oveqi 7427 . . . . . 6 (𝑥 + 𝑦) = (𝑥(+g𝑀)𝑦)
2423eleq1i 2861 . . . . 5 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑥(+g𝑀)𝑦) ∈ 𝑆)
25242ralbii 3147 . . . 4 (∀𝑥𝑆𝑦𝑆 (𝑥 + 𝑦) ∈ 𝑆 ↔ ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆)
2621, 25anbi12i 639 . . 3 ((𝑆𝐵 ∧ ∀𝑥𝑆𝑦𝑆 (𝑥 + 𝑦) ∈ 𝑆) ↔ (𝑆 ⊆ (Base‘𝑀) ∧ ∀𝑥𝑆𝑦𝑆 (𝑥(+g𝑀)𝑦) ∈ 𝑆))
2715, 19, 263bitr4i 306 . 2 (𝑆 ∈ {𝑡 ∈ 𝒫 (Base‘𝑀) ∣ ∀𝑥𝑡𝑦𝑡 (𝑥(+g𝑀)𝑦) ∈ 𝑡} ↔ (𝑆𝐵 ∧ ∀𝑥𝑆𝑦𝑆 (𝑥 + 𝑦) ∈ 𝑆))
2813, 27bitrdi 290 1 (𝑀 ∈ Mgm → (𝑆 ∈ (SubMgm‘𝑀) ↔ (𝑆𝐵 ∧ ∀𝑥𝑆𝑦𝑆 (𝑥 + 𝑦) ∈ 𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1568  wcel 2150  wral 3086  {crab 3423  wss 3913  𝒫 cpw 4567  cfv 6540  (class class class)co 7414  Basecbs 17272  +gcplusg 17313  Mgmcmgm 18699  SubMgmcsubmgm 18752
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2199  ax-12 2220  ax-ext 2742  ax-sep 5262  ax-nul 5274  ax-pow 5340  ax-pr 5408
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2099  df-mo 2574  df-eu 2604  df-clab 2749  df-cleq 2762  df-clel 2845  df-nfc 2919  df-ne 2966  df-ral 3087  df-rex 3097  df-rab 3424  df-v 3464  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5560  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7417  df-submgm 18754
This theorem is referenced by:  issubmgm2  18764  rabsubmgmd  18765  submgmcl  18768  mgmhmima  18776  mgmhmeql  18777  submgmacs  18778
  Copyright terms: Public domain W3C validator