| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > scafeqg | GIF version | ||
| Description: If the scalar multiplication operation is already a function, the functionalization of it is equal to the original operation. (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 |
|---|---|
| scafeqg | ⊢ ((𝑊 ∈ 𝑉 ∧ · Fn (𝐾 × 𝐵)) → ∙ = · ) |
| 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 14270 | . . 3 ⊢ (𝑊 ∈ 𝑉 → ∙ = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦))) |
| 7 | 6 | adantr 276 | . 2 ⊢ ((𝑊 ∈ 𝑉 ∧ · Fn (𝐾 × 𝐵)) → ∙ = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦))) |
| 8 | fnovim 6113 | . . 3 ⊢ ( · Fn (𝐾 × 𝐵) → · = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦))) | |
| 9 | 8 | adantl 277 | . 2 ⊢ ((𝑊 ∈ 𝑉 ∧ · Fn (𝐾 × 𝐵)) → · = (𝑥 ∈ 𝐾, 𝑦 ∈ 𝐵 ↦ (𝑥 · 𝑦))) |
| 10 | 7, 9 | eqtr4d 2265 | 1 ⊢ ((𝑊 ∈ 𝑉 ∧ · Fn (𝐾 × 𝐵)) → ∙ = · ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 × cxp 4717 Fn wfn 5313 ‘cfv 5318 (class class class)co 6001 ∈ cmpo 6003 Basecbs 13032 Scalarcsca 13113 ·𝑠 cvsca 13114 ·sf cscaf 14252 |
| 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-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-cnex 8090 ax-resscn 8091 ax-1re 8093 ax-addrcl 8096 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-ov 6004 df-oprab 6005 df-mpo 6006 df-1st 6286 df-2nd 6287 df-inn 9111 df-2 9169 df-3 9170 df-4 9171 df-5 9172 df-ndx 13035 df-slot 13036 df-base 13038 df-sca 13126 df-scaf 14254 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |