| 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 12830 | . 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 12841 | . 2 ⊢ (𝜑 → 𝑊 Struct 〈1, 6〉) |
| 8 | 1 | simpri 113 | . . . . 5 ⊢ (Scalar‘ndx) ∈ ℕ |
| 9 | opexg 4261 | . . . . 5 ⊢ (((Scalar‘ndx) ∈ ℕ ∧ 𝐹 ∈ 𝑌) → 〈(Scalar‘ndx), 𝐹〉 ∈ V) | |
| 10 | 8, 5, 9 | sylancr 414 | . . . 4 ⊢ (𝜑 → 〈(Scalar‘ndx), 𝐹〉 ∈ V) |
| 11 | tpid3g 3737 | . . . 4 ⊢ (〈(Scalar‘ndx), 𝐹〉 ∈ V → 〈(Scalar‘ndx), 𝐹〉 ∈ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉, 〈(Scalar‘ndx), 𝐹〉}) | |
| 12 | elun1 3330 | . . . 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 2290 | . 2 ⊢ (𝜑 → 〈(Scalar‘ndx), 𝐹〉 ∈ 𝑊) |
| 15 | 1, 7, 5, 14 | opelstrsl 12792 | 1 ⊢ (𝜑 → 𝐹 = (Scalar‘𝑊)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1364 ∈ wcel 2167 Vcvv 2763 ∪ cun 3155 {csn 3622 {ctp 3624 〈cop 3625 ‘cfv 5258 1c1 7880 ℕcn 8990 6c6 9045 ndxcnx 12675 Slot cslot 12677 Basecbs 12678 +gcplusg 12755 Scalarcsca 12758 ·𝑠 cvsca 12759 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4151 ax-pow 4207 ax-pr 4242 ax-un 4468 ax-setind 4573 ax-cnex 7970 ax-resscn 7971 ax-1cn 7972 ax-1re 7973 ax-icn 7974 ax-addcl 7975 ax-addrcl 7976 ax-mulcl 7977 ax-addcom 7979 ax-addass 7981 ax-distr 7983 ax-i2m1 7984 ax-0lt1 7985 ax-0id 7987 ax-rnegex 7988 ax-cnre 7990 ax-pre-ltirr 7991 ax-pre-ltwlin 7992 ax-pre-lttrn 7993 ax-pre-apti 7994 ax-pre-ltadd 7995 |
| This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rab 2484 df-v 2765 df-sbc 2990 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3451 df-pw 3607 df-sn 3628 df-pr 3629 df-tp 3630 df-op 3631 df-uni 3840 df-int 3875 df-br 4034 df-opab 4095 df-mpt 4096 df-id 4328 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-rn 4674 df-res 4675 df-ima 4676 df-iota 5219 df-fun 5260 df-fn 5261 df-f 5262 df-fv 5266 df-riota 5877 df-ov 5925 df-oprab 5926 df-mpo 5927 df-pnf 8063 df-mnf 8064 df-xr 8065 df-ltxr 8066 df-le 8067 df-sub 8199 df-neg 8200 df-inn 8991 df-2 9049 df-3 9050 df-4 9051 df-5 9052 df-6 9053 df-n0 9250 df-z 9327 df-uz 9602 df-fz 10084 df-struct 12680 df-ndx 12681 df-slot 12682 df-base 12684 df-plusg 12768 df-sca 12771 df-vsca 12772 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |