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

Theorem smatlem 30193
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 (𝜑𝐴 ∈ (𝐵𝑚 ((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.
StepHypRef Expression
1 smat.s . . . . . 6 𝑆 = (𝐾(subMat1‘𝐴)𝐿)
2 fz1ssnn 12585 . . . . . . . 8 (1...𝑀) ⊆ ℕ
3 smat.k . . . . . . . 8 (𝜑𝐾 ∈ (1...𝑀))
42, 3sseldi 3742 . . . . . . 7 (𝜑𝐾 ∈ ℕ)
5 fz1ssnn 12585 . . . . . . . 8 (1...𝑁) ⊆ ℕ
6 smat.l . . . . . . . 8 (𝜑𝐿 ∈ (1...𝑁))
75, 6sseldi 3742 . . . . . . 7 (𝜑𝐿 ∈ ℕ)
8 smat.a . . . . . . 7 (𝜑𝐴 ∈ (𝐵𝑚 ((1...𝑀) × (1...𝑁))))
9 smatfval 30191 . . . . . . 7 ((𝐾 ∈ ℕ ∧ 𝐿 ∈ ℕ ∧ 𝐴 ∈ (𝐵𝑚 ((1...𝑀) × (1...𝑁)))) → (𝐾(subMat1‘𝐴)𝐿) = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
104, 7, 8, 9syl3anc 1477 . . . . . 6 (𝜑 → (𝐾(subMat1‘𝐴)𝐿) = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
111, 10syl5eq 2806 . . . . 5 (𝜑𝑆 = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
1211oveqd 6831 . . . 4 (𝜑 → (𝐼𝑆𝐽) = (𝐼(𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))𝐽))
13 df-ov 6817 . . . 4 (𝐼(𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))𝐽) = ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩)
1412, 13syl6eq 2810 . . 3 (𝜑 → (𝐼𝑆𝐽) = ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩))
15 smatlem.i . . . . . . 7 (𝜑𝐼 ∈ ℕ)
16 smatlem.j . . . . . . 7 (𝜑𝐽 ∈ ℕ)
1715, 16jca 555 . . . . . 6 (𝜑 → (𝐼 ∈ ℕ ∧ 𝐽 ∈ ℕ))
18 opelxp 5303 . . . . . 6 (⟨𝐼, 𝐽⟩ ∈ (ℕ × ℕ) ↔ (𝐼 ∈ ℕ ∧ 𝐽 ∈ ℕ))
1917, 18sylibr 224 . . . . 5 (𝜑 → ⟨𝐼, 𝐽⟩ ∈ (ℕ × ℕ))
20 eqid 2760 . . . . . 6 (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) = (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
21 opex 5081 . . . . . 6 ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ ∈ V
2220, 21dmmpt2 7409 . . . . 5 dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) = (ℕ × ℕ)
2319, 22syl6eleqr 2850 . . . 4 (𝜑 → ⟨𝐼, 𝐽⟩ ∈ dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))
2420mpt2fun 6928 . . . . 5 Fun (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
25 fvco 6437 . . . . 5 ((Fun (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) ∧ ⟨𝐼, 𝐽⟩ ∈ dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)) → ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩) = (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)))
2624, 25mpan 708 . . . 4 (⟨𝐼, 𝐽⟩ ∈ dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) → ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩) = (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)))
2723, 26syl 17 . . 3 (𝜑 → ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩) = (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)))
2814, 27eqtrd 2794 . 2 (𝜑 → (𝐼𝑆𝐽) = (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)))
29 df-ov 6817 . . . . 5 (𝐼(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)𝐽) = ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)
30 breq1 4807 . . . . . . . . . 10 (𝑖 = 𝐼 → (𝑖 < 𝐾𝐼 < 𝐾))
31 id 22 . . . . . . . . . 10 (𝑖 = 𝐼𝑖 = 𝐼)
32 oveq1 6821 . . . . . . . . . 10 (𝑖 = 𝐼 → (𝑖 + 1) = (𝐼 + 1))
3330, 31, 32ifbieq12d 4257 . . . . . . . . 9 (𝑖 = 𝐼 → if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)) = if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)))
3433opeq1d 4559 . . . . . . . 8 (𝑖 = 𝐼 → ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ = ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
35 breq1 4807 . . . . . . . . . 10 (𝑗 = 𝐽 → (𝑗 < 𝐿𝐽 < 𝐿))
36 id 22 . . . . . . . . . 10 (𝑗 = 𝐽𝑗 = 𝐽)
37 oveq1 6821 . . . . . . . . . 10 (𝑗 = 𝐽 → (𝑗 + 1) = (𝐽 + 1))
3835, 36, 37ifbieq12d 4257 . . . . . . . . 9 (𝑗 = 𝐽 → if(𝑗 < 𝐿, 𝑗, (𝑗 + 1)) = if(𝐽 < 𝐿, 𝐽, (𝐽 + 1)))
3938opeq2d 4560 . . . . . . . 8 (𝑗 = 𝐽 → ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ = ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩)
40 opex 5081 . . . . . . . 8 ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩ ∈ V
4134, 39, 20, 40ovmpt2 6962 . . . . . . 7 ((𝐼 ∈ ℕ ∧ 𝐽 ∈ ℕ) → (𝐼(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)𝐽) = ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩)
4217, 41syl 17 . . . . . 6 (𝜑 → (𝐼(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)𝐽) = ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩)
43 smatlem.1 . . . . . . 7 (𝜑 → if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)) = 𝑋)
44 smatlem.2 . . . . . . 7 (𝜑 → if(𝐽 < 𝐿, 𝐽, (𝐽 + 1)) = 𝑌)
4543, 44opeq12d 4561 . . . . . 6 (𝜑 → ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩ = ⟨𝑋, 𝑌⟩)
4642, 45eqtrd 2794 . . . . 5 (𝜑 → (𝐼(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)𝐽) = ⟨𝑋, 𝑌⟩)
4729, 46syl5eqr 2808 . . . 4 (𝜑 → ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩) = ⟨𝑋, 𝑌⟩)
4847fveq2d 6357 . . 3 (𝜑 → (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)) = (𝐴‘⟨𝑋, 𝑌⟩))
49 df-ov 6817 . . 3 (𝑋𝐴𝑌) = (𝐴‘⟨𝑋, 𝑌⟩)
5048, 49syl6eqr 2812 . 2 (𝜑 → (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)) = (𝑋𝐴𝑌))
5128, 50eqtrd 2794 1 (𝜑 → (𝐼𝑆𝐽) = (𝑋𝐴𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1632  wcel 2139  ifcif 4230  cop 4327   class class class wbr 4804   × cxp 5264  dom cdm 5266  ccom 5270  Fun wfun 6043  cfv 6049  (class class class)co 6814  cmpt2 6816  𝑚 cmap 8025  1c1 10149   + caddc 10151   < clt 10286  cn 11232  ...cfz 12539  subMat1csmat 30189
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7115  ax-cnex 10204  ax-resscn 10205  ax-1cn 10206  ax-icn 10207  ax-addcl 10208  ax-addrcl 10209  ax-mulcl 10210  ax-mulrcl 10211  ax-mulcom 10212  ax-addass 10213  ax-mulass 10214  ax-distr 10215  ax-i2m1 10216  ax-1ne0 10217  ax-1rid 10218  ax-rnegex 10219  ax-rrecex 10220  ax-cnre 10221  ax-pre-lttri 10222  ax-pre-lttrn 10223  ax-pre-ltadd 10224  ax-pre-mulgt0 10225
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-nel 3036  df-ral 3055  df-rex 3056  df-reu 3057  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-riota 6775  df-ov 6817  df-oprab 6818  df-mpt2 6819  df-om 7232  df-1st 7334  df-2nd 7335  df-wrecs 7577  df-recs 7638  df-rdg 7676  df-er 7913  df-en 8124  df-dom 8125  df-sdom 8126  df-pnf 10288  df-mnf 10289  df-xr 10290  df-ltxr 10291  df-le 10292  df-sub 10480  df-neg 10481  df-nn 11233  df-z 11590  df-uz 11900  df-fz 12540  df-smat 30190
This theorem is referenced by:  smattl  30194  smattr  30195  smatbl  30196  smatbr  30197  1smat1  30200  madjusmdetlem3  30225
  Copyright terms: Public domain W3C validator