Theorem lsslindf 22017

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 21995	. . . 4 ⊢ Rel LIndF
2	1	brrelex1i 5722	. . 3 ⊢ (𝐹 LIndF 𝑋 → 𝐹 ∈ V)
3	2	a1i 11	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → (𝐹 LIndF 𝑋 → 𝐹 ∈ V))
4	1	brrelex1i 5722	. . 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 2766	. . . . . . . . 9 ⊢ (Base‘𝑊) = (Base‘𝑊)
9	7, 8	ressbasss 17324	. . . . . . . 8 ⊢ (Base‘𝑋) ⊆ (Base‘𝑊)
10		fss 6729	. . . . . . . 8 ⊢ ((𝐹:dom 𝐹⟶(Base‘𝑋) ∧ (Base‘𝑋) ⊆ (Base‘𝑊)) → 𝐹:dom 𝐹⟶(Base‘𝑊))
11	6, 9, 10	sylancl 598	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹:dom 𝐹⟶(Base‘𝑋)) → 𝐹:dom 𝐹⟶(Base‘𝑊))
12		ffn 6712	. . . . . . . . 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 21094	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ 𝑈 → 𝑆 ⊆ (Base‘𝑊))
17	16	3ad2ant2 1152	. . . . . . . . . . 11 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → 𝑆 ⊆ (Base‘𝑊))
18	7, 8	ressbas2 17323	. . . . . . . . . . 11 ⊢ (𝑆 ⊆ (Base‘𝑊) → 𝑆 = (Base‘𝑋))
19	17, 18	syl 18	. . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → 𝑆 = (Base‘𝑋))
20	14, 19	sseqtrd 3976	. . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → ran 𝐹 ⊆ (Base‘𝑋))
21	20	adantr 486	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹:dom 𝐹⟶(Base‘𝑊)) → ran 𝐹 ⊆ (Base‘𝑋))
22		df-f 6547	. . . . . . . 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 2766	. . . . . . . . . . . 12 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
28	7, 27	resssca 17421	. . . . . . . . . . 11 ⊢ (𝑆 ∈ 𝑈 → (Scalar‘𝑊) = (Scalar‘𝑋))
29	28	eqcomd 2772	. . . . . . . . . 10 ⊢ (𝑆 ∈ 𝑈 → (Scalar‘𝑋) = (Scalar‘𝑊))
30	26, 29	syl 18	. . . . . . . . 9 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (Scalar‘𝑋) = (Scalar‘𝑊))
31	30	fveq2d 6892	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (Base‘(Scalar‘𝑋)) = (Base‘(Scalar‘𝑊)))
32	30	fveq2d 6892	. . . . . . . . 9 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (0g‘(Scalar‘𝑋)) = (0g‘(Scalar‘𝑊)))
33	32	sneqd 4606	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → {(0g‘(Scalar‘𝑋))} = {(0g‘(Scalar‘𝑊))})
34	31, 33	difeq12d 4085	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ((Base‘(Scalar‘𝑋)) ∖ {(0g‘(Scalar‘𝑋))}) = ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}))
35		eqid 2766	. . . . . . . . . . . . 13 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊)
36	7, 35	ressvsca 17422	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ 𝑈 → ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑋))
37	36	eqcomd 2772	. . . . . . . . . . 11 ⊢ (𝑆 ∈ 𝑈 → ( ·𝑠 ‘𝑋) = ( ·𝑠 ‘𝑊))
38	26, 37	syl 18	. . . . . . . . . 10 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ( ·𝑠 ‘𝑋) = ( ·𝑠 ‘𝑊))
39	38	oveqd 7440	. . . . . . . . 9 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝑘( ·𝑠 ‘𝑋)(𝐹‘𝑥)) = (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)))
40		simpl1 1210	. . . . . . . . . 10 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → 𝑊 ∈ LMod)
41		imassrn 6078	. . . . . . . . . . 11 ⊢ (𝐹 “ (dom 𝐹 ∖ {𝑥})) ⊆ ran 𝐹
42		simpl3 1212	. . . . . . . . . . 11 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ran 𝐹 ⊆ 𝑆)
43	41, 42	sstrid 3951	. . . . . . . . . 10 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝐹 “ (dom 𝐹 ∖ {𝑥})) ⊆ 𝑆)
44		eqid 2766	. . . . . . . . . . 11 ⊢ (LSpan‘𝑊) = (LSpan‘𝑊)
45		eqid 2766	. . . . . . . . . . 11 ⊢ (LSpan‘𝑋) = (LSpan‘𝑋)
46	7, 44, 45, 15	lsslsp 21173	. . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ (𝐹 “ (dom 𝐹 ∖ {𝑥})) ⊆ 𝑆) → ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) = ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))
47	40, 26, 43, 46	syl3anc 1398	. . . . . . . . 9 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) = ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))
48	39, 47	eleq12d 2860	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ((𝑘( ·𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) ↔ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
49	48	notbid 321	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (¬ (𝑘( ·𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) ↔ ¬ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
50	34, 49	raleqbidv 3341	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (∀𝑘 ∈ ((Base‘(Scalar‘𝑋)) ∖ {(0g‘(Scalar‘𝑋))}) ¬ (𝑘( ·𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0g‘(Scalar‘𝑊))}) ¬ (𝑘( ·𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
51	50	ralbidv 3191	. . . . 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 7457	. . . . . 6 ⊢ 𝑋 ∈ V
54	53	a1i 11	. . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → 𝑋 ∈ V)
55		eqid 2766	. . . . . 6 ⊢ (Base‘𝑋) = (Base‘𝑋)
56		eqid 2766	. . . . . 6 ⊢ ( ·𝑠 ‘𝑋) = ( ·𝑠 ‘𝑋)
57		eqid 2766	. . . . . 6 ⊢ (Scalar‘𝑋) = (Scalar‘𝑋)
58		eqid 2766	. . . . . 6 ⊢ (Base‘(Scalar‘𝑋)) = (Base‘(Scalar‘𝑋))
59		eqid 2766	. . . . . 6 ⊢ (0g‘(Scalar‘𝑋)) = (0g‘(Scalar‘𝑋))
60	55, 56, 45, 57, 58, 59	islindf 21999	. . . . 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 2766	. . . . . 6 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
63		eqid 2766	. . . . . 6 ⊢ (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊))
64	8, 35, 44, 27, 62, 63	islindf 21999	. . . . 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 2146  ∀wral 3082  Vcvv 3458   ∖ cdif 3905   ⊆ wss 3908  {csn 4594   class class class wbr 5114  dom cdm 5666  ran crn 5667   “ cima 5669   Fn wfn 6538  ⟶wf 6539  ‘cfv 6543  (class class class)co 7423  Basecbs 17294   ↾_s cress 17315  Scalarcsca 17338   ·_𝑠 cvsca 17339  0_gc0g 17517  LModclmod 21018  LSubSpclss 21089  LSpanclspn 21129   LIndF clindf 21991

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-cnex 11174  ax-resscn 11175  ax-1cn 11176  ax-icn 11177  ax-addcl 11178  ax-addrcl 11179  ax-mulcl 11180  ax-mulrcl 11181  ax-mulcom 11182  ax-addass 11183  ax-mulass 11184  ax-distr 11185  ax-i2m1 11186  ax-1ne0 11187  ax-1rid 11188  ax-rnegex 11189  ax-rrecex 11190  ax-cnre 11191  ax-pre-lttri 11192  ax-pre-lttrn 11193  ax-pre-ltadd 11194  ax-pre-mulgt0 11195

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 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-om 7872  df-1st 7995  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-er 8703  df-en 8953  df-dom 8954  df-sdom 8955  df-pnf 11263  df-mnf 11264  df-xr 11265  df-ltxr 11266  df-le 11267  df-sub 11461  df-neg 11462  df-nn 12252  df-2 12321  df-3 12322  df-4 12323  df-5 12324  df-6 12325  df-sets 17249  df-slot 17267  df-ndx 17279  df-base 17295  df-ress 17316  df-plusg 17348  df-sca 17351  df-vsca 17352  df-0g 17519  df-mgm 18723  df-sgrp 18806  df-mnd 18822  df-grp 19034  df-minusg 19035  df-sbg 19036  df-subg 19220  df-mgp 20248  df-ur 20295  df-ring 20348  df-lmod 21020  df-lss 21090  df-lsp 21130  df-lindf 21993

This theorem is used by:  lsslinds  22018