mhpvarcl - Metamath Proof Explorer

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

Theorem mhpvarcl 21387

Description: A power series variable is a polynomial of degree 1. (Contributed by SN, 25-May-2024.)

**Hypotheses**
Ref	Expression
mhpvarcl.h	⊢ 𝐻 = (𝐼 mHomP 𝑅)
mhpvarcl.v	⊢ 𝑉 = (𝐼 mVar 𝑅)
mhpvarcl.i	⊢ (𝜑 → 𝐼 ∈ 𝑊)
mhpvarcl.r	⊢ (𝜑 → 𝑅 ∈ Ring)
mhpvarcl.x	⊢ (𝜑 → 𝑋 ∈ 𝐼)

**Assertion**
Ref	Expression
mhpvarcl	⊢ (𝜑 → (𝑉‘𝑋) ∈ (𝐻‘1))

Proof of Theorem mhpvarcl Dummy variables 𝑑 ℎ 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		iffalse 4474	. . . . . 6 ⊢ (¬ 𝑑 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) → if(𝑑 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), (1_r‘𝑅), (0_g‘𝑅)) = (0_g‘𝑅))
2		mhpvarcl.v	. . . . . . . 8 ⊢ 𝑉 = (𝐼 mVar 𝑅)
3		eqid 2736	. . . . . . . 8 ⊢ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}
4		eqid 2736	. . . . . . . 8 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
5		eqid 2736	. . . . . . . 8 ⊢ (1_r‘𝑅) = (1_r‘𝑅)
6		mhpvarcl.i	. . . . . . . . 9 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
7	6	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 𝐼 ∈ 𝑊)
8		mhpvarcl.r	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 ∈ Ring)
9	8	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 𝑅 ∈ Ring)
10		mhpvarcl.x	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ 𝐼)
11	10	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 𝑋 ∈ 𝐼)
12		simpr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin})
13	2, 3, 4, 5, 7, 9, 11, 12	mvrval2 21240	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → ((𝑉‘𝑋)‘𝑑) = if(𝑑 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), (1_r‘𝑅), (0_g‘𝑅)))
14	13	eqeq1d 2738	. . . . . 6 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (((𝑉‘𝑋)‘𝑑) = (0_g‘𝑅) ↔ if(𝑑 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), (1_r‘𝑅), (0_g‘𝑅)) = (0_g‘𝑅)))
15	1, 14	syl5ibr 246	. . . . 5 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (¬ 𝑑 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) → ((𝑉‘𝑋)‘𝑑) = (0_g‘𝑅)))
16	15	necon1ad 2958	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (((𝑉‘𝑋)‘𝑑) ≠ (0_g‘𝑅) → 𝑑 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))
17		nn0subm 20702	. . . . . . 7 ⊢ ℕ₀ ∈ (SubMnd‘ℂ_fld)
18		eqid 2736	. . . . . . . 8 ⊢ (ℂ_fld ↾_s ℕ₀) = (ℂ_fld ↾_s ℕ₀)
19		cnfld0 20671	. . . . . . . 8 ⊢ 0 = (0_g‘ℂ_fld)
20	18, 19	subm0 18503	. . . . . . 7 ⊢ (ℕ₀ ∈ (SubMnd‘ℂ_fld) → 0 = (0_g‘(ℂ_fld ↾_s ℕ₀)))
21	17, 20	ax-mp 5	. . . . . 6 ⊢ 0 = (0_g‘(ℂ_fld ↾_s ℕ₀))
22	18	submmnd 18501	. . . . . . 7 ⊢ (ℕ₀ ∈ (SubMnd‘ℂ_fld) → (ℂ_fld ↾_s ℕ₀) ∈ Mnd)
23	17, 22	mp1i 13	. . . . . 6 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (ℂ_fld ↾_s ℕ₀) ∈ Mnd)
24		eqid 2736	. . . . . 6 ⊢ (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))
25		1nn0 12299	. . . . . . . 8 ⊢ 1 ∈ ℕ₀
26	18	submbas 18502	. . . . . . . . 9 ⊢ (ℕ₀ ∈ (SubMnd‘ℂ_fld) → ℕ₀ = (Base‘(ℂ_fld ↾_s ℕ₀)))
27	17, 26	ax-mp 5	. . . . . . . 8 ⊢ ℕ₀ = (Base‘(ℂ_fld ↾_s ℕ₀))
28	25, 27	eleqtri 2835	. . . . . . 7 ⊢ 1 ∈ (Base‘(ℂ_fld ↾_s ℕ₀))
29	28	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → 1 ∈ (Base‘(ℂ_fld ↾_s ℕ₀)))
30	21, 23, 7, 11, 24, 29	gsummptif1n0 19616	. . . . 5 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → ((ℂ_fld ↾_s ℕ₀) Σ_g (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = 1)
31		oveq2 7315	. . . . . 6 ⊢ (𝑑 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) → ((ℂ_fld ↾_s ℕ₀) Σ_g 𝑑) = ((ℂ_fld ↾_s ℕ₀) Σ_g (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))))
32	31	eqeq1d 2738	. . . . 5 ⊢ (𝑑 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) → (((ℂ_fld ↾_s ℕ₀) Σ_g 𝑑) = 1 ↔ ((ℂ_fld ↾_s ℕ₀) Σ_g (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) = 1))
33	30, 32	syl5ibrcom 247	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (𝑑 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)) → ((ℂ_fld ↾_s ℕ₀) Σ_g 𝑑) = 1))
34	16, 33	syld 47	. . 3 ⊢ ((𝜑 ∧ 𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}) → (((𝑉‘𝑋)‘𝑑) ≠ (0_g‘𝑅) → ((ℂ_fld ↾_s ℕ₀) Σ_g 𝑑) = 1))
35	34	ralrimiva 3140	. 2 ⊢ (𝜑 → ∀𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} (((𝑉‘𝑋)‘𝑑) ≠ (0_g‘𝑅) → ((ℂ_fld ↾_s ℕ₀) Σ_g 𝑑) = 1))
36		mhpvarcl.h	. . 3 ⊢ 𝐻 = (𝐼 mHomP 𝑅)
37		eqid 2736	. . 3 ⊢ (𝐼 mPoly 𝑅) = (𝐼 mPoly 𝑅)
38		eqid 2736	. . 3 ⊢ (Base‘(𝐼 mPoly 𝑅)) = (Base‘(𝐼 mPoly 𝑅))
39	25	a1i 11	. . 3 ⊢ (𝜑 → 1 ∈ ℕ₀)
40	37, 2, 38, 6, 8, 10	mvrcl 21270	. . 3 ⊢ (𝜑 → (𝑉‘𝑋) ∈ (Base‘(𝐼 mPoly 𝑅)))
41	36, 37, 38, 4, 3, 6, 8, 39, 40	ismhp3 21382	. 2 ⊢ (𝜑 → ((𝑉‘𝑋) ∈ (𝐻‘1) ↔ ∀𝑑 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin} (((𝑉‘𝑋)‘𝑑) ≠ (0_g‘𝑅) → ((ℂ_fld ↾_s ℕ₀) Σ_g 𝑑) = 1)))
42	35, 41	mpbird 257	1 ⊢ (𝜑 → (𝑉‘𝑋) ∈ (𝐻‘1))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 = wceq 1539 ∈ wcel 2104 ≠ wne 2941 ∀wral 3062 {crab 3303 ifcif 4465 ↦ cmpt 5164 ^◡ccnv 5599 “ cima 5603 ‘cfv 6458 (class class class)co 7307 ↑_m cmap 8646 Fincfn 8764 0cc0 10921 1c1 10922 ℕcn 12023 ℕ₀cn0 12283 Basecbs 16961 ↾_s cress 16990 0_gc0g 17199 Σ_g cgsu 17200 Mndcmnd 18434 SubMndcsubmnd 18478 1_rcur 19786 Ringcrg 19832 ℂ_fldccnfld 20646 mVar cmvr 21157 mPoly cmpl 21158 mHomP cmhp 21368

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-rep 5218 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-cnex 10977 ax-resscn 10978 ax-1cn 10979 ax-icn 10980 ax-addcl 10981 ax-addrcl 10982 ax-mulcl 10983 ax-mulrcl 10984 ax-mulcom 10985 ax-addass 10986 ax-mulass 10987 ax-distr 10988 ax-i2m1 10989 ax-1ne0 10990 ax-1rid 10991 ax-rnegex 10992 ax-rrecex 10993 ax-cnre 10994 ax-pre-lttri 10995 ax-pre-lttrn 10996 ax-pre-ltadd 10997 ax-pre-mulgt0 10998 ax-addf 11000 ax-mulf 11001

This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3304 df-reu 3305 df-rab 3306 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-tp 4570 df-op 4572 df-uni 4845 df-int 4887 df-iun 4933 df-iin 4934 df-br 5082 df-opab 5144 df-mpt 5165 df-tr 5199 df-id 5500 df-eprel 5506 df-po 5514 df-so 5515 df-fr 5555 df-se 5556 df-we 5557 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-pred 6217 df-ord 6284 df-on 6285 df-lim 6286 df-suc 6287 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-isom 6467 df-riota 7264 df-ov 7310 df-oprab 7311 df-mpo 7312 df-of 7565 df-om 7745 df-1st 7863 df-2nd 7864 df-supp 8009 df-frecs 8128 df-wrecs 8159 df-recs 8233 df-rdg 8272 df-1o 8328 df-er 8529 df-map 8648 df-en 8765 df-dom 8766 df-sdom 8767 df-fin 8768 df-fsupp 9177 df-oi 9317 df-card 9745 df-pnf 11061 df-mnf 11062 df-xr 11063 df-ltxr 11064 df-le 11065 df-sub 11257 df-neg 11258 df-nn 12024 df-2 12086 df-3 12087 df-4 12088 df-5 12089 df-6 12090 df-7 12091 df-8 12092 df-9 12093 df-n0 12284 df-z 12370 df-dec 12488 df-uz 12633 df-fz 13290 df-fzo 13433 df-seq 13772 df-hash 14095 df-struct 16897 df-sets 16914 df-slot 16932 df-ndx 16944 df-base 16962 df-ress 16991 df-plusg 17024 df-mulr 17025 df-starv 17026 df-sca 17027 df-vsca 17028 df-tset 17030 df-ple 17031 df-ds 17033 df-unif 17034 df-0g 17201 df-gsum 17202 df-mre 17344 df-mrc 17345 df-acs 17347 df-mgm 18375 df-sgrp 18424 df-mnd 18435 df-submnd 18480 df-grp 18629 df-mulg 18750 df-cntz 18972 df-cmn 19437 df-mgp 19770 df-ur 19787 df-ring 19834 df-cring 19835 df-cnfld 20647 df-psr 21161 df-mvr 21162 df-mpl 21163 df-mhp 21372

This theorem is referenced by: (None)

W3C validator