| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nvmdi | Structured version Visualization version GIF version | ||
| Description: Distributive law for scalar product over subtraction. (Contributed by NM, 14-Feb-2008.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nvmdi.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| nvmdi.3 | ⊢ 𝑀 = ( −𝑣 ‘𝑈) |
| nvmdi.4 | ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) |
| Ref | Expression |
|---|---|
| nvmdi | ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(𝐵𝑀𝐶)) = ((𝐴𝑆𝐵)𝑀(𝐴𝑆𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr1 1213 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴 ∈ ℂ) | |
| 2 | simpr2 1214 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐵 ∈ 𝑋) | |
| 3 | neg1cn 12249 | . . . . . . 7 ⊢ -1 ∈ ℂ | |
| 4 | nvmdi.1 | . . . . . . . 8 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 5 | nvmdi.4 | . . . . . . . 8 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 6 | 4, 5 | nvscl 31136 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐶 ∈ 𝑋) → (-1𝑆𝐶) ∈ 𝑋) |
| 7 | 3, 6 | mp3an2 1478 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐶 ∈ 𝑋) → (-1𝑆𝐶) ∈ 𝑋) |
| 8 | 7 | 3ad2antr3 1209 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (-1𝑆𝐶) ∈ 𝑋) |
| 9 | 1, 2, 8 | 3jca 1146 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ (-1𝑆𝐶) ∈ 𝑋)) |
| 10 | eqid 2760 | . . . . 5 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 11 | 4, 10, 5 | nvdi 31140 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ (-1𝑆𝐶) ∈ 𝑋)) → (𝐴𝑆(𝐵( +𝑣 ‘𝑈)(-1𝑆𝐶))) = ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(𝐴𝑆(-1𝑆𝐶)))) |
| 12 | 9, 11 | syldan 603 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(𝐵( +𝑣 ‘𝑈)(-1𝑆𝐶))) = ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(𝐴𝑆(-1𝑆𝐶)))) |
| 13 | 4, 5 | nvscom 31139 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ -1 ∈ ℂ ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(-1𝑆𝐶)) = (-1𝑆(𝐴𝑆𝐶))) |
| 14 | 3, 13 | mp3anr2 1488 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(-1𝑆𝐶)) = (-1𝑆(𝐴𝑆𝐶))) |
| 15 | 14 | 3adantr2 1189 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(-1𝑆𝐶)) = (-1𝑆(𝐴𝑆𝐶))) |
| 16 | 15 | oveq2d 7431 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(𝐴𝑆(-1𝑆𝐶))) = ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(-1𝑆(𝐴𝑆𝐶)))) |
| 17 | 12, 16 | eqtrd 2795 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(𝐵( +𝑣 ‘𝑈)(-1𝑆𝐶))) = ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(-1𝑆(𝐴𝑆𝐶)))) |
| 18 | nvmdi.3 | . . . . 5 ⊢ 𝑀 = ( −𝑣 ‘𝑈) | |
| 19 | 4, 10, 5, 18 | nvmval 31152 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝑀𝐶) = (𝐵( +𝑣 ‘𝑈)(-1𝑆𝐶))) |
| 20 | 19 | 3adant3r1 1201 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝑀𝐶) = (𝐵( +𝑣 ‘𝑈)(-1𝑆𝐶))) |
| 21 | 20 | oveq2d 7431 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(𝐵𝑀𝐶)) = (𝐴𝑆(𝐵( +𝑣 ‘𝑈)(-1𝑆𝐶)))) |
| 22 | simpl 488 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝑈 ∈ NrmCVec) | |
| 23 | 4, 5 | nvscl 31136 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋) → (𝐴𝑆𝐵) ∈ 𝑋) |
| 24 | 23 | 3adant3r3 1203 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆𝐵) ∈ 𝑋) |
| 25 | 4, 5 | nvscl 31136 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ 𝑋) → (𝐴𝑆𝐶) ∈ 𝑋) |
| 26 | 25 | 3adant3r2 1202 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆𝐶) ∈ 𝑋) |
| 27 | 4, 10, 5, 18 | nvmval 31152 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝑆𝐵) ∈ 𝑋 ∧ (𝐴𝑆𝐶) ∈ 𝑋) → ((𝐴𝑆𝐵)𝑀(𝐴𝑆𝐶)) = ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(-1𝑆(𝐴𝑆𝐶)))) |
| 28 | 22, 24, 26, 27 | syl3anc 1398 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑆𝐵)𝑀(𝐴𝑆𝐶)) = ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(-1𝑆(𝐴𝑆𝐶)))) |
| 29 | 17, 21, 28 | 3eqtr4d 2805 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(𝐵𝑀𝐶)) = ((𝐴𝑆𝐵)𝑀(𝐴𝑆𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ‘cfv 6534 (class class class)co 7415 ℂcc 11144 1c1 11147 -cneg 11488 NrmCVeccnv 31094 +𝑣 cpv 31095 BaseSetcba 31096 ·𝑠OLD cns 31097 −𝑣 cnsb 31099 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7738 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7372 df-ov 7418 df-oprab 7419 df-mpo 7420 df-1st 7988 df-2nd 7989 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-pnf 11291 df-mnf 11292 df-ltxr 11294 df-sub 11489 df-neg 11490 df-grpo 31003 df-gid 31004 df-ginv 31005 df-gdiv 31006 df-ablo 31055 df-vc 31069 df-nv 31102 df-va 31105 df-ba 31106 df-sm 31107 df-0v 31108 df-vs 31109 df-nmcv 31110 |
| This theorem is used by: smcnlem 31207 minvecolem2 31385 |
| Copyright terms: Public domain | W3C validator |