Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  linc1 Structured version   Visualization version   GIF version

Theorem linc1 49929
Description: A vector is a linear combination of a set containing this vector. (Contributed by AV, 18-Apr-2019.) (Proof shortened by AV, 28-Jul-2019.)
Hypotheses
Ref Expression
linc1.b 𝐵 = (Base‘𝑀)
linc1.s 𝑆 = (Scalar‘𝑀)
linc1.0 0 = (0g‘𝑆)
linc1.1 1 = (1r‘𝑆)
linc1.f 𝐹 = (𝑥 ∈ 𝑉 ↦ if(𝑥 = 𝑋, 1 , 0 ))
Assertion
Ref Expression
linc1 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → (𝐹( linC ‘𝑀)𝑉) = 𝑋)
Distinct variable groups:   𝑥,𝐵   𝑥,𝑀   𝑥,𝑉   𝑥,𝑋   𝑥, 0   𝑥, 1
Allowed substitution hints:   𝑆(𝑥)   𝐹(𝑥)

Proof of Theorem linc1
Dummy variables 𝑣 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp1 1154 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → 𝑀 ∈ LMod)
2 linc1.s . . . . . . . . . 10 𝑆 = (Scalar‘𝑀)
32lmodring 21194 . . . . . . . . 9 (𝑀 ∈ LMod → 𝑆 ∈ Ring)
42eqcomi 2772 . . . . . . . . . . . 12 (Scalar‘𝑀) = 𝑆
54fveq2i 6919 . . . . . . . . . . 11 (Base‘(Scalar‘𝑀)) = (Base‘𝑆)
6 linc1.1 . . . . . . . . . . 11 1 = (1r‘𝑆)
75, 6ringidcl 20545 . . . . . . . . . 10 (𝑆 ∈ Ring → 1 ∈ (Base‘(Scalar‘𝑀)))
8 linc1.0 . . . . . . . . . . 11 0 = (0g‘𝑆)
95, 8ring0cl 20547 . . . . . . . . . 10 (𝑆 ∈ Ring → 0 ∈ (Base‘(Scalar‘𝑀)))
107, 9jca 521 . . . . . . . . 9 (𝑆 ∈ Ring → ( 1 ∈ (Base‘(Scalar‘𝑀)) ∧ 0 ∈ (Base‘(Scalar‘𝑀))))
113, 10syl 18 . . . . . . . 8 (𝑀 ∈ LMod → ( 1 ∈ (Base‘(Scalar‘𝑀)) ∧ 0 ∈ (Base‘(Scalar‘𝑀))))
12113ad2ant1 1151 . . . . . . 7 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → ( 1 ∈ (Base‘(Scalar‘𝑀)) ∧ 0 ∈ (Base‘(Scalar‘𝑀))))
1312adantr 486 . . . . . 6 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → ( 1 ∈ (Base‘(Scalar‘𝑀)) ∧ 0 ∈ (Base‘(Scalar‘𝑀))))
14 ifcl 4531 . . . . . 6 (( 1 ∈ (Base‘(Scalar‘𝑀)) ∧ 0 ∈ (Base‘(Scalar‘𝑀))) → if(𝑥 = 𝑋, 1 , 0 ) ∈ (Base‘(Scalar‘𝑀)))
1513, 14syl 18 . . . . 5 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → if(𝑥 = 𝑋, 1 , 0 ) ∈ (Base‘(Scalar‘𝑀)))
16 linc1.f . . . . 5 𝐹 = (𝑥 ∈ 𝑉 ↦ if(𝑥 = 𝑋, 1 , 0 ))
1715, 16fmptd 7146 . . . 4 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → 𝐹:𝑉⟶(Base‘(Scalar‘𝑀)))
18 fvex 6929 . . . . 5 (Base‘(Scalar‘𝑀)) ∈ V
19 simp2 1155 . . . . 5 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → 𝑉 ∈ 𝒫 𝐵)
20 elmapg 8897 . . . . 5 (((Base‘(Scalar‘𝑀)) ∈ V ∧ 𝑉 ∈ 𝒫 𝐵) → (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ↔ 𝐹:𝑉⟶(Base‘(Scalar‘𝑀))))
2118, 19, 20sylancr 599 . . . 4 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → (𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ↔ 𝐹:𝑉⟶(Base‘(Scalar‘𝑀))))
2217, 21mpbird 260 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉))
23 linc1.b . . . . . . 7 𝐵 = (Base‘𝑀)
2423pweqi 4576 . . . . . 6 𝒫 𝐵 = 𝒫 (Base‘𝑀)
2524eleq2i 2856 . . . . 5 (𝑉 ∈ 𝒫 𝐵 ↔ 𝑉 ∈ 𝒫 (Base‘𝑀))
2625biimpi 219 . . . 4 (𝑉 ∈ 𝒫 𝐵 → 𝑉 ∈ 𝒫 (Base‘𝑀))
27263ad2ant2 1152 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → 𝑉 ∈ 𝒫 (Base‘𝑀))
28 lincval 49913 . . 3 ((𝑀 ∈ LMod ∧ 𝐹 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑉) ∧ 𝑉 ∈ 𝒫 (Base‘𝑀)) → (𝐹( linC ‘𝑀)𝑉) = (𝑀 Σg (𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦))))
291, 22, 27, 28syl3anc 1399 . 2 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → (𝐹( linC ‘𝑀)𝑉) = (𝑀 Σg (𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦))))
30 eqid 2763 . . 3 (0g‘𝑀) = (0g‘𝑀)
31 lmodgrp 21193 . . . . 5 (𝑀 ∈ LMod → 𝑀 ∈ Grp)
3231grpmndd 19207 . . . 4 (𝑀 ∈ LMod → 𝑀 ∈ Mnd)
33323ad2ant1 1151 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → 𝑀 ∈ Mnd)
34 simp3 1156 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝑉)
351adantr 486 . . . . 5 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑦 ∈ 𝑉) → 𝑀 ∈ LMod)
36 eqeq1 2767 . . . . . . . 8 (𝑥 = 𝑦 → (𝑥 = 𝑋 ↔ 𝑦 = 𝑋))
3736ifbid 4509 . . . . . . 7 (𝑥 = 𝑦 → if(𝑥 = 𝑋, 1 , 0 ) = if(𝑦 = 𝑋, 1 , 0 ))
38 simpr 490 . . . . . . 7 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑦 ∈ 𝑉) → 𝑦 ∈ 𝑉)
39 eqid 2763 . . . . . . . . . . 11 (Base‘𝑆) = (Base‘𝑆)
402, 39, 6lmod1cl 21215 . . . . . . . . . 10 (𝑀 ∈ LMod → 1 ∈ (Base‘𝑆))
41403ad2ant1 1151 . . . . . . . . 9 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → 1 ∈ (Base‘𝑆))
4241adantr 486 . . . . . . . 8 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑦 ∈ 𝑉) → 1 ∈ (Base‘𝑆))
432, 39, 8lmod0cl 21214 . . . . . . . . . 10 (𝑀 ∈ LMod → 0 ∈ (Base‘𝑆))
44433ad2ant1 1151 . . . . . . . . 9 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → 0 ∈ (Base‘𝑆))
4544adantr 486 . . . . . . . 8 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑦 ∈ 𝑉) → 0 ∈ (Base‘𝑆))
4642, 45ifcld 4532 . . . . . . 7 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑦 ∈ 𝑉) → if(𝑦 = 𝑋, 1 , 0 ) ∈ (Base‘𝑆))
4716, 37, 38, 46fvmptd3 7048 . . . . . 6 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑦 ∈ 𝑉) → (𝐹‘𝑦) = if(𝑦 = 𝑋, 1 , 0 ))
4847, 46eqeltrd 2864 . . . . 5 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑦 ∈ 𝑉) → (𝐹‘𝑦) ∈ (Base‘𝑆))
49 elelpwi 4570 . . . . . . . 8 ((𝑦 ∈ 𝑉 ∧ 𝑉 ∈ 𝒫 𝐵) → 𝑦 ∈ 𝐵)
5049expcom 419 . . . . . . 7 (𝑉 ∈ 𝒫 𝐵 → (𝑦 ∈ 𝑉 → 𝑦 ∈ 𝐵))
51503ad2ant2 1152 . . . . . 6 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → (𝑦 ∈ 𝑉 → 𝑦 ∈ 𝐵))
5251imp 412 . . . . 5 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑦 ∈ 𝑉) → 𝑦 ∈ 𝐵)
53 eqid 2763 . . . . . 6 ( ·𝑠 ‘𝑀) = ( ·𝑠 ‘𝑀)
5423, 2, 53, 39lmodvscl 21204 . . . . 5 ((𝑀 ∈ LMod ∧ (𝐹‘𝑦) ∈ (Base‘𝑆) ∧ 𝑦 ∈ 𝐵) → ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵)
5535, 48, 52, 54syl3anc 1399 . . . 4 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑦 ∈ 𝑉) → ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦) ∈ 𝐵)
56 eqid 2763 . . . 4 (𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦)) = (𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦))
5755, 56fmptd 7146 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → (𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦)):𝑉⟶𝐵)
58 fveq2 6916 . . . . . . 7 (𝑦 = 𝑣 → (𝐹‘𝑦) = (𝐹‘𝑣))
59 id 23 . . . . . . 7 (𝑦 = 𝑣 → 𝑦 = 𝑣)
6058, 59oveq12d 7469 . . . . . 6 (𝑦 = 𝑣 → ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦) = ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣))
6160cbvmptv 5215 . . . . 5 (𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦)) = (𝑣 ∈ 𝑉 ↦ ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣))
62 fvexd 6931 . . . . 5 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → (0g‘𝑀) ∈ V)
63 ovexd 7486 . . . . 5 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉) → ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) ∈ V)
6461, 19, 62, 63mptsuppd 8242 . . . 4 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → ((𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦)) supp (0g‘𝑀)) = {𝑣 ∈ 𝑉 ∣ ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) ≠ (0g‘𝑀)})
65 2a1 29 . . . . . . 7 (𝑣 = 𝑋 → (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉) → (((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) ≠ (0g‘𝑀) → 𝑣 = 𝑋)))
66 simprr 785 . . . . . . . . . . . . . 14 ((¬ 𝑣 = 𝑋 ∧ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉)) → 𝑣 ∈ 𝑉)
676fvexi 6930 . . . . . . . . . . . . . . 15 1 ∈ V
688fvexi 6930 . . . . . . . . . . . . . . 15 0 ∈ V
6967, 68ifex 4536 . . . . . . . . . . . . . 14 if(𝑣 = 𝑋, 1 , 0 ) ∈ V
70 eqeq1 2767 . . . . . . . . . . . . . . . 16 (𝑥 = 𝑣 → (𝑥 = 𝑋 ↔ 𝑣 = 𝑋))
7170ifbid 4509 . . . . . . . . . . . . . . 15 (𝑥 = 𝑣 → if(𝑥 = 𝑋, 1 , 0 ) = if(𝑣 = 𝑋, 1 , 0 ))
7271, 16fvmptg 7022 . . . . . . . . . . . . . 14 ((𝑣 ∈ 𝑉 ∧ if(𝑣 = 𝑋, 1 , 0 ) ∈ V) → (𝐹‘𝑣) = if(𝑣 = 𝑋, 1 , 0 ))
7366, 69, 72sylancl 598 . . . . . . . . . . . . 13 ((¬ 𝑣 = 𝑋 ∧ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉)) → (𝐹‘𝑣) = if(𝑣 = 𝑋, 1 , 0 ))
74 iffalse 4494 . . . . . . . . . . . . . 14 (¬ 𝑣 = 𝑋 → if(𝑣 = 𝑋, 1 , 0 ) = 0 )
7574adantr 486 . . . . . . . . . . . . 13 ((¬ 𝑣 = 𝑋 ∧ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉)) → if(𝑣 = 𝑋, 1 , 0 ) = 0 )
7673, 75eqtrd 2798 . . . . . . . . . . . 12 ((¬ 𝑣 = 𝑋 ∧ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉)) → (𝐹‘𝑣) = 0 )
7776oveq1d 7466 . . . . . . . . . . 11 ((¬ 𝑣 = 𝑋 ∧ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉)) → ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) = ( 0 ( ·𝑠 ‘𝑀)𝑣))
781adantr 486 . . . . . . . . . . . . 13 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉) → 𝑀 ∈ LMod)
7978adantl 487 . . . . . . . . . . . 12 ((¬ 𝑣 = 𝑋 ∧ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉)) → 𝑀 ∈ LMod)
80 elelpwi 4570 . . . . . . . . . . . . . . . 16 ((𝑣 ∈ 𝑉 ∧ 𝑉 ∈ 𝒫 𝐵) → 𝑣 ∈ 𝐵)
8180expcom 419 . . . . . . . . . . . . . . 15 (𝑉 ∈ 𝒫 𝐵 → (𝑣 ∈ 𝑉 → 𝑣 ∈ 𝐵))
82813ad2ant2 1152 . . . . . . . . . . . . . 14 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → (𝑣 ∈ 𝑉 → 𝑣 ∈ 𝐵))
8382imp 412 . . . . . . . . . . . . 13 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉) → 𝑣 ∈ 𝐵)
8483adantl 487 . . . . . . . . . . . 12 ((¬ 𝑣 = 𝑋 ∧ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉)) → 𝑣 ∈ 𝐵)
8523, 2, 53, 8, 30lmod0vs 21221 . . . . . . . . . . . 12 ((𝑀 ∈ LMod ∧ 𝑣 ∈ 𝐵) → ( 0 ( ·𝑠 ‘𝑀)𝑣) = (0g‘𝑀))
8679, 84, 85syl2anc 596 . . . . . . . . . . 11 ((¬ 𝑣 = 𝑋 ∧ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉)) → ( 0 ( ·𝑠 ‘𝑀)𝑣) = (0g‘𝑀))
8777, 86eqtrd 2798 . . . . . . . . . 10 ((¬ 𝑣 = 𝑋 ∧ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉)) → ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) = (0g‘𝑀))
8887neeq1d 3018 . . . . . . . . 9 ((¬ 𝑣 = 𝑋 ∧ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉)) → (((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) ≠ (0g‘𝑀) ↔ (0g‘𝑀) ≠ (0g‘𝑀)))
89 eqneqall 2970 . . . . . . . . . 10 ((0g‘𝑀) = (0g‘𝑀) → ((0g‘𝑀) ≠ (0g‘𝑀) → 𝑣 = 𝑋))
9030, 89ax-mp 5 . . . . . . . . 9 ((0g‘𝑀) ≠ (0g‘𝑀) → 𝑣 = 𝑋)
9188, 90biimtrdi 256 . . . . . . . 8 ((¬ 𝑣 = 𝑋 ∧ ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉)) → (((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) ≠ (0g‘𝑀) → 𝑣 = 𝑋))
9291ex 418 . . . . . . 7 (¬ 𝑣 = 𝑋 → (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉) → (((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) ≠ (0g‘𝑀) → 𝑣 = 𝑋)))
9365, 92pm2.61i 184 . . . . . 6 (((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) ∧ 𝑣 ∈ 𝑉) → (((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) ≠ (0g‘𝑀) → 𝑣 = 𝑋))
9493ralrimiva 3158 . . . . 5 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → ∀𝑣 ∈ 𝑉 (((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) ≠ (0g‘𝑀) → 𝑣 = 𝑋))
95 rabsssn 4630 . . . . 5 ({𝑣 ∈ 𝑉 ∣ ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) ≠ (0g‘𝑀)} ⊆ {𝑋} ↔ ∀𝑣 ∈ 𝑉 (((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) ≠ (0g‘𝑀) → 𝑣 = 𝑋))
9694, 95sylibr 237 . . . 4 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → {𝑣 ∈ 𝑉 ∣ ((𝐹‘𝑣)( ·𝑠 ‘𝑀)𝑣) ≠ (0g‘𝑀)} ⊆ {𝑋})
9764, 96eqsstrd 3947 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → ((𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦)) supp (0g‘𝑀)) ⊆ {𝑋})
9823, 30, 33, 19, 34, 57, 97gsumpt 20227 . 2 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → (𝑀 Σg (𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦))) = ((𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦))‘𝑋))
99 ovex 7484 . . . 4 ((𝐹‘𝑋)( ·𝑠 ‘𝑀)𝑋) ∈ V
100 fveq2 6916 . . . . . 6 (𝑦 = 𝑋 → (𝐹‘𝑦) = (𝐹‘𝑋))
101 id 23 . . . . . 6 (𝑦 = 𝑋 → 𝑦 = 𝑋)
102100, 101oveq12d 7469 . . . . 5 (𝑦 = 𝑋 → ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦) = ((𝐹‘𝑋)( ·𝑠 ‘𝑀)𝑋))
103102, 56fvmptg 7022 . . . 4 ((𝑋 ∈ 𝑉 ∧ ((𝐹‘𝑋)( ·𝑠 ‘𝑀)𝑋) ∈ V) → ((𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦))‘𝑋) = ((𝐹‘𝑋)( ·𝑠 ‘𝑀)𝑋))
10434, 99, 103sylancl 598 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → ((𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦))‘𝑋) = ((𝐹‘𝑋)( ·𝑠 ‘𝑀)𝑋))
105 iftrue 4491 . . . . . 6 (𝑥 = 𝑋 → if(𝑥 = 𝑋, 1 , 0 ) = 1 )
106105, 16fvmptg 7022 . . . . 5 ((𝑋 ∈ 𝑉 ∧ 1 ∈ V) → (𝐹‘𝑋) = 1 )
10734, 67, 106sylancl 598 . . . 4 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → (𝐹‘𝑋) = 1 )
108107oveq1d 7466 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → ((𝐹‘𝑋)( ·𝑠 ‘𝑀)𝑋) = ( 1 ( ·𝑠 ‘𝑀)𝑋))
109 elelpwi 4570 . . . . . 6 ((𝑋 ∈ 𝑉 ∧ 𝑉 ∈ 𝒫 𝐵) → 𝑋 ∈ 𝐵)
110109ancoms 464 . . . . 5 ((𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝐵)
1111103adant1 1148 . . . 4 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → 𝑋 ∈ 𝐵)
11223, 2, 53, 6lmodvs1 21216 . . . 4 ((𝑀 ∈ LMod ∧ 𝑋 ∈ 𝐵) → ( 1 ( ·𝑠 ‘𝑀)𝑋) = 𝑋)
1131, 111, 112syl2anc 596 . . 3 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → ( 1 ( ·𝑠 ‘𝑀)𝑋) = 𝑋)
114104, 108, 1133eqtrd 2802 . 2 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → ((𝑦 ∈ 𝑉 ↦ ((𝐹‘𝑦)( ·𝑠 ‘𝑀)𝑦))‘𝑋) = 𝑋)
11529, 98, 1143eqtrd 2802 1 ((𝑀 ∈ LMod ∧ 𝑉 ∈ 𝒫 𝐵 ∧ 𝑋 ∈ 𝑉) → (𝐹( linC ‘𝑀)𝑉) = 𝑋)
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   ≠ wne 2959  ∀wral 3080  {crab 3416  Vcvv 3454   ⊆ wss 3900  ifcif 4485  𝒫 cpw 4560  {csn 4588   ↦ cmpt 5192  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451   supp csupp 8214   ↑m cmap 8885  Basecbs 17431  Scalarcsca 17475   ·𝑠 cvsca 17476  0gc0g 17660   Σg cgsu 17661  Mndcmnd 18973  1rcur 20458  Ringcrg 20510  LModclmod 21186   linC clinc 49908
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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
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 4841  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-supp 8215  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-2o 8515  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-fsupp 9392  df-oi 9541  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-n0 12647  df-z 12734  df-uz 13006  df-fz 13680  df-fzo 13829  df-seq 14185  df-hash 14516  df-sets 17386  df-slot 17404  df-ndx 17416  df-base 17432  df-ress 17453  df-plusg 17486  df-0g 17662  df-gsum 17663  df-mre 17806  df-mrc 17807  df-acs 17809  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-submnd 19029  df-grp 19197  df-mulg 19328  df-cntz 19582  df-cmn 20047  df-mgp 20412  df-ur 20459  df-ring 20512  df-lmod 21188  df-linc 49910
This theorem is used by:  lcoss  49940
  Copyright terms: Public domain W3C validator