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

Theorem frlmip 21821
Description: The inner product of a free module. (Contributed by Thierry Arnoux, 20-Jun-2019.)
Hypotheses
Ref Expression
frlmphl.y 𝑌 = (𝑅 freeLMod 𝐼)
frlmphl.b 𝐵 = (Base‘𝑅)
frlmphl.t · = (.r𝑅)
Assertion
Ref Expression
frlmip ((𝐼𝑊𝑅𝑉) → (𝑓 ∈ (𝐵m 𝐼), 𝑔 ∈ (𝐵m 𝐼) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥))))) = (·𝑖𝑌))
Distinct variable groups:   𝐵,𝑓,𝑔,𝑥   𝑓,𝐼,𝑔,𝑥   𝑅,𝑓,𝑔,𝑥   𝑓,𝑉,𝑔,𝑥   𝑓,𝑊,𝑔,𝑥
Allowed substitution hints:   · (𝑥,𝑓,𝑔)   𝑌(𝑥,𝑓,𝑔)

Proof of Theorem frlmip
StepHypRef Expression
1 frlmphl.y . . . 4 𝑌 = (𝑅 freeLMod 𝐼)
2 eqid 2740 . . . . . . 7 (𝑅 freeLMod 𝐼) = (𝑅 freeLMod 𝐼)
3 eqid 2740 . . . . . . 7 (Base‘(𝑅 freeLMod 𝐼)) = (Base‘(𝑅 freeLMod 𝐼))
42, 3frlmpws 21793 . . . . . 6 ((𝑅𝑉𝐼𝑊) → (𝑅 freeLMod 𝐼) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
54ancoms 458 . . . . 5 ((𝐼𝑊𝑅𝑉) → (𝑅 freeLMod 𝐼) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
6 frlmphl.b . . . . . . . . . . 11 𝐵 = (Base‘𝑅)
76ressid 17303 . . . . . . . . . 10 (𝑅𝑉 → (𝑅s 𝐵) = 𝑅)
8 eqidd 2741 . . . . . . . . . . 11 (𝑅𝑉 → ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘𝐵))
96eqimssi 4069 . . . . . . . . . . . 12 𝐵 ⊆ (Base‘𝑅)
109a1i 11 . . . . . . . . . . 11 (𝑅𝑉𝐵 ⊆ (Base‘𝑅))
118, 10srasca 21206 . . . . . . . . . 10 (𝑅𝑉 → (𝑅s 𝐵) = (Scalar‘((subringAlg ‘𝑅)‘𝐵)))
127, 11eqtr3d 2782 . . . . . . . . 9 (𝑅𝑉𝑅 = (Scalar‘((subringAlg ‘𝑅)‘𝐵)))
1312oveq1d 7463 . . . . . . . 8 (𝑅𝑉 → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
1413adantl 481 . . . . . . 7 ((𝐼𝑊𝑅𝑉) → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
15 fvex 6933 . . . . . . . . 9 ((subringAlg ‘𝑅)‘𝐵) ∈ V
16 rlmval 21221 . . . . . . . . . . . 12 (ringLMod‘𝑅) = ((subringAlg ‘𝑅)‘(Base‘𝑅))
176fveq2i 6923 . . . . . . . . . . . 12 ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘(Base‘𝑅))
1816, 17eqtr4i 2771 . . . . . . . . . . 11 (ringLMod‘𝑅) = ((subringAlg ‘𝑅)‘𝐵)
1918oveq1i 7458 . . . . . . . . . 10 ((ringLMod‘𝑅) ↑s 𝐼) = (((subringAlg ‘𝑅)‘𝐵) ↑s 𝐼)
20 eqid 2740 . . . . . . . . . 10 (Scalar‘((subringAlg ‘𝑅)‘𝐵)) = (Scalar‘((subringAlg ‘𝑅)‘𝐵))
2119, 20pwsval 17546 . . . . . . . . 9 ((((subringAlg ‘𝑅)‘𝐵) ∈ V ∧ 𝐼𝑊) → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
2215, 21mpan 689 . . . . . . . 8 (𝐼𝑊 → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
2322adantr 480 . . . . . . 7 ((𝐼𝑊𝑅𝑉) → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
2414, 23eqtr4d 2783 . . . . . 6 ((𝐼𝑊𝑅𝑉) → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((ringLMod‘𝑅) ↑s 𝐼))
251fveq2i 6923 . . . . . . 7 (Base‘𝑌) = (Base‘(𝑅 freeLMod 𝐼))
2625a1i 11 . . . . . 6 ((𝐼𝑊𝑅𝑉) → (Base‘𝑌) = (Base‘(𝑅 freeLMod 𝐼)))
2724, 26oveq12d 7466 . . . . 5 ((𝐼𝑊𝑅𝑉) → ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
285, 27eqtr4d 2783 . . . 4 ((𝐼𝑊𝑅𝑉) → (𝑅 freeLMod 𝐼) = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
291, 28eqtrid 2792 . . 3 ((𝐼𝑊𝑅𝑉) → 𝑌 = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
3029fveq2d 6924 . 2 ((𝐼𝑊𝑅𝑉) → (·𝑖𝑌) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))))
31 fvex 6933 . . . 4 (Base‘𝑌) ∈ V
32 eqid 2740 . . . . 5 ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)) = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))
33 eqid 2740 . . . . 5 (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
3432, 33ressip 17404 . . . 4 ((Base‘𝑌) ∈ V → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))))
3531, 34ax-mp 5 . . 3 (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
36 eqid 2740 . . . . 5 (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))
37 simpr 484 . . . . 5 ((𝐼𝑊𝑅𝑉) → 𝑅𝑉)
38 snex 5451 . . . . . . 7 {((subringAlg ‘𝑅)‘𝐵)} ∈ V
39 xpexg 7785 . . . . . . 7 ((𝐼𝑊 ∧ {((subringAlg ‘𝑅)‘𝐵)} ∈ V) → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
4038, 39mpan2 690 . . . . . 6 (𝐼𝑊 → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
4140adantr 480 . . . . 5 ((𝐼𝑊𝑅𝑉) → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
42 eqid 2740 . . . . 5 (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
4315snnz 4801 . . . . . 6 {((subringAlg ‘𝑅)‘𝐵)} ≠ ∅
44 dmxp 5953 . . . . . 6 ({((subringAlg ‘𝑅)‘𝐵)} ≠ ∅ → dom (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) = 𝐼)
4543, 44mp1i 13 . . . . 5 ((𝐼𝑊𝑅𝑉) → dom (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) = 𝐼)
4636, 37, 41, 42, 45, 33prdsip 17521 . . . 4 ((𝐼𝑊𝑅𝑉) → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝑓 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))), 𝑔 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔𝑥))))))
4736, 37, 41, 42, 45prdsbas 17517 . . . . . 6 ((𝐼𝑊𝑅𝑉) → (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = X𝑥𝐼 (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)))
48 eqidd 2741 . . . . . . . . . 10 (𝑥𝐼 → ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘𝐵))
499a1i 11 . . . . . . . . . 10 (𝑥𝐼𝐵 ⊆ (Base‘𝑅))
5048, 49srabase 21200 . . . . . . . . 9 (𝑥𝐼 → (Base‘𝑅) = (Base‘((subringAlg ‘𝑅)‘𝐵)))
516a1i 11 . . . . . . . . 9 (𝑥𝐼𝐵 = (Base‘𝑅))
5215fvconst2 7241 . . . . . . . . . 10 (𝑥𝐼 → ((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥) = ((subringAlg ‘𝑅)‘𝐵))
5352fveq2d 6924 . . . . . . . . 9 (𝑥𝐼 → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = (Base‘((subringAlg ‘𝑅)‘𝐵)))
5450, 51, 533eqtr4rd 2791 . . . . . . . 8 (𝑥𝐼 → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = 𝐵)
5554adantl 481 . . . . . . 7 (((𝐼𝑊𝑅𝑉) ∧ 𝑥𝐼) → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = 𝐵)
5655ixpeq2dva 8970 . . . . . 6 ((𝐼𝑊𝑅𝑉) → X𝑥𝐼 (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = X𝑥𝐼 𝐵)
576fvexi 6934 . . . . . . . 8 𝐵 ∈ V
58 ixpconstg 8964 . . . . . . . 8 ((𝐼𝑊𝐵 ∈ V) → X𝑥𝐼 𝐵 = (𝐵m 𝐼))
5957, 58mpan2 690 . . . . . . 7 (𝐼𝑊X𝑥𝐼 𝐵 = (𝐵m 𝐼))
6059adantr 480 . . . . . 6 ((𝐼𝑊𝑅𝑉) → X𝑥𝐼 𝐵 = (𝐵m 𝐼))
6147, 56, 603eqtrd 2784 . . . . 5 ((𝐼𝑊𝑅𝑉) → (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝐵m 𝐼))
62 frlmphl.t . . . . . . . . . 10 · = (.r𝑅)
6352, 49sraip 21210 . . . . . . . . . 10 (𝑥𝐼 → (.r𝑅) = (·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)))
6462, 63eqtr2id 2793 . . . . . . . . 9 (𝑥𝐼 → (·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = · )
6564oveqd 7465 . . . . . . . 8 (𝑥𝐼 → ((𝑓𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔𝑥)) = ((𝑓𝑥) · (𝑔𝑥)))
6665mpteq2ia 5269 . . . . . . 7 (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔𝑥))) = (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥)))
6766oveq2i 7459 . . . . . 6 (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔𝑥)))) = (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥))))
6867a1i 11 . . . . 5 ((𝐼𝑊𝑅𝑉) → (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔𝑥)))) = (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥)))))
6961, 61, 68mpoeq123dv 7525 . . . 4 ((𝐼𝑊𝑅𝑉) → (𝑓 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))), 𝑔 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔𝑥))))) = (𝑓 ∈ (𝐵m 𝐼), 𝑔 ∈ (𝐵m 𝐼) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥))))))
7046, 69eqtrd 2780 . . 3 ((𝐼𝑊𝑅𝑉) → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝑓 ∈ (𝐵m 𝐼), 𝑔 ∈ (𝐵m 𝐼) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥))))))
7135, 70eqtr3id 2794 . 2 ((𝐼𝑊𝑅𝑉) → (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))) = (𝑓 ∈ (𝐵m 𝐼), 𝑔 ∈ (𝐵m 𝐼) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥))))))
7230, 71eqtr2d 2781 1 ((𝐼𝑊𝑅𝑉) → (𝑓 ∈ (𝐵m 𝐼), 𝑔 ∈ (𝐵m 𝐼) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥))))) = (·𝑖𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2108  wne 2946  Vcvv 3488  wss 3976  c0 4352  {csn 4648  cmpt 5249   × cxp 5698  dom cdm 5700  cfv 6573  (class class class)co 7448  cmpo 7450  m cmap 8884  Xcixp 8955  Basecbs 17258  s cress 17287  .rcmulr 17312  Scalarcsca 17314  ·𝑖cip 17316   Σg cgsu 17500  Xscprds 17505  s cpws 17506  subringAlg csra 21193  ringLModcrglmod 21194   freeLMod cfrlm 21789
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-pre-mulgt0 11261
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-tp 4653  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-1st 8030  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-1o 8522  df-er 8763  df-map 8886  df-ixp 8956  df-en 9004  df-dom 9005  df-sdom 9006  df-fin 9007  df-sup 9511  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11522  df-neg 11523  df-nn 12294  df-2 12356  df-3 12357  df-4 12358  df-5 12359  df-6 12360  df-7 12361  df-8 12362  df-9 12363  df-n0 12554  df-z 12640  df-dec 12759  df-uz 12904  df-fz 13568  df-struct 17194  df-sets 17211  df-slot 17229  df-ndx 17241  df-base 17259  df-ress 17288  df-plusg 17324  df-mulr 17325  df-sca 17327  df-vsca 17328  df-ip 17329  df-tset 17330  df-ple 17331  df-ds 17333  df-hom 17335  df-cco 17336  df-prds 17507  df-pws 17509  df-sra 21195  df-rgmod 21196  df-dsmm 21775  df-frlm 21790
This theorem is referenced by:  frlmipval  21822  frlmphl  21824
  Copyright terms: Public domain W3C validator