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

Theorem frlmip 22141
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 2766 . . . . . . 7 (𝑅 freeLMod 𝐼) = (𝑅 freeLMod 𝐼)
3 eqid 2766 . . . . . . 7 (Base‘(𝑅 freeLMod 𝐼)) = (Base‘(𝑅 freeLMod 𝐼))
42, 3frlmpws 22113 . . . . . 6 ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → (𝑅 freeLMod 𝐼) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
54ancoms 464 . . . . 5 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅 freeLMod 𝐼) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
6 frlmphl.b . . . . . . . . . . 11 𝐵 = (Base‘𝑅)
76ressid 17468 . . . . . . . . . 10 (𝑅 ∈ 𝑉 → (𝑅 ↾s 𝐵) = 𝑅)
8 eqidd 2767 . . . . . . . . . . 11 (𝑅 ∈ 𝑉 → ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘𝐵))
96eqimssi 3972 . . . . . . . . . . . 12 𝐵 ⊆ (Base‘𝑅)
109a1i 11 . . . . . . . . . . 11 (𝑅 ∈ 𝑉 → 𝐵 ⊆ (Base‘𝑅))
118, 10srasca 21508 . . . . . . . . . 10 (𝑅 ∈ 𝑉 → (𝑅 ↾s 𝐵) = (Scalar‘((subringAlg ‘𝑅)‘𝐵)))
127, 11eqtr3d 2803 . . . . . . . . 9 (𝑅 ∈ 𝑉 → 𝑅 = (Scalar‘((subringAlg ‘𝑅)‘𝐵)))
1312oveq1d 7465 . . . . . . . 8 (𝑅 ∈ 𝑉 → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
1413adantl 487 . . . . . . 7 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
15 fvex 6928 . . . . . . . . 9 ((subringAlg ‘𝑅)‘𝐵) ∈ V
16 rlmval 21519 . . . . . . . . . . . 12 (ringLMod‘𝑅) = ((subringAlg ‘𝑅)‘(Base‘𝑅))
176fveq2i 6918 . . . . . . . . . . . 12 ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘(Base‘𝑅))
1816, 17eqtr4i 2792 . . . . . . . . . . 11 (ringLMod‘𝑅) = ((subringAlg ‘𝑅)‘𝐵)
1918oveq1i 7460 . . . . . . . . . 10 ((ringLMod‘𝑅) ↑s 𝐼) = (((subringAlg ‘𝑅)‘𝐵) ↑s 𝐼)
20 eqid 2766 . . . . . . . . . 10 (Scalar‘((subringAlg ‘𝑅)‘𝐵)) = (Scalar‘((subringAlg ‘𝑅)‘𝐵))
2119, 20pwsval 17709 . . . . . . . . 9 ((((subringAlg ‘𝑅)‘𝐵) ∈ V ∧ 𝐼 ∈ 𝑊) → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
2215, 21mpan 703 . . . . . . . 8 (𝐼 ∈ 𝑊 → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
2322adantr 486 . . . . . . 7 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → ((ringLMod‘𝑅) ↑s 𝐼) = ((Scalar‘((subringAlg ‘𝑅)‘𝐵))Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
2414, 23eqtr4d 2804 . . . . . 6 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = ((ringLMod‘𝑅) ↑s 𝐼))
251fveq2i 6918 . . . . . . 7 (Base‘𝑌) = (Base‘(𝑅 freeLMod 𝐼))
2625a1i 11 . . . . . 6 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (Base‘𝑌) = (Base‘(𝑅 freeLMod 𝐼)))
2724, 26oveq12d 7468 . . . . 5 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)) = (((ringLMod‘𝑅) ↑s 𝐼) ↾s (Base‘(𝑅 freeLMod 𝐼))))
285, 27eqtr4d 2804 . . . 4 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑅 freeLMod 𝐼) = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
291, 28eqtrid 2813 . . 3 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → 𝑌 = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
3029fveq2d 6919 . 2 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘𝑌) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))))
31 fvex 6928 . . . 4 (Base‘𝑌) ∈ V
32 eqid 2766 . . . . 5 ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)) = ((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))
33 eqid 2766 . . . . 5 (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
3432, 33ressip 17564 . . . 4 ((Base‘𝑌) ∈ V → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))))
3531, 34ax-mp 5 . . 3 (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌)))
36 eqid 2766 . . . . 5 (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) = (𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))
37 simpr 490 . . . . 5 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → 𝑅 ∈ 𝑉)
38 snex 5403 . . . . . . 7 {((subringAlg ‘𝑅)‘𝐵)} ∈ V
39 xpexg 7795 . . . . . . 7 ((𝐼 ∈ 𝑊 ∧ {((subringAlg ‘𝑅)‘𝐵)} ∈ V) → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
4038, 39mpan2 704 . . . . . 6 (𝐼 ∈ 𝑊 → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
4140adantr 486 . . . . 5 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) ∈ V)
42 eqid 2766 . . . . 5 (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})))
4315snnz 4738 . . . . . 6 {((subringAlg ‘𝑅)‘𝐵)} ≠ ∅
44 dmxp 5922 . . . . . 6 ({((subringAlg ‘𝑅)‘𝐵)} ≠ ∅ → dom (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) = 𝐼)
4543, 44mp1i 14 . . . . 5 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → dom (𝐼 × {((subringAlg ‘𝑅)‘𝐵)}) = 𝐼)
4636, 37, 41, 42, 45, 33prdsip 17684 . . . 4 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝑓 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))), 𝑔 ∈ (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥))))))
4736, 37, 41, 42, 45prdsbas 17680 . . . . . 6 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = X𝑥 ∈ 𝐼 (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)))
48 eqidd 2767 . . . . . . . . . 10 (𝑥 ∈ 𝐼 → ((subringAlg ‘𝑅)‘𝐵) = ((subringAlg ‘𝑅)‘𝐵))
499a1i 11 . . . . . . . . . 10 (𝑥 ∈ 𝐼 → 𝐵 ⊆ (Base‘𝑅))
5048, 49srabase 21505 . . . . . . . . 9 (𝑥 ∈ 𝐼 → (Base‘𝑅) = (Base‘((subringAlg ‘𝑅)‘𝐵)))
516a1i 11 . . . . . . . . 9 (𝑥 ∈ 𝐼 → 𝐵 = (Base‘𝑅))
5215fvconst2 7240 . . . . . . . . . 10 (𝑥 ∈ 𝐼 → ((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥) = ((subringAlg ‘𝑅)‘𝐵))
5352fveq2d 6919 . . . . . . . . 9 (𝑥 ∈ 𝐼 → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = (Base‘((subringAlg ‘𝑅)‘𝐵)))
5450, 51, 533eqtr4rd 2812 . . . . . . . 8 (𝑥 ∈ 𝐼 → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = 𝐵)
5554adantl 487 . . . . . . 7 (((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) ∧ 𝑥 ∈ 𝐼) → (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = 𝐵)
5655ixpeq2dva 8977 . . . . . 6 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → X𝑥 ∈ 𝐼 (Base‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = X𝑥 ∈ 𝐼 𝐵)
576fvexi 6929 . . . . . . . 8 𝐵 ∈ V
58 ixpconstg 8971 . . . . . . . 8 ((𝐼 ∈ 𝑊 ∧ 𝐵 ∈ V) → X𝑥 ∈ 𝐼 𝐵 = (𝐵 ↑m 𝐼))
5957, 58mpan2 704 . . . . . . 7 (𝐼 ∈ 𝑊 → X𝑥 ∈ 𝐼 𝐵 = (𝐵 ↑m 𝐼))
6059adantr 486 . . . . . 6 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → X𝑥 ∈ 𝐼 𝐵 = (𝐵 ↑m 𝐼))
6147, 56, 603eqtrd 2805 . . . . 5 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (Base‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝐵 ↑m 𝐼))
62 frlmphl.t . . . . . . . . . 10 · = (.r‘𝑅)
6352, 49sraip 21510 . . . . . . . . . 10 (𝑥 ∈ 𝐼 → (.r‘𝑅) = (·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)))
6462, 63eqtr2id 2814 . . . . . . . . 9 (𝑥 ∈ 𝐼 → (·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥)) = · )
6564oveqd 7467 . . . . . . . 8 (𝑥 ∈ 𝐼 → ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥)) = ((𝑓‘𝑥) · (𝑔‘𝑥)))
6665mpteq2ia 5205 . . . . . . 7 (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)(·𝑖‘((𝐼 × {((subringAlg ‘𝑅)‘𝐵)})‘𝑥))(𝑔‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥)))
6766oveq2i 7461 . . . . . 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 2801 . . 3 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘(𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)}))) = (𝑓 ∈ (𝐵 ↑m 𝐼), 𝑔 ∈ (𝐵 ↑m 𝐼) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))))
7135, 70eqtr3id 2815 . 2 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (·𝑖‘((𝑅Xs(𝐼 × {((subringAlg ‘𝑅)‘𝐵)})) ↾s (Base‘𝑌))) = (𝑓 ∈ (𝐵 ↑m 𝐼), 𝑔 ∈ (𝐵 ↑m 𝐼) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))))
7230, 71eqtr2d 2802 1 ((𝐼 ∈ 𝑊 ∧ 𝑅 ∈ 𝑉) → (𝑓 ∈ (𝐵 ↑m 𝐼), 𝑔 ∈ (𝐵 ↑m 𝐼) ↦ (𝑅 Σg (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥) · (𝑔‘𝑥))))) = (·𝑖‘𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150   ≠ wne 2962  Vcvv 3453   ⊆ wss 3899  ∅c0 4280  {csn 4587   ↦ cmpt 5191   × cxp 5655  dom cdm 5657  ‘cfv 6565  (class class class)co 7450   ∈ cmpo 7452   ↑m cmap 8884  Xcixp 8962  Basecbs 17433   ↾s cress 17454  .rcmulr 17475  Scalarcsca 17477  ·𝑖cip 17479   Σg cgsu 17663  Xscprds 17668   ↑s cpws 17669  subringAlg csra 21499  ringLModcrglmod 21500   freeLMod cfrlm 22109
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-er 8754  df-map 8886  df-ixp 8963  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  df-sup 9470  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-2 12444  df-3 12445  df-4 12446  df-5 12447  df-6 12448  df-7 12449  df-8 12450  df-9 12451  df-n0 12646  df-z 12733  df-dec 12854  df-uz 13005  df-fz 13679  df-struct 17371  df-sets 17388  df-slot 17406  df-ndx 17418  df-base 17434  df-ress 17455  df-plusg 17488  df-mulr 17489  df-sca 17491  df-vsca 17492  df-ip 17493  df-tset 17494  df-ple 17495  df-ds 17497  df-hom 17499  df-cco 17500  df-prds 17670  df-pws 17672  df-sra 21501  df-rgmod 21502  df-dsmm 22095  df-frlm 22110
This theorem is used by:  frlmipval  22142  frlmphl  22144
  Copyright terms: Public domain W3C validator