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 21964 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝑆) → 𝑀 ∈ 𝐵) |
6 | 5 | 3expa 1118 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝑆) → 𝑀 ∈ 𝐵) |
7 | 1, 2, 3, 4 | cpmatel 21965 | . . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
8 | 7 | 3expa 1118 | . . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
9 | 8 | biimpd 228 | . . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
10 | 9 | impancom 453 | . . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝑆) → (𝑀 ∈ 𝐵 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
11 | 6, 10 | jcai 518 | . 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝑆) → (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
12 | 11 | ex 414 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀 ∈ 𝑆 → (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1541 ∈ wcel 2106 ∀wral 3062 ‘cfv 6483 (class class class)co 7341 Fincfn 8808 ℕcn 12078 Basecbs 17009 0gc0g 17247 Ringcrg 19877 Poly1cpl1 21453 coe1cco1 21454 Mat cmat 21659 ConstPolyMat ccpmat 21957 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-sep 5247 ax-nul 5254 ax-pr 5376 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-rab 3405 df-v 3444 df-sbc 3731 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4274 df-if 4478 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4857 df-br 5097 df-opab 5159 df-id 5522 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-iota 6435 df-fun 6485 df-fv 6491 df-ov 7344 df-oprab 7345 df-mpo 7346 df-cpmat 21960 |
This theorem is referenced by: cpmatmcllem 21972 m2cpminvid2lem 22008 |
Copyright terms: Public domain | W3C validator |