lindfrn - Metamath Proof Explorer

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

Theorem lindfrn 21940

Description: The range of an independent family is an independent set. (Contributed by Stefan O'Rear, 24-Feb-2015.)

**Assertion**
Ref	Expression
lindfrn	⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → ran 𝐹 ∈ (LIndS‘𝑊))

Proof of Theorem lindfrn Dummy variables 𝑘 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2769	. . . . 5 ⊢ (Base‘𝑊) = (Base‘𝑊)
2	1	lindff 21934	. . . 4 ⊢ ((𝐹 LIndF 𝑊 ∧ 𝑊 ∈ LMod) → 𝐹:dom 𝐹⟶(Base‘𝑊))
3	2	ancoms 463	. . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → 𝐹:dom 𝐹⟶(Base‘𝑊))
4	3	frnd 6715	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → ran 𝐹 ⊆ (Base‘𝑊))
5		simpll 778	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ 𝑦 ∈ dom 𝐹) → 𝑊 ∈ LMod)
6		imassrn 6074	. . . . . . . . 9 ⊢ (𝐹 “ (dom 𝐹 ∖ {𝑦})) ⊆ ran 𝐹
7	6, 4	sstrid 3956	. . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → (𝐹 “ (dom 𝐹 ∖ {𝑦})) ⊆ (Base‘𝑊))
8	7	adantr 485	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ 𝑦 ∈ dom 𝐹) → (𝐹 “ (dom 𝐹 ∖ {𝑦})) ⊆ (Base‘𝑊))
9	3	ffund 6711	. . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → Fun 𝐹)
10		eldifsn 4758	. . . . . . . . . 10 ⊢ (𝑥 ∈ (ran 𝐹 ∖ {(𝐹‘𝑦)}) ↔ (𝑥 ∈ ran 𝐹 ∧ 𝑥 ≠ (𝐹‘𝑦)))
11		funfn 6567	. . . . . . . . . . . . . 14 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
12		fvelrnb 6942	. . . . . . . . . . . . . 14 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ ran 𝐹 ↔ ∃𝑘 ∈ dom 𝐹(𝐹‘𝑘) = 𝑥))
13	11, 12	sylbi 220	. . . . . . . . . . . . 13 ⊢ (Fun 𝐹 → (𝑥 ∈ ran 𝐹 ↔ ∃𝑘 ∈ dom 𝐹(𝐹‘𝑘) = 𝑥))
14	13	adantr 485	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (𝑥 ∈ ran 𝐹 ↔ ∃𝑘 ∈ dom 𝐹(𝐹‘𝑘) = 𝑥))
15		difss 4098	. . . . . . . . . . . . . . . . . 18 ⊢ (dom 𝐹 ∖ {𝑦}) ⊆ dom 𝐹
16	15	jctr 533	. . . . . . . . . . . . . . . . 17 ⊢ (Fun 𝐹 → (Fun 𝐹 ∧ (dom 𝐹 ∖ {𝑦}) ⊆ dom 𝐹))
17	16	ad2antrr 738	. . . . . . . . . . . . . . . 16 ⊢ (((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ≠ (𝐹‘𝑦))) → (Fun 𝐹 ∧ (dom 𝐹 ∖ {𝑦}) ⊆ dom 𝐹))
18		simpl 487	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ≠ (𝐹‘𝑦)) → 𝑘 ∈ dom 𝐹)
19		fveq2 6882	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 = 𝑦 → (𝐹‘𝑘) = (𝐹‘𝑦))
20	19	necon3i 2996	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹‘𝑘) ≠ (𝐹‘𝑦) → 𝑘 ≠ 𝑦)
21	20	adantl 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ≠ (𝐹‘𝑦)) → 𝑘 ≠ 𝑦)
22		eldifsn 4758	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (dom 𝐹 ∖ {𝑦}) ↔ (𝑘 ∈ dom 𝐹 ∧ 𝑘 ≠ 𝑦))
23	18, 21, 22	sylanbrc 594	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ≠ (𝐹‘𝑦)) → 𝑘 ∈ (dom 𝐹 ∖ {𝑦}))
24	23	adantl 486	. . . . . . . . . . . . . . . 16 ⊢ (((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ≠ (𝐹‘𝑦))) → 𝑘 ∈ (dom 𝐹 ∖ {𝑦}))
25		funfvima2 7230	. . . . . . . . . . . . . . . 16 ⊢ ((Fun 𝐹 ∧ (dom 𝐹 ∖ {𝑦}) ⊆ dom 𝐹) → (𝑘 ∈ (dom 𝐹 ∖ {𝑦}) → (𝐹‘𝑘) ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦}))))
26	17, 24, 25	sylc 66	. . . . . . . . . . . . . . 15 ⊢ (((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ≠ (𝐹‘𝑦))) → (𝐹‘𝑘) ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦})))
27	26	expr 461	. . . . . . . . . . . . . 14 ⊢ (((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ≠ (𝐹‘𝑦) → (𝐹‘𝑘) ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦}))))
28		neeq1 3026	. . . . . . . . . . . . . . 15 ⊢ ((𝐹‘𝑘) = 𝑥 → ((𝐹‘𝑘) ≠ (𝐹‘𝑦) ↔ 𝑥 ≠ (𝐹‘𝑦)))
29		eleq1 2857	. . . . . . . . . . . . . . 15 ⊢ ((𝐹‘𝑘) = 𝑥 → ((𝐹‘𝑘) ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦})) ↔ 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦}))))
30	28, 29	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑘) = 𝑥 → (((𝐹‘𝑘) ≠ (𝐹‘𝑦) → (𝐹‘𝑘) ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦}))) ↔ (𝑥 ≠ (𝐹‘𝑦) → 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦})))))
31	27, 30	syl5ibcom 248	. . . . . . . . . . . . 13 ⊢ (((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) = 𝑥 → (𝑥 ≠ (𝐹‘𝑦) → 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦})))))
32	31	rexlimdva 3172	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (∃𝑘 ∈ dom 𝐹(𝐹‘𝑘) = 𝑥 → (𝑥 ≠ (𝐹‘𝑦) → 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦})))))
33	14, 32	sylbid 243	. . . . . . . . . . 11 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (𝑥 ∈ ran 𝐹 → (𝑥 ≠ (𝐹‘𝑦) → 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦})))))
34	33	impd 415	. . . . . . . . . 10 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → ((𝑥 ∈ ran 𝐹 ∧ 𝑥 ≠ (𝐹‘𝑦)) → 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦}))))
35	10, 34	biimtrid 245	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (𝑥 ∈ (ran 𝐹 ∖ {(𝐹‘𝑦)}) → 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦}))))
36	35	ssrdv 3951	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (ran 𝐹 ∖ {(𝐹‘𝑦)}) ⊆ (𝐹 “ (dom 𝐹 ∖ {𝑦})))
37	9, 36	sylan 591	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ 𝑦 ∈ dom 𝐹) → (ran 𝐹 ∖ {(𝐹‘𝑦)}) ⊆ (𝐹 “ (dom 𝐹 ∖ {𝑦})))
38		eqid 2769	. . . . . . . 8 ⊢ (LSpan‘𝑊) = (LSpan‘𝑊)
39	1, 38	lspss 21083	. . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝐹 “ (dom 𝐹 ∖ {𝑦})) ⊆ (Base‘𝑊) ∧ (ran 𝐹 ∖ {(𝐹‘𝑦)}) ⊆ (𝐹 “ (dom 𝐹 ∖ {𝑦}))) → ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)})) ⊆ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑦}))))
40	5, 8, 37, 39	syl3anc 1396	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ 𝑦 ∈ dom 𝐹) → ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)})) ⊆ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑦}))))
41	40	adantrr 729	. . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)})) ⊆ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑦}))))
42		simplr 780	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → 𝐹 LIndF 𝑊)
43		simprl 782	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → 𝑦 ∈ dom 𝐹)
44		eldifi 4093	. . . . . . 7 ⊢ (𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) → 𝑘 ∈ (Base‘(Scalar‘𝑊)))
45	44	ad2antll 741	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → 𝑘 ∈ (Base‘(Scalar‘𝑊)))
46		eldifsni 4762	. . . . . . 7 ⊢ (𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) → 𝑘 ≠ (0_g‘(Scalar‘𝑊)))
47	46	ad2antll 741	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → 𝑘 ≠ (0_g‘(Scalar‘𝑊)))
48		eqid 2769	. . . . . . 7 ⊢ ( ·_𝑠 ‘𝑊) = ( ·_𝑠 ‘𝑊)
49		eqid 2769	. . . . . . 7 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
50		eqid 2769	. . . . . . 7 ⊢ (0_g‘(Scalar‘𝑊)) = (0_g‘(Scalar‘𝑊))
51		eqid 2769	. . . . . . 7 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
52	48, 38, 49, 50, 51	lindfind 21935	. . . . . 6 ⊢ (((𝐹 LIndF 𝑊 ∧ 𝑦 ∈ dom 𝐹) ∧ (𝑘 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑘 ≠ (0_g‘(Scalar‘𝑊)))) → ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑦}))))
53	42, 43, 45, 47, 52	syl22anc 851	. . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑦}))))
54	41, 53	ssneldd 3948	. . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)})))
55	54	ralrimivva 3214	. . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → ∀𝑦 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)})))
56	9	funfnd 6568	. . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → 𝐹 Fn dom 𝐹)
57		oveq2 7419	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝑦) → (𝑘( ·_𝑠 ‘𝑊)𝑥) = (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)))
58		sneq 4604	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹‘𝑦) → {𝑥} = {(𝐹‘𝑦)})
59	58	difeq2d 4089	. . . . . . . . 9 ⊢ (𝑥 = (𝐹‘𝑦) → (ran 𝐹 ∖ {𝑥}) = (ran 𝐹 ∖ {(𝐹‘𝑦)}))
60	59	fveq2d 6886	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝑦) → ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})) = ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)})))
61	57, 60	eleq12d 2863	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝑦) → ((𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})) ↔ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)}))))
62	61	notbid 321	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝑦) → (¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})) ↔ ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)}))))
63	62	ralbidv 3194	. . . . 5 ⊢ (𝑥 = (𝐹‘𝑦) → (∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)}))))
64	63	ralrn 7084	. . . 4 ⊢ (𝐹 Fn dom 𝐹 → (∀𝑥 ∈ ran 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})) ↔ ∀𝑦 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)}))))
65	56, 64	syl 18	. . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → (∀𝑥 ∈ ran 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})) ↔ ∀𝑦 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)}))))
66	55, 65	mpbird 260	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → ∀𝑥 ∈ ran 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})))
67	1, 48, 38, 49, 51, 50	islinds2 21932	. . 3 ⊢ (𝑊 ∈ LMod → (ran 𝐹 ∈ (LIndS‘𝑊) ↔ (ran 𝐹 ⊆ (Base‘𝑊) ∧ ∀𝑥 ∈ ran 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})))))
68	67	adantr 485	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → (ran 𝐹 ∈ (LIndS‘𝑊) ↔ (ran 𝐹 ⊆ (Base‘𝑊) ∧ ∀𝑥 ∈ ran 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})))))
69	4, 66, 68	mpbir2and 725	1 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → ran 𝐹 ∈ (LIndS‘𝑊))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∀wral 3085 ∃wrex 3095 ∖ cdif 3910 ⊆ wss 3913 {csn 4594 class class class wbr 5113 dom cdm 5662 ran crn 5663 “ cima 5665 Fun wfun 6531 Fn wfn 6532 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 Basecbs 17269 Scalarcsca 17313 ·_𝑠 cvsca 17314 0_gc0g 17492 LModclmod 20959 LSpanclspn 21070 LIndF clindf 21923 LIndSclinds 21924

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-1cn 11158 ax-addcl 11160

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-om 7863 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-nn 12234 df-slot 17242 df-ndx 17254 df-base 17270 df-0g 17494 df-mgm 18698 df-sgrp 18777 df-mnd 18793 df-grp 19003 df-lmod 20961 df-lss 21031 df-lsp 21071 df-lindf 21925 df-linds 21926

This theorem is referenced by: islindf3 21945 lindsmm 21947 matunitlindflem2 38156

W3C validator