lindfmm - Metamath Proof Explorer

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

Theorem lindfmm 21807

Description: Linear independence of a family is unchanged by injective linear functions. (Contributed by Stefan O'Rear, 26-Feb-2015.) (Revised by Stefan O'Rear, 6-May-2015.)

**Hypotheses**
Ref	Expression
lindfmm.b	⊢ 𝐵 = (Base‘𝑆)
lindfmm.c	⊢ 𝐶 = (Base‘𝑇)

**Assertion**
Ref	Expression
lindfmm	⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐹 LIndF 𝑆 ↔ (𝐺 ∘ 𝐹) LIndF 𝑇))

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

Step	Hyp	Ref	Expression
1		rellindf 21788	. . . . 5 ⊢ Rel LIndF
2	1	brrelex1i 5687	. . . 4 ⊢ (𝐹 LIndF 𝑆 → 𝐹 ∈ V)
3		simp3 1139	. . . 4 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → 𝐹:𝐼⟶𝐵)
4		dmfex 7856	. . . 4 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐼⟶𝐵) → 𝐼 ∈ V)
5	2, 3, 4	syl2anr 598	. . 3 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) ∧ 𝐹 LIndF 𝑆) → 𝐼 ∈ V)
6	5	ex 412	. 2 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐹 LIndF 𝑆 → 𝐼 ∈ V))
7	1	brrelex1i 5687	. . . 4 ⊢ ((𝐺 ∘ 𝐹) LIndF 𝑇 → (𝐺 ∘ 𝐹) ∈ V)
8		f1f 6736	. . . . . 6 ⊢ (𝐺:𝐵–1-1→𝐶 → 𝐺:𝐵⟶𝐶)
9		fco 6692	. . . . . 6 ⊢ ((𝐺:𝐵⟶𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐺 ∘ 𝐹):𝐼⟶𝐶)
10	8, 9	sylan 581	. . . . 5 ⊢ ((𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐺 ∘ 𝐹):𝐼⟶𝐶)
11	10	3adant1 1131	. . . 4 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐺 ∘ 𝐹):𝐼⟶𝐶)
12		dmfex 7856	. . . 4 ⊢ (((𝐺 ∘ 𝐹) ∈ V ∧ (𝐺 ∘ 𝐹):𝐼⟶𝐶) → 𝐼 ∈ V)
13	7, 11, 12	syl2anr 598	. . 3 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) ∧ (𝐺 ∘ 𝐹) LIndF 𝑇) → 𝐼 ∈ V)
14	13	ex 412	. 2 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → ((𝐺 ∘ 𝐹) LIndF 𝑇 → 𝐼 ∈ V))
15		eldifi 4071	. . . . . . . . 9 ⊢ (𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) → 𝑘 ∈ (Base‘(Scalar‘𝑆)))
16		simpllr 776	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → 𝐺:𝐵–1-1→𝐶)
17		lmhmlmod1 21028	. . . . . . . . . . . . . . 15 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
18	17	ad3antrrr 731	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → 𝑆 ∈ LMod)
19		simprr 773	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → 𝑘 ∈ (Base‘(Scalar‘𝑆)))
20		simprl 771	. . . . . . . . . . . . . . 15 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝐹:𝐼⟶𝐵)
21		simpl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆))) → 𝑥 ∈ 𝐼)
22		ffvelcdm 7033	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:𝐼⟶𝐵 ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ 𝐵)
23	20, 21, 22	syl2an 597	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐹‘𝑥) ∈ 𝐵)
24		lindfmm.b	. . . . . . . . . . . . . . 15 ⊢ 𝐵 = (Base‘𝑆)
25		eqid 2736	. . . . . . . . . . . . . . 15 ⊢ (Scalar‘𝑆) = (Scalar‘𝑆)
26		eqid 2736	. . . . . . . . . . . . . . 15 ⊢ ( ·_𝑠 ‘𝑆) = ( ·_𝑠 ‘𝑆)
27		eqid 2736	. . . . . . . . . . . . . . 15 ⊢ (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑆))
28	24, 25, 26, 27	lmodvscl 20873	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ∈ LMod ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)) ∧ (𝐹‘𝑥) ∈ 𝐵) → (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ 𝐵)
29	18, 19, 23, 28	syl3anc 1374	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ 𝐵)
30		imassrn 6036	. . . . . . . . . . . . . . . 16 ⊢ (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ ran 𝐹
31		frn 6675	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹:𝐼⟶𝐵 → ran 𝐹 ⊆ 𝐵)
32	31	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V) → ran 𝐹 ⊆ 𝐵)
33	30, 32	sstrid 3933	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V) → (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ 𝐵)
34	33	ad2antlr 728	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ 𝐵)
35		eqid 2736	. . . . . . . . . . . . . . 15 ⊢ (LSpan‘𝑆) = (LSpan‘𝑆)
36	24, 35	lspssv 20978	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ∈ LMod ∧ (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ 𝐵) → ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ⊆ 𝐵)
37	18, 34, 36	syl2anc 585	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ⊆ 𝐵)
38		f1elima 7218	. . . . . . . . . . . . 13 ⊢ ((𝐺:𝐵–1-1→𝐶 ∧ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ 𝐵 ∧ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ⊆ 𝐵) → ((𝐺‘(𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥))) ∈ (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) ↔ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))))
39	16, 29, 37, 38	syl3anc 1374	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((𝐺‘(𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥))) ∈ (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) ↔ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))))
40		simplll 775	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → 𝐺 ∈ (𝑆 LMHom 𝑇))
41		eqid 2736	. . . . . . . . . . . . . . . 16 ⊢ ( ·_𝑠 ‘𝑇) = ( ·_𝑠 ‘𝑇)
42	25, 27, 24, 26, 41	lmhmlin 21030	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)) ∧ (𝐹‘𝑥) ∈ 𝐵) → (𝐺‘(𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥))) = (𝑘( ·_𝑠 ‘𝑇)(𝐺‘(𝐹‘𝑥))))
43	40, 19, 23, 42	syl3anc 1374	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐺‘(𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥))) = (𝑘( ·_𝑠 ‘𝑇)(𝐺‘(𝐹‘𝑥))))
44		ffn 6668	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹:𝐼⟶𝐵 → 𝐹 Fn 𝐼)
45	44	ad2antrl 729	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝐹 Fn 𝐼)
46		fvco2 6937	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹 Fn 𝐼 ∧ 𝑥 ∈ 𝐼) → ((𝐺 ∘ 𝐹)‘𝑥) = (𝐺‘(𝐹‘𝑥)))
47	45, 21, 46	syl2an 597	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((𝐺 ∘ 𝐹)‘𝑥) = (𝐺‘(𝐹‘𝑥)))
48	47	oveq2d 7383	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) = (𝑘( ·_𝑠 ‘𝑇)(𝐺‘(𝐹‘𝑥))))
49	43, 48	eqtr4d 2774	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐺‘(𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥))) = (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)))
50		eqid 2736	. . . . . . . . . . . . . . . 16 ⊢ (LSpan‘𝑇) = (LSpan‘𝑇)
51	24, 35, 50	lmhmlsp 21044	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ 𝐵) → (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) = ((LSpan‘𝑇)‘(𝐺 “ (𝐹 “ (𝐼 ∖ {𝑥})))))
52	40, 34, 51	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) = ((LSpan‘𝑇)‘(𝐺 “ (𝐹 “ (𝐼 ∖ {𝑥})))))
53		imaco 6215	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})) = (𝐺 “ (𝐹 “ (𝐼 ∖ {𝑥})))
54	53	fveq2i 6843	. . . . . . . . . . . . . 14 ⊢ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥}))) = ((LSpan‘𝑇)‘(𝐺 “ (𝐹 “ (𝐼 ∖ {𝑥}))))
55	52, 54	eqtr4di 2789	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) = ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥}))))
56	49, 55	eleq12d 2830	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((𝐺‘(𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥))) ∈ (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) ↔ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
57	39, 56	bitr3d 281	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
58	57	notbid 318	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
59	58	anassrs 467	. . . . . . . . 9 ⊢ (((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆))) → (¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
60	15, 59	sylan2 594	. . . . . . . 8 ⊢ (((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))})) → (¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
61	60	ralbidva 3158	. . . . . . 7 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) → (∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) ¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
62		eqid 2736	. . . . . . . . . . . 12 ⊢ (Scalar‘𝑇) = (Scalar‘𝑇)
63	25, 62	lmhmsca 21025	. . . . . . . . . . 11 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑇) = (Scalar‘𝑆))
64	63	fveq2d 6844	. . . . . . . . . 10 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑆)))
65	63	fveq2d 6844	. . . . . . . . . . 11 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → (0_g‘(Scalar‘𝑇)) = (0_g‘(Scalar‘𝑆)))
66	65	sneqd 4579	. . . . . . . . . 10 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → {(0_g‘(Scalar‘𝑇))} = {(0_g‘(Scalar‘𝑆))})
67	64, 66	difeq12d 4067	. . . . . . . . 9 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → ((Base‘(Scalar‘𝑇)) ∖ {(0_g‘(Scalar‘𝑇))}) = ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}))
68	67	ad3antrrr 731	. . . . . . . 8 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) → ((Base‘(Scalar‘𝑇)) ∖ {(0_g‘(Scalar‘𝑇))}) = ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}))
69	68	raleqdv 3295	. . . . . . 7 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) → (∀𝑘 ∈ ((Base‘(Scalar‘𝑇)) ∖ {(0_g‘(Scalar‘𝑇))}) ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥}))) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
70	61, 69	bitr4d 282	. . . . . 6 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) → (∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) ¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝑇)) ∖ {(0_g‘(Scalar‘𝑇))}) ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
71	70	ralbidva 3158	. . . . 5 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → (∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) ¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑇)) ∖ {(0_g‘(Scalar‘𝑇))}) ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
72	17	ad2antrr 727	. . . . . 6 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝑆 ∈ LMod)
73		simprr 773	. . . . . 6 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝐼 ∈ V)
74		eqid 2736	. . . . . . 7 ⊢ (0_g‘(Scalar‘𝑆)) = (0_g‘(Scalar‘𝑆))
75	24, 26, 35, 25, 27, 74	islindf2 21794	. . . . . 6 ⊢ ((𝑆 ∈ LMod ∧ 𝐼 ∈ V ∧ 𝐹:𝐼⟶𝐵) → (𝐹 LIndF 𝑆 ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) ¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))))
76	72, 73, 20, 75	syl3anc 1374	. . . . 5 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → (𝐹 LIndF 𝑆 ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) ¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))))
77		lmhmlmod2 21027	. . . . . . 7 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
78	77	ad2antrr 727	. . . . . 6 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝑇 ∈ LMod)
79	10	ad2ant2lr 749	. . . . . 6 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → (𝐺 ∘ 𝐹):𝐼⟶𝐶)
80		lindfmm.c	. . . . . . 7 ⊢ 𝐶 = (Base‘𝑇)
81		eqid 2736	. . . . . . 7 ⊢ (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑇))
82		eqid 2736	. . . . . . 7 ⊢ (0_g‘(Scalar‘𝑇)) = (0_g‘(Scalar‘𝑇))
83	80, 41, 50, 62, 81, 82	islindf2 21794	. . . . . 6 ⊢ ((𝑇 ∈ LMod ∧ 𝐼 ∈ V ∧ (𝐺 ∘ 𝐹):𝐼⟶𝐶) → ((𝐺 ∘ 𝐹) LIndF 𝑇 ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑇)) ∖ {(0_g‘(Scalar‘𝑇))}) ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
84	78, 73, 79, 83	syl3anc 1374	. . . . 5 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → ((𝐺 ∘ 𝐹) LIndF 𝑇 ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑇)) ∖ {(0_g‘(Scalar‘𝑇))}) ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
85	71, 76, 84	3bitr4d 311	. . . 4 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → (𝐹 LIndF 𝑆 ↔ (𝐺 ∘ 𝐹) LIndF 𝑇))
86	85	exp32 420	. . 3 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) → (𝐹:𝐼⟶𝐵 → (𝐼 ∈ V → (𝐹 LIndF 𝑆 ↔ (𝐺 ∘ 𝐹) LIndF 𝑇))))
87	86	3impia 1118	. 2 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐼 ∈ V → (𝐹 LIndF 𝑆 ↔ (𝐺 ∘ 𝐹) LIndF 𝑇)))
88	6, 14, 87	pm5.21ndd 379	1 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐹 LIndF 𝑆 ↔ (𝐺 ∘ 𝐹) LIndF 𝑇))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3051 Vcvv 3429 ∖ cdif 3886 ⊆ wss 3889 {csn 4567 class class class wbr 5085 ran crn 5632 “ cima 5634 ∘ ccom 5635 Fn wfn 6493 ⟶wf 6494 –1-1→wf1 6495 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 Scalarcsca 17223 ·_𝑠 cvsca 17224 0_gc0g 17402 LModclmod 20855 LSpanclspn 20966 LMHom clmhm 21014 LIndF clindf 21784

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-map 8775 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-0g 17404 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-grp 18912 df-minusg 18913 df-sbg 18914 df-subg 19099 df-ghm 19188 df-mgp 20122 df-ur 20163 df-ring 20216 df-lmod 20857 df-lss 20927 df-lsp 20967 df-lmhm 21017 df-lindf 21786

This theorem is referenced by: lindsmm 21808

W3C validator