Theorem smatlem 34475

Description: Lemma for the next theorems. (Contributed by Thierry Arnoux, 19-Aug-2020.)

Hypotheses

Ref	Expression
smat.s	⊢ 𝑆 = (𝐾(subMat1‘𝐴)𝐿)
smat.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
smat.n	⊢ (𝜑 → 𝑁 ∈ ℕ)
smat.k	⊢ (𝜑 → 𝐾 ∈ (1...𝑀))
smat.l	⊢ (𝜑 → 𝐿 ∈ (1...𝑁))
smat.a	⊢ (𝜑 → 𝐴 ∈ (𝐵 ↑m ((1...𝑀) × (1...𝑁))))
smatlem.i	⊢ (𝜑 → 𝐼 ∈ ℕ)
smatlem.j	⊢ (𝜑 → 𝐽 ∈ ℕ)
smatlem.1	⊢ (𝜑 → if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)) = 𝑋)
smatlem.2	⊢ (𝜑 → if(𝐽 < 𝐿, 𝐽, (𝐽 + 1)) = 𝑌)

Assertion

Ref	Expression
smatlem	⊢ (𝜑 → (𝐼𝑆𝐽) = (𝑋𝐴𝑌))

Proof of Theorem smatlem

Dummy variables 𝑖 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		smat.s	. . . . . 6 ⊢ 𝑆 = (𝐾(subMat1‘𝐴)𝐿)
2		fz1ssnn 13692	. . . . . . . 8 ⊢ (1...𝑀) ⊆ ℕ
3		smat.k	. . . . . . . 8 ⊢ (𝜑 → 𝐾 ∈ (1...𝑀))
4	2, 3	sselid 3906	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ ℕ)
5		fz1ssnn 13692	. . . . . . . 8 ⊢ (1...𝑁) ⊆ ℕ
6		smat.l	. . . . . . . 8 ⊢ (𝜑 → 𝐿 ∈ (1...𝑁))
7	5, 6	sselid 3906	. . . . . . 7 ⊢ (𝜑 → 𝐿 ∈ ℕ)
8		smat.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ (𝐵 ↑m ((1...𝑀) × (1...𝑁))))
9		smatfval 34473	. . . . . . 7 ⊢ ((𝐾 ∈ ℕ ∧ 𝐿 ∈ ℕ ∧ 𝐴 ∈ (𝐵 ↑m ((1...𝑀) × (1...𝑁)))) → (𝐾(subMat1‘𝐴)𝐿) = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
10	4, 7, 8, 9	syl3anc 1398	. . . . . 6 ⊢ (𝜑 → (𝐾(subMat1‘𝐴)𝐿) = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
11	1, 10	eqtrid 2807	. . . . 5 ⊢ (𝜑 → 𝑆 = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
12	11	oveqd 7437	. . . 4 ⊢ (𝜑 → (𝐼𝑆𝐽) = (𝐼(𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))𝐽))
13		df-ov 7423	. . . 4 ⊢ (𝐼(𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))𝐽) = ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩)
14	12, 13	eqtrdi 2811	. . 3 ⊢ (𝜑 → (𝐼𝑆𝐽) = ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩))
15		smatlem.i	. . . . . . 7 ⊢ (𝜑 → 𝐼 ∈ ℕ)
16		smatlem.j	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ ℕ)
17	15, 16	jca 521	. . . . . 6 ⊢ (𝜑 → (𝐼 ∈ ℕ ∧ 𝐽 ∈ ℕ))
18		opelxp 5686	. . . . . 6 ⊢ (⟨𝐼, 𝐽⟩ ∈ (ℕ × ℕ) ↔ (𝐼 ∈ ℕ ∧ 𝐽 ∈ ℕ))
19	17, 18	sylibr 237	. . . . 5 ⊢ (𝜑 → ⟨𝐼, 𝐽⟩ ∈ (ℕ × ℕ))
20		eqid 2760	. . . . . 6 ⊢ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) = (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
21		opex 5431	. . . . . 6 ⊢ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ ∈ V
22	20, 21	dmmpo 8082	. . . . 5 ⊢ dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) = (ℕ × ℕ)
23	19, 22	eleqtrrdi 2871	. . . 4 ⊢ (𝜑 → ⟨𝐼, 𝐽⟩ ∈ dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))
24	20	mpofun 7544	. . . . 5 ⊢ Fun (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
25		fvco 6983	. . . . 5 ⊢ ((Fun (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) ∧ ⟨𝐼, 𝐽⟩ ∈ dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)) → ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩) = (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)))
26	24, 25	mpan 703	. . . 4 ⊢ (⟨𝐼, 𝐽⟩ ∈ dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) → ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩) = (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)))
27	23, 26	syl 18	. . 3 ⊢ (𝜑 → ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩) = (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)))
28	14, 27	eqtrd 2795	. 2 ⊢ (𝜑 → (𝐼𝑆𝐽) = (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)))
29		df-ov 7423	. . . . 5 ⊢ (𝐼(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)𝐽) = ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)
30		breq1 5105	. . . . . . . . . 10 ⊢ (𝑖 = 𝐼 → (𝑖 < 𝐾 ↔ 𝐼 < 𝐾))
31		id 23	. . . . . . . . . 10 ⊢ (𝑖 = 𝐼 → 𝑖 = 𝐼)
32		oveq1 7427	. . . . . . . . . 10 ⊢ (𝑖 = 𝐼 → (𝑖 + 1) = (𝐼 + 1))
33	30, 31, 32	ifbieq12d 4510	. . . . . . . . 9 ⊢ (𝑖 = 𝐼 → if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)) = if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)))
34	33	opeq1d 4845	. . . . . . . 8 ⊢ (𝑖 = 𝐼 → ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ = ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
35		breq1 5105	. . . . . . . . . 10 ⊢ (𝑗 = 𝐽 → (𝑗 < 𝐿 ↔ 𝐽 < 𝐿))
36		id 23	. . . . . . . . . 10 ⊢ (𝑗 = 𝐽 → 𝑗 = 𝐽)
37		oveq1 7427	. . . . . . . . . 10 ⊢ (𝑗 = 𝐽 → (𝑗 + 1) = (𝐽 + 1))
38	35, 36, 37	ifbieq12d 4510	. . . . . . . . 9 ⊢ (𝑗 = 𝐽 → if(𝑗 < 𝐿, 𝑗, (𝑗 + 1)) = if(𝐽 < 𝐿, 𝐽, (𝐽 + 1)))
39	38	opeq2d 4846	. . . . . . . 8 ⊢ (𝑗 = 𝐽 → ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ = ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩)
40		opex 5431	. . . . . . . 8 ⊢ ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩ ∈ V
41	34, 39, 20, 40	ovmpo 7580	. . . . . . 7 ⊢ ((𝐼 ∈ ℕ ∧ 𝐽 ∈ ℕ) → (𝐼(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)𝐽) = ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩)
42	17, 41	syl 18	. . . . . 6 ⊢ (𝜑 → (𝐼(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)𝐽) = ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩)
43		smatlem.1	. . . . . . 7 ⊢ (𝜑 → if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)) = 𝑋)
44		smatlem.2	. . . . . . 7 ⊢ (𝜑 → if(𝐽 < 𝐿, 𝐽, (𝐽 + 1)) = 𝑌)
45	43, 44	opeq12d 4847	. . . . . 6 ⊢ (𝜑 → ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩ = ⟨𝑋, 𝑌⟩)
46	42, 45	eqtrd 2795	. . . . 5 ⊢ (𝜑 → (𝐼(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)𝐽) = ⟨𝑋, 𝑌⟩)
47	29, 46	eqtr3id 2809	. . . 4 ⊢ (𝜑 → ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩) = ⟨𝑋, 𝑌⟩)
48	47	fveq2d 6889	. . 3 ⊢ (𝜑 → (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)) = (𝐴‘⟨𝑋, 𝑌⟩))
49		df-ov 7423	. . 3 ⊢ (𝑋𝐴𝑌) = (𝐴‘⟨𝑋, 𝑌⟩)
50	48, 49	eqtr4di 2813	. 2 ⊢ (𝜑 → (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)) = (𝑋𝐴𝑌))
51	28, 50	eqtrd 2795	1 ⊢ (𝜑 → (𝐼𝑆𝐽) = (𝑋𝐴𝑌))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ifcif 4481  ⟨cop 4834   class class class wbr 5102   × cxp 5648  dom cdm 5650   ∘ ccom 5654  Fun wfun 6532  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422   ↑_m cmap 8850  1c1 11204   + caddc 11206   < clt 11346  ℕcn 12338  ...cfz 13642  subMat1csmat 34471

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11259  ax-resscn 11260  ax-1cn 11261  ax-icn 11262  ax-addcl 11263  ax-addrcl 11264  ax-mulcl 11265  ax-mulrcl 11266  ax-mulcom 11267  ax-addass 11268  ax-mulass 11269  ax-distr 11270  ax-i2m1 11271  ax-1ne0 11272  ax-1rid 11273  ax-rnegex 11274  ax-rrecex 11275  ax-cnre 11276  ax-pre-lttri 11277  ax-pre-lttrn 11278  ax-pre-ltadd 11279  ax-pre-mulgt0 11280

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-er 8720  df-en 8977  df-dom 8978  df-sdom 8979  df-pnf 11348  df-mnf 11349  df-xr 11350  df-ltxr 11351  df-le 11352  df-sub 11546  df-neg 11547  df-nn 12339  df-z 12697  df-uz 12969  df-fz 13643  df-smat 34472

This theorem is used by:  smattl  34476  smattr  34477  smatbl  34478  smatbr  34479  1smat1  34482  madjusmdetlem3  34507