![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > submgmacs | Structured version Visualization version GIF version |
Description: Submagmas are an algebraic closure system. (Contributed by AV, 27-Feb-2020.) |
Ref | Expression |
---|---|
submgmacs.b | ⊢ 𝐵 = (Base‘𝐺) |
Ref | Expression |
---|---|
submgmacs | ⊢ (𝐺 ∈ Mgm → (SubMgm‘𝐺) ∈ (ACS‘𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | submgmacs.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
2 | eqid 2735 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
3 | 1, 2 | issubmgm 18728 | . . . . 5 ⊢ (𝐺 ∈ Mgm → (𝑠 ∈ (SubMgm‘𝐺) ↔ (𝑠 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝐺)𝑦) ∈ 𝑠))) |
4 | velpw 4610 | . . . . . 6 ⊢ (𝑠 ∈ 𝒫 𝐵 ↔ 𝑠 ⊆ 𝐵) | |
5 | 4 | anbi1i 624 | . . . . 5 ⊢ ((𝑠 ∈ 𝒫 𝐵 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝐺)𝑦) ∈ 𝑠) ↔ (𝑠 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝐺)𝑦) ∈ 𝑠)) |
6 | 3, 5 | bitr4di 289 | . . . 4 ⊢ (𝐺 ∈ Mgm → (𝑠 ∈ (SubMgm‘𝐺) ↔ (𝑠 ∈ 𝒫 𝐵 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝐺)𝑦) ∈ 𝑠))) |
7 | 6 | eqabdv 2873 | . . 3 ⊢ (𝐺 ∈ Mgm → (SubMgm‘𝐺) = {𝑠 ∣ (𝑠 ∈ 𝒫 𝐵 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝐺)𝑦) ∈ 𝑠)}) |
8 | df-rab 3434 | . . 3 ⊢ {𝑠 ∈ 𝒫 𝐵 ∣ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝐺)𝑦) ∈ 𝑠} = {𝑠 ∣ (𝑠 ∈ 𝒫 𝐵 ∧ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝐺)𝑦) ∈ 𝑠)} | |
9 | 7, 8 | eqtr4di 2793 | . 2 ⊢ (𝐺 ∈ Mgm → (SubMgm‘𝐺) = {𝑠 ∈ 𝒫 𝐵 ∣ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝐺)𝑦) ∈ 𝑠}) |
10 | 1 | fvexi 6921 | . . 3 ⊢ 𝐵 ∈ V |
11 | 1, 2 | mgmcl 18669 | . . . . 5 ⊢ ((𝐺 ∈ Mgm ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
12 | 11 | 3expb 1119 | . . . 4 ⊢ ((𝐺 ∈ Mgm ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
13 | 12 | ralrimivva 3200 | . . 3 ⊢ (𝐺 ∈ Mgm → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) |
14 | acsfn2 17708 | . . 3 ⊢ ((𝐵 ∈ V ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐺)𝑦) ∈ 𝐵) → {𝑠 ∈ 𝒫 𝐵 ∣ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝐺)𝑦) ∈ 𝑠} ∈ (ACS‘𝐵)) | |
15 | 10, 13, 14 | sylancr 587 | . 2 ⊢ (𝐺 ∈ Mgm → {𝑠 ∈ 𝒫 𝐵 ∣ ∀𝑥 ∈ 𝑠 ∀𝑦 ∈ 𝑠 (𝑥(+g‘𝐺)𝑦) ∈ 𝑠} ∈ (ACS‘𝐵)) |
16 | 9, 15 | eqeltrd 2839 | 1 ⊢ (𝐺 ∈ Mgm → (SubMgm‘𝐺) ∈ (ACS‘𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 {cab 2712 ∀wral 3059 {crab 3433 Vcvv 3478 ⊆ wss 3963 𝒫 cpw 4605 ‘cfv 6563 (class class class)co 7431 Basecbs 17245 +gcplusg 17298 ACScacs 17630 Mgmcmgm 18664 SubMgmcsubmgm 18717 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-iin 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-ov 7434 df-om 7888 df-1o 8505 df-2o 8506 df-en 8985 df-fin 8988 df-mre 17631 df-mrc 17632 df-acs 17634 df-mgm 18666 df-submgm 18719 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |