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 21774

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 2734	. . . . 5 ⊢ (Base‘𝑊) = (Base‘𝑊)
2	1	lindff 21768	. . . 4 ⊢ ((𝐹 LIndF 𝑊 ∧ 𝑊 ∈ LMod) → 𝐹:dom 𝐹⟶(Base‘𝑊))
3	2	ancoms 458	. . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → 𝐹:dom 𝐹⟶(Base‘𝑊))
4	3	frnd 6668	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → ran 𝐹 ⊆ (Base‘𝑊))
5		simpll 766	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ 𝑦 ∈ dom 𝐹) → 𝑊 ∈ LMod)
6		imassrn 6028	. . . . . . . . 9 ⊢ (𝐹 “ (dom 𝐹 ∖ {𝑦})) ⊆ ran 𝐹
7	6, 4	sstrid 3943	. . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → (𝐹 “ (dom 𝐹 ∖ {𝑦})) ⊆ (Base‘𝑊))
8	7	adantr 480	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ 𝑦 ∈ dom 𝐹) → (𝐹 “ (dom 𝐹 ∖ {𝑦})) ⊆ (Base‘𝑊))
9	3	ffund 6664	. . . . . . . 8 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → Fun 𝐹)
10		eldifsn 4740	. . . . . . . . . 10 ⊢ (𝑥 ∈ (ran 𝐹 ∖ {(𝐹‘𝑦)}) ↔ (𝑥 ∈ ran 𝐹 ∧ 𝑥 ≠ (𝐹‘𝑦)))
11		funfn 6520	. . . . . . . . . . . . . 14 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
12		fvelrnb 6892	. . . . . . . . . . . . . 14 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ ran 𝐹 ↔ ∃𝑘 ∈ dom 𝐹(𝐹‘𝑘) = 𝑥))
13	11, 12	sylbi 217	. . . . . . . . . . . . 13 ⊢ (Fun 𝐹 → (𝑥 ∈ ran 𝐹 ↔ ∃𝑘 ∈ dom 𝐹(𝐹‘𝑘) = 𝑥))
14	13	adantr 480	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (𝑥 ∈ ran 𝐹 ↔ ∃𝑘 ∈ dom 𝐹(𝐹‘𝑘) = 𝑥))
15		difss 4086	. . . . . . . . . . . . . . . . . 18 ⊢ (dom 𝐹 ∖ {𝑦}) ⊆ dom 𝐹
16	15	jctr 524	. . . . . . . . . . . . . . . . 17 ⊢ (Fun 𝐹 → (Fun 𝐹 ∧ (dom 𝐹 ∖ {𝑦}) ⊆ dom 𝐹))
17	16	ad2antrr 726	. . . . . . . . . . . . . . . 16 ⊢ (((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ≠ (𝐹‘𝑦))) → (Fun 𝐹 ∧ (dom 𝐹 ∖ {𝑦}) ⊆ dom 𝐹))
18		simpl 482	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ≠ (𝐹‘𝑦)) → 𝑘 ∈ dom 𝐹)
19		fveq2 6832	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 = 𝑦 → (𝐹‘𝑘) = (𝐹‘𝑦))
20	19	necon3i 2962	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹‘𝑘) ≠ (𝐹‘𝑦) → 𝑘 ≠ 𝑦)
21	20	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ≠ (𝐹‘𝑦)) → 𝑘 ≠ 𝑦)
22		eldifsn 4740	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (dom 𝐹 ∖ {𝑦}) ↔ (𝑘 ∈ dom 𝐹 ∧ 𝑘 ≠ 𝑦))
23	18, 21, 22	sylanbrc 583	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ≠ (𝐹‘𝑦)) → 𝑘 ∈ (dom 𝐹 ∖ {𝑦}))
24	23	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ (((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ≠ (𝐹‘𝑦))) → 𝑘 ∈ (dom 𝐹 ∖ {𝑦}))
25		funfvima2 7175	. . . . . . . . . . . . . . . 16 ⊢ ((Fun 𝐹 ∧ (dom 𝐹 ∖ {𝑦}) ⊆ dom 𝐹) → (𝑘 ∈ (dom 𝐹 ∖ {𝑦}) → (𝐹‘𝑘) ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦}))))
26	17, 24, 25	sylc 65	. . . . . . . . . . . . . . 15 ⊢ (((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) ∧ (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ≠ (𝐹‘𝑦))) → (𝐹‘𝑘) ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦})))
27	26	expr 456	. . . . . . . . . . . . . 14 ⊢ (((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) ≠ (𝐹‘𝑦) → (𝐹‘𝑘) ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦}))))
28		neeq1 2992	. . . . . . . . . . . . . . 15 ⊢ ((𝐹‘𝑘) = 𝑥 → ((𝐹‘𝑘) ≠ (𝐹‘𝑦) ↔ 𝑥 ≠ (𝐹‘𝑦)))
29		eleq1 2822	. . . . . . . . . . . . . . 15 ⊢ ((𝐹‘𝑘) = 𝑥 → ((𝐹‘𝑘) ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦})) ↔ 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦}))))
30	28, 29	imbi12d 344	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑘) = 𝑥 → (((𝐹‘𝑘) ≠ (𝐹‘𝑦) → (𝐹‘𝑘) ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦}))) ↔ (𝑥 ≠ (𝐹‘𝑦) → 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦})))))
31	27, 30	syl5ibcom 245	. . . . . . . . . . . . 13 ⊢ (((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) ∧ 𝑘 ∈ dom 𝐹) → ((𝐹‘𝑘) = 𝑥 → (𝑥 ≠ (𝐹‘𝑦) → 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦})))))
32	31	rexlimdva 3135	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (∃𝑘 ∈ dom 𝐹(𝐹‘𝑘) = 𝑥 → (𝑥 ≠ (𝐹‘𝑦) → 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦})))))
33	14, 32	sylbid 240	. . . . . . . . . . 11 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (𝑥 ∈ ran 𝐹 → (𝑥 ≠ (𝐹‘𝑦) → 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦})))))
34	33	impd 410	. . . . . . . . . 10 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → ((𝑥 ∈ ran 𝐹 ∧ 𝑥 ≠ (𝐹‘𝑦)) → 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦}))))
35	10, 34	biimtrid 242	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (𝑥 ∈ (ran 𝐹 ∖ {(𝐹‘𝑦)}) → 𝑥 ∈ (𝐹 “ (dom 𝐹 ∖ {𝑦}))))
36	35	ssrdv 3937	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (ran 𝐹 ∖ {(𝐹‘𝑦)}) ⊆ (𝐹 “ (dom 𝐹 ∖ {𝑦})))
37	9, 36	sylan 580	. . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ 𝑦 ∈ dom 𝐹) → (ran 𝐹 ∖ {(𝐹‘𝑦)}) ⊆ (𝐹 “ (dom 𝐹 ∖ {𝑦})))
38		eqid 2734	. . . . . . . 8 ⊢ (LSpan‘𝑊) = (LSpan‘𝑊)
39	1, 38	lspss 20933	. . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ (𝐹 “ (dom 𝐹 ∖ {𝑦})) ⊆ (Base‘𝑊) ∧ (ran 𝐹 ∖ {(𝐹‘𝑦)}) ⊆ (𝐹 “ (dom 𝐹 ∖ {𝑦}))) → ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)})) ⊆ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑦}))))
40	5, 8, 37, 39	syl3anc 1373	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ 𝑦 ∈ dom 𝐹) → ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)})) ⊆ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑦}))))
41	40	adantrr 717	. . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)})) ⊆ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑦}))))
42		simplr 768	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → 𝐹 LIndF 𝑊)
43		simprl 770	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → 𝑦 ∈ dom 𝐹)
44		eldifi 4081	. . . . . . 7 ⊢ (𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) → 𝑘 ∈ (Base‘(Scalar‘𝑊)))
45	44	ad2antll 729	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → 𝑘 ∈ (Base‘(Scalar‘𝑊)))
46		eldifsni 4744	. . . . . . 7 ⊢ (𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) → 𝑘 ≠ (0_g‘(Scalar‘𝑊)))
47	46	ad2antll 729	. . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → 𝑘 ≠ (0_g‘(Scalar‘𝑊)))
48		eqid 2734	. . . . . . 7 ⊢ ( ·_𝑠 ‘𝑊) = ( ·_𝑠 ‘𝑊)
49		eqid 2734	. . . . . . 7 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
50		eqid 2734	. . . . . . 7 ⊢ (0_g‘(Scalar‘𝑊)) = (0_g‘(Scalar‘𝑊))
51		eqid 2734	. . . . . . 7 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
52	48, 38, 49, 50, 51	lindfind 21769	. . . . . 6 ⊢ (((𝐹 LIndF 𝑊 ∧ 𝑦 ∈ dom 𝐹) ∧ (𝑘 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑘 ≠ (0_g‘(Scalar‘𝑊)))) → ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑦}))))
53	42, 43, 45, 47, 52	syl22anc 838	. . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(𝐹 “ (dom 𝐹 ∖ {𝑦}))))
54	41, 53	ssneldd 3934	. . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) ∧ (𝑦 ∈ dom 𝐹 ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}))) → ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)})))
55	54	ralrimivva 3177	. . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → ∀𝑦 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)})))
56	9	funfnd 6521	. . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → 𝐹 Fn dom 𝐹)
57		oveq2 7364	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝑦) → (𝑘( ·_𝑠 ‘𝑊)𝑥) = (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)))
58		sneq 4588	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹‘𝑦) → {𝑥} = {(𝐹‘𝑦)})
59	58	difeq2d 4076	. . . . . . . . 9 ⊢ (𝑥 = (𝐹‘𝑦) → (ran 𝐹 ∖ {𝑥}) = (ran 𝐹 ∖ {(𝐹‘𝑦)}))
60	59	fveq2d 6836	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝑦) → ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})) = ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)})))
61	57, 60	eleq12d 2828	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝑦) → ((𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})) ↔ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)}))))
62	61	notbid 318	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝑦) → (¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})) ↔ ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)}))))
63	62	ralbidv 3157	. . . . 5 ⊢ (𝑥 = (𝐹‘𝑦) → (∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)}))))
64	63	ralrn 7031	. . . 4 ⊢ (𝐹 Fn dom 𝐹 → (∀𝑥 ∈ ran 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})) ↔ ∀𝑦 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)}))))
65	56, 64	syl 17	. . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → (∀𝑥 ∈ ran 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})) ↔ ∀𝑦 ∈ dom 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)(𝐹‘𝑦)) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {(𝐹‘𝑦)}))))
66	55, 65	mpbird 257	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → ∀𝑥 ∈ ran 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})))
67	1, 48, 38, 49, 51, 50	islinds2 21766	. . 3 ⊢ (𝑊 ∈ LMod → (ran 𝐹 ∈ (LIndS‘𝑊) ↔ (ran 𝐹 ⊆ (Base‘𝑊) ∧ ∀𝑥 ∈ ran 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})))))
68	67	adantr 480	. 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → (ran 𝐹 ∈ (LIndS‘𝑊) ↔ (ran 𝐹 ⊆ (Base‘𝑊) ∧ ∀𝑥 ∈ ran 𝐹∀𝑘 ∈ ((Base‘(Scalar‘𝑊)) ∖ {(0_g‘(Scalar‘𝑊))}) ¬ (𝑘( ·_𝑠 ‘𝑊)𝑥) ∈ ((LSpan‘𝑊)‘(ran 𝐹 ∖ {𝑥})))))
69	4, 66, 68	mpbir2and 713	1 ⊢ ((𝑊 ∈ LMod ∧ 𝐹 LIndF 𝑊) → ran 𝐹 ∈ (LIndS‘𝑊))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ∀wral 3049 ∃wrex 3058 ∖ cdif 3896 ⊆ wss 3899 {csn 4578 class class class wbr 5096 dom cdm 5622 ran crn 5623 “ cima 5625 Fun wfun 6484 Fn wfn 6485 ⟶wf 6486 ‘cfv 6490 (class class class)co 7356 Basecbs 17134 Scalarcsca 17178 ·_𝑠 cvsca 17179 0_gc0g 17357 LModclmod 20809 LSpanclspn 20920 LIndF clindf 21757 LIndSclinds 21758

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-1cn 11082 ax-addcl 11084

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-nn 12144 df-slot 17107 df-ndx 17119 df-base 17135 df-0g 17359 df-mgm 18563 df-sgrp 18642 df-mnd 18658 df-grp 18864 df-lmod 20811 df-lss 20881 df-lsp 20921 df-lindf 21759 df-linds 21760

This theorem is referenced by: islindf3 21779 lindsmm 21781 matunitlindflem2 37757

W3C validator