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

Theorem frlmip 21738
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 2735 . . . . . . 7 (𝑅 freeLMod 𝐼) = (𝑅 freeLMod 𝐼)
3 eqid 2735 . . . . . . 7 (Base‘(𝑅 freeLMod 𝐼)) = (Base‘(𝑅 freeLMod 𝐼))
42, 3frlmpws 21710 . . . . . 6 ((𝑅𝑉𝐼𝑊) → (𝑅 freeLMod 𝐼) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
54ancoms 458 . . . . 5 ((𝐼𝑊𝑅𝑉) → (𝑅 freeLMod 𝐼) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
6 frlmphl.b . . . . . . . . . . 11 𝐵 = (Base‘𝑅)
76ressid 17265 . . . . . . . . . 10 (𝑅𝑉 → (𝑅s 𝐵) = 𝑅)
8 eqidd 2736 . . . . . . . . . . 11 (𝑅𝑉 → ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘𝐵))
96eqimssi 4019 . . . . . . . . . . . 12 𝐵 ⊆ (Base‘𝑅)
109a1i 11 . . . . . . . . . . 11 (𝑅𝑉𝐵 ⊆ (Base‘𝑅))
118, 10srasca 21138 . . . . . . . . . 10 (𝑅𝑉 → (𝑅s 𝐵) = (Scalar‘((subringAlg ‘𝑅)‘𝐵)))
127, 11eqtr3d 2772 . . . . . . . . 9 (𝑅𝑉𝑅 = (Scalar‘((subringAlg ‘𝑅)‘𝐵)))
1312oveq1d 7420 . . . . . . . 8 (𝑅𝑉 → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
1413adantl 481 . . . . . . 7 ((𝐼𝑊𝑅𝑉) → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
15 fvex 6889 . . . . . . . . 9 ((subringAlg ‘𝑅)‘𝐵) ∈ V
16 rlmval 21149 . . . . . . . . . . . 12 (ringLMod‘𝑅) = ((subringAlg ‘𝑅)‘(Base‘𝑅))
176fveq2i 6879 . . . . . . . . . . . 12 ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘(Base‘𝑅))
1816, 17eqtr4i 2761 . . . . . . . . . . 11 (ringLMod‘𝑅) = ((subringAlg ‘𝑅)‘𝐵)
1918oveq1i 7415 . . . . . . . . . 10 ((ringLMod‘𝑅) ↑s 𝐼) = (((subringAlg ‘𝑅)‘𝐵) ↑s 𝐼)
20 eqid 2735 . . . . . . . . . 10 (Scalar‘((subringAlg ‘𝑅)‘𝐵)) = (Scalar‘((subringAlg ‘𝑅)‘𝐵))
2119, 20pwsval 17500 . . . . . . . . 9 ((((subringAlg ‘𝑅)‘𝐵) ∈ V ∧ 𝐼𝑊) → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
2215, 21mpan 690 . . . . . . . 8 (𝐼𝑊 → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
2322adantr 480 . . . . . . 7 ((𝐼𝑊𝑅𝑉) → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
2414, 23eqtr4d 2773 . . . . . 6 ((𝐼𝑊𝑅𝑉) → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((ringLMod‘𝑅) ↑s 𝐼))
251fveq2i 6879 . . . . . . 7 (Base‘𝑌) = (Base‘(𝑅 freeLMod 𝐼))
2625a1i 11 . . . . . 6 ((𝐼𝑊𝑅𝑉) → (Base‘𝑌) = (Base‘(𝑅 freeLMod 𝐼)))
2724, 26oveq12d 7423 . . . . 5 ((𝐼𝑊𝑅𝑉) → ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
285, 27eqtr4d 2773 . . . 4 ((𝐼𝑊𝑅𝑉) → (𝑅 freeLMod 𝐼) = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
291, 28eqtrid 2782 . . 3 ((𝐼𝑊𝑅𝑉) → 𝑌 = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
3029fveq2d 6880 . 2 ((𝐼𝑊𝑅𝑉) → (·𝑖𝑌) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))))
31 fvex 6889 . . . 4 (Base‘𝑌) ∈ V
32 eqid 2735 . . . . 5 ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)) = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))
33 eqid 2735 . . . . 5 (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
3432, 33ressip 17359 . . . 4 ((Base‘𝑌) ∈ V → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))))
3531, 34ax-mp 5 . . 3 (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
36 eqid 2735 . . . . 5 (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))
37 simpr 484 . . . . 5 ((𝐼𝑊𝑅𝑉) → 𝑅𝑉)
38 snex 5406 . . . . . . 7 {((subringAlg ‘𝑅)‘𝐵)} ∈ V
39 xpexg 7744 . . . . . . 7 ((𝐼𝑊 ∧ {((subringAlg ‘𝑅)‘𝐵)} ∈ V) → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
4038, 39mpan2 691 . . . . . 6 (𝐼𝑊 → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
4140adantr 480 . . . . 5 ((𝐼𝑊𝑅𝑉) → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
42 eqid 2735 . . . . 5 (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
4315snnz 4752 . . . . . 6 {((subringAlg ‘𝑅)‘𝐵)} ≠ ∅
44 dmxp 5908 . . . . . 6 ({((subringAlg ‘𝑅)‘𝐵)} ≠ ∅ → dom (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) = 𝐼)
4543, 44mp1i 13 . . . . 5 ((𝐼𝑊𝑅𝑉) → dom (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) = 𝐼)
4636, 37, 41, 42, 45, 33prdsip 17475 . . . 4 ((𝐼𝑊𝑅𝑉) → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝑓 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))), 𝑔 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔𝑥))))))
4736, 37, 41, 42, 45prdsbas 17471 . . . . . 6 ((𝐼𝑊𝑅𝑉) → (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = X𝑥𝐼 (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)))
48 eqidd 2736 . . . . . . . . . 10 (𝑥𝐼 → ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘𝐵))
499a1i 11 . . . . . . . . . 10 (𝑥𝐼𝐵 ⊆ (Base‘𝑅))
5048, 49srabase 21135 . . . . . . . . 9 (𝑥𝐼 → (Base‘𝑅) = (Base‘((subringAlg ‘𝑅)‘𝐵)))
516a1i 11 . . . . . . . . 9 (𝑥𝐼𝐵 = (Base‘𝑅))
5215fvconst2 7196 . . . . . . . . . 10 (𝑥𝐼 → ((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥) = ((subringAlg ‘𝑅)‘𝐵))
5352fveq2d 6880 . . . . . . . . 9 (𝑥𝐼 → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = (Base‘((subringAlg ‘𝑅)‘𝐵)))
5450, 51, 533eqtr4rd 2781 . . . . . . . 8 (𝑥𝐼 → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = 𝐵)
5554adantl 481 . . . . . . 7 (((𝐼𝑊𝑅𝑉) ∧ 𝑥𝐼) → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = 𝐵)
5655ixpeq2dva 8926 . . . . . 6 ((𝐼𝑊𝑅𝑉) → X𝑥𝐼 (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = X𝑥𝐼 𝐵)
576fvexi 6890 . . . . . . . 8 𝐵 ∈ V
58 ixpconstg 8920 . . . . . . . 8 ((𝐼𝑊𝐵 ∈ V) → X𝑥𝐼 𝐵 = (𝐵m 𝐼))
5957, 58mpan2 691 . . . . . . 7 (𝐼𝑊X𝑥𝐼 𝐵 = (𝐵m 𝐼))
6059adantr 480 . . . . . 6 ((𝐼𝑊𝑅𝑉) → X𝑥𝐼 𝐵 = (𝐵m 𝐼))
6147, 56, 603eqtrd 2774 . . . . 5 ((𝐼𝑊𝑅𝑉) → (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝐵m 𝐼))
62 frlmphl.t . . . . . . . . . 10 · = (.r𝑅)
6352, 49sraip 21140 . . . . . . . . . 10 (𝑥𝐼 → (.r𝑅) = (·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)))
6462, 63eqtr2id 2783 . . . . . . . . 9 (𝑥𝐼 → (·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = · )
6564oveqd 7422 . . . . . . . 8 (𝑥𝐼 → ((𝑓𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔𝑥)) = ((𝑓𝑥) · (𝑔𝑥)))
6665mpteq2ia 5216 . . . . . . 7 (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔𝑥))) = (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥)))
6766oveq2i 7416 . . . . . 6 (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔𝑥)))) = (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥))))
6867a1i 11 . . . . 5 ((𝐼𝑊𝑅𝑉) → (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔𝑥)))) = (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥)))))
6961, 61, 68mpoeq123dv 7482 . . . 4 ((𝐼𝑊𝑅𝑉) → (𝑓 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))), 𝑔 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔𝑥))))) = (𝑓 ∈ (𝐵m 𝐼), 𝑔 ∈ (𝐵m 𝐼) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥))))))
7046, 69eqtrd 2770 . . 3 ((𝐼𝑊𝑅𝑉) → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝑓 ∈ (𝐵m 𝐼), 𝑔 ∈ (𝐵m 𝐼) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥))))))
7135, 70eqtr3id 2784 . 2 ((𝐼𝑊𝑅𝑉) → (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))) = (𝑓 ∈ (𝐵m 𝐼), 𝑔 ∈ (𝐵m 𝐼) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥))))))
7230, 71eqtr2d 2771 1 ((𝐼𝑊𝑅𝑉) → (𝑓 ∈ (𝐵m 𝐼), 𝑔 ∈ (𝐵m 𝐼) ↦ (𝑅 Σg (𝑥𝐼 ↦ ((𝑓𝑥) · (𝑔𝑥))))) = (·𝑖𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  wne 2932  Vcvv 3459  wss 3926  c0 4308  {csn 4601  cmpt 5201   × cxp 5652  dom cdm 5654  cfv 6531  (class class class)co 7405  cmpo 7407  m cmap 8840  Xcixp 8911  Basecbs 17228  s cress 17251  .rcmulr 17272  Scalarcsca 17274  ·𝑖cip 17276   Σg cgsu 17454  Xscprds 17459  s cpws 17460  subringAlg csra 21129  ringLModcrglmod 21130   freeLMod cfrlm 21706
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-cnex 11185  ax-resscn 11186  ax-1cn 11187  ax-icn 11188  ax-addcl 11189  ax-addrcl 11190  ax-mulcl 11191  ax-mulrcl 11192  ax-mulcom 11193  ax-addass 11194  ax-mulass 11195  ax-distr 11196  ax-i2m1 11197  ax-1ne0 11198  ax-1rid 11199  ax-rnegex 11200  ax-rrecex 11201  ax-cnre 11202  ax-pre-lttri 11203  ax-pre-lttrn 11204  ax-pre-ltadd 11205  ax-pre-mulgt0 11206
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-tp 4606  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7862  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-1o 8480  df-er 8719  df-map 8842  df-ixp 8912  df-en 8960  df-dom 8961  df-sdom 8962  df-fin 8963  df-sup 9454  df-pnf 11271  df-mnf 11272  df-xr 11273  df-ltxr 11274  df-le 11275  df-sub 11468  df-neg 11469  df-nn 12241  df-2 12303  df-3 12304  df-4 12305  df-5 12306  df-6 12307  df-7 12308  df-8 12309  df-9 12310  df-n0 12502  df-z 12589  df-dec 12709  df-uz 12853  df-fz 13525  df-struct 17166  df-sets 17183  df-slot 17201  df-ndx 17213  df-base 17229  df-ress 17252  df-plusg 17284  df-mulr 17285  df-sca 17287  df-vsca 17288  df-ip 17289  df-tset 17290  df-ple 17291  df-ds 17293  df-hom 17295  df-cco 17296  df-prds 17461  df-pws 17463  df-sra 21131  df-rgmod 21132  df-dsmm 21692  df-frlm 21707
This theorem is referenced by:  frlmipval  21739  frlmphl  21741
  Copyright terms: Public domain W3C validator