| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > frlmfzowrdb | Structured version Visualization version GIF version | ||
| Description: The vectors of a module with indices 0 to 𝑁 − 1 are the length- 𝑁 words over the scalars of the module. (Contributed by SN, 1-Sep-2023.) |
| Ref | Expression |
|---|---|
| frlmfzowrd.w | ⊢ 𝑊 = (𝐾 freeLMod (0..^𝑁)) |
| frlmfzowrd.b | ⊢ 𝐵 = (Base‘𝑊) |
| frlmfzowrd.s | ⊢ 𝑆 = (Base‘𝐾) |
| Ref | Expression |
|---|---|
| frlmfzowrdb | ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑋 ∈ 𝐵 ↔ (𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frlmfzowrd.w | . . . . 5 ⊢ 𝑊 = (𝐾 freeLMod (0..^𝑁)) | |
| 2 | frlmfzowrd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑊) | |
| 3 | frlmfzowrd.s | . . . . 5 ⊢ 𝑆 = (Base‘𝐾) | |
| 4 | 1, 2, 3 | frlmfzowrd 43834 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ Word 𝑆) |
| 5 | 4 | a1i 11 | . . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑋 ∈ 𝐵 → 𝑋 ∈ Word 𝑆)) |
| 6 | 1, 2, 3 | frlmfzolen 43835 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝐵) → (♯‘𝑋) = 𝑁) |
| 7 | 6 | ex 418 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (𝑋 ∈ 𝐵 → (♯‘𝑋) = 𝑁)) |
| 8 | 7 | adantl 487 | . . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑋 ∈ 𝐵 → (♯‘𝑋) = 𝑁)) |
| 9 | 5, 8 | jcad 522 | . 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑋 ∈ 𝐵 → (𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁))) |
| 10 | simp3l 1222 | . . . . . 6 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0 ∧ (𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁)) → 𝑋 ∈ Word 𝑆) | |
| 11 | wrdf 14703 | . . . . . 6 ⊢ (𝑋 ∈ Word 𝑆 → 𝑋:(0..^(♯‘𝑋))⟶𝑆) | |
| 12 | 10, 11 | syl 18 | . . . . 5 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0 ∧ (𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁)) → 𝑋:(0..^(♯‘𝑋))⟶𝑆) |
| 13 | simp3r 1223 | . . . . . . 7 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0 ∧ (𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁)) → (♯‘𝑋) = 𝑁) | |
| 14 | 13 | oveq2d 7466 | . . . . . 6 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0 ∧ (𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁)) → (0..^(♯‘𝑋)) = (0..^𝑁)) |
| 15 | 14 | feq2d 6722 | . . . . 5 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0 ∧ (𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁)) → (𝑋:(0..^(♯‘𝑋))⟶𝑆 ↔ 𝑋:(0..^𝑁)⟶𝑆)) |
| 16 | 12, 15 | mpbid 235 | . . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0 ∧ (𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁)) → 𝑋:(0..^𝑁)⟶𝑆) |
| 17 | simp1 1155 | . . . . 5 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0 ∧ (𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁)) → 𝐾 ∈ 𝑉) | |
| 18 | fzofi 14156 | . . . . 5 ⊢ (0..^𝑁) ∈ Fin | |
| 19 | 1, 3, 2 | frlmfielbas 43832 | . . . . 5 ⊢ ((𝐾 ∈ 𝑉 ∧ (0..^𝑁) ∈ Fin) → (𝑋 ∈ 𝐵 ↔ 𝑋:(0..^𝑁)⟶𝑆)) |
| 20 | 17, 18, 19 | sylancl 598 | . . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0 ∧ (𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁)) → (𝑋 ∈ 𝐵 ↔ 𝑋:(0..^𝑁)⟶𝑆)) |
| 21 | 16, 20 | mpbird 260 | . . 3 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0 ∧ (𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁)) → 𝑋 ∈ 𝐵) |
| 22 | 21 | 3expia 1140 | . 2 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → ((𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁) → 𝑋 ∈ 𝐵)) |
| 23 | 9, 22 | impbid 215 | 1 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑁 ∈ ℕ0) → (𝑋 ∈ 𝐵 ↔ (𝑋 ∈ Word 𝑆 ∧ (♯‘𝑋) = 𝑁))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ⟶wf 6561 ‘cfv 6565 (class class class)co 7450 Fincfn 9010 0cc0 11238 ℕ0cn0 12645 ..^cfzo 13827 ♯chash 14514 Word cword 14698 Basecbs 17433 freeLMod cfrlm 22109 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-supp 8214 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-er 8754 df-map 8886 df-ixp 8963 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-fsupp 9391 df-sup 9470 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-3 12445 df-4 12446 df-5 12447 df-6 12448 df-7 12449 df-8 12450 df-9 12451 df-n0 12646 df-z 12733 df-dec 12854 df-uz 13005 df-fz 13679 df-fzo 13828 df-hash 14515 df-word 14699 df-struct 17371 df-sets 17388 df-slot 17406 df-ndx 17418 df-base 17434 df-ress 17455 df-plusg 17488 df-mulr 17489 df-sca 17491 df-vsca 17492 df-ip 17493 df-tset 17494 df-ple 17495 df-ds 17497 df-hom 17499 df-cco 17500 df-0g 17664 df-prds 17670 df-pws 17672 df-sra 21501 df-rgmod 21502 df-dsmm 22095 df-frlm 22110 |
| This theorem is used by: frlmfzoccat 43837 |
| Copyright terms: Public domain | W3C validator |