mpllsslem - Metamath Proof Explorer

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

Theorem mpllsslem 21916

Description: If 𝐴 is an ideal of subsets (a nonempty collection closed under subset and binary union) of the set 𝐷 of finite bags (the primary applications being 𝐴 = Fin and 𝐴 = 𝒫 𝐵 for some 𝐵), then the set of all power series whose coefficient functions are supported on an element of 𝐴 is a linear subspace of the set of all power series. (Contributed by Mario Carneiro, 12-Jan-2015.) (Revised by AV, 16-Jul-2019.)

**Hypotheses**
Ref	Expression
mplsubglem.s	⊢ 𝑆 = (𝐼 mPwSer 𝑅)
mplsubglem.b	⊢ 𝐵 = (Base‘𝑆)
mplsubglem.z	⊢ 0 = (0_g‘𝑅)
mplsubglem.d	⊢ 𝐷 = {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}
mplsubglem.i	⊢ (𝜑 → 𝐼 ∈ 𝑊)
mplsubglem.0	⊢ (𝜑 → ∅ ∈ 𝐴)
mplsubglem.a	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ∪ 𝑦) ∈ 𝐴)
mplsubglem.y	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ⊆ 𝑥)) → 𝑦 ∈ 𝐴)
mplsubglem.u	⊢ (𝜑 → 𝑈 = {𝑔 ∈ 𝐵 ∣ (𝑔 supp 0 ) ∈ 𝐴})
mpllsslem.r	⊢ (𝜑 → 𝑅 ∈ Ring)

**Assertion**
Ref	Expression
mpllsslem	⊢ (𝜑 → 𝑈 ∈ (LSubSp‘𝑆))

Distinct variable groups: 𝑓,𝑔,𝑥,𝑦, 0 𝐴,𝑓,𝑔,𝑥,𝑦 𝐵,𝑓,𝑔 𝐷,𝑔 𝑓,𝐼 𝜑,𝑥,𝑦 𝑆,𝑓,𝑔,𝑦 Allowed substitution hints: 𝜑(𝑓,𝑔) 𝐵(𝑥,𝑦) 𝐷(𝑥,𝑦,𝑓) 𝑅(𝑥,𝑦,𝑓,𝑔) 𝑆(𝑥) 𝑈(𝑥,𝑦,𝑓,𝑔) 𝐼(𝑥,𝑦,𝑔) 𝑊(𝑥,𝑦,𝑓,𝑔)

