ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  scaffvalg GIF version

Theorem scaffvalg 14645
Description: The scalar multiplication operation as a function. (Contributed by Mario Carneiro, 5-Oct-2015.) (Proof shortened by AV, 2-Mar-2024.)
Hypotheses
Ref Expression
scaffval.b 𝐵 = (Base‘𝑊)
scaffval.f 𝐹 = (Scalar‘𝑊)
scaffval.k 𝐾 = (Base‘𝐹)
scaffval.a = ( ·sf𝑊)
scaffval.s · = ( ·𝑠𝑊)
Assertion
Ref Expression
scaffvalg (𝑊𝑉 = (𝑥𝐾, 𝑦𝐵 ↦ (𝑥 · 𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝑥, · ,𝑦   𝑥,𝑊,𝑦   𝑥,𝑉,𝑦
Allowed substitution hints:   (𝑥, 𝑦)   𝐹(𝑥, 𝑦)

Proof of Theorem scaffvalg
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 scaffval.a . 2 = ( ·sf𝑊)
2 elex 2833 . . 3 (𝑊𝑉𝑊 ∈ V)
3 df-scaf 14628 . . . 4 ·sf = (𝑤 ∈ V ↦ (𝑥 ∈ (Base‘(Scalar‘𝑤)), 𝑦 ∈ (Base‘𝑤) ↦ (𝑥( ·𝑠𝑤)𝑦)))
4 fveq2 5695 . . . . . . . 8 (𝑤 = 𝑊 → (Scalar‘𝑤) = (Scalar‘𝑊))
5 scaffval.f . . . . . . . 8 𝐹 = (Scalar‘𝑊)
64, 5eqtr4di 2289 . . . . . . 7 (𝑤 = 𝑊 → (Scalar‘𝑤) = 𝐹)
76fveq2d 5699 . . . . . 6 (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = (Base‘𝐹))
8 scaffval.k . . . . . 6 𝐾 = (Base‘𝐹)
97, 8eqtr4di 2289 . . . . 5 (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = 𝐾)
10 fveq2 5695 . . . . . 6 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
11 scaffval.b . . . . . 6 𝐵 = (Base‘𝑊)
1210, 11eqtr4di 2289 . . . . 5 (𝑤 = 𝑊 → (Base‘𝑤) = 𝐵)
13 fveq2 5695 . . . . . . 7 (𝑤 = 𝑊 → ( ·𝑠𝑤) = ( ·𝑠𝑊))
14 scaffval.s . . . . . . 7 · = ( ·𝑠𝑊)
1513, 14eqtr4di 2289 . . . . . 6 (𝑤 = 𝑊 → ( ·𝑠𝑤) = · )
1615oveqd 6102 . . . . 5 (𝑤 = 𝑊 → (𝑥( ·𝑠𝑤)𝑦) = (𝑥 · 𝑦))
179, 12, 16mpoeq123dv 6150 . . . 4 (𝑤 = 𝑊 → (𝑥 ∈ (Base‘(Scalar‘𝑤)), 𝑦 ∈ (Base‘𝑤) ↦ (𝑥( ·𝑠𝑤)𝑦)) = (𝑥𝐾, 𝑦𝐵 ↦ (𝑥 · 𝑦)))
18 elex 2833 . . . 4 (𝑊 ∈ V → 𝑊 ∈ V)
19 basfn 13413 . . . . . . 7 Base Fn V
20 scaslid 13509 . . . . . . . . 9 (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘ndx) ∈ ℕ)
2120slotex 13381 . . . . . . . 8 (𝑊 ∈ V → (Scalar‘𝑊) ∈ V)
225, 21eqeltrid 2325 . . . . . . 7 (𝑊 ∈ V → 𝐹 ∈ V)
23 funfvex 5712 . . . . . . . 8 ((Fun Base ∧ 𝐹 ∈ dom Base) → (Base‘𝐹) ∈ V)
2423funfni 5483 . . . . . . 7 ((Base Fn V ∧ 𝐹 ∈ V) → (Base‘𝐹) ∈ V)
2519, 22, 24sylancr 418 . . . . . 6 (𝑊 ∈ V → (Base‘𝐹) ∈ V)
268, 25eqeltrid 2325 . . . . 5 (𝑊 ∈ V → 𝐾 ∈ V)
27 funfvex 5712 . . . . . . . 8 ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
2827funfni 5483 . . . . . . 7 ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
2919, 28mpan 428 . . . . . 6 (𝑊 ∈ V → (Base‘𝑊) ∈ V)
3011, 29eqeltrid 2325 . . . . 5 (𝑊 ∈ V → 𝐵 ∈ V)
31 mpoexga 6448 . . . . 5 ((𝐾 ∈ V ∧ 𝐵 ∈ V) → (𝑥𝐾, 𝑦𝐵 ↦ (𝑥 · 𝑦)) ∈ V)
3226, 30, 31syl2anc 415 . . . 4 (𝑊 ∈ V → (𝑥𝐾, 𝑦𝐵 ↦ (𝑥 · 𝑦)) ∈ V)
333, 17, 18, 32fvmptd3 5799 . . 3 (𝑊 ∈ V → ( ·sf𝑊) = (𝑥𝐾, 𝑦𝐵 ↦ (𝑥 · 𝑦)))
342, 33syl 14 . 2 (𝑊𝑉 → ( ·sf𝑊) = (𝑥𝐾, 𝑦𝐵 ↦ (𝑥 · 𝑦)))
351, 34eqtrid 2283 1 (𝑊𝑉 = (𝑥𝐾, 𝑦𝐵 ↦ (𝑥 · 𝑦)))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4   = wceq 1402  wcel 2209  Vcvv 2821   Fn wfn 5372  cfv 5377  (class class class)co 6085  cmpo 6087  Basecbs 13354  Scalarcsca 13436   ·𝑠 cvsca 13437   ·sf cscaf 14626
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-inn 9306  df-2 9364  df-3 9365  df-4 9366  df-5 9367  df-ndx 13357  df-slot 13358  df-base 13360  df-sca 13449  df-scaf 14628
This theorem is used by:  scafvalg  14646  scafeqg  14647  scaffng  14648  lmodscaf  14649
  Copyright terms: Public domain W3C validator