| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cpmatel | Structured version Visualization version GIF version | ||
| Description: Property of a constant polynomial matrix. (Contributed by AV, 15-Nov-2019.) |
| Ref | Expression |
|---|---|
| cpmat.s | ⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅) |
| cpmat.p | ⊢ 𝑃 = (Poly1‘𝑅) |
| cpmat.c | ⊢ 𝐶 = (𝑁 Mat 𝑃) |
| cpmat.b | ⊢ 𝐵 = (Base‘𝐶) |
| Ref | Expression |
|---|---|
| cpmatel | ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cpmat.s | . . . . . 6 ⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅) | |
| 2 | cpmat.p | . . . . . 6 ⊢ 𝑃 = (Poly1‘𝑅) | |
| 3 | cpmat.c | . . . . . 6 ⊢ 𝐶 = (𝑁 Mat 𝑃) | |
| 4 | cpmat.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐶) | |
| 5 | 1, 2, 3, 4 | cpmat 22835 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)}) |
| 6 | 5 | 3adant3 1148 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)}) |
| 7 | 6 | eleq2d 2855 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ 𝑀 ∈ {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)})) |
| 8 | oveq 7417 | . . . . . . . . 9 ⊢ (𝑚 = 𝑀 → (𝑖𝑚𝑗) = (𝑖𝑀𝑗)) | |
| 9 | 8 | fveq2d 6886 | . . . . . . . 8 ⊢ (𝑚 = 𝑀 → (coe1‘(𝑖𝑚𝑗)) = (coe1‘(𝑖𝑀𝑗))) |
| 10 | 9 | fveq1d 6884 | . . . . . . 7 ⊢ (𝑚 = 𝑀 → ((coe1‘(𝑖𝑚𝑗))‘𝑘) = ((coe1‘(𝑖𝑀𝑗))‘𝑘)) |
| 11 | 10 | eqeq1d 2771 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅) ↔ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 12 | 11 | ralbidv 3194 | . . . . 5 ⊢ (𝑚 = 𝑀 → (∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅) ↔ ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 13 | 12 | 2ralbidv 3235 | . . . 4 ⊢ (𝑚 = 𝑀 → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 14 | 13 | elrab 3659 | . . 3 ⊢ (𝑀 ∈ {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)} ↔ (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 15 | 7, 14 | bitrdi 290 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅)))) |
| 16 | 15 | 3anibar 1346 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∀wral 3085 {crab 3423 ‘cfv 6537 (class class class)co 7411 Fincfn 8943 ℕcn 12233 Basecbs 17269 0gc0g 17492 Poly1cpl1 22306 coe1cco1 22307 Mat cmat 22533 ConstPolyMat ccpmat 22829 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-cpmat 22832 |
| This theorem is referenced by: cpmatelimp 22838 cpmatel2 22839 1elcpmat 22841 cpmatmcl 22845 m2cpm 22867 |
| Copyright terms: Public domain | W3C validator |