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 29191
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 12243 . . . . . . . 8 (1...𝑀) ⊆ ℕ
3 smat.k . . . . . . . 8 (𝜑𝐾 ∈ (1...𝑀))
42, 3sseldi 3566 . . . . . . 7 (𝜑𝐾 ∈ ℕ)
5 fz1ssnn 12243 . . . . . . . 8 (1...𝑁) ⊆ ℕ
6 smat.l . . . . . . . 8 (𝜑𝐿 ∈ (1...𝑁))
75, 6sseldi 3566 . . . . . . 7 (𝜑𝐿 ∈ ℕ)
8 smat.a . . . . . . 7 (𝜑𝐴 ∈ (𝐵𝑚 ((1...𝑀) × (1...𝑁))))
9 smatfval 29189 . . . . . . 7 ((𝐾 ∈ ℕ ∧ 𝐿 ∈ ℕ ∧ 𝐴 ∈ (𝐵𝑚 ((1...𝑀) × (1...𝑁)))) → (𝐾(subMat1‘𝐴)𝐿) = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
104, 7, 8, 9syl3anc 1318 . . . . . 6 (𝜑 → (𝐾(subMat1‘𝐴)𝐿) = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
111, 10syl5eq 2656 . . . . 5 (𝜑𝑆 = (𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)))
1211oveqd 6566 . . . 4 (𝜑 → (𝐼𝑆𝐽) = (𝐼(𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))𝐽))
13 df-ov 6552 . . . 4 (𝐼(𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))𝐽) = ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩)
1412, 13syl6eq 2660 . . 3 (𝜑 → (𝐼𝑆𝐽) = ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩))
15 smatlem.i . . . . . . 7 (𝜑𝐼 ∈ ℕ)
16 smatlem.j . . . . . . 7 (𝜑𝐽 ∈ ℕ)
1715, 16jca 553 . . . . . 6 (𝜑 → (𝐼 ∈ ℕ ∧ 𝐽 ∈ ℕ))
18 opelxp 5070 . . . . . 6 (⟨𝐼, 𝐽⟩ ∈ (ℕ × ℕ) ↔ (𝐼 ∈ ℕ ∧ 𝐽 ∈ ℕ))
1917, 18sylibr 223 . . . . 5 (𝜑 → ⟨𝐼, 𝐽⟩ ∈ (ℕ × ℕ))
20 eqid 2610 . . . . . 6 (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) = (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
21 opex 4859 . . . . . 6 ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ ∈ V
2220, 21dmmpt2 7129 . . . . 5 dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) = (ℕ × ℕ)
2319, 22syl6eleqr 2699 . . . 4 (𝜑 → ⟨𝐼, 𝐽⟩ ∈ dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))
2420mpt2fun 6660 . . . . 5 Fun (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
25 fvco 6184 . . . . 5 ((Fun (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩) ∧ ⟨𝐼, 𝐽⟩ ∈ dom (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)) → ((𝐴 ∘ (𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩))‘⟨𝐼, 𝐽⟩) = (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)))
2624, 25mpan 702 . . . 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 2644 . 2 (𝜑 → (𝐼𝑆𝐽) = (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)))
29 df-ov 6552 . . . . 5 (𝐼(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)𝐽) = ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)
30 breq1 4586 . . . . . . . . . 10 (𝑖 = 𝐼 → (𝑖 < 𝐾𝐼 < 𝐾))
31 id 22 . . . . . . . . . 10 (𝑖 = 𝐼𝑖 = 𝐼)
32 oveq1 6556 . . . . . . . . . 10 (𝑖 = 𝐼 → (𝑖 + 1) = (𝐼 + 1))
3330, 31, 32ifbieq12d 4063 . . . . . . . . 9 (𝑖 = 𝐼 → if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)) = if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)))
3433opeq1d 4346 . . . . . . . 8 (𝑖 = 𝐼 → ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ = ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)
35 breq1 4586 . . . . . . . . . 10 (𝑗 = 𝐽 → (𝑗 < 𝐿𝐽 < 𝐿))
36 id 22 . . . . . . . . . 10 (𝑗 = 𝐽𝑗 = 𝐽)
37 oveq1 6556 . . . . . . . . . 10 (𝑗 = 𝐽 → (𝑗 + 1) = (𝐽 + 1))
3835, 36, 37ifbieq12d 4063 . . . . . . . . 9 (𝑗 = 𝐽 → if(𝑗 < 𝐿, 𝑗, (𝑗 + 1)) = if(𝐽 < 𝐿, 𝐽, (𝐽 + 1)))
3938opeq2d 4347 . . . . . . . 8 (𝑗 = 𝐽 → ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩ = ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩)
40 opex 4859 . . . . . . . 8 ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩ ∈ V
4134, 39, 20, 40ovmpt2 6694 . . . . . . 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 4348 . . . . . 6 (𝜑 → ⟨if(𝐼 < 𝐾, 𝐼, (𝐼 + 1)), if(𝐽 < 𝐿, 𝐽, (𝐽 + 1))⟩ = ⟨𝑋, 𝑌⟩)
4642, 45eqtrd 2644 . . . . 5 (𝜑 → (𝐼(𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)𝐽) = ⟨𝑋, 𝑌⟩)
4729, 46syl5eqr 2658 . . . 4 (𝜑 → ((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩) = ⟨𝑋, 𝑌⟩)
4847fveq2d 6107 . . 3 (𝜑 → (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)) = (𝐴‘⟨𝑋, 𝑌⟩))
49 df-ov 6552 . . 3 (𝑋𝐴𝑌) = (𝐴‘⟨𝑋, 𝑌⟩)
5048, 49syl6eqr 2662 . 2 (𝜑 → (𝐴‘((𝑖 ∈ ℕ, 𝑗 ∈ ℕ ↦ ⟨if(𝑖 < 𝐾, 𝑖, (𝑖 + 1)), if(𝑗 < 𝐿, 𝑗, (𝑗 + 1))⟩)‘⟨𝐼, 𝐽⟩)) = (𝑋𝐴𝑌))
5128, 50eqtrd 2644 1 (𝜑 → (𝐼𝑆𝐽) = (𝑋𝐴𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wcel 1977  ifcif 4036  cop 4131   class class class wbr 4583   × cxp 5036  dom cdm 5038  ccom 5042  Fun wfun 5798  cfv 5804  (class class class)co 6549  cmpt2 6551  𝑚 cmap 7744  1c1 9816   + caddc 9818   < clt 9953  cn 10897  ...cfz 12197  subMat1csmat 29187
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-z 11255  df-uz 11564  df-fz 12198  df-smat 29188
This theorem is referenced by:  smattl  29192  smattr  29193  smatbl  29194  smatbr  29195  1smat1  29198  madjusmdetlem3  29223
  Copyright terms: Public domain W3C validator