| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cpmatelimp | Structured version Visualization version GIF version | ||
| Description: Implication of a set being a constant polynomial matrix. (Contributed by AV, 18-Nov-2019.) |
| Ref | Expression |
|---|---|
| cpmat.s | ⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅) |
| cpmat.p | ⊢ 𝑃 = (Poly1‘𝑅) |
| cpmat.c | ⊢ 𝐶 = (𝑁 Mat 𝑃) |
| cpmat.b | ⊢ 𝐵 = (Base‘𝐶) |
| Ref | Expression |
|---|---|
| cpmatelimp | ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀 ∈ 𝑆 → (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cpmat.s | . . . . 5 ⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅) | |
| 2 | cpmat.p | . . . . 5 ⊢ 𝑃 = (Poly1‘𝑅) | |
| 3 | cpmat.c | . . . . 5 ⊢ 𝐶 = (𝑁 Mat 𝑃) | |
| 4 | cpmat.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐶) | |
| 5 | 1, 2, 3, 4 | cpmatpmat 22700 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝑆) → 𝑀 ∈ 𝐵) |
| 6 | 5 | 3expa 1124 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝑆) → 𝑀 ∈ 𝐵) |
| 7 | 1, 2, 3, 4 | cpmatel 22701 | . . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 8 | 7 | 3expa 1124 | . . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 9 | 8 | biimpd 230 | . . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 10 | 9 | impancom 452 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝑆) → (𝑀 ∈ 𝐵 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 11 | 6, 10 | jcai 521 | . 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝑆) → (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 12 | 11 | ex 413 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀 ∈ 𝑆 → (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∀wral 3054 ‘cfv 6492 (class class class)co 7363 Fincfn 8890 ℕcn 12172 Basecbs 17177 0gc0g 17400 Ringcrg 20212 Poly1cpl1 22169 coe1cco1 22170 Mat cmat 22397 ConstPolyMat ccpmat 22693 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-sbc 3731 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-iota 6448 df-fun 6494 df-fv 6500 df-ov 7366 df-oprab 7367 df-mpo 7368 df-cpmat 22696 |
| This theorem is referenced by: cpmatmcllem 22708 m2cpminvid2lem 22744 |
| Copyright terms: Public domain | W3C validator |