| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > scafvalg | GIF version | ||
| Description: The scalar multiplication operation as a function. (Contributed by Mario Carneiro, 5-Oct-2015.) |
| Ref | Expression |
|---|---|
| scaffval.b | ⊢ 𝐵 = (Base‘𝑊) |
| scaffval.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| scaffval.k | ⊢ 𝐾 = (Base‘𝐹) |
| scaffval.a | ⊢ ∙ = ( ·sf ‘𝑊) |
| scaffval.s | ⊢ · = ( ·𝑠 ‘𝑊) |
| Ref | Expression |
|---|---|
| scafvalg | ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∙ 𝑌) = (𝑋 · 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | scaffval.b | . . . 4 ⊢ 𝐵 = (Base‘𝑊) | |
| 2 | scaffval.f | . . . 4 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 3 | scaffval.k | . . . 4 ⊢ 𝐾 = (Base‘𝐹) | |
| 4 | scaffval.a | . . . 4 ⊢ ∙ = ( ·sf ‘𝑊) | |
| 5 | scaffval.s | . . . 4 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 6 | 1, 2, 3, 4, 5 | scaffvalg 14566 | . . 3 ⊢ (𝑊 ∈ 𝑉 → ∙ = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦))) |
| 7 | 6 | 3ad2ant1 1045 | . 2 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → ∙ = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦))) |
| 8 | oveq12 6067 | . . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑥 · 𝑦) = (𝑋 · 𝑌)) | |
| 9 | 8 | adantl 277 | . 2 ⊢ (((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → (𝑥 · 𝑦) = (𝑋 · 𝑌)) |
| 10 | simp2 1025 | . 2 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐾) | |
| 11 | simp3 1026 | . 2 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 12 | vscaslid 13460 | . . . . . 6 ⊢ ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ) | |
| 13 | 12 | slotex 13323 | . . . . 5 ⊢ (𝑊 ∈ 𝑉 → ( ·𝑠 ‘𝑊) ∈ V) |
| 14 | 5, 13 | eqeltrid 2321 | . . . 4 ⊢ (𝑊 ∈ 𝑉 → · ∈ V) |
| 15 | 14 | 3ad2ant1 1045 | . . 3 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → · ∈ V) |
| 16 | ovexg 6092 | . . 3 ⊢ ((𝑋 ∈ 𝐾 ∧ · ∈ V ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) ∈ V) | |
| 17 | 10, 15, 11, 16 | syl3anc 1274 | . 2 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) ∈ V) |
| 18 | 7, 9, 10, 11, 17 | ovmpod 6189 | 1 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐾 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∙ 𝑌) = (𝑋 · 𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2205 Vcvv 2815 ‘cfv 5357 (class class class)co 6058 ∈ cmpo 6060 Basecbs 13296 Scalarcsca 13377 ·𝑠 cvsca 13378 ·sf cscaf 14548 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1re 8237 ax-addrcl 8240 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-inn 9255 df-2 9313 df-3 9314 df-4 9315 df-5 9316 df-6 9317 df-ndx 13299 df-slot 13300 df-base 13302 df-sca 13390 df-vsca 13391 df-scaf 14550 |
| This theorem is referenced by: lmodfopne 14586 |
| Copyright terms: Public domain | W3C validator |