| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lmodscad | GIF version | ||
| Description: The set of scalars of a constructed left vector space. (Contributed by Mario Carneiro, 2-Oct-2013.) (Revised by Jim Kingdon, 6-Feb-2023.) |
| Ref | Expression |
|---|---|
| lvecfn.w | ⊢ 𝑊 = ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} ∪ {〈( ·𝑠 ‘ndx), · 〉}) |
| lmodstr.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| lmodstr.g | ⊢ (𝜑 → + ∈ 𝑋) |
| lmodstr.s | ⊢ (𝜑 → 𝐹 ∈ 𝑌) |
| lmodstr.m | ⊢ (𝜑 → · ∈ 𝑍) |
| Ref | Expression |
|---|---|
| lmodscad | ⊢ (𝜑 → 𝐹 = (Scalar‘𝑊)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | scaslid 13387 | . 2 ⊢ (Scalar = Slot (Scalar‘ndx) ∧ (Scalar‘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 13398 | . 2 ⊢ (𝜑 → 𝑊 Struct 〈1, 6〉) |
| 8 | 1 | simpri 113 | . . . . 5 ⊢ (Scalar‘ndx) ∈ ℕ |
| 9 | opexg 4346 | . . . . 5 ⊢ (((Scalar‘ndx) ∈ ℕ ∧ 𝐹 ∈ 𝑌) → 〈(Scalar‘ndx), 𝐹〉 ∈ V) | |
| 10 | 8, 5, 9 | sylancr 414 | . . . 4 ⊢ (𝜑 → 〈(Scalar‘ndx), 𝐹〉 ∈ V) |
| 11 | tpid3g 3809 | . . . 4 ⊢ (〈(Scalar‘ndx), 𝐹〉 ∈ V → 〈(Scalar‘ndx), 𝐹〉 ∈ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉}) | |
| 12 | elun1 3388 | . . . 4 ⊢ (〈(Scalar‘ndx), 𝐹〉 ∈ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} → 〈(Scalar‘ndx), 𝐹〉 ∈ ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} ∪ {〈( ·𝑠 ‘ndx), · 〉})) | |
| 13 | 10, 11, 12 | 3syl 17 | . . 3 ⊢ (𝜑 → 〈(Scalar‘ndx), 𝐹〉 ∈ ({〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉} ∪ {〈( ·𝑠 ‘ndx), · 〉})) |
| 14 | 13, 2 | eleqtrrdi 2328 | . 2 ⊢ (𝜑 → 〈(Scalar‘ndx), 𝐹〉 ∈ 𝑊) |
| 15 | 1, 7, 5, 14 | opelstrsl 13348 | 1 ⊢ (𝜑 → 𝐹 = (Scalar‘𝑊)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2205 Vcvv 2815 ∪ cun 3211 {csn 3691 {ctp 3693 〈cop 3694 ‘cfv 5354 1c1 8133 ℕcn 9242 6c6 9297 ndxcnx 13230 Slot cslot 13232 Basecbs 13233 +gcplusg 13311 Scalarcsca 13314 ·𝑠 cvsca 13315 |
| 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-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-cnex 8223 ax-resscn 8224 ax-1cn 8225 ax-1re 8226 ax-icn 8227 ax-addcl 8228 ax-addrcl 8229 ax-mulcl 8230 ax-addcom 8232 ax-addass 8234 ax-distr 8236 ax-i2m1 8237 ax-0lt1 8238 ax-0id 8240 ax-rnegex 8241 ax-cnre 8243 ax-pre-ltirr 8244 ax-pre-ltwlin 8245 ax-pre-lttrn 8246 ax-pre-apti 8247 ax-pre-ltadd 8248 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 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-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3045 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-pw 3673 df-sn 3697 df-pr 3698 df-tp 3699 df-op 3700 df-uni 3917 df-int 3952 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-pnf 8315 df-mnf 8316 df-xr 8317 df-ltxr 8318 df-le 8319 df-sub 8451 df-neg 8452 df-inn 9243 df-2 9301 df-3 9302 df-4 9303 df-5 9304 df-6 9305 df-n0 9502 df-z 9583 df-uz 9860 df-fz 10349 df-struct 13235 df-ndx 13236 df-slot 13237 df-base 13239 df-plusg 13324 df-sca 13327 df-vsca 13328 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |