![]() |
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 20626 | . . . . . 6 ⊢ (𝑋 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
4 | 3 | simpld 490 | . . . . 5 ⊢ (𝑋 ∈ 𝐵 → 𝑁 ∈ Fin) |
5 | simpr 479 | . . . . . . . 8 ⊢ ((𝑁 ≠ ∅ ∧ 𝑁 ∈ Fin) → 𝑁 ∈ Fin) | |
6 | simpl 476 | . . . . . . . 8 ⊢ ((𝑁 ≠ ∅ ∧ 𝑁 ∈ Fin) → 𝑁 ≠ ∅) | |
7 | 5, 5, 6 | 3jca 1119 | . . . . . . 7 ⊢ ((𝑁 ≠ ∅ ∧ 𝑁 ∈ Fin) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅)) |
8 | 7 | ex 403 | . . . . . 6 ⊢ (𝑁 ≠ ∅ → (𝑁 ∈ Fin → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅))) |
9 | 8 | adantr 474 | . . . . 5 ⊢ ((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → (𝑁 ∈ Fin → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅))) |
10 | 4, 9 | syl5com 31 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → ((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅))) |
11 | 10 | adantr 474 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) → ((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅))) |
12 | 11 | impcom 398 | . 2 ⊢ (((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉)) → (𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅)) |
13 | simpr 479 | . . 3 ⊢ ((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → 𝑅 ∈ Ring) | |
14 | simpr 479 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) → 𝑌 ∈ 𝑉) | |
15 | 13, 14 | anim12i 606 | . 2 ⊢ (((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉)) → (𝑅 ∈ Ring ∧ 𝑌 ∈ 𝑉)) |
16 | eqid 2778 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
17 | eqid 2778 | . . 3 ⊢ ((Base‘𝑅) ↑𝑚 (𝑁 × 𝑁)) = ((Base‘𝑅) ↑𝑚 (𝑁 × 𝑁)) | |
18 | slesolex.v | . . 3 ⊢ 𝑉 = ((Base‘𝑅) ↑𝑚 𝑁) | |
19 | slesolex.x | . . 3 ⊢ · = (𝑅 maVecMul 〈𝑁, 𝑁〉) | |
20 | 16, 17, 18, 19, 18 | mavmulsolcl 20766 | . 2 ⊢ (((𝑁 ∈ Fin ∧ 𝑁 ∈ Fin ∧ 𝑁 ≠ ∅) ∧ (𝑅 ∈ Ring ∧ 𝑌 ∈ 𝑉)) → ((𝑋 · 𝑍) = 𝑌 → 𝑍 ∈ 𝑉)) |
21 | 12, 15, 20 | syl2anc 579 | 1 ⊢ (((𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉)) → ((𝑋 · 𝑍) = 𝑌 → 𝑍 ∈ 𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 ∧ w3a 1071 = wceq 1601 ∈ wcel 2107 ≠ wne 2969 Vcvv 3398 ∅c0 4141 〈cop 4404 × cxp 5355 ‘cfv 6137 (class class class)co 6924 ↑𝑚 cmap 8142 Fincfn 8243 Basecbs 16259 Ringcrg 18938 Mat cmat 20621 maVecMul cmvmul 20755 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-rep 5008 ax-sep 5019 ax-nul 5027 ax-pow 5079 ax-pr 5140 ax-un 7228 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-ral 3095 df-rex 3096 df-reu 3097 df-rab 3099 df-v 3400 df-sbc 3653 df-csb 3752 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-op 4405 df-uni 4674 df-iun 4757 df-br 4889 df-opab 4951 df-mpt 4968 df-id 5263 df-xp 5363 df-rel 5364 df-cnv 5365 df-co 5366 df-dm 5367 df-rn 5368 df-res 5369 df-ima 5370 df-iota 6101 df-fun 6139 df-fn 6140 df-f 6141 df-f1 6142 df-fo 6143 df-f1o 6144 df-fv 6145 df-ov 6927 df-oprab 6928 df-mpt2 6929 df-1st 7447 df-2nd 7448 df-map 8144 df-slot 16263 df-base 16265 df-mat 20622 df-mvmul 20756 |
This theorem is referenced by: slesolinv 20896 cramerimplem3 20902 cramerimp 20903 cramer 20908 |
Copyright terms: Public domain | W3C validator |