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

Theorem frlmval 22109
Description: Value of the "free module" function. (Contributed by Stefan O'Rear, 1-Feb-2015.)
Hypothesis
Ref Expression
frlmval.f 𝐹 = (𝑅 freeLMod 𝐼)
Assertion
Ref Expression
frlmval ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → 𝐹 = (𝑅 ⊕m (𝐼 × {(ringLMod‘𝑅)})))

Proof of Theorem frlmval
Dummy variables 𝑟 𝑖 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 frlmval.f . 2 𝐹 = (𝑅 freeLMod 𝐼)
2 elex 3475 . . 3 (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
3 elex 3475 . . 3 (𝐼 ∈ 𝑊 → 𝐼 ∈ V)
4 id 23 . . . . 5 (𝑟 = 𝑅 → 𝑟 = 𝑅)
5 fveq2 6916 . . . . . . 7 (𝑟 = 𝑅 → (ringLMod‘𝑟) = (ringLMod‘𝑅))
65sneqd 4596 . . . . . 6 (𝑟 = 𝑅 → {(ringLMod‘𝑟)} = {(ringLMod‘𝑅)})
76xpeq2d 5688 . . . . 5 (𝑟 = 𝑅 → (𝑖 × {(ringLMod‘𝑟)}) = (𝑖 × {(ringLMod‘𝑅)}))
84, 7oveq12d 7469 . . . 4 (𝑟 = 𝑅 → (𝑟 ⊕m (𝑖 × {(ringLMod‘𝑟)})) = (𝑅 ⊕m (𝑖 × {(ringLMod‘𝑅)})))
9 xpeq1 5672 . . . . 5 (𝑖 = 𝐼 → (𝑖 × {(ringLMod‘𝑅)}) = (𝐼 × {(ringLMod‘𝑅)}))
109oveq2d 7467 . . . 4 (𝑖 = 𝐼 → (𝑅 ⊕m (𝑖 × {(ringLMod‘𝑅)})) = (𝑅 ⊕m (𝐼 × {(ringLMod‘𝑅)})))
11 df-frlm 22108 . . . 4 freeLMod = (𝑟 ∈ V, 𝑖 ∈ V ↦ (𝑟 ⊕m (𝑖 × {(ringLMod‘𝑟)})))
12 ovex 7484 . . . 4 (𝑅 ⊕m (𝐼 × {(ringLMod‘𝑅)})) ∈ V
138, 10, 11, 12ovmpo 7612 . . 3 ((𝑅 ∈ V ∧ 𝐼 ∈ V) → (𝑅 freeLMod 𝐼) = (𝑅 ⊕m (𝐼 × {(ringLMod‘𝑅)})))
142, 3, 13syl2an 608 . 2 ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → (𝑅 freeLMod 𝐼) = (𝑅 ⊕m (𝐼 × {(ringLMod‘𝑅)})))
151, 14eqtrid 2810 1 ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → 𝐹 = (𝑅 ⊕m (𝐼 × {(ringLMod‘𝑅)})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  {csn 4588   × cxp 5656  ‘cfv 6566  (class class class)co 7451  ringLModcrglmod 21498   ⊕m cdsmm 22092   freeLMod cfrlm 22107
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-frlm 22108
This theorem is used by:  frlmlmod  22110  frlmpws  22111  frlmlss  22112  frlmpwsfi  22113  frlmbas  22116
  Copyright terms: Public domain W3C validator