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

Theorem lcoop 44760
Description: A linear combination as operation. (Contributed by AV, 5-Apr-2019.) (Revised by AV, 28-Jul-2019.)
Hypotheses
Ref Expression
lcoop.b 𝐵 = (Base‘𝑀)
lcoop.s 𝑆 = (Scalar‘𝑀)
lcoop.r 𝑅 = (Base‘𝑆)
Assertion
Ref Expression
lcoop ((𝑀𝑋𝑉 ∈ 𝒫 𝐵) → (𝑀 LinCo 𝑉) = {𝑐𝐵 ∣ ∃𝑠 ∈ (𝑅m 𝑉)(𝑠 finSupp (0g𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))})
Distinct variable groups:   𝐵,𝑐   𝑀,𝑐,𝑠   𝑅,𝑐,𝑠   𝑉,𝑐,𝑠
Allowed substitution hints:   𝐵(𝑠)   𝑆(𝑠,𝑐)   𝑋(𝑠,𝑐)

Proof of Theorem lcoop
Dummy variables 𝑚 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3487 . . 3 (𝑀𝑋𝑀 ∈ V)
21adantr 484 . 2 ((𝑀𝑋𝑉 ∈ 𝒫 𝐵) → 𝑀 ∈ V)
3 lcoop.b . . . . . 6 𝐵 = (Base‘𝑀)
43pweqi 4529 . . . . 5 𝒫 𝐵 = 𝒫 (Base‘𝑀)
54eleq2i 2905 . . . 4 (𝑉 ∈ 𝒫 𝐵𝑉 ∈ 𝒫 (Base‘𝑀))
65biimpi 219 . . 3 (𝑉 ∈ 𝒫 𝐵𝑉 ∈ 𝒫 (Base‘𝑀))
76adantl 485 . 2 ((𝑀𝑋𝑉 ∈ 𝒫 𝐵) → 𝑉 ∈ 𝒫 (Base‘𝑀))
83fvexi 6666 . . 3 𝐵 ∈ V
9 rabexg 5210 . . 3 (𝐵 ∈ V → {𝑐𝐵 ∣ ∃𝑠 ∈ (𝑅m 𝑉)(𝑠 finSupp (0g𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))} ∈ V)
108, 9mp1i 13 . 2 ((𝑀𝑋𝑉 ∈ 𝒫 𝐵) → {𝑐𝐵 ∣ ∃𝑠 ∈ (𝑅m 𝑉)(𝑠 finSupp (0g𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))} ∈ V)
11 fveq2 6652 . . . . . 6 (𝑚 = 𝑀 → (Base‘𝑚) = (Base‘𝑀))
1211, 3eqtr4di 2875 . . . . 5 (𝑚 = 𝑀 → (Base‘𝑚) = 𝐵)
1312adantr 484 . . . 4 ((𝑚 = 𝑀𝑣 = 𝑉) → (Base‘𝑚) = 𝐵)
14 2fveq3 6657 . . . . . . . 8 (𝑚 = 𝑀 → (Base‘(Scalar‘𝑚)) = (Base‘(Scalar‘𝑀)))
1514adantr 484 . . . . . . 7 ((𝑚 = 𝑀𝑣 = 𝑉) → (Base‘(Scalar‘𝑚)) = (Base‘(Scalar‘𝑀)))
16 lcoop.r . . . . . . . 8 𝑅 = (Base‘𝑆)
17 lcoop.s . . . . . . . . 9 𝑆 = (Scalar‘𝑀)
1817fveq2i 6655 . . . . . . . 8 (Base‘𝑆) = (Base‘(Scalar‘𝑀))
1916, 18eqtri 2845 . . . . . . 7 𝑅 = (Base‘(Scalar‘𝑀))
2015, 19eqtr4di 2875 . . . . . 6 ((𝑚 = 𝑀𝑣 = 𝑉) → (Base‘(Scalar‘𝑚)) = 𝑅)
21 simpr 488 . . . . . 6 ((𝑚 = 𝑀𝑣 = 𝑉) → 𝑣 = 𝑉)
2220, 21oveq12d 7158 . . . . 5 ((𝑚 = 𝑀𝑣 = 𝑉) → ((Base‘(Scalar‘𝑚)) ↑m 𝑣) = (𝑅m 𝑉))
23 2fveq3 6657 . . . . . . . . 9 (𝑚 = 𝑀 → (0g‘(Scalar‘𝑚)) = (0g‘(Scalar‘𝑀)))
2417a1i 11 . . . . . . . . . . 11 (𝑚 = 𝑀𝑆 = (Scalar‘𝑀))
2524eqcomd 2828 . . . . . . . . . 10 (𝑚 = 𝑀 → (Scalar‘𝑀) = 𝑆)
2625fveq2d 6656 . . . . . . . . 9 (𝑚 = 𝑀 → (0g‘(Scalar‘𝑀)) = (0g𝑆))
2723, 26eqtrd 2857 . . . . . . . 8 (𝑚 = 𝑀 → (0g‘(Scalar‘𝑚)) = (0g𝑆))
2827adantr 484 . . . . . . 7 ((𝑚 = 𝑀𝑣 = 𝑉) → (0g‘(Scalar‘𝑚)) = (0g𝑆))
2928breq2d 5054 . . . . . 6 ((𝑚 = 𝑀𝑣 = 𝑉) → (𝑠 finSupp (0g‘(Scalar‘𝑚)) ↔ 𝑠 finSupp (0g𝑆)))
30 fveq2 6652 . . . . . . . . 9 (𝑚 = 𝑀 → ( linC ‘𝑚) = ( linC ‘𝑀))
3130adantr 484 . . . . . . . 8 ((𝑚 = 𝑀𝑣 = 𝑉) → ( linC ‘𝑚) = ( linC ‘𝑀))
32 eqidd 2823 . . . . . . . 8 ((𝑚 = 𝑀𝑣 = 𝑉) → 𝑠 = 𝑠)
3331, 32, 21oveq123d 7161 . . . . . . 7 ((𝑚 = 𝑀𝑣 = 𝑉) → (𝑠( linC ‘𝑚)𝑣) = (𝑠( linC ‘𝑀)𝑉))
3433eqeq2d 2833 . . . . . 6 ((𝑚 = 𝑀𝑣 = 𝑉) → (𝑐 = (𝑠( linC ‘𝑚)𝑣) ↔ 𝑐 = (𝑠( linC ‘𝑀)𝑉)))
3529, 34anbi12d 633 . . . . 5 ((𝑚 = 𝑀𝑣 = 𝑉) → ((𝑠 finSupp (0g‘(Scalar‘𝑚)) ∧ 𝑐 = (𝑠( linC ‘𝑚)𝑣)) ↔ (𝑠 finSupp (0g𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))))
3622, 35rexeqbidv 3383 . . . 4 ((𝑚 = 𝑀𝑣 = 𝑉) → (∃𝑠 ∈ ((Base‘(Scalar‘𝑚)) ↑m 𝑣)(𝑠 finSupp (0g‘(Scalar‘𝑚)) ∧ 𝑐 = (𝑠( linC ‘𝑚)𝑣)) ↔ ∃𝑠 ∈ (𝑅m 𝑉)(𝑠 finSupp (0g𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))))
3713, 36rabeqbidv 3461 . . 3 ((𝑚 = 𝑀𝑣 = 𝑉) → {𝑐 ∈ (Base‘𝑚) ∣ ∃𝑠 ∈ ((Base‘(Scalar‘𝑚)) ↑m 𝑣)(𝑠 finSupp (0g‘(Scalar‘𝑚)) ∧ 𝑐 = (𝑠( linC ‘𝑚)𝑣))} = {𝑐𝐵 ∣ ∃𝑠 ∈ (𝑅m 𝑉)(𝑠 finSupp (0g𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))})
3811pweqd 4530 . . 3 (𝑚 = 𝑀 → 𝒫 (Base‘𝑚) = 𝒫 (Base‘𝑀))
39 df-lco 44756 . . 3 LinCo = (𝑚 ∈ V, 𝑣 ∈ 𝒫 (Base‘𝑚) ↦ {𝑐 ∈ (Base‘𝑚) ∣ ∃𝑠 ∈ ((Base‘(Scalar‘𝑚)) ↑m 𝑣)(𝑠 finSupp (0g‘(Scalar‘𝑚)) ∧ 𝑐 = (𝑠( linC ‘𝑚)𝑣))})
4037, 38, 39ovmpox 7287 . 2 ((𝑀 ∈ V ∧ 𝑉 ∈ 𝒫 (Base‘𝑀) ∧ {𝑐𝐵 ∣ ∃𝑠 ∈ (𝑅m 𝑉)(𝑠 finSupp (0g𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))} ∈ V) → (𝑀 LinCo 𝑉) = {𝑐𝐵 ∣ ∃𝑠 ∈ (𝑅m 𝑉)(𝑠 finSupp (0g𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))})
412, 7, 10, 40syl3anc 1368 1 ((𝑀𝑋𝑉 ∈ 𝒫 𝐵) → (𝑀 LinCo 𝑉) = {𝑐𝐵 ∣ ∃𝑠 ∈ (𝑅m 𝑉)(𝑠 finSupp (0g𝑆) ∧ 𝑐 = (𝑠( linC ‘𝑀)𝑉))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wcel 2114  wrex 3131  {crab 3134  Vcvv 3469  𝒫 cpw 4511   class class class wbr 5042  cfv 6334  (class class class)co 7140  m cmap 8393   finSupp cfsupp 8821  Basecbs 16474  Scalarcsca 16559  0gc0g 16704   linC clinc 44753   LinCo clinco 44754
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 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179  ax-nul 5186  ax-pr 5307
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ral 3135  df-rex 3136  df-rab 3139  df-v 3471  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4266  df-if 4440  df-pw 4513  df-sn 4540  df-pr 4542  df-op 4546  df-uni 4814  df-br 5043  df-opab 5105  df-id 5437  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-iota 6293  df-fun 6336  df-fv 6342  df-ov 7143  df-oprab 7144  df-mpo 7145  df-lco 44756
This theorem is referenced by:  lcoval  44761  lco0  44776
  Copyright terms: Public domain W3C validator