Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > slesolvec | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
slesolex.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
slesolex.b | ⊢ 𝐵 = (Base‘𝐴) |
slesolex.v | ⊢ 𝑉 = ((Base‘𝑅) ↑𝑚 𝑁) |
slesolex.x | ⊢ · = (𝑅 maVecMul 〈𝑁, 𝑁〉) |
Ref | Expression |
---|---|
slesolvec | ⊢ (((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉)) → ((𝑋 · 𝑍) = 𝑌 → 𝑍 ∈ 𝑉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | slesolex.a | . . . . . . 7 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
2 | slesolex.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐴) | |
3 | 1, 2 | matrcl 20037 | . . . . . 6 ⊢ (𝑋 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
4 | 3 | simpld 474 | . . . . 5 ⊢ (𝑋 ∈ 𝐵 → 𝑁 ∈ Fin) |
5 | simpr 476 | . . . . . . . 8 ⊢ ((𝑁 ≠ ∅ ∧ 𝑁 ∈ Fin) → 𝑁 ∈ Fin) | |
6 | simpl 472 | . . . . . . . 8 ⊢ ((𝑁 ≠ ∅ ∧ 𝑁 ∈ Fin) → 𝑁 ≠ ∅) | |
7 | 5, 5, 6 | 3jca 1235 | . . . . . . 7 ⊢ ((𝑁 ≠ ∅ ∧ 𝑁 ∈ Fin) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅)) |
8 | 7 | ex 449 | . . . . . 6 ⊢ (𝑁 ≠ ∅ → (𝑁 ∈ Fin → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅))) |
9 | 8 | adantr 480 | . . . . 5 ⊢ ((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → (𝑁 ∈ Fin → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅))) |
10 | 4, 9 | syl5com 31 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → ((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅))) |
11 | 10 | adantr 480 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) → ((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅))) |
12 | 11 | impcom 445 | . 2 ⊢ (((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉)) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅)) |
13 | simpr 476 | . . 3 ⊢ ((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → 𝑅 ∈ Ring) | |
14 | simpr 476 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) → 𝑌 ∈ 𝑉) | |
15 | 13, 14 | anim12i 588 | . 2 ⊢ (((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉)) → (𝑅 ∈ Ring ∧ 𝑌 ∈ 𝑉)) |
16 | eqid 2610 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
17 | eqid 2610 | . . 3 ⊢ ((Base‘𝑅) ↑𝑚 (𝑁 × 𝑁)) = ((Base‘𝑅) ↑𝑚 (𝑁 × 𝑁)) | |
18 | slesolex.v | . . 3 ⊢ 𝑉 = ((Base‘𝑅) ↑𝑚 𝑁) | |
19 | slesolex.x | . . 3 ⊢ · = (𝑅 maVecMul 〈𝑁, 𝑁〉) | |
20 | 16, 17, 18, 19, 18 | mavmulsolcl 20176 | . 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅) ∧ (𝑅 ∈ Ring ∧ 𝑌 ∈ 𝑉)) → ((𝑋 · 𝑍) = 𝑌 → 𝑍 ∈ 𝑉)) |
21 | 12, 15, 20 | syl2anc 691 | 1 ⊢ (((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉)) → ((𝑋 · 𝑍) = 𝑌 → 𝑍 ∈ 𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 Vcvv 3173 ∅c0 3874 〈cop 4131 × cxp 5036 ‘cfv 5804 (class class class)co 6549 ↑𝑚 cmap 7744 Fincfn 7841 Basecbs 15695 Ringcrg 18370 Mat cmat 20032 maVecMul cmvmul 20165 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-1st 7059 df-2nd 7060 df-map 7746 df-slot 15699 df-base 15700 df-mat 20033 df-mvmul 20166 |
This theorem is referenced by: slesolinv 20305 cramerimplem3 20310 cramerimp 20311 cramer 20316 |
Copyright terms: Public domain | W3C validator |