MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  chfacffsupp Structured version   Visualization version   GIF version

Theorem chfacffsupp 22878
Description: The "characteristic factor function" is finitely supported. (Contributed by AV, 20-Nov-2019.) (Proof shortened by AV, 23-Dec-2019.)
Hypotheses
Ref Expression
chfacfisf.a 𝐴 = (𝑁 Mat 𝑅)
chfacfisf.b 𝐵 = (Base‘𝐴)
chfacfisf.p 𝑃 = (Poly1𝑅)
chfacfisf.y 𝑌 = (𝑁 Mat 𝑃)
chfacfisf.r × = (.r𝑌)
chfacfisf.s = (-g𝑌)
chfacfisf.0 0 = (0g𝑌)
chfacfisf.t 𝑇 = (𝑁 matToPolyMat 𝑅)
chfacfisf.g 𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))
Assertion
Ref Expression
chfacffsupp (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) → 𝐺 finSupp (0g𝑌))
Distinct variable groups:   𝐵,𝑛   𝑛,𝑀   𝑛,𝑁   𝑅,𝑛   𝑛,𝑌   𝑛,𝑏   𝑛,𝑠
Allowed substitution hints:   𝐴(𝑛,𝑠,𝑏)   𝐵(𝑠,𝑏)   𝑃(𝑛,𝑠,𝑏)   𝑅(𝑠,𝑏)   𝑇(𝑛,𝑠,𝑏)   × (𝑛,𝑠,𝑏)   𝐺(𝑛,𝑠,𝑏)   𝑀(𝑠,𝑏)   (𝑛,𝑠,𝑏)   𝑁(𝑠,𝑏)   𝑌(𝑠,𝑏)   0 (𝑛,𝑠,𝑏)

