Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cramerlem2 | Structured version Visualization version GIF version |
Description: Lemma 2 for cramer 21292. (Contributed by AV, 21-Feb-2019.) (Revised by AV, 1-Mar-2019.) |
Ref | Expression |
---|---|
cramer.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
cramer.b | ⊢ 𝐵 = (Base‘𝐴) |
cramer.v | ⊢ 𝑉 = ((Base‘𝑅) ↑m 𝑁) |
cramer.d | ⊢ 𝐷 = (𝑁 maDet 𝑅) |
cramer.x | ⊢ · = (𝑅 maVecMul 〈𝑁, 𝑁〉) |
cramer.q | ⊢ / = (/r‘𝑅) |
Ref | Expression |
---|---|
cramerlem2 | ⊢ ((𝑅 ∈ CRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) ∧ (𝐷‘𝑋) ∈ (Unit‘𝑅)) → ∀𝑧 ∈ 𝑉 ((𝑋 · 𝑧) = 𝑌 → 𝑧 = (𝑖 ∈ 𝑁 ↦ ((𝐷‘((𝑋(𝑁 matRepV 𝑅)𝑌)‘𝑖)) / (𝐷‘𝑋))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpll1 1207 | . . . 4 ⊢ ((((𝑅 ∈ CRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) ∧ (𝐷‘𝑋) ∈ (Unit‘𝑅)) ∧ 𝑧 ∈ 𝑉) ∧ (𝑋 · 𝑧) = 𝑌) → 𝑅 ∈ CRing) | |
2 | simpll2 1208 | . . . 4 ⊢ ((((𝑅 ∈ CRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) ∧ (𝐷‘𝑋) ∈ (Unit‘𝑅)) ∧ 𝑧 ∈ 𝑉) ∧ (𝑋 · 𝑧) = 𝑌) → (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉)) | |
3 | simpll3 1209 | . . . 4 ⊢ ((((𝑅 ∈ CRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) ∧ (𝐷‘𝑋) ∈ (Unit‘𝑅)) ∧ 𝑧 ∈ 𝑉) ∧ (𝑋 · 𝑧) = 𝑌) → (𝐷‘𝑋) ∈ (Unit‘𝑅)) | |
4 | simplr 767 | . . . 4 ⊢ ((((𝑅 ∈ CRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) ∧ (𝐷‘𝑋) ∈ (Unit‘𝑅)) ∧ 𝑧 ∈ 𝑉) ∧ (𝑋 · 𝑧) = 𝑌) → 𝑧 ∈ 𝑉) | |
5 | simpr 487 | . . . 4 ⊢ ((((𝑅 ∈ CRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) ∧ (𝐷‘𝑋) ∈ (Unit‘𝑅)) ∧ 𝑧 ∈ 𝑉) ∧ (𝑋 · 𝑧) = 𝑌) → (𝑋 · 𝑧) = 𝑌) | |
6 | cramer.a | . . . . 5 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
7 | cramer.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐴) | |
8 | cramer.v | . . . . 5 ⊢ 𝑉 = ((Base‘𝑅) ↑m 𝑁) | |
9 | cramer.d | . . . . 5 ⊢ 𝐷 = (𝑁 maDet 𝑅) | |
10 | cramer.x | . . . . 5 ⊢ · = (𝑅 maVecMul 〈𝑁, 𝑁〉) | |
11 | cramer.q | . . . . 5 ⊢ / = (/r‘𝑅) | |
12 | 6, 7, 8, 9, 10, 11 | cramerlem1 21288 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) ∧ ((𝐷‘𝑋) ∈ (Unit‘𝑅) ∧ 𝑧 ∈ 𝑉 ∧ (𝑋 · 𝑧) = 𝑌)) → 𝑧 = (𝑖 ∈ 𝑁 ↦ ((𝐷‘((𝑋(𝑁 matRepV 𝑅)𝑌)‘𝑖)) / (𝐷‘𝑋)))) |
13 | 1, 2, 3, 4, 5, 12 | syl113anc 1377 | . . 3 ⊢ ((((𝑅 ∈ CRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) ∧ (𝐷‘𝑋) ∈ (Unit‘𝑅)) ∧ 𝑧 ∈ 𝑉) ∧ (𝑋 · 𝑧) = 𝑌) → 𝑧 = (𝑖 ∈ 𝑁 ↦ ((𝐷‘((𝑋(𝑁 matRepV 𝑅)𝑌)‘𝑖)) / (𝐷‘𝑋)))) |
14 | 13 | ex 415 | . 2 ⊢ (((𝑅 ∈ CRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) ∧ (𝐷‘𝑋) ∈ (Unit‘𝑅)) ∧ 𝑧 ∈ 𝑉) → ((𝑋 · 𝑧) = 𝑌 → 𝑧 = (𝑖 ∈ 𝑁 ↦ ((𝐷‘((𝑋(𝑁 matRepV 𝑅)𝑌)‘𝑖)) / (𝐷‘𝑋))))) |
15 | 14 | ralrimiva 3180 | 1 ⊢ ((𝑅 ∈ CRing ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑉) ∧ (𝐷‘𝑋) ∈ (Unit‘𝑅)) → ∀𝑧 ∈ 𝑉 ((𝑋 · 𝑧) = 𝑌 → 𝑧 = (𝑖 ∈ 𝑁 ↦ ((𝐷‘((𝑋(𝑁 matRepV 𝑅)𝑌)‘𝑖)) / (𝐷‘𝑋))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1082 = wceq 1531 ∈ wcel 2108 ∀wral 3136 〈cop 4565 ↦ cmpt 5137 ‘cfv 6348 (class class class)co 7148 ↑m cmap 8398 Basecbs 16475 CRingccrg 19290 Unitcui 19381 /rcdvr 19424 Mat cmat 21008 maVecMul cmvmul 21141 matRepV cmatrepV 21158 maDet cmdat 21185 |
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 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7453 ax-cnex 10585 ax-resscn 10586 ax-1cn 10587 ax-icn 10588 ax-addcl 10589 ax-addrcl 10590 ax-mulcl 10591 ax-mulrcl 10592 ax-mulcom 10593 ax-addass 10594 ax-mulass 10595 ax-distr 10596 ax-i2m1 10597 ax-1ne0 10598 ax-1rid 10599 ax-rnegex 10600 ax-rrecex 10601 ax-cnre 10602 ax-pre-lttri 10603 ax-pre-lttrn 10604 ax-pre-ltadd 10605 ax-pre-mulgt0 10606 ax-addf 10608 ax-mulf 10609 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-xor 1499 df-tru 1534 df-fal 1544 df-ex 1775 df-nf 1779 df-sb 2064 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ne 3015 df-nel 3122 df-ral 3141 df-rex 3142 df-reu 3143 df-rmo 3144 df-rab 3145 df-v 3495 df-sbc 3771 df-csb 3882 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-pss 3952 df-nul 4290 df-if 4466 df-pw 4539 df-sn 4560 df-pr 4562 df-tp 4564 df-op 4566 df-ot 4568 df-uni 4831 df-int 4868 df-iun 4912 df-iin 4913 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7106 df-ov 7151 df-oprab 7152 df-mpo 7153 df-of 7401 df-om 7573 df-1st 7681 df-2nd 7682 df-supp 7823 df-tpos 7884 df-wrecs 7939 df-recs 8000 df-rdg 8038 df-1o 8094 df-2o 8095 df-oadd 8098 df-er 8281 df-map 8400 df-pm 8401 df-ixp 8454 df-en 8502 df-dom 8503 df-sdom 8504 df-fin 8505 df-fsupp 8826 df-sup 8898 df-oi 8966 df-card 9360 df-pnf 10669 df-mnf 10670 df-xr 10671 df-ltxr 10672 df-le 10673 df-sub 10864 df-neg 10865 df-div 11290 df-nn 11631 df-2 11692 df-3 11693 df-4 11694 df-5 11695 df-6 11696 df-7 11697 df-8 11698 df-9 11699 df-n0 11890 df-xnn0 11960 df-z 11974 df-dec 12091 df-uz 12236 df-rp 12382 df-fz 12885 df-fzo 13026 df-seq 13362 df-exp 13422 df-hash 13683 df-word 13854 df-lsw 13907 df-concat 13915 df-s1 13942 df-substr 13995 df-pfx 14025 df-splice 14104 df-reverse 14113 df-s2 14202 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-mulr 16571 df-starv 16572 df-sca 16573 df-vsca 16574 df-ip 16575 df-tset 16576 df-ple 16577 df-ds 16579 df-unif 16580 df-hom 16581 df-cco 16582 df-0g 16707 df-gsum 16708 df-prds 16713 df-pws 16715 df-mre 16849 df-mrc 16850 df-acs 16852 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-mhm 17948 df-submnd 17949 df-efmnd 18026 df-grp 18098 df-minusg 18099 df-sbg 18100 df-mulg 18217 df-subg 18268 df-ghm 18348 df-gim 18391 df-cntz 18439 df-oppg 18466 df-symg 18488 df-pmtr 18562 df-psgn 18611 df-evpm 18612 df-cmn 18900 df-abl 18901 df-mgp 19232 df-ur 19244 df-srg 19248 df-ring 19291 df-cring 19292 df-oppr 19365 df-dvdsr 19383 df-unit 19384 df-invr 19414 df-dvr 19425 df-rnghom 19459 df-drng 19496 df-subrg 19525 df-lmod 19628 df-lss 19696 df-sra 19936 df-rgmod 19937 df-cnfld 20538 df-zring 20610 df-zrh 20643 df-dsmm 20868 df-frlm 20883 df-mamu 20987 df-mat 21009 df-mvmul 21142 df-marrep 21159 df-marepv 21160 df-subma 21178 df-mdet 21186 df-minmar1 21236 |
This theorem is referenced by: cramerlem3 21290 |
Copyright terms: Public domain | W3C validator |