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 21743

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 21724	. . . . 5 ⊢ Rel LIndF
2	1	brrelex1i 5697	. . . 4 ⊢ (𝐹 LIndF 𝑆 → 𝐹 ∈ V)
3		simp3 1138	. . . 4 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → 𝐹:𝐼⟶𝐵)
4		dmfex 7884	. . . 4 ⊢ ((𝐹 ∈ V ∧ 𝐹:𝐼⟶𝐵) → 𝐼 ∈ V)
5	2, 3, 4	syl2anr 597	. . 3 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) ∧ 𝐹 LIndF 𝑆) → 𝐼 ∈ V)
6	5	ex 412	. 2 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐹 LIndF 𝑆 → 𝐼 ∈ V))
7	1	brrelex1i 5697	. . . 4 ⊢ ((𝐺 ∘ 𝐹) LIndF 𝑇 → (𝐺 ∘ 𝐹) ∈ V)
8		f1f 6759	. . . . . 6 ⊢ (𝐺:𝐵–1-1→𝐶 → 𝐺:𝐵⟶𝐶)
9		fco 6715	. . . . . 6 ⊢ ((𝐺:𝐵⟶𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐺 ∘ 𝐹):𝐼⟶𝐶)
10	8, 9	sylan 580	. . . . 5 ⊢ ((𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐺 ∘ 𝐹):𝐼⟶𝐶)
11	10	3adant1 1130	. . . 4 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐺 ∘ 𝐹):𝐼⟶𝐶)
12		dmfex 7884	. . . 4 ⊢ (((𝐺 ∘ 𝐹) ∈ V ∧ (𝐺 ∘ 𝐹):𝐼⟶𝐶) → 𝐼 ∈ V)
13	7, 11, 12	syl2anr 597	. . 3 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) ∧ (𝐺 ∘ 𝐹) LIndF 𝑇) → 𝐼 ∈ V)
14	13	ex 412	. 2 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶 ∧ 𝐹:𝐼⟶𝐵) → ((𝐺 ∘ 𝐹) LIndF 𝑇 → 𝐼 ∈ V))
15		eldifi 4097	. . . . . . . . 9 ⊢ (𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) → 𝑘 ∈ (Base‘(Scalar‘𝑆)))
16		simpllr 775	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → 𝐺:𝐵–1-1→𝐶)
17		lmhmlmod1 20947	. . . . . . . . . . . . . . 15 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
18	17	ad3antrrr 730	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → 𝑆 ∈ LMod)
19		simprr 772	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → 𝑘 ∈ (Base‘(Scalar‘𝑆)))
20		simprl 770	. . . . . . . . . . . . . . 15 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝐹:𝐼⟶𝐵)
21		simpl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆))) → 𝑥 ∈ 𝐼)
22		ffvelcdm 7056	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:𝐼⟶𝐵 ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ 𝐵)
23	20, 21, 22	syl2an 596	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐹‘𝑥) ∈ 𝐵)
24		lindfmm.b	. . . . . . . . . . . . . . 15 ⊢ 𝐵 = (Base‘𝑆)
25		eqid 2730	. . . . . . . . . . . . . . 15 ⊢ (Scalar‘𝑆) = (Scalar‘𝑆)
26		eqid 2730	. . . . . . . . . . . . . . 15 ⊢ ( ·_𝑠 ‘𝑆) = ( ·_𝑠 ‘𝑆)
27		eqid 2730	. . . . . . . . . . . . . . 15 ⊢ (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑆))
28	24, 25, 26, 27	lmodvscl 20791	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ∈ LMod ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)) ∧ (𝐹‘𝑥) ∈ 𝐵) → (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ 𝐵)
29	18, 19, 23, 28	syl3anc 1373	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ 𝐵)
30		imassrn 6045	. . . . . . . . . . . . . . . 16 ⊢ (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ ran 𝐹
31		frn 6698	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹:𝐼⟶𝐵 → ran 𝐹 ⊆ 𝐵)
32	31	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V) → ran 𝐹 ⊆ 𝐵)
33	30, 32	sstrid 3961	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V) → (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ 𝐵)
34	33	ad2antlr 727	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ 𝐵)
35		eqid 2730	. . . . . . . . . . . . . . 15 ⊢ (LSpan‘𝑆) = (LSpan‘𝑆)
36	24, 35	lspssv 20896	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ∈ LMod ∧ (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ 𝐵) → ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ⊆ 𝐵)
37	18, 34, 36	syl2anc 584	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ⊆ 𝐵)
38		f1elima 7241	. . . . . . . . . . . . 13 ⊢ ((𝐺:𝐵–1-1→𝐶 ∧ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ 𝐵 ∧ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ⊆ 𝐵) → ((𝐺‘(𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥))) ∈ (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) ↔ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))))
39	16, 29, 37, 38	syl3anc 1373	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((𝐺‘(𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥))) ∈ (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) ↔ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))))
40		simplll 774	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → 𝐺 ∈ (𝑆 LMHom 𝑇))
41		eqid 2730	. . . . . . . . . . . . . . . 16 ⊢ ( ·_𝑠 ‘𝑇) = ( ·_𝑠 ‘𝑇)
42	25, 27, 24, 26, 41	lmhmlin 20949	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)) ∧ (𝐹‘𝑥) ∈ 𝐵) → (𝐺‘(𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥))) = (𝑘( ·_𝑠 ‘𝑇)(𝐺‘(𝐹‘𝑥))))
43	40, 19, 23, 42	syl3anc 1373	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐺‘(𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥))) = (𝑘( ·_𝑠 ‘𝑇)(𝐺‘(𝐹‘𝑥))))
44		ffn 6691	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹:𝐼⟶𝐵 → 𝐹 Fn 𝐼)
45	44	ad2antrl 728	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝐹 Fn 𝐼)
46		fvco2 6961	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹 Fn 𝐼 ∧ 𝑥 ∈ 𝐼) → ((𝐺 ∘ 𝐹)‘𝑥) = (𝐺‘(𝐹‘𝑥)))
47	45, 21, 46	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((𝐺 ∘ 𝐹)‘𝑥) = (𝐺‘(𝐹‘𝑥)))
48	47	oveq2d 7406	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) = (𝑘( ·_𝑠 ‘𝑇)(𝐺‘(𝐹‘𝑥))))
49	43, 48	eqtr4d 2768	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐺‘(𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥))) = (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)))
50		eqid 2730	. . . . . . . . . . . . . . . 16 ⊢ (LSpan‘𝑇) = (LSpan‘𝑇)
51	24, 35, 50	lmhmlsp 20963	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ 𝐵) → (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) = ((LSpan‘𝑇)‘(𝐺 “ (𝐹 “ (𝐼 ∖ {𝑥})))))
52	40, 34, 51	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) = ((LSpan‘𝑇)‘(𝐺 “ (𝐹 “ (𝐼 ∖ {𝑥})))))
53		imaco 6227	. . . . . . . . . . . . . . 15 ⊢ ((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})) = (𝐺 “ (𝐹 “ (𝐼 ∖ {𝑥})))
54	53	fveq2i 6864	. . . . . . . . . . . . . 14 ⊢ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥}))) = ((LSpan‘𝑇)‘(𝐺 “ (𝐹 “ (𝐼 ∖ {𝑥}))))
55	52, 54	eqtr4di 2783	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) = ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥}))))
56	49, 55	eleq12d 2823	. . . . . . . . . . . 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 593	. . . . . . . 8 ⊢ (((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))})) → (¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
61	60	ralbidva 3155	. . . . . . 7 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) → (∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) ¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
62		eqid 2730	. . . . . . . . . . . 12 ⊢ (Scalar‘𝑇) = (Scalar‘𝑇)
63	25, 62	lmhmsca 20944	. . . . . . . . . . 11 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑇) = (Scalar‘𝑆))
64	63	fveq2d 6865	. . . . . . . . . 10 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑆)))
65	63	fveq2d 6865	. . . . . . . . . . 11 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → (0_g‘(Scalar‘𝑇)) = (0_g‘(Scalar‘𝑆)))
66	65	sneqd 4604	. . . . . . . . . 10 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → {(0_g‘(Scalar‘𝑇))} = {(0_g‘(Scalar‘𝑆))})
67	64, 66	difeq12d 4093	. . . . . . . . 9 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → ((Base‘(Scalar‘𝑇)) ∖ {(0_g‘(Scalar‘𝑇))}) = ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}))
68	67	ad3antrrr 730	. . . . . . . 8 ⊢ ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) → ((Base‘(Scalar‘𝑇)) ∖ {(0_g‘(Scalar‘𝑇))}) = ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}))
69	68	raleqdv 3301	. . . . . . 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 3155	. . . . 5 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → (∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) ¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑇)) ∖ {(0_g‘(Scalar‘𝑇))}) ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
72	17	ad2antrr 726	. . . . . 6 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝑆 ∈ LMod)
73		simprr 772	. . . . . 6 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝐼 ∈ V)
74		eqid 2730	. . . . . . 7 ⊢ (0_g‘(Scalar‘𝑆)) = (0_g‘(Scalar‘𝑆))
75	24, 26, 35, 25, 27, 74	islindf2 21730	. . . . . 6 ⊢ ((𝑆 ∈ LMod ∧ 𝐼 ∈ V ∧ 𝐹:𝐼⟶𝐵) → (𝐹 LIndF 𝑆 ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) ¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))))
76	72, 73, 20, 75	syl3anc 1373	. . . . 5 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → (𝐹 LIndF 𝑆 ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0_g‘(Scalar‘𝑆))}) ¬ (𝑘( ·_𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))))
77		lmhmlmod2 20946	. . . . . . 7 ⊢ (𝐺 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
78	77	ad2antrr 726	. . . . . 6 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝑇 ∈ LMod)
79	10	ad2ant2lr 748	. . . . . 6 ⊢ (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵–1-1→𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → (𝐺 ∘ 𝐹):𝐼⟶𝐶)
80		lindfmm.c	. . . . . . 7 ⊢ 𝐶 = (Base‘𝑇)
81		eqid 2730	. . . . . . 7 ⊢ (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑇))
82		eqid 2730	. . . . . . 7 ⊢ (0_g‘(Scalar‘𝑇)) = (0_g‘(Scalar‘𝑇))
83	80, 41, 50, 62, 81, 82	islindf2 21730	. . . . . 6 ⊢ ((𝑇 ∈ LMod ∧ 𝐼 ∈ V ∧ (𝐺 ∘ 𝐹):𝐼⟶𝐶) → ((𝐺 ∘ 𝐹) LIndF 𝑇 ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑇)) ∖ {(0_g‘(Scalar‘𝑇))}) ¬ (𝑘( ·_𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
84	78, 73, 79, 83	syl3anc 1373	. . . . 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 1117	. 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 1086 = wceq 1540 ∈ wcel 2109 ∀wral 3045 Vcvv 3450 ∖ cdif 3914 ⊆ wss 3917 {csn 4592 class class class wbr 5110 ran crn 5642 “ cima 5644 ∘ ccom 5645 Fn wfn 6509 ⟶wf 6510 –1-1→wf1 6511 ‘cfv 6514 (class class class)co 7390 Basecbs 17186 Scalarcsca 17230 ·_𝑠 cvsca 17231 0_gc0g 17409 LModclmod 20773 LSpanclspn 20884 LMHom clmhm 20933 LIndF clindf 21720

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-er 8674 df-map 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-2 12256 df-sets 17141 df-slot 17159 df-ndx 17171 df-base 17187 df-ress 17208 df-plusg 17240 df-0g 17411 df-mgm 18574 df-sgrp 18653 df-mnd 18669 df-grp 18875 df-minusg 18876 df-sbg 18877 df-subg 19062 df-ghm 19152 df-mgp 20057 df-ur 20098 df-ring 20151 df-lmod 20775 df-lss 20845 df-lsp 20885 df-lmhm 20936 df-lindf 21722

This theorem is referenced by: lindsmm 21744

W3C validator