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

Theorem frlmval 22061
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 3471 . . 3 (𝑅 ∈ 𝑉 → 𝑅 ∈ V)
3 elex 3471 . . 3 (𝐼 ∈ 𝑊 → 𝐼 ∈ V)
4 id 23 . . . . 5 (𝑟 = 𝑅 → 𝑟 = 𝑅)
5 fveq2 6888 . . . . . . 7 (𝑟 = 𝑅 → (ringLMod‘𝑟) = (ringLMod‘𝑅))
65sneqd 4592 . . . . . 6 (𝑟 = 𝑅 → {(ringLMod‘𝑟)} = {(ringLMod‘𝑅)})
76xpeq2d 5680 . . . . 5 (𝑟 = 𝑅 → (𝑖 × {(ringLMod‘𝑟)}) = (𝑖 × {(ringLMod‘𝑅)}))
84, 7oveq12d 7440 . . . 4 (𝑟 = 𝑅 → (𝑟 ⊕m (𝑖 × {(ringLMod‘𝑟)})) = (𝑅 ⊕m (𝑖 × {(ringLMod‘𝑅)})))
9 xpeq1 5664 . . . . 5 (𝑖 = 𝐼 → (𝑖 × {(ringLMod‘𝑅)}) = (𝐼 × {(ringLMod‘𝑅)}))
109oveq2d 7438 . . . 4 (𝑖 = 𝐼 → (𝑅 ⊕m (𝑖 × {(ringLMod‘𝑅)})) = (𝑅 ⊕m (𝐼 × {(ringLMod‘𝑅)})))
11 df-frlm 22060 . . . 4 freeLMod = (𝑟 ∈ V, 𝑖 ∈ V ↦ (𝑟 ⊕m (𝑖 × {(ringLMod‘𝑟)})))
12 ovex 7455 . . . 4 (𝑅 ⊕m (𝐼 × {(ringLMod‘𝑅)})) ∈ V
138, 10, 11, 12ovmpo 7582 . . 3 ((𝑅 ∈ V ∧ 𝐼 ∈ V) → (𝑅 freeLMod 𝐼) = (𝑅 ⊕m (𝐼 × {(ringLMod‘𝑅)})))
142, 3, 13syl2an 608 . 2 ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → (𝑅 freeLMod 𝐼) = (𝑅 ⊕m (𝐼 × {(ringLMod‘𝑅)})))
151, 14eqtrid 2807 1 ((𝑅 ∈ 𝑉 ∧ 𝐼 ∈ 𝑊) → 𝐹 = (𝑅 ⊕m (𝐼 × {(ringLMod‘𝑅)})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450  {csn 4584   × cxp 5648  ‘cfv 6541  (class class class)co 7422  ringLModcrglmod 21454   ⊕m cdsmm 22044   freeLMod cfrlm 22059
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6496  df-fun 6543  df-fv 6549  df-ov 7425  df-oprab 7426  df-mpo 7427  df-frlm 22060
This theorem is used by:  frlmlmod  22062  frlmpws  22063  frlmlss  22064  frlmpwsfi  22065  frlmbas  22068
  Copyright terms: Public domain W3C validator