cpmatelimp - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > cpmatelimp		Structured version Visualization version GIF version

Theorem cpmatelimp 22607

Description: Implication of a set being a constant polynomial matrix. (Contributed by AV, 18-Nov-2019.)

**Hypotheses**
Ref	Expression
cpmat.s	⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅)
cpmat.p	⊢ 𝑃 = (Poly₁‘𝑅)
cpmat.c	⊢ 𝐶 = (𝑁 Mat 𝑃)
cpmat.b	⊢ 𝐵 = (Base‘𝐶)

**Assertion**
Ref	Expression
cpmatelimp	⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀 ∈ 𝑆 → (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe₁‘(𝑖𝑀𝑗))‘𝑘) = (0_g‘𝑅))))

Distinct variable groups: 𝑖,𝑁,𝑗,𝑘 𝑅,𝑖,𝑗,𝑘 𝑖,𝑀,𝑗,𝑘 Allowed substitution hints: 𝐵(𝑖,𝑗,𝑘) 𝐶(𝑖,𝑗,𝑘) 𝑃(𝑖,𝑗,𝑘) 𝑆(𝑖,𝑗,𝑘)

**Proof of Theorem cpmatelimp**
Step	Hyp	Ref	Expression
1		cpmat.s	. . . . 5 ⊢ 𝑆 = (𝑁 ConstPolyMat 𝑅)
2		cpmat.p	. . . . 5 ⊢ 𝑃 = (Poly₁‘𝑅)
3		cpmat.c	. . . . 5 ⊢ 𝐶 = (𝑁 Mat 𝑃)
4		cpmat.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐶)
5	1, 2, 3, 4	cpmatpmat 22605	. . . 4 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝑆) → 𝑀 ∈ 𝐵)
6	5	3expa 1116	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝑆) → 𝑀 ∈ 𝐵)
7	1, 2, 3, 4	cpmatel 22606	. . . . . 6 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe₁‘(𝑖𝑀𝑗))‘𝑘) = (0_g‘𝑅)))
8	7	3expa 1116	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe₁‘(𝑖𝑀𝑗))‘𝑘) = (0_g‘𝑅)))
9	8	biimpd 228	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝐵) → (𝑀 ∈ 𝑆 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe₁‘(𝑖𝑀𝑗))‘𝑘) = (0_g‘𝑅)))
10	9	impancom 451	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝑆) → (𝑀 ∈ 𝐵 → ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe₁‘(𝑖𝑀𝑗))‘𝑘) = (0_g‘𝑅)))
11	6, 10	jcai 516	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑀 ∈ 𝑆) → (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe₁‘(𝑖𝑀𝑗))‘𝑘) = (0_g‘𝑅)))
12	11	ex 412	1 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → (𝑀 ∈ 𝑆 → (𝑀 ∈ 𝐵 ∧ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 ∀𝑘 ∈ ℕ ((coe₁‘(𝑖𝑀𝑗))‘𝑘) = (0_g‘𝑅))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ∀wral 3057 ‘cfv 6542 (class class class)co 7414 Fincfn 8957 ℕcn 12236 Basecbs 17173 0_gc0g 17414 Ringcrg 20166 Poly₁cpl1 22089 coe₁cco1 22090 Mat cmat 22300 ConstPolyMat ccpmat 22598

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5293 ax-nul 5300 ax-pr 5423

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2937 df-ral 3058 df-rex 3067 df-rab 3429 df-v 3472 df-sbc 3776 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-nul 4319 df-if 4525 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-br 5143 df-opab 5205 df-id 5570 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-iota 6494 df-fun 6544 df-fv 6550 df-ov 7417 df-oprab 7418 df-mpo 7419 df-cpmat 22601

This theorem is referenced by: cpmatmcllem 22613 m2cpminvid2lem 22649

W3C validator

	
		OSZAR »