slesolvec - Metamath Proof Explorer

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

Theorem slesolvec 22712

Description: Every solution of a system of linear equations represented by a matrix and a vector is a vector. (Contributed by AV, 10-Feb-2019.) (Revised by AV, 27-Feb-2019.)

**Hypotheses**
Ref	Expression
slesolex.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
slesolex.b	⊢ 𝐵 = (Base‘𝐴)
slesolex.v	⊢ 𝑉 = ((Base‘𝑅) ↑_m 𝑁)
slesolex.x	⊢ · = (𝑅 maVecMul ⟨𝑁, 𝑁⟩)

**Assertion**
Ref	Expression
slesolvec	⊢ (((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉)) → ((𝑋 · 𝑍) = 𝑌 → 𝑍 ∈ 𝑉))

**Proof of Theorem slesolvec**
Step	Hyp	Ref	Expression
1		slesolex.a	. . . . . . 7 ⊢ 𝐴 = (𝑁 Mat 𝑅)
2		slesolex.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐴)
3	1, 2	matrcl 22445	. . . . . 6 ⊢ (𝑋 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V))
4	3	simpld 497	. . . . 5 ⊢ (𝑋 ∈ 𝐵 → 𝑁 ∈ Fin)
5		simpr 487	. . . . . . . 8 ⊢ ((𝑁 ≠ ∅ ∧ 𝑁 ∈ Fin) → 𝑁 ∈ Fin)
6		simpl 485	. . . . . . . 8 ⊢ ((𝑁 ≠ ∅ ∧ 𝑁 ∈ Fin) → 𝑁 ≠ ∅)
7	5, 5, 6	3jca 1137	. . . . . . 7 ⊢ ((𝑁 ≠ ∅ ∧ 𝑁 ∈ Fin) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅))
8	7	ex 415	. . . . . 6 ⊢ (𝑁 ≠ ∅ → (𝑁 ∈ Fin → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅)))
9	8	adantr 483	. . . . 5 ⊢ ((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → (𝑁 ∈ Fin → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅)))
10	4, 9	syl5com 31	. . . 4 ⊢ (𝑋 ∈ 𝐵 → ((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅)))
11	10	adantr 483	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) → ((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅)))
12	11	impcom 410	. 2 ⊢ (((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉)) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅))
13		simpr 487	. . 3 ⊢ ((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → 𝑅 ∈ Ring)
14		simpr 487	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) → 𝑌 ∈ 𝑉)
15	13, 14	anim12i 621	. 2 ⊢ (((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉)) → (𝑅 ∈ Ring ∧ 𝑌 ∈ 𝑉))
16		eqid 2756	. . 3 ⊢ (Base‘𝑅) = (Base‘𝑅)
17		eqid 2756	. . 3 ⊢ ((Base‘𝑅) ↑_m (𝑁 × 𝑁)) = ((Base‘𝑅) ↑_m (𝑁 × 𝑁))
18		slesolex.v	. . 3 ⊢ 𝑉 = ((Base‘𝑅) ↑_m 𝑁)
19		slesolex.x	. . 3 ⊢ · = (𝑅 maVecMul ⟨𝑁, 𝑁⟩)
20	16, 17, 18, 19, 18	mavmulsolcl 22584	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅) ∧ (𝑅 ∈ Ring ∧ 𝑌 ∈ 𝑉)) → ((𝑋 · 𝑍) = 𝑌 → 𝑍 ∈ 𝑉))
21	12, 15, 20	syl2anc 592	1 ⊢ (((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉)) → ((𝑋 · 𝑍) = 𝑌 → 𝑍 ∈ 𝑉))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1095 = wceq 1554 ∈ wcel 2136 ≠ wne 2951 Vcvv 3448 ∅c0 4280 ⟨cop 4582 × cxp 5638 ‘cfv 6510 (class class class)co 7385 ↑_m cmap 8796 Fincfn 8916 Basecbs 17221 Ringcrg 20255 Mat cmat 22440 maVecMul cmvmul 22573

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-rep 5221 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-1cn 11121 ax-addcl 11123

This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-ral 3071 df-rex 3081 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4945 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-ov 7388 df-oprab 7389 df-mpo 7390 df-om 7836 df-1st 7959 df-2nd 7960 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-map 8798 df-nn 12201 df-slot 17194 df-ndx 17206 df-base 17222 df-mat 22441 df-mvmul 22574

This theorem is referenced by: slesolinv 22713 cramerimplem3 22718 cramerimp 22719 cramer 22724

W3C validator