mhpsubg - Metamath Proof Explorer

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

Theorem mhpsubg 22094

Description: Homogeneous polynomials form a subgroup of the polynomials. (Contributed by SN, 25-Sep-2023.)

**Hypotheses**
Ref	Expression
mhpsubg.h	⊢ 𝐻 = (𝐼 mHomP 𝑅)
mhpsubg.p	⊢ 𝑃 = (𝐼 mPoly 𝑅)
mhpsubg.i	⊢ (𝜑 → 𝐼 ∈ 𝑉)
mhpsubg.r	⊢ (𝜑 → 𝑅 ∈ Grp)
mhpsubg.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)

**Assertion**
Ref	Expression
mhpsubg	⊢ (𝜑 → (𝐻‘𝑁) ∈ (SubGrp‘𝑃))

Proof of Theorem mhpsubg Dummy variables 𝑥 𝑦 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mhpsubg.h	. . . . 5 ⊢ 𝐻 = (𝐼 mHomP 𝑅)
2		mhpsubg.p	. . . . 5 ⊢ 𝑃 = (𝐼 mPoly 𝑅)
3		eqid 2734	. . . . 5 ⊢ (Base‘𝑃) = (Base‘𝑃)
4		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → 𝑥 ∈ (𝐻‘𝑁))
5	1, 2, 3, 4	mhpmpl 22085	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → 𝑥 ∈ (Base‘𝑃))
6	5	ex 412	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝐻‘𝑁) → 𝑥 ∈ (Base‘𝑃)))
7	6	ssrdv 3937	. 2 ⊢ (𝜑 → (𝐻‘𝑁) ⊆ (Base‘𝑃))
8		eqid 2734	. . . 4 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
9		eqid 2734	. . . 4 ⊢ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}
10		mhpsubg.i	. . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
11		mhpsubg.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ Grp)
12		mhpsubg.n	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
13	1, 8, 9, 10, 11, 12	mhp0cl 22087	. . 3 ⊢ (𝜑 → ({ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} × {(0_g‘𝑅)}) ∈ (𝐻‘𝑁))
14	13	ne0d 4292	. 2 ⊢ (𝜑 → (𝐻‘𝑁) ≠ ∅)
15		eqid 2734	. . . . . 6 ⊢ (+_g‘𝑃) = (+_g‘𝑃)
16	11	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → 𝑅 ∈ Grp)
17	16	adantr 480	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) ∧ 𝑦 ∈ (𝐻‘𝑁)) → 𝑅 ∈ Grp)
18		simplr 768	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) ∧ 𝑦 ∈ (𝐻‘𝑁)) → 𝑥 ∈ (𝐻‘𝑁))
19		simpr 484	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) ∧ 𝑦 ∈ (𝐻‘𝑁)) → 𝑦 ∈ (𝐻‘𝑁))
20	1, 2, 15, 17, 18, 19	mhpaddcl 22092	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) ∧ 𝑦 ∈ (𝐻‘𝑁)) → (𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁))
21	20	ralrimiva 3126	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → ∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁))
22		eqid 2734	. . . . 5 ⊢ (inv_g‘𝑃) = (inv_g‘𝑃)
23	1, 2, 22, 16, 4	mhpinvcl 22093	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁))
24	21, 23	jca 511	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → (∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁) ∧ ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁)))
25	24	ralrimiva 3126	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (𝐻‘𝑁)(∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁) ∧ ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁)))
26	2	mplgrp 21970	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ Grp) → 𝑃 ∈ Grp)
27	10, 11, 26	syl2anc 584	. . 3 ⊢ (𝜑 → 𝑃 ∈ Grp)
28	3, 15, 22	issubg2 19069	. . 3 ⊢ (𝑃 ∈ Grp → ((𝐻‘𝑁) ∈ (SubGrp‘𝑃) ↔ ((𝐻‘𝑁) ⊆ (Base‘𝑃) ∧ (𝐻‘𝑁) ≠ ∅ ∧ ∀𝑥 ∈ (𝐻‘𝑁)(∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁) ∧ ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁)))))
29	27, 28	syl 17	. 2 ⊢ (𝜑 → ((𝐻‘𝑁) ∈ (SubGrp‘𝑃) ↔ ((𝐻‘𝑁) ⊆ (Base‘𝑃) ∧ (𝐻‘𝑁) ≠ ∅ ∧ ∀𝑥 ∈ (𝐻‘𝑁)(∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁) ∧ ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁)))))
30	7, 14, 25, 29	mpbir3and 1343	1 ⊢ (𝜑 → (𝐻‘𝑁) ∈ (SubGrp‘𝑃))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ∀wral 3049 {crab 3397 ⊆ wss 3899 ∅c0 4283 {csn 4578 × cxp 5620 ^◡ccnv 5621 “ cima 5625 ‘cfv 6490 (class class class)co 7356 ↑_m cmap 8761 Fincfn 8881 ℕcn 12143 ℕ₀cn0 12399 Basecbs 17134 +_gcplusg 17175 0_gc0g 17357 Grpcgrp 18861 inv_gcminusg 18862 SubGrpcsubg 19048 mPoly cmpl 21860 mHomP cmhp 22070

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-tp 4583 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-of 7620 df-om 7807 df-1st 7931 df-2nd 7932 df-supp 8101 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-er 8633 df-map 8763 df-ixp 8834 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-fsupp 9263 df-sup 9343 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-2 12206 df-3 12207 df-4 12208 df-5 12209 df-6 12210 df-7 12211 df-8 12212 df-9 12213 df-n0 12400 df-z 12487 df-dec 12606 df-uz 12750 df-fz 13422 df-struct 17072 df-sets 17089 df-slot 17107 df-ndx 17119 df-base 17135 df-ress 17156 df-plusg 17188 df-mulr 17189 df-sca 17191 df-vsca 17192 df-ip 17193 df-tset 17194 df-ple 17195 df-ds 17197 df-hom 17199 df-cco 17200 df-0g 17359 df-prds 17365 df-pws 17367 df-mgm 18563 df-sgrp 18642 df-mnd 18658 df-grp 18864 df-minusg 18865 df-subg 19051 df-psr 21863 df-mpl 21865 df-mhp 22077

This theorem is referenced by: mhplss 22096

W3C validator