Proof of Theorem mpllsslem Dummy variables 𝑘 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mplsubglem.s	. . 3 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
2		mplsubglem.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
3		mpllsslem.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ Ring)
4	1, 2, 3	psrsca 21863	. 2 ⊢ (𝜑 → 𝑅 = (Scalar‘𝑆))
5		eqidd 2731	. 2 ⊢ (𝜑 → (Base‘𝑅) = (Base‘𝑅))
6		mplsubglem.b	. . 3 ⊢ 𝐵 = (Base‘𝑆)
7	6	a1i 11	. 2 ⊢ (𝜑 → 𝐵 = (Base‘𝑆))
8		eqidd 2731	. 2 ⊢ (𝜑 → (+_g‘𝑆) = (+_g‘𝑆))
9		eqidd 2731	. 2 ⊢ (𝜑 → ( ·_𝑠 ‘𝑆) = ( ·_𝑠 ‘𝑆))
10		eqidd 2731	. 2 ⊢ (𝜑 → (LSubSp‘𝑆) = (LSubSp‘𝑆))
11		mplsubglem.z	. . . 4 ⊢ 0 = (0_g‘𝑅)
12		mplsubglem.d	. . . 4 ⊢ 𝐷 = {𝑓 ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡𝑓 “ ℕ) ∈ Fin}
13		mplsubglem.0	. . . 4 ⊢ (𝜑 → ∅ ∈ 𝐴)
14		mplsubglem.a	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ∪ 𝑦) ∈ 𝐴)
15		mplsubglem.y	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ⊆ 𝑥)) → 𝑦 ∈ 𝐴)
16		mplsubglem.u	. . . 4 ⊢ (𝜑 → 𝑈 = {𝑔 ∈ 𝐵 ∣ (𝑔 supp 0 ) ∈ 𝐴})
17		ringgrp 20154	. . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp)
18	3, 17	syl 17	. . . 4 ⊢ (𝜑 → 𝑅 ∈ Grp)
19	1, 6, 11, 12, 2, 13, 14, 15, 16, 18	mplsubglem 21915	. . 3 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝑆))
20	6	subgss 19066	. . 3 ⊢ (𝑈 ∈ (SubGrp‘𝑆) → 𝑈 ⊆ 𝐵)
21	19, 20	syl 17	. 2 ⊢ (𝜑 → 𝑈 ⊆ 𝐵)
22		eqid 2730	. . . 4 ⊢ (0_g‘𝑆) = (0_g‘𝑆)
23	22	subg0cl 19073	. . 3 ⊢ (𝑈 ∈ (SubGrp‘𝑆) → (0_g‘𝑆) ∈ 𝑈)
24		ne0i 4307	. . 3 ⊢ ((0_g‘𝑆) ∈ 𝑈 → 𝑈 ≠ ∅)
25	19, 23, 24	3syl 18	. 2 ⊢ (𝜑 → 𝑈 ≠ ∅)
26	19	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈 ∧ 𝑤 ∈ 𝑈)) → 𝑈 ∈ (SubGrp‘𝑆))
27		eqid 2730	. . . . . 6 ⊢ ( ·_𝑠 ‘𝑆) = ( ·_𝑠 ‘𝑆)
28		eqid 2730	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
29	3	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝑅 ∈ Ring)
30		simprl 770	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝑢 ∈ (Base‘𝑅))
31		simprr 772	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝑣 ∈ 𝑈)
32	16	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝑈 = {𝑔 ∈ 𝐵 ∣ (𝑔 supp 0 ) ∈ 𝐴})
33	32	eleq2d 2815	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑣 ∈ 𝑈 ↔ 𝑣 ∈ {𝑔 ∈ 𝐵 ∣ (𝑔 supp 0 ) ∈ 𝐴}))
34		oveq1 7397	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑣 → (𝑔 supp 0 ) = (𝑣 supp 0 ))
35	34	eleq1d 2814	. . . . . . . . . 10 ⊢ (𝑔 = 𝑣 → ((𝑔 supp 0 ) ∈ 𝐴 ↔ (𝑣 supp 0 ) ∈ 𝐴))
36	35	elrab 3662	. . . . . . . . 9 ⊢ (𝑣 ∈ {𝑔 ∈ 𝐵 ∣ (𝑔 supp 0 ) ∈ 𝐴} ↔ (𝑣 ∈ 𝐵 ∧ (𝑣 supp 0 ) ∈ 𝐴))
37	33, 36	bitrdi 287	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑣 ∈ 𝑈 ↔ (𝑣 ∈ 𝐵 ∧ (𝑣 supp 0 ) ∈ 𝐴)))
38	31, 37	mpbid 232	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑣 ∈ 𝐵 ∧ (𝑣 supp 0 ) ∈ 𝐴))
39	38	simpld 494	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝑣 ∈ 𝐵)
40	1, 27, 28, 6, 29, 30, 39	psrvscacl 21867	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝐵)
41		ovex 7423	. . . . . . 7 ⊢ ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ V
42	41	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ V)
43		sseq2 3976	. . . . . . . . 9 ⊢ (𝑥 = (𝑣 supp 0 ) → (𝑦 ⊆ 𝑥 ↔ 𝑦 ⊆ (𝑣 supp 0 )))
44	43	imbi1d 341	. . . . . . . 8 ⊢ (𝑥 = (𝑣 supp 0 ) → ((𝑦 ⊆ 𝑥 → 𝑦 ∈ 𝐴) ↔ (𝑦 ⊆ (𝑣 supp 0 ) → 𝑦 ∈ 𝐴)))
45	44	albidv 1920	. . . . . . 7 ⊢ (𝑥 = (𝑣 supp 0 ) → (∀𝑦(𝑦 ⊆ 𝑥 → 𝑦 ∈ 𝐴) ↔ ∀𝑦(𝑦 ⊆ (𝑣 supp 0 ) → 𝑦 ∈ 𝐴)))
46	15	expr 456	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 ⊆ 𝑥 → 𝑦 ∈ 𝐴))
47	46	alrimiv 1927	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑦(𝑦 ⊆ 𝑥 → 𝑦 ∈ 𝐴))
48	47	ralrimiva 3126	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 ⊆ 𝑥 → 𝑦 ∈ 𝐴))
49	48	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 ⊆ 𝑥 → 𝑦 ∈ 𝐴))
50	38	simprd 495	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑣 supp 0 ) ∈ 𝐴)
51	45, 49, 50	rspcdva 3592	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ∀𝑦(𝑦 ⊆ (𝑣 supp 0 ) → 𝑦 ∈ 𝐴))
52	1, 28, 12, 6, 40	psrelbas 21850	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑢( ·_𝑠 ‘𝑆)𝑣):𝐷⟶(Base‘𝑅))
53		eqid 2730	. . . . . . . . 9 ⊢ (._r‘𝑅) = (._r‘𝑅)
54	30	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → 𝑢 ∈ (Base‘𝑅))
55	39	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → 𝑣 ∈ 𝐵)
56		eldifi 4097	. . . . . . . . . 10 ⊢ (𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 )) → 𝑘 ∈ 𝐷)
57	56	adantl 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → 𝑘 ∈ 𝐷)
58	1, 27, 28, 6, 53, 12, 54, 55, 57	psrvscaval 21866	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → ((𝑢( ·_𝑠 ‘𝑆)𝑣)‘𝑘) = (𝑢(._r‘𝑅)(𝑣‘𝑘)))
59	1, 28, 12, 6, 39	psrelbas 21850	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝑣:𝐷⟶(Base‘𝑅))
60		ssidd 3973	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑣 supp 0 ) ⊆ (𝑣 supp 0 ))
61		ovex 7423	. . . . . . . . . . . 12 ⊢ (ℕ₀ ↑_m 𝐼) ∈ V
62	12, 61	rabex2 5299	. . . . . . . . . . 11 ⊢ 𝐷 ∈ V
63	62	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝐷 ∈ V)
64	11	fvexi 6875	. . . . . . . . . . 11 ⊢ 0 ∈ V
65	64	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 0 ∈ V)
66	59, 60, 63, 65	suppssr 8177	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → (𝑣‘𝑘) = 0 )
67	66	oveq2d 7406	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → (𝑢(._r‘𝑅)(𝑣‘𝑘)) = (𝑢(._r‘𝑅) 0 ))
68	28, 53, 11	ringrz 20210	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝑢 ∈ (Base‘𝑅)) → (𝑢(._r‘𝑅) 0 ) = 0 )
69	3, 30, 68	syl2an2r 685	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑢(._r‘𝑅) 0 ) = 0 )
70	69	adantr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → (𝑢(._r‘𝑅) 0 ) = 0 )
71	58, 67, 70	3eqtrd 2769	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → ((𝑢( ·_𝑠 ‘𝑆)𝑣)‘𝑘) = 0 )
72	52, 71	suppss 8176	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ⊆ (𝑣 supp 0 ))
73		sseq1 3975	. . . . . . . 8 ⊢ (𝑦 = ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) → (𝑦 ⊆ (𝑣 supp 0 ) ↔ ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ⊆ (𝑣 supp 0 )))
74		eleq1 2817	. . . . . . . 8 ⊢ (𝑦 = ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) → (𝑦 ∈ 𝐴 ↔ ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ 𝐴))
75	73, 74	imbi12d 344	. . . . . . 7 ⊢ (𝑦 = ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) → ((𝑦 ⊆ (𝑣 supp 0 ) → 𝑦 ∈ 𝐴) ↔ (((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ⊆ (𝑣 supp 0 ) → ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ 𝐴)))
76	75	spcgv 3565	. . . . . 6 ⊢ (((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ V → (∀𝑦(𝑦 ⊆ (𝑣 supp 0 ) → 𝑦 ∈ 𝐴) → (((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ⊆ (𝑣 supp 0 ) → ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ 𝐴)))
77	42, 51, 72, 76	syl3c 66	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ 𝐴)
78	32	eleq2d 2815	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ((𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝑈 ↔ (𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ {𝑔 ∈ 𝐵 ∣ (𝑔 supp 0 ) ∈ 𝐴}))
79		oveq1 7397	. . . . . . . 8 ⊢ (𝑔 = (𝑢( ·_𝑠 ‘𝑆)𝑣) → (𝑔 supp 0 ) = ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ))
80	79	eleq1d 2814	. . . . . . 7 ⊢ (𝑔 = (𝑢( ·_𝑠 ‘𝑆)𝑣) → ((𝑔 supp 0 ) ∈ 𝐴 ↔ ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ 𝐴))
81	80	elrab 3662	. . . . . 6 ⊢ ((𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ {𝑔 ∈ 𝐵 ∣ (𝑔 supp 0 ) ∈ 𝐴} ↔ ((𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝐵 ∧ ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ 𝐴))
82	78, 81	bitrdi 287	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ((𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝑈 ↔ ((𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝐵 ∧ ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ 𝐴)))
83	40, 77, 82	mpbir2and 713	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝑈)
84	83	3adantr3 1172	. . 3 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈 ∧ 𝑤 ∈ 𝑈)) → (𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝑈)
85		simpr3 1197	. . 3 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈 ∧ 𝑤 ∈ 𝑈)) → 𝑤 ∈ 𝑈)
86		eqid 2730	. . . 4 ⊢ (+_g‘𝑆) = (+_g‘𝑆)
87	86	subgcl 19075	. . 3 ⊢ ((𝑈 ∈ (SubGrp‘𝑆) ∧ (𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝑈 ∧ 𝑤 ∈ 𝑈) → ((𝑢( ·_𝑠 ‘𝑆)𝑣)(+_g‘𝑆)𝑤) ∈ 𝑈)
88	26, 84, 85, 87	syl3anc 1373	. 2 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈 ∧ 𝑤 ∈ 𝑈)) → ((𝑢( ·_𝑠 ‘𝑆)𝑣)(+_g‘𝑆)𝑤) ∈ 𝑈)
89	4, 5, 7, 8, 9, 10, 21, 25, 88	islssd 20848	1 ⊢ (𝜑 → 𝑈 ∈ (LSubSp‘𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 ∀wal 1538 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 ∀wral 3045 {crab 3408 Vcvv 3450 ∖ cdif 3914 ∪ cun 3915 ⊆ wss 3917 ∅c0 4299 ^◡ccnv 5640 “ cima 5644 ‘cfv 6514 (class class class)co 7390 supp csupp 8142 ↑_m cmap 8802 Fincfn 8921 ℕcn 12193 ℕ₀cn0 12449 Basecbs 17186 +_gcplusg 17227 ._rcmulr 17228 ·_𝑠 cvsca 17231 0_gc0g 17409 Grpcgrp 18872 SubGrpcsubg 19059 Ringcrg 20149 LSubSpclss 20844 mPwSer cmps 21820

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 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-tp 4597 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-of 7656 df-om 7846 df-1st 7971 df-2nd 7972 df-supp 8143 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-er 8674 df-map 8804 df-ixp 8874 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-fsupp 9320 df-sup 9400 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-2 12256 df-3 12257 df-4 12258 df-5 12259 df-6 12260 df-7 12261 df-8 12262 df-9 12263 df-n0 12450 df-z 12537 df-dec 12657 df-uz 12801 df-fz 13476 df-struct 17124 df-sets 17141 df-slot 17159 df-ndx 17171 df-base 17187 df-ress 17208 df-plusg 17240 df-mulr 17241 df-sca 17243 df-vsca 17244 df-ip 17245 df-tset 17246 df-ple 17247 df-ds 17249 df-hom 17251 df-cco 17252 df-0g 17411 df-prds 17417 df-pws 17419 df-mgm 18574 df-sgrp 18653 df-mnd 18669 df-grp 18875 df-minusg 18876 df-subg 19062 df-cmn 19719 df-abl 19720 df-mgp 20057 df-rng 20069 df-ur 20098 df-ring 20151 df-lss 20845 df-psr 21825

This theorem is referenced by: mpllss 21919

W3C validator