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 21981

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 21929	. 2 ⊢ (𝜑 → 𝑅 = (Scalar‘𝑆))
5		eqidd 2741	. 2 ⊢ (𝜑 → (Base‘𝑅) = (Base‘𝑅))
6		mplsubglem.b	. . 3 ⊢ 𝐵 = (Base‘𝑆)
7	6	a1i 11	. 2 ⊢ (𝜑 → 𝐵 = (Base‘𝑆))
8		eqidd 2741	. 2 ⊢ (𝜑 → (+_g‘𝑆) = (+_g‘𝑆))
9		eqidd 2741	. 2 ⊢ (𝜑 → ( ·_𝑠 ‘𝑆) = ( ·_𝑠 ‘𝑆))
10		eqidd 2741	. 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 20217	. . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp)
18	3, 17	syl 17	. . . 4 ⊢ (𝜑 → 𝑅 ∈ Grp)
19	1, 6, 11, 12, 2, 13, 14, 15, 16, 18	mplsubglem 21980	. . 3 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝑆))
20	6	subgss 19101	. . 3 ⊢ (𝑈 ∈ (SubGrp‘𝑆) → 𝑈 ⊆ 𝐵)
21	19, 20	syl 17	. 2 ⊢ (𝜑 → 𝑈 ⊆ 𝐵)
22		eqid 2740	. . . 4 ⊢ (0_g‘𝑆) = (0_g‘𝑆)
23	22	subg0cl 19108	. . 3 ⊢ (𝑈 ∈ (SubGrp‘𝑆) → (0_g‘𝑆) ∈ 𝑈)
24		ne0i 4276	. . 3 ⊢ ((0_g‘𝑆) ∈ 𝑈 → 𝑈 ≠ ∅)
25	19, 23, 24	3syl 18	. 2 ⊢ (𝜑 → 𝑈 ≠ ∅)
26	19	adantr 481	. . 3 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈 ∧ 𝑤 ∈ 𝑈)) → 𝑈 ∈ (SubGrp‘𝑆))
27		eqid 2740	. . . . . 6 ⊢ ( ·_𝑠 ‘𝑆) = ( ·_𝑠 ‘𝑆)
28		eqid 2740	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
29	3	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝑅 ∈ Ring)
30		simprl 776	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝑢 ∈ (Base‘𝑅))
31		simprr 778	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝑣 ∈ 𝑈)
32	16	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝑈 = {𝑔 ∈ 𝐵 ∣ (𝑔 supp 0 ) ∈ 𝐴})
33	32	eleq2d 2826	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑣 ∈ 𝑈 ↔ 𝑣 ∈ {𝑔 ∈ 𝐵 ∣ (𝑔 supp 0 ) ∈ 𝐴}))
34		oveq1 7370	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑣 → (𝑔 supp 0 ) = (𝑣 supp 0 ))
35	34	eleq1d 2825	. . . . . . . . . 10 ⊢ (𝑔 = 𝑣 → ((𝑔 supp 0 ) ∈ 𝐴 ↔ (𝑣 supp 0 ) ∈ 𝐴))
36	35	elrab 3636	. . . . . . . . 9 ⊢ (𝑣 ∈ {𝑔 ∈ 𝐵 ∣ (𝑔 supp 0 ) ∈ 𝐴} ↔ (𝑣 ∈ 𝐵 ∧ (𝑣 supp 0 ) ∈ 𝐴))
37	33, 36	bitrdi 288	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑣 ∈ 𝑈 ↔ (𝑣 ∈ 𝐵 ∧ (𝑣 supp 0 ) ∈ 𝐴)))
38	31, 37	mpbid 233	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑣 ∈ 𝐵 ∧ (𝑣 supp 0 ) ∈ 𝐴))
39	38	simpld 495	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝑣 ∈ 𝐵)
40	1, 27, 28, 6, 29, 30, 39	psrvscacl 21933	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝐵)
41		ovex 7396	. . . . . . 7 ⊢ ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ V
42	41	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ V)
43		sseq2 3948	. . . . . . . . 9 ⊢ (𝑥 = (𝑣 supp 0 ) → (𝑦 ⊆ 𝑥 ↔ 𝑦 ⊆ (𝑣 supp 0 )))
44	43	imbi1d 342	. . . . . . . 8 ⊢ (𝑥 = (𝑣 supp 0 ) → ((𝑦 ⊆ 𝑥 → 𝑦 ∈ 𝐴) ↔ (𝑦 ⊆ (𝑣 supp 0 ) → 𝑦 ∈ 𝐴)))
45	44	albidv 1927	. . . . . . 7 ⊢ (𝑥 = (𝑣 supp 0 ) → (∀𝑦(𝑦 ⊆ 𝑥 → 𝑦 ∈ 𝐴) ↔ ∀𝑦(𝑦 ⊆ (𝑣 supp 0 ) → 𝑦 ∈ 𝐴)))
46	15	expr 457	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 ⊆ 𝑥 → 𝑦 ∈ 𝐴))
47	46	alrimiv 1934	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑦(𝑦 ⊆ 𝑥 → 𝑦 ∈ 𝐴))
48	47	ralrimiva 3132	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 ⊆ 𝑥 → 𝑦 ∈ 𝐴))
49	48	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 ⊆ 𝑥 → 𝑦 ∈ 𝐴))
50	38	simprd 496	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑣 supp 0 ) ∈ 𝐴)
51	45, 49, 50	rspcdva 3568	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ∀𝑦(𝑦 ⊆ (𝑣 supp 0 ) → 𝑦 ∈ 𝐴))
52	1, 28, 12, 6, 40	psrelbas 21917	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑢( ·_𝑠 ‘𝑆)𝑣):𝐷⟶(Base‘𝑅))
53		eqid 2740	. . . . . . . . 9 ⊢ (._r‘𝑅) = (._r‘𝑅)
54	30	adantr 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → 𝑢 ∈ (Base‘𝑅))
55	39	adantr 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → 𝑣 ∈ 𝐵)
56		eldifi 4068	. . . . . . . . . 10 ⊢ (𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 )) → 𝑘 ∈ 𝐷)
57	56	adantl 482	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → 𝑘 ∈ 𝐷)
58	1, 27, 28, 6, 53, 12, 54, 55, 57	psrvscaval 21932	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → ((𝑢( ·_𝑠 ‘𝑆)𝑣)‘𝑘) = (𝑢(._r‘𝑅)(𝑣‘𝑘)))
59	1, 28, 12, 6, 39	psrelbas 21917	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝑣:𝐷⟶(Base‘𝑅))
60		ssidd 3945	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑣 supp 0 ) ⊆ (𝑣 supp 0 ))
61		ovex 7396	. . . . . . . . . . . 12 ⊢ (ℕ₀ ↑_m 𝐼) ∈ V
62	12, 61	rabex2 5276	. . . . . . . . . . 11 ⊢ 𝐷 ∈ V
63	62	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 𝐷 ∈ V)
64	11	fvexi 6848	. . . . . . . . . . 11 ⊢ 0 ∈ V
65	64	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → 0 ∈ V)
66	59, 60, 63, 65	suppssr 8142	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → (𝑣‘𝑘) = 0 )
67	66	oveq2d 7379	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → (𝑢(._r‘𝑅)(𝑣‘𝑘)) = (𝑢(._r‘𝑅) 0 ))
68	28, 53, 11	ringrz 20273	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝑢 ∈ (Base‘𝑅)) → (𝑢(._r‘𝑅) 0 ) = 0 )
69	3, 30, 68	syl2an2r 691	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑢(._r‘𝑅) 0 ) = 0 )
70	69	adantr 481	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → (𝑢(._r‘𝑅) 0 ) = 0 )
71	58, 67, 70	3eqtrd 2779	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) ∧ 𝑘 ∈ (𝐷 ∖ (𝑣 supp 0 ))) → ((𝑢( ·_𝑠 ‘𝑆)𝑣)‘𝑘) = 0 )
72	52, 71	suppss 8141	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ⊆ (𝑣 supp 0 ))
73		sseq1 3947	. . . . . . . 8 ⊢ (𝑦 = ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) → (𝑦 ⊆ (𝑣 supp 0 ) ↔ ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ⊆ (𝑣 supp 0 )))
74		eleq1 2828	. . . . . . . 8 ⊢ (𝑦 = ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) → (𝑦 ∈ 𝐴 ↔ ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ 𝐴))
75	73, 74	imbi12d 345	. . . . . . 7 ⊢ (𝑦 = ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) → ((𝑦 ⊆ (𝑣 supp 0 ) → 𝑦 ∈ 𝐴) ↔ (((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ⊆ (𝑣 supp 0 ) → ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ 𝐴)))
76	75	spcgv 3541	. . . . . 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 2826	. . . . . 6 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ((𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝑈 ↔ (𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ {𝑔 ∈ 𝐵 ∣ (𝑔 supp 0 ) ∈ 𝐴}))
79		oveq1 7370	. . . . . . . 8 ⊢ (𝑔 = (𝑢( ·_𝑠 ‘𝑆)𝑣) → (𝑔 supp 0 ) = ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ))
80	79	eleq1d 2825	. . . . . . 7 ⊢ (𝑔 = (𝑢( ·_𝑠 ‘𝑆)𝑣) → ((𝑔 supp 0 ) ∈ 𝐴 ↔ ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ 𝐴))
81	80	elrab 3636	. . . . . 6 ⊢ ((𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ {𝑔 ∈ 𝐵 ∣ (𝑔 supp 0 ) ∈ 𝐴} ↔ ((𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝐵 ∧ ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ 𝐴))
82	78, 81	bitrdi 288	. . . . 5 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → ((𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝑈 ↔ ((𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝐵 ∧ ((𝑢( ·_𝑠 ‘𝑆)𝑣) supp 0 ) ∈ 𝐴)))
83	40, 77, 82	mpbir2and 719	. . . 4 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈)) → (𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝑈)
84	83	3adantr3 1178	. . 3 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈 ∧ 𝑤 ∈ 𝑈)) → (𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝑈)
85		simpr3 1203	. . 3 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈 ∧ 𝑤 ∈ 𝑈)) → 𝑤 ∈ 𝑈)
86		eqid 2740	. . . 4 ⊢ (+_g‘𝑆) = (+_g‘𝑆)
87	86	subgcl 19110	. . 3 ⊢ ((𝑈 ∈ (SubGrp‘𝑆) ∧ (𝑢( ·_𝑠 ‘𝑆)𝑣) ∈ 𝑈 ∧ 𝑤 ∈ 𝑈) → ((𝑢( ·_𝑠 ‘𝑆)𝑣)(+_g‘𝑆)𝑤) ∈ 𝑈)
88	26, 84, 85, 87	syl3anc 1379	. 2 ⊢ ((𝜑 ∧ (𝑢 ∈ (Base‘𝑅) ∧ 𝑣 ∈ 𝑈 ∧ 𝑤 ∈ 𝑈)) → ((𝑢( ·_𝑠 ‘𝑆)𝑣)(+_g‘𝑆)𝑤) ∈ 𝑈)
89	4, 5, 7, 8, 9, 10, 21, 25, 88	islssd 20932	1 ⊢ (𝜑 → 𝑈 ∈ (LSubSp‘𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1092 ∀wal 1545 = wceq 1547 ∈ wcel 2119 ≠ wne 2935 ∀wral 3054 {crab 3392 Vcvv 3432 ∖ cdif 3887 ∪ cun 3888 ⊆ wss 3890 ∅c0 4268 ^◡ccnv 5624 “ cima 5628 ‘cfv 6492 (class class class)co 7363 supp csupp 8107 ↑_m cmap 8770 Fincfn 8890 ℕcn 12172 ℕ₀cn0 12435 Basecbs 17177 +_gcplusg 17218 ._rcmulr 17219 ·_𝑠 cvsca 17222 0_gc0g 17400 Grpcgrp 18907 SubGrpcsubg 19094 Ringcrg 20212 LSubSpclss 20928 mPwSer cmps 21886

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-tp 4567 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-of 7627 df-om 7814 df-1st 7938 df-2nd 7939 df-supp 8108 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-er 8640 df-map 8772 df-ixp 8843 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-fsupp 9272 df-sup 9352 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-2 12242 df-3 12243 df-4 12244 df-5 12245 df-6 12246 df-7 12247 df-8 12248 df-9 12249 df-n0 12436 df-z 12523 df-dec 12643 df-uz 12787 df-fz 13460 df-struct 17115 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17178 df-ress 17199 df-plusg 17231 df-mulr 17232 df-sca 17234 df-vsca 17235 df-ip 17236 df-tset 17237 df-ple 17238 df-ds 17240 df-hom 17242 df-cco 17243 df-0g 17402 df-prds 17408 df-pws 17410 df-mgm 18606 df-sgrp 18685 df-mnd 18701 df-grp 18910 df-minusg 18911 df-subg 19097 df-cmn 19755 df-abl 19756 df-mgp 20120 df-rng 20132 df-ur 20161 df-ring 20214 df-lss 20929 df-psr 21891

This theorem is referenced by: mpllss 21984

W3C validator