Theorem lsslindf 22166

Description: Linear independence is unchanged by working in a subspace. (Contributed by Stefan O'Rear, 24-Feb-2015.) (Revised by Stefan O'Rear, 6-May-2015.)

Hypotheses

Ref	Expression
lsslindf.u	⊢ 𝑈 = (LSubSp‘𝑊)
lsslindf.x	⊢ 𝑋 = (𝑊 ↾s 𝑆)

Assertion

Ref	Expression
lsslindf	⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → (𝐹 LIndF 𝑋 ↔ 𝐹 LIndF 𝑊))

Proof of Theorem lsslindf

Dummy variables 𝑘 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rellindf 22144	. . . 4 ⊢ Rel LIndF
2	1	brrelex1i 5711	. . 3 ⊢ (𝐹 LIndF 𝑋 → 𝐹 ∈ V)
3	2	a1i 11	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → (𝐹 LIndF 𝑋 → 𝐹 ∈ V))
4	1	brrelex1i 5711	. . 3 ⊢ (𝐹 LIndF 𝑊 → 𝐹 ∈ V)
5	4	a1i 11	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → (𝐹 LIndF 𝑊 → 𝐹 ∈ V))
6		simpr 490	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹:dom 𝐹⟶(Base‘𝑋)) → 𝐹:dom 𝐹⟶(Base‘𝑋))
7		lsslindf.x	. . . . . . . . 9 ⊢ 𝑋 = (𝑊 ↾s 𝑆)
8		eqid 2763	. . . . . . . . 9 ⊢ (Base‘𝑊) = (Base‘𝑊)
9	7, 8	ressbasss 17446	. . . . . . . 8 ⊢ (Base‘𝑋) ⊆ (Base‘𝑊)
10		fss 6748	. . . . . . . 8 ⊢ ((𝐹:dom 𝐹⟶(Base‘𝑋) ∧ (Base‘𝑋) ⊆ (Base‘𝑊)) → 𝐹:dom 𝐹⟶(Base‘𝑊))
11	6, 9, 10	sylancl 598	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹:dom 𝐹⟶(Base‘𝑋)) → 𝐹:dom 𝐹⟶(Base‘𝑊))
12		ffn 6731	. . . . . . . . 9 ⊢ (𝐹:dom 𝐹⟶(Base‘𝑊) → 𝐹 Fn dom 𝐹)
13	12	adantl 487	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹:dom 𝐹⟶(Base‘𝑊)) → 𝐹 Fn dom 𝐹)
14		simp3 1156	. . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → ran 𝐹 ⊆ 𝑆)
15		lsslindf.u	. . . . . . . . . . . . 13 ⊢ 𝑈 = (LSubSp‘𝑊)
16	8, 15	lssss 21241	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ 𝑈 → 𝑆 ⊆ (Base‘𝑊))
17	16	3ad2ant2 1152	. . . . . . . . . . 11 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → 𝑆 ⊆ (Base‘𝑊))
18	7, 8	ressbas2 17445	. . . . . . . . . . 11 ⊢ (𝑆 ⊆ (Base‘𝑊) → 𝑆 = (Base‘𝑋))
19	17, 18	syl 18	. . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → 𝑆 = (Base‘𝑋))
20	14, 19	sseqtrd 3949	. . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → ran 𝐹 ⊆ (Base‘𝑋))
21	20	adantr 486	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹:dom 𝐹⟶(Base‘𝑊)) → ran 𝐹 ⊆ (Base‘𝑋))
22		df-f 6562	. . . . . . . 8 ⊢ (𝐹:dom 𝐹⟶(Base‘𝑋) ↔ (𝐹 Fn dom 𝐹 ∧ ran 𝐹 ⊆ (Base‘𝑋)))
23	13, 21, 22	sylanbrc 595	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹:dom 𝐹⟶(Base‘𝑊)) → 𝐹:dom 𝐹⟶(Base‘𝑋))
24	11, 23	impbida 813	. . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → (𝐹:dom 𝐹⟶(Base‘𝑋) ↔ 𝐹:dom 𝐹⟶(Base‘𝑊)))
25	24	adantr 486	. . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝐹:dom 𝐹⟶(Base‘𝑋) ↔ 𝐹:dom 𝐹⟶(Base‘𝑊)))
26		simpl2 1211	. . . . . . . . . 10 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → 𝑆 ∈ 𝑈)
27		eqid 2763	. . . . . . . . . . . 12 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
28	7, 27	resssca 17543	. . . . . . . . . . 11 ⊢ (𝑆 ∈ 𝑈 → (Scalar‘𝑊) = (Scalar‘𝑋))
29	28	eqcomd 2769	. . . . . . . . . 10 ⊢ (𝑆 ∈ 𝑈 → (Scalar‘𝑋) = (Scalar‘𝑊))
30	26, 29	syl 18	. . . . . . . . 9 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (Scalar‘𝑋) = (Scalar‘𝑊))
31	30	fveq2d 6912	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (Base‘(Scalar‘𝑋)) = (Base‘(Scalar‘𝑊)))
32	30	fveq2d 6912	. . . . . . . . 9 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (0g‘(Scalar‘𝑋)) = (0g‘(Scalar‘𝑊)))
33	32	sneqd 4596	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → {(0g‘(Scalar‘𝑋))} = {(0g‘(Scalar‘𝑊))})
34	31, 33	difeq12d 4067	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ((Base‘(Scalar‘𝑋)) ∖ {(0g‘(Scalar‘𝑋))}) = ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}))
35		eqid 2763	. . . . . . . . . . . . 13 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
36	7, 35	ressvsca 17544	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ 𝑈 → ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑋))
37	36	eqcomd 2769	. . . . . . . . . . 11 ⊢ (𝑆 ∈ 𝑈 → ( ·𝑠 ‘𝑋) = ( ·𝑠 ‘𝑊))
38	26, 37	syl 18	. . . . . . . . . 10 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ( ·𝑠 ‘𝑋) = ( ·𝑠 ‘𝑊))
39	38	oveqd 7460	. . . . . . . . 9 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝑘( ·𝑠 ‘𝑋)(𝐹‘𝑥)) = (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)))
40		simpl1 1210	. . . . . . . . . 10 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → 𝑊 ∈ LMod)
41		imassrn 6210	. . . . . . . . . . 11 ⊢ (𝐹 “ (dom 𝐹 ∖ {𝑥})) ⊆ ran 𝐹
42		simpl3 1212	. . . . . . . . . . 11 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ran 𝐹 ⊆ 𝑆)
43	41, 42	sstrid 3924	. . . . . . . . . 10 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝐹 “ (dom 𝐹 ∖ {𝑥})) ⊆ 𝑆)
44		eqid 2763	. . . . . . . . . . 11 ⊢ (LSpan‘𝑊) = (LSpan‘𝑊)
45		eqid 2763	. . . . . . . . . . 11 ⊢ (LSpan‘𝑋) = (LSpan‘𝑋)
46	7, 44, 45, 15	lsslsp 21320	. . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ (𝐹 “ (dom 𝐹 ∖ {𝑥})) ⊆ 𝑆) → ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) = ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))
47	40, 26, 43, 46	syl3anc 1399	. . . . . . . . 9 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) = ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))
48	39, 47	eleq12d 2858	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ((𝑘( ·𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) ↔ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
49	48	notbid 321	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (¬ (𝑘( ·𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) ↔ ¬ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
50	34, 49	raleqbidv 3338	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (∀𝑘 ∈ ((Base‘(Scalar‘𝑋)) ∖ {(0g‘(Scalar‘𝑋))}) ¬ (𝑘( ·𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
51	50	ralbidv 3189	. . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑋)) ∖ {(0g‘(Scalar‘𝑋))}) ¬ (𝑘( ·𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) ↔ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
52	25, 51	anbi12d 644	. . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ((𝐹:dom 𝐹⟶(Base‘𝑋) ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑋)) ∖ {(0g‘(Scalar‘𝑋))}) ¬ (𝑘( ·𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))) ↔ (𝐹:dom 𝐹⟶(Base‘𝑊) ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
53	7	ovexi 7477	. . . . . 6 ⊢ 𝑋 ∈ V
54	53	a1i 11	. . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → 𝑋 ∈ V)
55		eqid 2763	. . . . . 6 ⊢ (Base‘𝑋) = (Base‘𝑋)
56		eqid 2763	. . . . . 6 ⊢ ( ·𝑠 ‘𝑋) = ( ·𝑠 ‘𝑋)
57		eqid 2763	. . . . . 6 ⊢ (Scalar‘𝑋) = (Scalar‘𝑋)
58		eqid 2763	. . . . . 6 ⊢ (Base‘(Scalar‘𝑋)) = (Base‘(Scalar‘𝑋))
59		eqid 2763	. . . . . 6 ⊢ (0g‘(Scalar‘𝑋)) = (0g‘(Scalar‘𝑋))
60	55, 56, 45, 57, 58, 59	islindf 22148	. . . . 5 ⊢ ((𝑋 ∈ V ∧ 𝐹 ∈ V) → (𝐹 LIndF 𝑋 ↔ (𝐹:dom 𝐹⟶(Base‘𝑋) ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑋)) ∖ {(0g‘(Scalar‘𝑋))}) ¬ (𝑘( ·𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
61	54, 60	sylan 592	. . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝐹 LIndF 𝑋 ↔ (𝐹:dom 𝐹⟶(Base‘𝑋) ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑋)) ∖ {(0g‘(Scalar‘𝑋))}) ¬ (𝑘( ·𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
62		eqid 2763	. . . . . 6 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
63		eqid 2763	. . . . . 6 ⊢ (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊))
64	8, 35, 44, 27, 62, 63	islindf 22148	. . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 ∈ V) → (𝐹 LIndF 𝑊 ↔ (𝐹:dom 𝐹⟶(Base‘𝑊) ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
65	64	3ad2antl1 1204	. . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝐹 LIndF 𝑊 ↔ (𝐹:dom 𝐹⟶(Base‘𝑊) ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
66	52, 61, 65	3bitr4d 314	. . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝐹 LIndF 𝑋 ↔ 𝐹 LIndF 𝑊))
67	66	ex 418	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → (𝐹 ∈ V → (𝐹 LIndF 𝑋 ↔ 𝐹 LIndF 𝑊)))
68	3, 5, 67	pm5.21ndd 382	1 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → (𝐹 LIndF 𝑋 ↔ 𝐹 LIndF 𝑊))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048  {csn 4588   class class class wbr 5106  dom cdm 5655  ran crn 5656   “ cima 5658   Fn wfn 6553  ⟶wf 6554  ‘cfv 6558  (class class class)co 7443  Basecbs 17416   ↾_s cress 17437  Scalarcsca 17460   ·_𝑠 cvsca 17461  0_gc0g 17639  LModclmod 21165  LSubSpclss 21236  LSpanclspn 21276   LIndF clindf 22140

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284  ax-1cn 11285  ax-icn 11286  ax-addcl 11287  ax-addrcl 11288  ax-mulcl 11289  ax-mulrcl 11290  ax-mulcom 11291  ax-addass 11292  ax-mulass 11293  ax-distr 11294  ax-i2m1 11295  ax-1ne0 11296  ax-1rid 11297  ax-rnegex 11298  ax-rrecex 11299  ax-cnre 11300  ax-pre-lttri 11301  ax-pre-lttrn 11302  ax-pre-ltadd 11303  ax-pre-mulgt0 11304

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-er 8745  df-en 9002  df-dom 9003  df-sdom 9004  df-pnf 11372  df-mnf 11373  df-xr 11374  df-ltxr 11375  df-le 11376  df-sub 11570  df-neg 11571  df-nn 12363  df-2 12432  df-3 12433  df-4 12434  df-5 12435  df-6 12436  df-sets 17371  df-slot 17389  df-ndx 17401  df-base 17417  df-ress 17438  df-plusg 17470  df-sca 17473  df-vsca 17474  df-0g 17641  df-mgm 18845  df-sgrp 18937  df-mnd 18953  df-grp 19176  df-minusg 19177  df-sbg 19178  df-subg 19362  df-mgp 20391  df-ur 20438  df-ring 20491  df-lmod 21167  df-lss 21237  df-lsp 21277  df-lindf 22142

This theorem is used by:  lsslinds  22167