| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lmodvscad | GIF version | ||
| Description: The scalar product operation of a constructed left vector space. (Contributed by Mario Carneiro, 2-Oct-2013.) (Revised by Jim Kingdon, 7-Feb-2023.) |
| Ref | Expression |
|---|---|
| lvecfn.w | ⊢ 𝑊 = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} ∪ {〈( ·𝑠 ‘ndx), · 〉}) |
| lmodstr.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| lmodstr.g | ⊢ (𝜑 → + ∈ 𝑋) |
| lmodstr.s | ⊢ (𝜑 → 𝐹 ∈ 𝑌) |
| lmodstr.m | ⊢ (𝜑 → · ∈ 𝑍) |
| Ref | Expression |
|---|---|
| lmodvscad | ⊢ (𝜑 → · = ( ·𝑠 ‘𝑊)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vscaslid 13500 | . 2 ⊢ ( ·𝑠 = Slot ( ·𝑠 ‘ndx) ∧ ( ·𝑠 ‘ndx) ∈ ℕ) | |
| 2 | lvecfn.w | . . 3 ⊢ 𝑊 = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} ∪ {〈( ·𝑠 ‘ndx), · 〉}) | |
| 3 | lmodstr.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 4 | lmodstr.g | . . 3 ⊢ (𝜑 → + ∈ 𝑋) | |
| 5 | lmodstr.s | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑌) | |
| 6 | lmodstr.m | . . 3 ⊢ (𝜑 → · ∈ 𝑍) | |
| 7 | 2, 3, 4, 5, 6 | lmodstrd 13501 | . 2 ⊢ (𝜑 → 𝑊 Struct 〈1, 6〉) |
| 8 | 1 | simpri 113 | . . . . 5 ⊢ ( ·𝑠 ‘ndx) ∈ ℕ |
| 9 | opexg 4366 | . . . . 5 ⊢ ((( ·𝑠 ‘ndx) ∈ ℕ ∧ · ∈ 𝑍) → 〈( ·𝑠 ‘ndx), · 〉 ∈ V) | |
| 10 | 8, 6, 9 | sylancr 418 | . . . 4 ⊢ (𝜑 → 〈( ·𝑠 ‘ndx), · 〉 ∈ V) |
| 11 | snidg 3737 | . . . 4 ⊢ (〈( ·𝑠 ‘ndx), · 〉 ∈ V → 〈( ·𝑠 ‘ndx), · 〉 ∈ {〈( ·𝑠 ‘ndx), · 〉}) | |
| 12 | elun2 3397 | . . . 4 ⊢ (〈( ·𝑠 ‘ndx), · 〉 ∈ {〈( ·𝑠 ‘ndx), · 〉} → 〈( ·𝑠 ‘ndx), · 〉 ∈ ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} ∪ {〈( ·𝑠 ‘ndx), · 〉})) | |
| 13 | 10, 11, 12 | 3syl 17 | . . 3 ⊢ (𝜑 → 〈( ·𝑠 ‘ndx), · 〉 ∈ ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} ∪ {〈( ·𝑠 ‘ndx), · 〉})) |
| 14 | 13, 2 | eleqtrrdi 2332 | . 2 ⊢ (𝜑 → 〈( ·𝑠 ‘ndx), · 〉 ∈ 𝑊) |
| 15 | 1, 7, 6, 14 | opelstrsl 13451 | 1 ⊢ (𝜑 → · = ( ·𝑠 ‘𝑊)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 Vcvv 2821 ∪ cun 3218 {csn 3708 {ctp 3710 〈cop 3711 ‘cfv 5375 1c1 8174 ℕcn 9287 6c6 9342 ndxcnx 13332 Slot cslot 13334 Basecbs 13335 +gcplusg 13414 Scalarcsca 13417 ·𝑠 cvsca 13418 |
| 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 623 ax-in2 624 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-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-addass 8275 ax-distr 8277 ax-i2m1 8278 ax-0lt1 8279 ax-0id 8281 ax-rnegex 8282 ax-cnre 8284 ax-pre-ltirr 8285 ax-pre-ltwlin 8286 ax-pre-lttrn 8287 ax-pre-apti 8288 ax-pre-ltadd 8289 |
| This theorem depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 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-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-tp 3716 df-op 3717 df-uni 3934 df-int 3969 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-pnf 8356 df-mnf 8357 df-xr 8358 df-ltxr 8359 df-le 8360 df-sub 8493 df-neg 8494 df-inn 9288 df-2 9346 df-3 9347 df-4 9348 df-5 9349 df-6 9350 df-n0 9547 df-z 9628 df-uz 9905 df-fz 10395 df-struct 13337 df-ndx 13338 df-slot 13339 df-base 13341 df-plusg 13427 df-sca 13430 df-vsca 13431 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |