lsslindf - Metamath Proof Explorer

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

Theorem lsslindf 19988

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 19966	. . . 4 ⊢ Rel LIndF
2	1	brrelexi 5082	. . 3 ⊢ (𝐹 LIndF 𝑋 → 𝐹 ∈ V)
3	2	a1i 11	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → (𝐹 LIndF 𝑋 → 𝐹 ∈ V))
4	1	brrelexi 5082	. . 3 ⊢ (𝐹 LIndF 𝑊 → 𝐹 ∈ V)
5	4	a1i 11	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → (𝐹 LIndF 𝑊 → 𝐹 ∈ V))
6		simpr 476	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹:dom 𝐹⟶(Base‘𝑋)) → 𝐹:dom 𝐹⟶(Base‘𝑋))
7		lsslindf.x	. . . . . . . . 9 ⊢ 𝑋 = (𝑊 ↾_s 𝑆)
8		eqid 2610	. . . . . . . . 9 ⊢ (Base‘𝑊) = (Base‘𝑊)
9	7, 8	ressbasss 15759	. . . . . . . 8 ⊢ (Base‘𝑋) ⊆ (Base‘𝑊)
10		fss 5969	. . . . . . . 8 ⊢ ((𝐹:dom 𝐹⟶(Base‘𝑋) ∧ (Base‘𝑋) ⊆ (Base‘𝑊)) → 𝐹:dom 𝐹⟶(Base‘𝑊))
11	6, 9, 10	sylancl 693	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹:dom 𝐹⟶(Base‘𝑋)) → 𝐹:dom 𝐹⟶(Base‘𝑊))
12		ffn 5958	. . . . . . . . 9 ⊢ (𝐹:dom 𝐹⟶(Base‘𝑊) → 𝐹 Fn dom 𝐹)
13	12	adantl 481	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹:dom 𝐹⟶(Base‘𝑊)) → 𝐹 Fn dom 𝐹)
14		simp3 1056	. . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → ran 𝐹 ⊆ 𝑆)
15		lsslindf.u	. . . . . . . . . . . . 13 ⊢ 𝑈 = (LSubSp‘𝑊)
16	8, 15	lssss 18758	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ 𝑈 → 𝑆 ⊆ (Base‘𝑊))
17	16	3ad2ant2 1076	. . . . . . . . . . 11 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → 𝑆 ⊆ (Base‘𝑊))
18	7, 8	ressbas2 15758	. . . . . . . . . . 11 ⊢ (𝑆 ⊆ (Base‘𝑊) → 𝑆 = (Base‘𝑋))
19	17, 18	syl 17	. . . . . . . . . 10 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → 𝑆 = (Base‘𝑋))
20	14, 19	sseqtrd 3604	. . . . . . . . 9 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → ran 𝐹 ⊆ (Base‘𝑋))
21	20	adantr 480	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹:dom 𝐹⟶(Base‘𝑊)) → ran 𝐹 ⊆ (Base‘𝑋))
22		df-f 5808	. . . . . . . 8 ⊢ (𝐹:dom 𝐹⟶(Base‘𝑋) ↔ (𝐹 Fn dom 𝐹 ∧ ran 𝐹 ⊆ (Base‘𝑋)))
23	13, 21, 22	sylanbrc 695	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹:dom 𝐹⟶(Base‘𝑊)) → 𝐹:dom 𝐹⟶(Base‘𝑋))
24	11, 23	impbida 873	. . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → (𝐹:dom 𝐹⟶(Base‘𝑋) ↔ 𝐹:dom 𝐹⟶(Base‘𝑊)))
25	24	adantr 480	. . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝐹:dom 𝐹⟶(Base‘𝑋) ↔ 𝐹:dom 𝐹⟶(Base‘𝑊)))
26		simpl2 1058	. . . . . . . . . 10 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → 𝑆 ∈ 𝑈)
27		eqid 2610	. . . . . . . . . . . 12 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
28	7, 27	resssca 15854	. . . . . . . . . . 11 ⊢ (𝑆 ∈ 𝑈 → (Scalar‘𝑊) = (Scalar‘𝑋))
29	28	eqcomd 2616	. . . . . . . . . 10 ⊢ (𝑆 ∈ 𝑈 → (Scalar‘𝑋) = (Scalar‘𝑊))
30	26, 29	syl 17	. . . . . . . . 9 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (Scalar‘𝑋) = (Scalar‘𝑊))
31	30	fveq2d 6107	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (Base‘(Scalar‘𝑋)) = (Base‘(Scalar‘𝑊)))
32	30	fveq2d 6107	. . . . . . . . 9 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (0_g‘(Scalar‘𝑋)) = (0_g‘(Scalar‘𝑊)))
33	32	sneqd 4137	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → {(0_g‘(Scalar‘𝑋))} = {(0_g‘(Scalar‘𝑊))})
34	31, 33	difeq12d 3691	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ((Base‘(Scalar‘𝑋)) ∖ {(0_g‘(Scalar‘𝑋))}) = ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))
35		eqid 2610	. . . . . . . . . . . . 13 ⊢ ( ·_𝑠 ‘𝑊) = ( ·_𝑠 ‘𝑊)
36	7, 35	ressvsca 15855	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ 𝑈 → ( ·_𝑠 ‘𝑊) = ( ·_𝑠 ‘𝑋))
37	36	eqcomd 2616	. . . . . . . . . . 11 ⊢ (𝑆 ∈ 𝑈 → ( ·_𝑠 ‘𝑋) = ( ·_𝑠 ‘𝑊))
38	26, 37	syl 17	. . . . . . . . . 10 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ( ·_𝑠 ‘𝑋) = ( ·_𝑠 ‘𝑊))
39	38	oveqd 6566	. . . . . . . . 9 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝑘( ·_𝑠 ‘𝑋)(𝐹‘𝑥)) = (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑥)))
40		simpl1 1057	. . . . . . . . . . 11 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → 𝑊 ∈ LMod)
41		imassrn 5396	. . . . . . . . . . . 12 ⊢ (𝐹 “ (dom 𝐹 ∖ {𝑥})) ⊆ ran 𝐹
42		simpl3 1059	. . . . . . . . . . . 12 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ran 𝐹 ⊆ 𝑆)
43	41, 42	syl5ss 3579	. . . . . . . . . . 11 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝐹 “ (dom 𝐹 ∖ {𝑥})) ⊆ 𝑆)
44		eqid 2610	. . . . . . . . . . . 12 ⊢ (LSpan‘𝑊) = (LSpan‘𝑊)
45		eqid 2610	. . . . . . . . . . . 12 ⊢ (LSpan‘𝑋) = (LSpan‘𝑋)
46	7, 44, 45, 15	lsslsp 18836	. . . . . . . . . . 11 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ (𝐹 “ (dom 𝐹 ∖ {𝑥})) ⊆ 𝑆) → ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) = ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))
47	40, 26, 43, 46	syl3anc 1318	. . . . . . . . . 10 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) = ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))
48	47	eqcomd 2616	. . . . . . . . 9 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) = ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))
49	39, 48	eleq12d 2682	. . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ((𝑘( ·_𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) ↔ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
50	49	notbid 307	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (¬ (𝑘( ·_𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) ↔ ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
51	34, 50	raleqbidv 3129	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (∀𝑘 ∈ ((Base‘(Scalar‘𝑋)) ∖ {(0_g‘(Scalar‘𝑋))}) ¬ (𝑘( ·_𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
52	51	ralbidv 2969	. . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑋)) ∖ {(0_g‘(Scalar‘𝑋))}) ¬ (𝑘( ·_𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))) ↔ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))))
53	25, 52	anbi12d 743	. . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → ((𝐹:dom 𝐹⟶(Base‘𝑋) ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑋)) ∖ {(0_g‘(Scalar‘𝑋))}) ¬ (𝑘( ·_𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥})))) ↔ (𝐹:dom 𝐹⟶(Base‘𝑊) ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
54		ovex 6577	. . . . . . 7 ⊢ (𝑊 ↾_s 𝑆) ∈ V
55	7, 54	eqeltri 2684	. . . . . 6 ⊢ 𝑋 ∈ V
56	55	a1i 11	. . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → 𝑋 ∈ V)
57		eqid 2610	. . . . . 6 ⊢ (Base‘𝑋) = (Base‘𝑋)
58		eqid 2610	. . . . . 6 ⊢ ( ·_𝑠 ‘𝑋) = ( ·_𝑠 ‘𝑋)
59		eqid 2610	. . . . . 6 ⊢ (Scalar‘𝑋) = (Scalar‘𝑋)
60		eqid 2610	. . . . . 6 ⊢ (Base‘(Scalar‘𝑋)) = (Base‘(Scalar‘𝑋))
61		eqid 2610	. . . . . 6 ⊢ (0_g‘(Scalar‘𝑋)) = (0_g‘(Scalar‘𝑋))
62	57, 58, 45, 59, 60, 61	islindf 19970	. . . . 5 ⊢ ((𝑋 ∈ V ∧ 𝐹 ∈ V) → (𝐹 LIndF 𝑋 ↔ (𝐹:dom 𝐹⟶(Base‘𝑋) ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑋)) ∖ {(0_g‘(Scalar‘𝑋))}) ¬ (𝑘( ·_𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
63	56, 62	sylan 487	. . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝐹 LIndF 𝑋 ↔ (𝐹:dom 𝐹⟶(Base‘𝑋) ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑋)) ∖ {(0_g‘(Scalar‘𝑋))}) ¬ (𝑘( ·_𝑠 ‘𝑋)(𝐹‘𝑥)) ∈ ((LSpan‘𝑋)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
64		eqid 2610	. . . . . 6 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
65		eqid 2610	. . . . . 6 ⊢ (0_g‘(Scalar‘𝑊)) = (0_g‘(Scalar‘𝑊))
66	8, 35, 44, 27, 64, 65	islindf 19970	. . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 ∈ V) → (𝐹 LIndF 𝑊 ↔ (𝐹:dom 𝐹⟶(Base‘𝑊) ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
67	66	3ad2antl1 1216	. . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝐹 LIndF 𝑊 ↔ (𝐹:dom 𝐹⟶(Base‘𝑊) ∧ ∀𝑥 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑥)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑥}))))))
68	53, 63, 67	3bitr4d 299	. . 3 ⊢ (((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) ∧ 𝐹 ∈ V) → (𝐹 LIndF 𝑋 ↔ 𝐹 LIndF 𝑊))
69	68	ex 449	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → (𝐹 ∈ V → (𝐹 LIndF 𝑋 ↔ 𝐹 LIndF 𝑊)))
70	3, 5, 69	pm5.21ndd 368	1 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝑈 ∧ ran 𝐹 ⊆ 𝑆) → (𝐹 LIndF 𝑋 ↔ 𝐹 LIndF 𝑊))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ∀wral 2896 Vcvv 3173 ∖ cdif 3537 ⊆ wss 3540 {csn 4125 class class class wbr 4583 dom cdm 5038 ran crn 5039 “ cima 5041 Fn wfn 5799 ⟶wf 5800 ‘cfv 5804 (class class class)co 6549 Basecbs 15695 ↾_s cress 15696 Scalarcsca 15771 ·_𝑠 cvsca 15772 0_gc0g 15923 LModclmod 18686 LSubSpclss 18753 LSpanclspn 18792 LIndF clindf 19962

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-ndx 15698 df-slot 15699 df-base 15700 df-sets 15701 df-ress 15702 df-plusg 15781 df-sca 15784 df-vsca 15785 df-0g 15925 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-grp 17248 df-minusg 17249 df-sbg 17250 df-subg 17414 df-mgp 18313 df-ur 18325 df-ring 18372 df-lmod 18688 df-lss 18754 df-lsp 18793 df-lindf 19964

This theorem is referenced by: lsslinds 19989

W3C validator