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 22175

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 2735	. . . . 5 ⊢ (Base‘𝑃) = (Base‘𝑃)
4		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → 𝑥 ∈ (𝐻‘𝑁))
5	1, 2, 3, 4	mhpmpl 22166	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → 𝑥 ∈ (Base‘𝑃))
6	5	ex 412	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝐻‘𝑁) → 𝑥 ∈ (Base‘𝑃)))
7	6	ssrdv 4001	. 2 ⊢ (𝜑 → (𝐻‘𝑁) ⊆ (Base‘𝑃))
8		eqid 2735	. . . 4 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
9		eqid 2735	. . . 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 22168	. . 3 ⊢ (𝜑 → ({ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} × {(0_g‘𝑅)}) ∈ (𝐻‘𝑁))
14	13	ne0d 4348	. 2 ⊢ (𝜑 → (𝐻‘𝑁) ≠ ∅)
15		eqid 2735	. . . . . 6 ⊢ (+_g‘𝑃) = (+_g‘𝑃)
16	11	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → 𝑅 ∈ Grp)
17	16	adantr 480	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) ∧ 𝑦 ∈ (𝐻‘𝑁)) → 𝑅 ∈ Grp)
18		simplr 769	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) ∧ 𝑦 ∈ (𝐻‘𝑁)) → 𝑥 ∈ (𝐻‘𝑁))
19		simpr 484	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) ∧ 𝑦 ∈ (𝐻‘𝑁)) → 𝑦 ∈ (𝐻‘𝑁))
20	1, 2, 15, 17, 18, 19	mhpaddcl 22173	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) ∧ 𝑦 ∈ (𝐻‘𝑁)) → (𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁))
21	20	ralrimiva 3144	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → ∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁))
22		eqid 2735	. . . . 5 ⊢ (inv_g‘𝑃) = (inv_g‘𝑃)
23	1, 2, 22, 16, 4	mhpinvcl 22174	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁))
24	21, 23	jca 511	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → (∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁) ∧ ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁)))
25	24	ralrimiva 3144	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (𝐻‘𝑁)(∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁) ∧ ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁)))
26	2	mplgrp 22055	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ Grp) → 𝑃 ∈ Grp)
27	10, 11, 26	syl2anc 584	. . 3 ⊢ (𝜑 → 𝑃 ∈ Grp)
28	3, 15, 22	issubg2 19172	. . 3 ⊢ (𝑃 ∈ Grp → ((𝐻‘𝑁) ∈ (SubGrp‘𝑃) ↔ ((𝐻‘𝑁) ⊆ (Base‘𝑃) ∧ (𝐻‘𝑁) ≠ ∅ ∧ ∀𝑥 ∈ (𝐻‘𝑁)(∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁) ∧ ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁)))))
29	27, 28	syl 17	. 2 ⊢ (𝜑 → ((𝐻‘𝑁) ∈ (SubGrp‘𝑃) ↔ ((𝐻‘𝑁) ⊆ (Base‘𝑃) ∧ (𝐻‘𝑁) ≠ ∅ ∧ ∀𝑥 ∈ (𝐻‘𝑁)(∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁) ∧ ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁)))))
30	7, 14, 25, 29	mpbir3and 1341	1 ⊢ (𝜑 → (𝐻‘𝑁) ∈ (SubGrp‘𝑃))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ≠ wne 2938 ∀wral 3059 {crab 3433 ⊆ wss 3963 ∅c0 4339 {csn 4631 × cxp 5687 ^◡ccnv 5688 “ cima 5692 ‘cfv 6563 (class class class)co 7431 ↑_m cmap 8865 Fincfn 8984 ℕcn 12264 ℕ₀cn0 12524 Basecbs 17245 +_gcplusg 17298 0_gc0g 17486 Grpcgrp 18964 inv_gcminusg 18965 SubGrpcsubg 19151 mPoly cmpl 21944 mHomP cmhp 22151

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-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230

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-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 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-tp 4636 df-op 4638 df-uni 4913 df-iun 4998 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-pred 6323 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-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-of 7697 df-om 7888 df-1st 8013 df-2nd 8014 df-supp 8185 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-er 8744 df-map 8867 df-ixp 8937 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-fsupp 9400 df-sup 9480 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12525 df-z 12612 df-dec 12732 df-uz 12877 df-fz 13545 df-struct 17181 df-sets 17198 df-slot 17216 df-ndx 17228 df-base 17246 df-ress 17275 df-plusg 17311 df-mulr 17312 df-sca 17314 df-vsca 17315 df-ip 17316 df-tset 17317 df-ple 17318 df-ds 17320 df-hom 17322 df-cco 17323 df-0g 17488 df-prds 17494 df-pws 17496 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-grp 18967 df-minusg 18968 df-subg 19154 df-psr 21947 df-mpl 21949 df-mhp 22158

This theorem is referenced by: mhplss 22177

W3C validator