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 21868 | . . . . 5 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)}) |
6 | 5 | 3adant3 1131 | . . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → 𝑆 = {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)}) |
7 | 6 | eleq2d 2824 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ 𝑀 ∈ {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)})) |
8 | oveq 7273 | . . . . . . . . 9 ⊢ (𝑚 = 𝑀 → (𝑖𝑚𝑗) = (𝑖𝑀𝑗)) | |
9 | 8 | fveq2d 6770 | . . . . . . . 8 ⊢ (𝑚 = 𝑀 → (coe1‘(𝑖𝑚𝑗)) = (coe1‘(𝑖𝑀𝑗))) |
10 | 9 | fveq1d 6768 | . . . . . . 7 ⊢ (𝑚 = 𝑀 → ((coe1‘(𝑖𝑚𝑗))‘𝑘) = ((coe1‘(𝑖𝑀𝑗))‘𝑘)) |
11 | 10 | eqeq1d 2740 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅) ↔ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
12 | 11 | ralbidv 3121 | . . . . 5 ⊢ (𝑚 = 𝑀 → (∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅) ↔ ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
13 | 12 | 2ralbidv 3123 | . . . 4 ⊢ (𝑚 = 𝑀 → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
14 | 13 | elrab 3623 | . . 3 ⊢ (𝑀 ∈ {𝑚 ∈ 𝐵 ∣ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑚𝑗))‘𝑘) = (0g‘𝑅)} ↔ (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
15 | 7, 14 | bitrdi 287 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅)))) |
16 | 15 | 3anibar 1328 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ 𝑉 ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe1‘(𝑖𝑀𝑗))‘𝑘) = (0g‘𝑅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ∀wral 3064 {crab 3068 ‘cfv 6426 (class class class)co 7267 Fincfn 8720 ℕcn 11983 Basecbs 16922 0gc0g 17160 Poly1cpl1 21358 coe1cco1 21359 Mat cmat 21564 ConstPolyMat ccpmat 21862 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-sep 5221 ax-nul 5228 ax-pr 5350 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3431 df-sbc 3716 df-dif 3889 df-un 3891 df-in 3893 df-ss 3903 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5074 df-opab 5136 df-id 5484 df-xp 5590 df-rel 5591 df-cnv 5592 df-co 5593 df-dm 5594 df-iota 6384 df-fun 6428 df-fv 6434 df-ov 7270 df-oprab 7271 df-mpo 7272 df-cpmat 21865 |
This theorem is referenced by: cpmatelimp 21871 cpmatel2 21872 1elcpmat 21874 cpmatmcl 21878 m2cpm 21900 |
Copyright terms: Public domain | W3C validator |