lmatfval - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > lmatfval		Structured version Visualization version GIF version

Theorem lmatfval 32782

Description: Entries of a literal matrix. (Contributed by Thierry Arnoux, 28-Aug-2020.)

**Hypotheses**
Ref	Expression
lmatfval.m	⊢ 𝑀 = (litMat‘𝑊)
lmatfval.n	⊢ (𝜑 → 𝑁 ∈ ℕ)
lmatfval.w	⊢ (𝜑 → 𝑊 ∈ Word Word 𝑉)
lmatfval.1	⊢ (𝜑 → (♯‘𝑊) = 𝑁)
lmatfval.2	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (♯‘(𝑊‘𝑖)) = 𝑁)
lmatfval.i	⊢ (𝜑 → 𝐼 ∈ (1...𝑁))
lmatfval.j	⊢ (𝜑 → 𝐽 ∈ (1...𝑁))

**Assertion**
Ref	Expression
lmatfval	⊢ (𝜑 → (𝐼𝑀𝐽) = ((𝑊‘(𝐼 − 1))‘(𝐽 − 1)))

Distinct variable groups: 𝑖,𝑀 𝑖,𝐼 𝑖,𝐽 𝑖,𝑁 𝑖,𝑊 𝜑,𝑖 Allowed substitution hint: 𝑉(𝑖)

