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

Theorem lindfmm 22177
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.
StepHypRef Expression
1 rellindf 22158 . . . . 5 Rel LIndF
21brrelex1i 5712 . . . 4 (𝐹 LIndF 𝑆 → 𝐹 ∈ V)
3 simp3 1156 . . . 4 ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶 ∧ 𝐹:𝐼⟶𝐵) → 𝐹:𝐼⟶𝐵)
4 dmfex 7949 . . . 4 ((𝐹 ∈ V ∧ 𝐹:𝐼⟶𝐵) → 𝐼 ∈ V)
52, 3, 4syl2anr 609 . . 3 (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶 ∧ 𝐹:𝐼⟶𝐵) ∧ 𝐹 LIndF 𝑆) → 𝐼 ∈ V)
65ex 418 . 2 ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐹 LIndF 𝑆 → 𝐼 ∈ V))
71brrelex1i 5712 . . . 4 ((𝐺 ∘ 𝐹) LIndF 𝑇 → (𝐺 ∘ 𝐹) ∈ V)
8 f1f 6806 . . . . . 6 (𝐺:𝐵⟶1-1𝐶 → 𝐺:𝐵⟶𝐶)
9 fco 6762 . . . . . 6 ((𝐺:𝐵⟶𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐺 ∘ 𝐹):𝐼⟶𝐶)
108, 9sylan 592 . . . . 5 ((𝐺:𝐵⟶1-1𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐺 ∘ 𝐹):𝐼⟶𝐶)
11103adant1 1148 . . . 4 ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐺 ∘ 𝐹):𝐼⟶𝐶)
12 dmfex 7949 . . . 4 (((𝐺 ∘ 𝐹) ∈ V ∧ (𝐺 ∘ 𝐹):𝐼⟶𝐶) → 𝐼 ∈ V)
137, 11, 12syl2anr 609 . . 3 (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶 ∧ 𝐹:𝐼⟶𝐵) ∧ (𝐺 ∘ 𝐹) LIndF 𝑇) → 𝐼 ∈ V)
1413ex 418 . 2 ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶 ∧ 𝐹:𝐼⟶𝐵) → ((𝐺 ∘ 𝐹) LIndF 𝑇 → 𝐼 ∈ V))
15 eldifi 4070 . . . . . . . . 9 (𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0g‘(Scalar‘𝑆))}) → 𝑘 ∈ (Base‘(Scalar‘𝑆)))
16 simpllr 788 . . . . . . . . . . . . 13 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → 𝐺:𝐵⟶1-1𝐶)
17 lmhmlmod1 21350 . . . . . . . . . . . . . . 15 (𝐺 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
1817ad3antrrr 743 . . . . . . . . . . . . . 14 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → 𝑆 ∈ LMod)
19 simprr 785 . . . . . . . . . . . . . 14 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → 𝑘 ∈ (Base‘(Scalar‘𝑆)))
20 simprl 783 . . . . . . . . . . . . . . 15 (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝐹:𝐼⟶𝐵)
21 simpl 488 . . . . . . . . . . . . . . 15 ((𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆))) → 𝑥 ∈ 𝐼)
22 ffvelcdm 7111 . . . . . . . . . . . . . . 15 ((𝐹:𝐼⟶𝐵 ∧ 𝑥 ∈ 𝐼) → (𝐹‘𝑥) ∈ 𝐵)
2320, 21, 22syl2an 608 . . . . . . . . . . . . . 14 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐹‘𝑥) ∈ 𝐵)
24 lindfmm.b . . . . . . . . . . . . . . 15 𝐵 = (Base‘𝑆)
25 eqid 2763 . . . . . . . . . . . . . . 15 (Scalar‘𝑆) = (Scalar‘𝑆)
26 eqid 2763 . . . . . . . . . . . . . . 15 ( ·𝑠 ‘𝑆) = ( ·𝑠 ‘𝑆)
27 eqid 2763 . . . . . . . . . . . . . . 15 (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑆))
2824, 25, 26, 27lmodvscl 21195 . . . . . . . . . . . . . 14 ((𝑆 ∈ LMod ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)) ∧ (𝐹‘𝑥) ∈ 𝐵) → (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ 𝐵)
2918, 19, 23, 28syl3anc 1399 . . . . . . . . . . . . 13 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ 𝐵)
30 imassrn 6214 . . . . . . . . . . . . . . . 16 (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ ran 𝐹
31 frn 6745 . . . . . . . . . . . . . . . . 17 (𝐹:𝐼⟶𝐵 → ran 𝐹 ⊆ 𝐵)
3231adantr 486 . . . . . . . . . . . . . . . 16 ((𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V) → ran 𝐹 ⊆ 𝐵)
3330, 32sstrid 3924 . . . . . . . . . . . . . . 15 ((𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V) → (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ 𝐵)
3433ad2antlr 740 . . . . . . . . . . . . . 14 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ 𝐵)
35 eqid 2763 . . . . . . . . . . . . . . 15 (LSpan‘𝑆) = (LSpan‘𝑆)
3624, 35lspssv 21300 . . . . . . . . . . . . . 14 ((𝑆 ∈ LMod ∧ (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ 𝐵) → ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ⊆ 𝐵)
3718, 34, 36syl2anc 596 . . . . . . . . . . . . 13 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ⊆ 𝐵)
38 f1elima 7296 . . . . . . . . . . . . 13 ((𝐺:𝐵⟶1-1𝐶 ∧ (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ 𝐵 ∧ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ⊆ 𝐵) → ((𝐺‘(𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥))) ∈ (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) ↔ (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))))
3916, 29, 37, 38syl3anc 1399 . . . . . . . . . . . 12 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((𝐺‘(𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥))) ∈ (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) ↔ (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))))
40 simplll 787 . . . . . . . . . . . . . . 15 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → 𝐺 ∈ (𝑆 LMHom 𝑇))
41 eqid 2763 . . . . . . . . . . . . . . . 16 ( ·𝑠 ‘𝑇) = ( ·𝑠 ‘𝑇)
4225, 27, 24, 26, 41lmhmlin 21352 . . . . . . . . . . . . . . 15 ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)) ∧ (𝐹‘𝑥) ∈ 𝐵) → (𝐺‘(𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥))) = (𝑘( ·𝑠 ‘𝑇)(𝐺‘(𝐹‘𝑥))))
4340, 19, 23, 42syl3anc 1399 . . . . . . . . . . . . . 14 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐺‘(𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥))) = (𝑘( ·𝑠 ‘𝑇)(𝐺‘(𝐹‘𝑥))))
44 ffn 6737 . . . . . . . . . . . . . . . . 17 (𝐹:𝐼⟶𝐵 → 𝐹 Fn 𝐼)
4544ad2antrl 741 . . . . . . . . . . . . . . . 16 (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝐹 Fn 𝐼)
46 fvco2 7011 . . . . . . . . . . . . . . . 16 ((𝐹 Fn 𝐼 ∧ 𝑥 ∈ 𝐼) → ((𝐺 ∘ 𝐹)‘𝑥) = (𝐺‘(𝐹‘𝑥)))
4745, 21, 46syl2an 608 . . . . . . . . . . . . . . 15 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((𝐺 ∘ 𝐹)‘𝑥) = (𝐺‘(𝐹‘𝑥)))
4847oveq2d 7465 . . . . . . . . . . . . . 14 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) = (𝑘( ·𝑠 ‘𝑇)(𝐺‘(𝐹‘𝑥))))
4943, 48eqtr4d 2801 . . . . . . . . . . . . 13 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐺‘(𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥))) = (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)))
50 eqid 2763 . . . . . . . . . . . . . . . 16 (LSpan‘𝑇) = (LSpan‘𝑇)
5124, 35, 50lmhmlsp 21366 . . . . . . . . . . . . . . 15 ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ (𝐹 “ (𝐼 ∖ {𝑥})) ⊆ 𝐵) → (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) = ((LSpan‘𝑇)‘(𝐺 “ (𝐹 “ (𝐼 ∖ {𝑥})))))
5240, 34, 51syl2anc 596 . . . . . . . . . . . . . 14 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) = ((LSpan‘𝑇)‘(𝐺 “ (𝐹 “ (𝐼 ∖ {𝑥})))))
53 imaco 6269 . . . . . . . . . . . . . . 15 ((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})) = (𝐺 “ (𝐹 “ (𝐼 ∖ {𝑥})))
5453fveq2i 6917 . . . . . . . . . . . . . 14 ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥}))) = ((LSpan‘𝑇)‘(𝐺 “ (𝐹 “ (𝐼 ∖ {𝑥}))))
5552, 54eqtr4di 2816 . . . . . . . . . . . . 13 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) = ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥}))))
5649, 55eleq12d 2858 . . . . . . . . . . . 12 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((𝐺‘(𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥))) ∈ (𝐺 “ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))) ↔ (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
5739, 56bitr3d 284 . . . . . . . . . . 11 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → ((𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
5857notbid 321 . . . . . . . . . 10 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ (𝑥 ∈ 𝐼 ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆)))) → (¬ (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ¬ (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
5958anassrs 473 . . . . . . . . 9 (((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) ∧ 𝑘 ∈ (Base‘(Scalar‘𝑆))) → (¬ (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ¬ (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
6015, 59sylan2 605 . . . . . . . 8 (((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) ∧ 𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0g‘(Scalar‘𝑆))})) → (¬ (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ¬ (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
6160ralbidva 3187 . . . . . . 7 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) → (∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0g‘(Scalar‘𝑆))}) ¬ (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0g‘(Scalar‘𝑆))}) ¬ (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
62 eqid 2763 . . . . . . . . . . . 12 (Scalar‘𝑇) = (Scalar‘𝑇)
6325, 62lmhmsca 21347 . . . . . . . . . . 11 (𝐺 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑇) = (Scalar‘𝑆))
6463fveq2d 6918 . . . . . . . . . 10 (𝐺 ∈ (𝑆 LMHom 𝑇) → (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑆)))
6563fveq2d 6918 . . . . . . . . . . 11 (𝐺 ∈ (𝑆 LMHom 𝑇) → (0g‘(Scalar‘𝑇)) = (0g‘(Scalar‘𝑆)))
6665sneqd 4596 . . . . . . . . . 10 (𝐺 ∈ (𝑆 LMHom 𝑇) → {(0g‘(Scalar‘𝑇))} = {(0g‘(Scalar‘𝑆))})
6764, 66difeq12d 4067 . . . . . . . . 9 (𝐺 ∈ (𝑆 LMHom 𝑇) → ((Base‘(Scalar‘𝑇)) ∖ {(0g‘(Scalar‘𝑇))}) = ((Base‘(Scalar‘𝑆)) ∖ {(0g‘(Scalar‘𝑆))}))
6867ad3antrrr 743 . . . . . . . 8 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) → ((Base‘(Scalar‘𝑇)) ∖ {(0g‘(Scalar‘𝑇))}) = ((Base‘(Scalar‘𝑆)) ∖ {(0g‘(Scalar‘𝑆))}))
6968raleqdv 3323 . . . . . . 7 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) → (∀𝑘 ∈ ((Base‘(Scalar‘𝑇)) ∖ {(0g‘(Scalar‘𝑇))}) ¬ (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥}))) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0g‘(Scalar‘𝑆))}) ¬ (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
7061, 69bitr4d 285 . . . . . 6 ((((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) ∧ 𝑥 ∈ 𝐼) → (∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0g‘(Scalar‘𝑆))}) ¬ (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ∀𝑘 ∈ ((Base‘(Scalar‘𝑇)) ∖ {(0g‘(Scalar‘𝑇))}) ¬ (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
7170ralbidva 3187 . . . . 5 (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → (∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0g‘(Scalar‘𝑆))}) ¬ (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥}))) ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑇)) ∖ {(0g‘(Scalar‘𝑇))}) ¬ (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
7217ad2antrr 739 . . . . . 6 (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝑆 ∈ LMod)
73 simprr 785 . . . . . 6 (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝐼 ∈ V)
74 eqid 2763 . . . . . . 7 (0g‘(Scalar‘𝑆)) = (0g‘(Scalar‘𝑆))
7524, 26, 35, 25, 27, 74islindf2 22164 . . . . . 6 ((𝑆 ∈ LMod ∧ 𝐼 ∈ V ∧ 𝐹:𝐼⟶𝐵) → (𝐹 LIndF 𝑆 ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0g‘(Scalar‘𝑆))}) ¬ (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))))
7672, 73, 20, 75syl3anc 1399 . . . . 5 (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → (𝐹 LIndF 𝑆 ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑆)) ∖ {(0g‘(Scalar‘𝑆))}) ¬ (𝑘( ·𝑠 ‘𝑆)(𝐹‘𝑥)) ∈ ((LSpan‘𝑆)‘(𝐹 “ (𝐼 ∖ {𝑥})))))
77 lmhmlmod2 21349 . . . . . . 7 (𝐺 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
7877ad2antrr 739 . . . . . 6 (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → 𝑇 ∈ LMod)
7910ad2ant2lr 761 . . . . . 6 (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → (𝐺 ∘ 𝐹):𝐼⟶𝐶)
80 lindfmm.c . . . . . . 7 𝐶 = (Base‘𝑇)
81 eqid 2763 . . . . . . 7 (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑇))
82 eqid 2763 . . . . . . 7 (0g‘(Scalar‘𝑇)) = (0g‘(Scalar‘𝑇))
8380, 41, 50, 62, 81, 82islindf2 22164 . . . . . 6 ((𝑇 ∈ LMod ∧ 𝐼 ∈ V ∧ (𝐺 ∘ 𝐹):𝐼⟶𝐶) → ((𝐺 ∘ 𝐹) LIndF 𝑇 ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑇)) ∖ {(0g‘(Scalar‘𝑇))}) ¬ (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
8478, 73, 79, 83syl3anc 1399 . . . . 5 (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → ((𝐺 ∘ 𝐹) LIndF 𝑇 ↔ ∀𝑥 ∈ 𝐼 ∀𝑘 ∈ ((Base‘(Scalar‘𝑇)) ∖ {(0g‘(Scalar‘𝑇))}) ¬ (𝑘( ·𝑠 ‘𝑇)((𝐺 ∘ 𝐹)‘𝑥)) ∈ ((LSpan‘𝑇)‘((𝐺 ∘ 𝐹) “ (𝐼 ∖ {𝑥})))))
8571, 76, 843bitr4d 314 . . . 4 (((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) ∧ (𝐹:𝐼⟶𝐵 ∧ 𝐼 ∈ V)) → (𝐹 LIndF 𝑆 ↔ (𝐺 ∘ 𝐹) LIndF 𝑇))
8685exp32 426 . . 3 ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶) → (𝐹:𝐼⟶𝐵 → (𝐼 ∈ V → (𝐹 LIndF 𝑆 ↔ (𝐺 ∘ 𝐹) LIndF 𝑇))))
87863impia 1135 . 2 ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐼 ∈ V → (𝐹 LIndF 𝑆 ↔ (𝐺 ∘ 𝐹) LIndF 𝑇)))
886, 14, 87pm5.21ndd 382 1 ((𝐺 ∈ (𝑆 LMHom 𝑇) ∧ 𝐺:𝐵⟶1-1𝐶 ∧ 𝐹:𝐼⟶𝐵) → (𝐹 LIndF 𝑆 ↔ (𝐺 ∘ 𝐹) LIndF 𝑇))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048  {csn 4588   class class class wbr 5106  ran crn 5657   “ cima 5659   ∘ ccom 5660   Fn wfn 6559  ⟶wf 6560  ⟶1-1wf1 6561  ‘cfv 6564  (class class class)co 7449  Basecbs 17428  Scalarcsca 17472   ·𝑠 cvsca 17473  0gc0g 17651  LModclmod 21177  LSpanclspn 21288   LMHom clmhm 21336   LIndF clindf 22154
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7781  ax-cnex 11293  ax-resscn 11294  ax-1cn 11295  ax-icn 11296  ax-addcl 11297  ax-addrcl 11298  ax-mulcl 11299  ax-mulrcl 11300  ax-mulcom 11301  ax-addass 11302  ax-mulass 11303  ax-distr 11304  ax-i2m1 11305  ax-1ne0 11306  ax-1rid 11307  ax-rnegex 11308  ax-rrecex 11309  ax-cnre 11310  ax-pre-lttri 11311  ax-pre-lttrn 11312  ax-pre-ltadd 11313  ax-pre-mulgt0 11314
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6328  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-riota 7406  df-ov 7452  df-oprab 7453  df-mpo 7454  df-om 7910  df-1st 8033  df-2nd 8034  df-frecs 8335  df-wrecs 8366  df-recs 8415  df-rdg 8454  df-er 8753  df-map 8885  df-en 9010  df-dom 9011  df-sdom 9012  df-pnf 11382  df-mnf 11383  df-xr 11384  df-ltxr 11385  df-le 11386  df-sub 11580  df-neg 11581  df-nn 12374  df-2 12443  df-sets 17383  df-slot 17401  df-ndx 17413  df-base 17429  df-ress 17450  df-plusg 17482  df-0g 17653  df-mgm 18857  df-sgrp 18949  df-mnd 18965  df-grp 19188  df-minusg 19189  df-sbg 19190  df-subg 19374  df-ghm 19469  df-mgp 20403  df-ur 20450  df-ring 20503  df-lmod 21179  df-lss 21249  df-lsp 21289  df-lmhm 21339  df-lindf 22156
This theorem is used by:  lindsmm  22178
  Copyright terms: Public domain W3C validator