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

Theorem smatlem 31150
 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.
StepHypRef Expression
1 smat.s . . . . . 6 𝑆 = (𝐾(subMat1‘𝐴)𝐿)
2 fz1ssnn 12937 . . . . . . . 8 (1...𝑀) ⊆ ℕ
3 smat.k . . . . . . . 8 (𝜑𝐾 ∈ (1...𝑀))
42, 3sseldi 3916 . . . . . . 7 (𝜑𝐾 ∈ ℕ)
5 fz1ssnn 12937 . . . . . . . 8 (1...𝑁) ⊆ ℕ
6 smat.l . . . . . . . 8 (𝜑𝐿 ∈ (1...𝑁))
75, 6sseldi 3916 . . . . . . 7 (𝜑𝐿 ∈ ℕ)
8 smat.a . . . . . . 7 (𝜑𝐴 ∈ (𝐵m ((1...𝑀) × (1...𝑁))))
9 smatfval 31148 . . . . . . 7 ((𝐾 ∈ ℕ ∧ 𝐿 ∈ ℕ ∧ 𝐴 ∈ (𝐵m ((1...𝑀) × (1...𝑁)))) → (𝐾(subMat1‘𝐴)𝐿) = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
104, 7, 8, 9syl3anc 1368 . . . . . 6 (𝜑 → (𝐾(subMat1‘𝐴)𝐿) = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
111, 10syl5eq 2848 . . . . 5 (𝜑𝑆 = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
1211oveqd 7156 . . . 4 (𝜑 → (𝐼𝑆𝐽) = (𝐼(𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))𝐽))
13 df-ov 7142 . . . 4 (𝐼(𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))𝐽) = ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩)
1412, 13eqtrdi 2852 . . 3 (𝜑 → (𝐼𝑆𝐽) = ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩))
15 smatlem.i . . . . . . 7 (𝜑𝐼 ∈ ℕ)
16 smatlem.j . . . . . . 7 (𝜑𝐽 ∈ ℕ)
1715, 16jca 515 . . . . . 6 (𝜑 → (𝐼 ∈ ℕ ∧ 𝐽 ∈ ℕ))
18 opelxp 5559 . . . . . 6 (⟨𝐼, 𝐽⟩ ∈ (ℕ × ℕ) ↔ (𝐼 ∈ ℕ ∧ 𝐽 ∈ ℕ))
1917, 18sylibr 237 . . . . 5 (𝜑 → ⟨𝐼, 𝐽⟩ ∈ (ℕ × ℕ))
20 eqid 2801 . . . . . 6 (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) = (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
21 opex 5324 . . . . . 6 ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ ∈ V
2220, 21dmmpo 7755 . . . . 5 dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) = (ℕ × ℕ)
2319, 22eleqtrrdi 2904 . . . 4 (𝜑 → ⟨𝐼, 𝐽⟩ ∈ dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))
2420mpofun 7259 . . . . 5 Fun (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
25 fvco 6740 . . . . 5 ((Fun (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) ∧ ⟨𝐼, 𝐽⟩ ∈ dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)) → ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩) = (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)))
2624, 25mpan 689 . . . 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 2836 . 2 (𝜑 → (𝐼𝑆𝐽) = (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)))
29 df-ov 7142 . . . . 5 (𝐼(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)𝐽) = ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)
30 breq1 5036 . . . . . . . . . 10 (𝑖 = 𝐼 → (𝑖 < 𝐾𝐼 < 𝐾))
31 id 22 . . . . . . . . . 10 (𝑖 = 𝐼𝑖 = 𝐼)
32 oveq1 7146 . . . . . . . . . 10 (𝑖 = 𝐼 → (𝑖 + 1) = (𝐼 + 1))
3330, 31, 32ifbieq12d 4455 . . . . . . . . 9 (𝑖 = 𝐼 → if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)) = if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)))
3433opeq1d 4774 . . . . . . . 8 (𝑖 = 𝐼 → ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ = ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
35 breq1 5036 . . . . . . . . . 10 (𝑗 = 𝐽 → (𝑗 < 𝐿𝐽 < 𝐿))
36 id 22 . . . . . . . . . 10 (𝑗 = 𝐽𝑗 = 𝐽)
37 oveq1 7146 . . . . . . . . . 10 (𝑗 = 𝐽 → (𝑗 + 1) = (𝐽 + 1))
3835, 36, 37ifbieq12d 4455 . . . . . . . . 9 (𝑗 = 𝐽 → if(𝑗 < 𝐿, 𝑗, (𝑗 + 1)) = if(𝐽 < 𝐿, 𝐽, (𝐽 + 1)))
3938opeq2d 4775 . . . . . . . 8 (𝑗 = 𝐽 → ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ = ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩)
40 opex 5324 . . . . . . . 8 ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩ ∈ V
4134, 39, 20, 40ovmpo 7293 . . . . . . 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 4776 . . . . . 6 (𝜑 → ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩ = ⟨𝑋, 𝑌⟩)
4642, 45eqtrd 2836 . . . . 5 (𝜑 → (𝐼(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)𝐽) = ⟨𝑋, 𝑌⟩)
4729, 46syl5eqr 2850 . . . 4 (𝜑 → ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩) = ⟨𝑋, 𝑌⟩)
4847fveq2d 6653 . . 3 (𝜑 → (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)) = (𝐴‘⟨𝑋, 𝑌⟩))
49 df-ov 7142 . . 3 (𝑋𝐴𝑌) = (𝐴‘⟨𝑋, 𝑌⟩)
5048, 49eqtr4di 2854 . 2 (𝜑 → (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)) = (𝑋𝐴𝑌))
5128, 50eqtrd 2836 1 (𝜑 → (𝐼𝑆𝐽) = (𝑋𝐴𝑌))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2112  ifcif 4428  ⟨cop 4534   class class class wbr 5033   × cxp 5521  dom cdm 5523   ∘ ccom 5527  Fun wfun 6322  ‘cfv 6328  (class class class)co 7139   ∈ cmpo 7141   ↑m cmap 8393  1c1 10531   + caddc 10533   < clt 10668  ℕcn 11629  ...cfz 12889  subMat1csmat 31146 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 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-rep 5157  ax-sep 5170  ax-nul 5177  ax-pow 5234  ax-pr 5298  ax-un 7445  ax-cnex 10586  ax-resscn 10587  ax-1cn 10588  ax-icn 10589  ax-addcl 10590  ax-addrcl 10591  ax-mulcl 10592  ax-mulrcl 10593  ax-mulcom 10594  ax-addass 10595  ax-mulass 10596  ax-distr 10597  ax-i2m1 10598  ax-1ne0 10599  ax-1rid 10600  ax-rnegex 10601  ax-rrecex 10602  ax-cnre 10603  ax-pre-lttri 10604  ax-pre-lttrn 10605  ax-pre-ltadd 10606  ax-pre-mulgt0 10607 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ne 2991  df-nel 3095  df-ral 3114  df-rex 3115  df-reu 3116  df-rab 3118  df-v 3446  df-sbc 3724  df-csb 3832  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3903  df-nul 4247  df-if 4429  df-pw 4502  df-sn 4529  df-pr 4531  df-tp 4533  df-op 4535  df-uni 4804  df-iun 4886  df-br 5034  df-opab 5096  df-mpt 5114  df-tr 5140  df-id 5428  df-eprel 5433  df-po 5442  df-so 5443  df-fr 5482  df-we 5484  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-res 5535  df-ima 5536  df-pred 6120  df-ord 6166  df-on 6167  df-lim 6168  df-suc 6169  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-riota 7097  df-ov 7142  df-oprab 7143  df-mpo 7144  df-om 7565  df-1st 7675  df-2nd 7676  df-wrecs 7934  df-recs 7995  df-rdg 8033  df-er 8276  df-en 8497  df-dom 8498  df-sdom 8499  df-pnf 10670  df-mnf 10671  df-xr 10672  df-ltxr 10673  df-le 10674  df-sub 10865  df-neg 10866  df-nn 11630  df-z 11974  df-uz 12236  df-fz 12890  df-smat 31147 This theorem is referenced by:  smattl  31151  smattr  31152  smatbl  31153  smatbr  31154  1smat1  31157  madjusmdetlem3  31182
 Copyright terms: Public domain W3C validator