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

Theorem lincop 46479
Description: A linear combination as operation. (Contributed by AV, 30-Mar-2019.)
Assertion
Ref Expression
lincop (𝑀𝑋 → ( linC ‘𝑀) = (𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑣), 𝑣 ∈ 𝒫 (Base‘𝑀) ↦ (𝑀 Σg (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑀)𝑥)))))
Distinct variable groups:   𝑀,𝑠,𝑣,𝑥   𝑣,𝑋
Allowed substitution hints:   𝑋(𝑥,𝑠)

Proof of Theorem lincop
Dummy variable 𝑚 is distinct from all other variables.
StepHypRef Expression
1 df-linc 46477 . 2 linC = (𝑚 ∈ V ↦ (𝑠 ∈ ((Base‘(Scalar‘𝑚)) ↑m 𝑣), 𝑣 ∈ 𝒫 (Base‘𝑚) ↦ (𝑚 Σg (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑚)𝑥)))))
2 2fveq3 6847 . . . 4 (𝑚 = 𝑀 → (Base‘(Scalar‘𝑚)) = (Base‘(Scalar‘𝑀)))
32oveq1d 7372 . . 3 (𝑚 = 𝑀 → ((Base‘(Scalar‘𝑚)) ↑m 𝑣) = ((Base‘(Scalar‘𝑀)) ↑m 𝑣))
4 fveq2 6842 . . . 4 (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀))
54pweqd 4577 . . 3 (𝑚 = 𝑀 → 𝒫 (Base‘𝑚) = 𝒫 (Base‘𝑀))
6 id 22 . . . 4 (𝑚 = 𝑀𝑚 = 𝑀)
7 fveq2 6842 . . . . . 6 (𝑚 = 𝑀 → ( ·𝑠𝑚) = ( ·𝑠𝑀))
87oveqd 7374 . . . . 5 (𝑚 = 𝑀 → ((𝑠𝑥)( ·𝑠𝑚)𝑥) = ((𝑠𝑥)( ·𝑠𝑀)𝑥))
98mpteq2dv 5207 . . . 4 (𝑚 = 𝑀 → (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑚)𝑥)) = (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑀)𝑥)))
106, 9oveq12d 7375 . . 3 (𝑚 = 𝑀 → (𝑚 Σg (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑚)𝑥))) = (𝑀 Σg (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑀)𝑥))))
113, 5, 10mpoeq123dv 7432 . 2 (𝑚 = 𝑀 → (𝑠 ∈ ((Base‘(Scalar‘𝑚)) ↑m 𝑣), 𝑣 ∈ 𝒫 (Base‘𝑚) ↦ (𝑚 Σg (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑚)𝑥)))) = (𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑣), 𝑣 ∈ 𝒫 (Base‘𝑀) ↦ (𝑀 Σg (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑀)𝑥)))))
12 elex 3463 . 2 (𝑀𝑋𝑀 ∈ V)
13 fvex 6855 . . . 4 (Base‘𝑀) ∈ V
1413pwex 5335 . . 3 𝒫 (Base‘𝑀) ∈ V
15 ovexd 7392 . . . 4 (𝑀𝑋 → ((Base‘(Scalar‘𝑀)) ↑m 𝑣) ∈ V)
1615ralrimivw 3147 . . 3 (𝑀𝑋 → ∀𝑣 ∈ 𝒫 (Base‘𝑀)((Base‘(Scalar‘𝑀)) ↑m 𝑣) ∈ V)
17 eqid 2736 . . . 4 (𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑣), 𝑣 ∈ 𝒫 (Base‘𝑀) ↦ (𝑀 Σg (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑀)𝑥)))) = (𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑣), 𝑣 ∈ 𝒫 (Base‘𝑀) ↦ (𝑀 Σg (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑀)𝑥))))
1817mpoexxg2 46403 . . 3 ((𝒫 (Base‘𝑀) ∈ V ∧ ∀𝑣 ∈ 𝒫 (Base‘𝑀)((Base‘(Scalar‘𝑀)) ↑m 𝑣) ∈ V) → (𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑣), 𝑣 ∈ 𝒫 (Base‘𝑀) ↦ (𝑀 Σg (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑀)𝑥)))) ∈ V)
1914, 16, 18sylancr 587 . 2 (𝑀𝑋 → (𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑣), 𝑣 ∈ 𝒫 (Base‘𝑀) ↦ (𝑀 Σg (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑀)𝑥)))) ∈ V)
201, 11, 12, 19fvmptd3 6971 1 (𝑀𝑋 → ( linC ‘𝑀) = (𝑠 ∈ ((Base‘(Scalar‘𝑀)) ↑m 𝑣), 𝑣 ∈ 𝒫 (Base‘𝑀) ↦ (𝑀 Σg (𝑥𝑣 ↦ ((𝑠𝑥)( ·𝑠𝑀)𝑥)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2106  wral 3064  Vcvv 3445  𝒫 cpw 4560  cmpt 5188  cfv 6496  (class class class)co 7357  cmpo 7359  m cmap 8765  Basecbs 17083  Scalarcsca 17136   ·𝑠 cvsca 17137   Σg cgsu 17322   linC clinc 46475
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-1st 7921  df-2nd 7922  df-linc 46477
This theorem is referenced by:  lincval  46480
  Copyright terms: Public domain W3C validator