| 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 22654 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝑆) → 𝑀 ∈ 𝐵) |
| 6 | 5 | 3expa 1118 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝑆) → 𝑀 ∈ 𝐵) |
| 7 | 1, 2, 3, 4 | cpmatel 22655 | . . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 8 | 7 | 3expa 1118 | . . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 9 | 8 | biimpd 229 | . . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 10 | 9 | impancom 451 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝑆) → (𝑀 ∈ 𝐵 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 11 | 6, 10 | jcai 516 | . 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝑆) → (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
| 12 | 11 | ex 412 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀 ∈ 𝑆 → (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ‘cfv 6492 (class class class)co 7358 Fincfn 8883 ℕcn 12145 Basecbs 17136 0gc0g 17359 Ringcrg 20168 Poly1cpl1 22117 coe1cco1 22118 Mat cmat 22351 ConstPolyMat ccpmat 22647 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-iota 6448 df-fun 6494 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-cpmat 22650 |
| This theorem is referenced by: cpmatmcllem 22662 m2cpminvid2lem 22698 |
| Copyright terms: Public domain | W3C validator |