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 22119

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 2736	. . . . 5 ⊢ (Base‘𝑃) = (Base‘𝑃)
4		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → 𝑥 ∈ (𝐻‘𝑁))
5	1, 2, 3, 4	mhpmpl 22110	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → 𝑥 ∈ (Base‘𝑃))
6	5	ex 412	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝐻‘𝑁) → 𝑥 ∈ (Base‘𝑃)))
7	6	ssrdv 3927	. 2 ⊢ (𝜑 → (𝐻‘𝑁) ⊆ (Base‘𝑃))
8		eqid 2736	. . . 4 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
9		eqid 2736	. . . 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 22112	. . 3 ⊢ (𝜑 → ({ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} × {(0_g‘𝑅)}) ∈ (𝐻‘𝑁))
14	13	ne0d 4282	. 2 ⊢ (𝜑 → (𝐻‘𝑁) ≠ ∅)
15		eqid 2736	. . . . . 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 22117	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) ∧ 𝑦 ∈ (𝐻‘𝑁)) → (𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁))
21	20	ralrimiva 3129	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → ∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁))
22		eqid 2736	. . . . 5 ⊢ (inv_g‘𝑃) = (inv_g‘𝑃)
23	1, 2, 22, 16, 4	mhpinvcl 22118	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁))
24	21, 23	jca 511	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐻‘𝑁)) → (∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁) ∧ ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁)))
25	24	ralrimiva 3129	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (𝐻‘𝑁)(∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁) ∧ ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁)))
26	2	mplgrp 21995	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑅 ∈ Grp) → 𝑃 ∈ Grp)
27	10, 11, 26	syl2anc 585	. . 3 ⊢ (𝜑 → 𝑃 ∈ Grp)
28	3, 15, 22	issubg2 19117	. . 3 ⊢ (𝑃 ∈ Grp → ((𝐻‘𝑁) ∈ (SubGrp‘𝑃) ↔ ((𝐻‘𝑁) ⊆ (Base‘𝑃) ∧ (𝐻‘𝑁) ≠ ∅ ∧ ∀𝑥 ∈ (𝐻‘𝑁)(∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁) ∧ ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁)))))
29	27, 28	syl 17	. 2 ⊢ (𝜑 → ((𝐻‘𝑁) ∈ (SubGrp‘𝑃) ↔ ((𝐻‘𝑁) ⊆ (Base‘𝑃) ∧ (𝐻‘𝑁) ≠ ∅ ∧ ∀𝑥 ∈ (𝐻‘𝑁)(∀𝑦 ∈ (𝐻‘𝑁)(𝑥(+_g‘𝑃)𝑦) ∈ (𝐻‘𝑁) ∧ ((inv_g‘𝑃)‘𝑥) ∈ (𝐻‘𝑁)))))
30	7, 14, 25, 29	mpbir3and 1344	1 ⊢ (𝜑 → (𝐻‘𝑁) ∈ (SubGrp‘𝑃))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ∀wral 3051 {crab 3389 ⊆ wss 3889 ∅c0 4273 {csn 4567 × cxp 5629 ^◡ccnv 5630 “ cima 5634 ‘cfv 6498 (class class class)co 7367 ↑_m cmap 8773 Fincfn 8893 ℕcn 12174 ℕ₀cn0 12437 Basecbs 17179 +_gcplusg 17220 0_gc0g 17402 Grpcgrp 18909 inv_gcminusg 18910 SubGrpcsubg 19096 mPoly cmpl 21886 mHomP cmhp 22095

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-of 7631 df-om 7818 df-1st 7942 df-2nd 7943 df-supp 8111 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-map 8775 df-ixp 8846 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-fsupp 9275 df-sup 9355 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-9 12251 df-n0 12438 df-z 12525 df-dec 12645 df-uz 12789 df-fz 13462 df-struct 17117 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-mulr 17234 df-sca 17236 df-vsca 17237 df-ip 17238 df-tset 17239 df-ple 17240 df-ds 17242 df-hom 17244 df-cco 17245 df-0g 17404 df-prds 17410 df-pws 17412 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-grp 18912 df-minusg 18913 df-subg 19099 df-psr 21889 df-mpl 21891 df-mhp 22102

This theorem is referenced by: mhplss 22121

W3C validator