Proof of Theorem chfacffsupp
Dummy variables 𝑘 𝑙 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 chfacfisf.g . 2 𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))))
2 fvexd 6922 . . 3 (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) → (0g𝑌) ∈ V)
3 ovex 7464 . . . . 5 ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))) ∈ V
4 fvex 6920 . . . . . 6 (𝑇‘(𝑏𝑠)) ∈ V
5 chfacfisf.0 . . . . . . . 8 0 = (0g𝑌)
65fvexi 6921 . . . . . . 7 0 ∈ V
7 ovex 7464 . . . . . . 7 ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛)))) ∈ V
86, 7ifex 4581 . . . . . 6 if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))) ∈ V
94, 8ifex 4581 . . . . 5 if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛)))))) ∈ V
103, 9ifex 4581 . . . 4 if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))) ∈ V
1110a1i 11 . . 3 ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑛 ∈ ℕ0) → if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))) ∈ V)
12 nnnn0 12531 . . . . . 6 (𝑠 ∈ ℕ → 𝑠 ∈ ℕ0)
13 peano2nn0 12564 . . . . . 6 (𝑠 ∈ ℕ0 → (𝑠 + 1) ∈ ℕ0)
1412, 13syl 17 . . . . 5 (𝑠 ∈ ℕ → (𝑠 + 1) ∈ ℕ0)
1514ad2antrl 728 . . . 4 (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) → (𝑠 + 1) ∈ ℕ0)
16 simplr 769 . . . . . . 7 (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) → 𝑘 ∈ ℕ0)
17 0red 11262 . . . . . . . . . . . . . 14 (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) → 0 ∈ ℝ)
18 nnre 12271 . . . . . . . . . . . . . . . . 17 (𝑠 ∈ ℕ → 𝑠 ∈ ℝ)
19 peano2re 11432 . . . . . . . . . . . . . . . . 17 (𝑠 ∈ ℝ → (𝑠 + 1) ∈ ℝ)
2018, 19syl 17 . . . . . . . . . . . . . . . 16 (𝑠 ∈ ℕ → (𝑠 + 1) ∈ ℝ)
2120adantr 480 . . . . . . . . . . . . . . 15 ((𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠))) → (𝑠 + 1) ∈ ℝ)
2221ad3antlr 731 . . . . . . . . . . . . . 14 (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) → (𝑠 + 1) ∈ ℝ)
23 nn0re 12533 . . . . . . . . . . . . . . 15 (𝑘 ∈ ℕ0𝑘 ∈ ℝ)
2423ad2antlr 727 . . . . . . . . . . . . . 14 (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) → 𝑘 ∈ ℝ)
2512adantr 480 . . . . . . . . . . . . . . . . 17 ((𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠))) → 𝑠 ∈ ℕ0)
2625ad2antlr 727 . . . . . . . . . . . . . . . 16 ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) → 𝑠 ∈ ℕ0)
27 nn0p1gt0 12553 . . . . . . . . . . . . . . . 16 (𝑠 ∈ ℕ0 → 0 < (𝑠 + 1))
2826, 27syl 17 . . . . . . . . . . . . . . 15 ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) → 0 < (𝑠 + 1))
2928adantr 480 . . . . . . . . . . . . . 14 (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) → 0 < (𝑠 + 1))
30 simpr 484 . . . . . . . . . . . . . 14 (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) → (𝑠 + 1) < 𝑘)
3117, 22, 24, 29, 30lttrd 11420 . . . . . . . . . . . . 13 (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) → 0 < 𝑘)
3231gt0ne0d 11825 . . . . . . . . . . . 12 (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) → 𝑘 ≠ 0)
3332neneqd 2943 . . . . . . . . . . 11 (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) → ¬ 𝑘 = 0)
3433adantr 480 . . . . . . . . . 10 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → ¬ 𝑘 = 0)
35 eqeq1 2739 . . . . . . . . . . . 12 (𝑛 = 𝑘 → (𝑛 = 0 ↔ 𝑘 = 0))
3635notbid 318 . . . . . . . . . . 11 (𝑛 = 𝑘 → (¬ 𝑛 = 0 ↔ ¬ 𝑘 = 0))
3736adantl 481 . . . . . . . . . 10 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → (¬ 𝑛 = 0 ↔ ¬ 𝑘 = 0))
3834, 37mpbird 257 . . . . . . . . 9 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → ¬ 𝑛 = 0)
3938iffalsed 4542 . . . . . . . 8 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))) = if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛)))))))
4021ad2antlr 727 . . . . . . . . . . . . 13 ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) → (𝑠 + 1) ∈ ℝ)
41 ltne 11356 . . . . . . . . . . . . 13 (((𝑠 + 1) ∈ ℝ ∧ (𝑠 + 1) < 𝑘) → 𝑘 ≠ (𝑠 + 1))
4240, 41sylan 580 . . . . . . . . . . . 12 (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) → 𝑘 ≠ (𝑠 + 1))
4342neneqd 2943 . . . . . . . . . . 11 (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) → ¬ 𝑘 = (𝑠 + 1))
4443adantr 480 . . . . . . . . . 10 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → ¬ 𝑘 = (𝑠 + 1))
45 eqeq1 2739 . . . . . . . . . . . 12 (𝑛 = 𝑘 → (𝑛 = (𝑠 + 1) ↔ 𝑘 = (𝑠 + 1)))
4645notbid 318 . . . . . . . . . . 11 (𝑛 = 𝑘 → (¬ 𝑛 = (𝑠 + 1) ↔ ¬ 𝑘 = (𝑠 + 1)))
4746adantl 481 . . . . . . . . . 10 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → (¬ 𝑛 = (𝑠 + 1) ↔ ¬ 𝑘 = (𝑠 + 1)))
4844, 47mpbird 257 . . . . . . . . 9 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → ¬ 𝑛 = (𝑠 + 1))
4948iffalsed 4542 . . . . . . . 8 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛)))))) = if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))
50 simplr 769 . . . . . . . . . . 11 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → (𝑠 + 1) < 𝑘)
51 breq2 5152 . . . . . . . . . . . 12 (𝑛 = 𝑘 → ((𝑠 + 1) < 𝑛 ↔ (𝑠 + 1) < 𝑘))
5251adantl 481 . . . . . . . . . . 11 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → ((𝑠 + 1) < 𝑛 ↔ (𝑠 + 1) < 𝑘))
5350, 52mpbird 257 . . . . . . . . . 10 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → (𝑠 + 1) < 𝑛)
5453iftrued 4539 . . . . . . . . 9 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))) = 0 )
5554, 5eqtrdi 2791 . . . . . . . 8 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))) = (0g𝑌))
5639, 49, 553eqtrd 2779 . . . . . . 7 ((((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) ∧ 𝑛 = 𝑘) → if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))) = (0g𝑌))
5716, 56csbied 3946 . . . . . 6 (((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) ∧ (𝑠 + 1) < 𝑘) → 𝑘 / 𝑛if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))) = (0g𝑌))
5857ex 412 . . . . 5 ((((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) ∧ 𝑘 ∈ ℕ0) → ((𝑠 + 1) < 𝑘𝑘 / 𝑛if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))) = (0g𝑌)))
5958ralrimiva 3144 . . . 4 (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) → ∀𝑘 ∈ ℕ0 ((𝑠 + 1) < 𝑘𝑘 / 𝑛if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))) = (0g𝑌)))
60 breq1 5151 . . . . 5 (𝑙 = (𝑠 + 1) → (𝑙 < 𝑘 ↔ (𝑠 + 1) < 𝑘))
6160rspceaimv 3628 . . . 4 (((𝑠 + 1) ∈ ℕ0 ∧ ∀𝑘 ∈ ℕ0 ((𝑠 + 1) < 𝑘𝑘 / 𝑛if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))) = (0g𝑌))) → ∃𝑙 ∈ ℕ0𝑘 ∈ ℕ0 (𝑙 < 𝑘𝑘 / 𝑛if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))) = (0g𝑌)))
6215, 59, 61syl2anc 584 . . 3 (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) → ∃𝑙 ∈ ℕ0𝑘 ∈ ℕ0 (𝑙 < 𝑘𝑘 / 𝑛if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛))))))) = (0g𝑌)))
632, 11, 62mptnn0fsupp 14035 . 2 (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) → (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( 0 ((𝑇𝑀) × (𝑇‘(𝑏‘0)))), if(𝑛 = (𝑠 + 1), (𝑇‘(𝑏𝑠)), if((𝑠 + 1) < 𝑛, 0 , ((𝑇‘(𝑏‘(𝑛 − 1))) ((𝑇𝑀) × (𝑇‘(𝑏𝑛)))))))) finSupp (0g𝑌))
641, 63eqbrtrid 5183 1 (((𝑁 ∈ Fin ∧ 𝑅 ∈ CRing ∧ 𝑀𝐵) ∧ (𝑠 ∈ ℕ ∧ 𝑏 ∈ (𝐵m (0...𝑠)))) → 𝐺 finSupp (0g𝑌))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1086   = wceq 1537  wcel 2106  wne 2938  wral 3059  wrex 3068  Vcvv 3478  csb 3908  ifcif 4531   class class class wbr 5148  cmpt 5231  cfv 6563  (class class class)co 7431  m cmap 8865  Fincfn 8984   finSupp cfsupp 9399  cr 11152  0cc0 11153  1c1 11154   + caddc 11156   < clt 11293  cmin 11490  cn 12264  0cn0 12524  ...cfz 13544  Basecbs 17245  .rcmulr 17299  0gc0g 17486  -gcsg 18966  CRingccrg 20252  Poly1cpl1 22194   Mat cmat 22427   matToPolyMat cmat2pmat 22726
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8013  df-2nd 8014  df-supp 8185  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-er 8744  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-fsupp 9400  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-nn 12265  df-n0 12525  df-z 12612  df-uz 12877  df-fz 13545
This theorem is referenced by:  cpmadumatpolylem2  22904  cayhamlem4  22910
  Copyright terms: Public domain W3C validator