Proof of Theorem lmatfval Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lmatfval.m	. . 3 ⊢ 𝑀 = (litMat‘𝑊)
2		lmatfval.w	. . . 4 ⊢ (𝜑 → 𝑊 ∈ Word Word 𝑉)
3		lmatval 32781	. . . 4 ⊢ (𝑊 ∈ Word Word 𝑉 → (litMat‘𝑊) = (𝑖 ∈ (1...(♯‘𝑊)), 𝑗 ∈ (1...(♯‘(𝑊‘0))) ↦ ((𝑊‘(𝑖 − 1))‘(𝑗 − 1))))
4	2, 3	syl 17	. . 3 ⊢ (𝜑 → (litMat‘𝑊) = (𝑖 ∈ (1...(♯‘𝑊)), 𝑗 ∈ (1...(♯‘(𝑊‘0))) ↦ ((𝑊‘(𝑖 − 1))‘(𝑗 − 1))))
5	1, 4	eqtrid 2784	. 2 ⊢ (𝜑 → 𝑀 = (𝑖 ∈ (1...(♯‘𝑊)), 𝑗 ∈ (1...(♯‘(𝑊‘0))) ↦ ((𝑊‘(𝑖 − 1))‘(𝑗 − 1))))
6		simprl 769	. . . 4 ⊢ ((𝜑 ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐽)) → 𝑖 = 𝐼)
7	6	fvoveq1d 7427	. . 3 ⊢ ((𝜑 ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐽)) → (𝑊‘(𝑖 − 1)) = (𝑊‘(𝐼 − 1)))
8		simprr 771	. . . 4 ⊢ ((𝜑 ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐽)) → 𝑗 = 𝐽)
9	8	oveq1d 7420	. . 3 ⊢ ((𝜑 ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐽)) → (𝑗 − 1) = (𝐽 − 1))
10	7, 9	fveq12d 6895	. 2 ⊢ ((𝜑 ∧ (𝑖 = 𝐼 ∧ 𝑗 = 𝐽)) → ((𝑊‘(𝑖 − 1))‘(𝑗 − 1)) = ((𝑊‘(𝐼 − 1))‘(𝐽 − 1)))
11		lmatfval.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ (1...𝑁))
12		lmatfval.1	. . . 4 ⊢ (𝜑 → (♯‘𝑊) = 𝑁)
13	12	oveq2d 7421	. . 3 ⊢ (𝜑 → (1...(♯‘𝑊)) = (1...𝑁))
14	11, 13	eleqtrrd 2836	. 2 ⊢ (𝜑 → 𝐼 ∈ (1...(♯‘𝑊)))
15		lmatfval.j	. . 3 ⊢ (𝜑 → 𝐽 ∈ (1...𝑁))
16		1m1e0 12280	. . . . . 6 ⊢ (1 − 1) = 0
17		lmatfval.n	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℕ)
18		nnuz 12861	. . . . . . . . 9 ⊢ ℕ = (ℤ_≥‘1)
19	17, 18	eleqtrdi 2843	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘1))
20		eluzfz1 13504	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘1) → 1 ∈ (1...𝑁))
21	19, 20	syl 17	. . . . . . 7 ⊢ (𝜑 → 1 ∈ (1...𝑁))
22		fz1fzo0m1 13676	. . . . . . 7 ⊢ (1 ∈ (1...𝑁) → (1 − 1) ∈ (0..^𝑁))
23	21, 22	syl 17	. . . . . 6 ⊢ (𝜑 → (1 − 1) ∈ (0..^𝑁))
24	16, 23	eqeltrrid 2838	. . . . 5 ⊢ (𝜑 → 0 ∈ (0..^𝑁))
25		simpr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 = 0) → 𝑖 = 0)
26	25	eleq1d 2818	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 = 0) → (𝑖 ∈ (0..^𝑁) ↔ 0 ∈ (0..^𝑁)))
27	25	fveq2d 6892	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 = 0) → (𝑊‘𝑖) = (𝑊‘0))
28	27	fveqeq2d 6896	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 = 0) → ((♯‘(𝑊‘𝑖)) = 𝑁 ↔ (♯‘(𝑊‘0)) = 𝑁))
29	26, 28	imbi12d 344	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 = 0) → ((𝑖 ∈ (0..^𝑁) → (♯‘(𝑊‘𝑖)) = 𝑁) ↔ (0 ∈ (0..^𝑁) → (♯‘(𝑊‘0)) = 𝑁)))
30		lmatfval.2	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑁)) → (♯‘(𝑊‘𝑖)) = 𝑁)
31	30	ex 413	. . . . . 6 ⊢ (𝜑 → (𝑖 ∈ (0..^𝑁) → (♯‘(𝑊‘𝑖)) = 𝑁))
32	24, 29, 31	vtocld 3542	. . . . 5 ⊢ (𝜑 → (0 ∈ (0..^𝑁) → (♯‘(𝑊‘0)) = 𝑁))
33	24, 32	mpd 15	. . . 4 ⊢ (𝜑 → (♯‘(𝑊‘0)) = 𝑁)
34	33	oveq2d 7421	. . 3 ⊢ (𝜑 → (1...(♯‘(𝑊‘0))) = (1...𝑁))
35	15, 34	eleqtrrd 2836	. 2 ⊢ (𝜑 → 𝐽 ∈ (1...(♯‘(𝑊‘0))))
36		fz1fzo0m1 13676	. . . . . 6 ⊢ (𝐼 ∈ (1...𝑁) → (𝐼 − 1) ∈ (0..^𝑁))
37	11, 36	syl 17	. . . . 5 ⊢ (𝜑 → (𝐼 − 1) ∈ (0..^𝑁))
38	12	oveq2d 7421	. . . . 5 ⊢ (𝜑 → (0..^(♯‘𝑊)) = (0..^𝑁))
39	37, 38	eleqtrrd 2836	. . . 4 ⊢ (𝜑 → (𝐼 − 1) ∈ (0..^(♯‘𝑊)))
40		wrdsymbcl 14473	. . . 4 ⊢ ((𝑊 ∈ Word Word 𝑉 ∧ (𝐼 − 1) ∈ (0..^(♯‘𝑊))) → (𝑊‘(𝐼 − 1)) ∈ Word 𝑉)
41	2, 39, 40	syl2anc 584	. . 3 ⊢ (𝜑 → (𝑊‘(𝐼 − 1)) ∈ Word 𝑉)
42		fz1fzo0m1 13676	. . . . 5 ⊢ (𝐽 ∈ (1...𝑁) → (𝐽 − 1) ∈ (0..^𝑁))
43	15, 42	syl 17	. . . 4 ⊢ (𝜑 → (𝐽 − 1) ∈ (0..^𝑁))
44		simpr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 = (𝐼 − 1)) → 𝑖 = (𝐼 − 1))
45	44	eleq1d 2818	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 = (𝐼 − 1)) → (𝑖 ∈ (0..^𝑁) ↔ (𝐼 − 1) ∈ (0..^𝑁)))
46	44	fveq2d 6892	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 = (𝐼 − 1)) → (𝑊‘𝑖) = (𝑊‘(𝐼 − 1)))
47	46	fveqeq2d 6896	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 = (𝐼 − 1)) → ((♯‘(𝑊‘𝑖)) = 𝑁 ↔ (♯‘(𝑊‘(𝐼 − 1))) = 𝑁))
48	45, 47	imbi12d 344	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 = (𝐼 − 1)) → ((𝑖 ∈ (0..^𝑁) → (♯‘(𝑊‘𝑖)) = 𝑁) ↔ ((𝐼 − 1) ∈ (0..^𝑁) → (♯‘(𝑊‘(𝐼 − 1))) = 𝑁)))
49	37, 48, 31	vtocld 3542	. . . . . 6 ⊢ (𝜑 → ((𝐼 − 1) ∈ (0..^𝑁) → (♯‘(𝑊‘(𝐼 − 1))) = 𝑁))
50	37, 49	mpd 15	. . . . 5 ⊢ (𝜑 → (♯‘(𝑊‘(𝐼 − 1))) = 𝑁)
51	50	oveq2d 7421	. . . 4 ⊢ (𝜑 → (0..^(♯‘(𝑊‘(𝐼 − 1)))) = (0..^𝑁))
52	43, 51	eleqtrrd 2836	. . 3 ⊢ (𝜑 → (𝐽 − 1) ∈ (0..^(♯‘(𝑊‘(𝐼 − 1)))))
53		wrdsymbcl 14473	. . 3 ⊢ (((𝑊‘(𝐼 − 1)) ∈ Word 𝑉 ∧ (𝐽 − 1) ∈ (0..^(♯‘(𝑊‘(𝐼 − 1))))) → ((𝑊‘(𝐼 − 1))‘(𝐽 − 1)) ∈ 𝑉)
54	41, 52, 53	syl2anc 584	. 2 ⊢ (𝜑 → ((𝑊‘(𝐼 − 1))‘(𝐽 − 1)) ∈ 𝑉)
55	5, 10, 14, 35, 54	ovmpod 7556	1 ⊢ (𝜑 → (𝐼𝑀𝐽) = ((𝑊‘(𝐼 − 1))‘(𝐽 − 1)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ‘cfv 6540 (class class class)co 7405 ∈ cmpo 7407 0cc0 11106 1c1 11107 − cmin 11440 ℕcn 12208 ℤ_≥cuz 12818 ...cfz 13480 ..^cfzo 13623 ♯chash 14286 Word cword 14460 litMatclmat 32779

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-n0 12469 df-z 12555 df-uz 12819 df-fz 13481 df-fzo 13624 df-hash 14287 df-word 14461 df-lmat 32780

This theorem is referenced by: lmatfvlem 32783 lmat22e11 32786

W3C validator