| 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 1212 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐴 ∈ ℂ) | |
| 2 | simpr2 1213 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝐵 ∈ 𝑋) | |
| 3 | neg1cn 12209 | . . . . . . 7 ⊢ -1 ∈ ℂ | |
| 4 | nvmdi.1 | . . . . . . . 8 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 5 | nvmdi.4 | . . . . . . . 8 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 6 | 4, 5 | nvscl 30989 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐶 ∈ 𝑋) → (-1𝑆𝐶) ∈ 𝑋) |
| 7 | 3, 6 | mp3an2 1477 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐶 ∈ 𝑋) → (-1𝑆𝐶) ∈ 𝑋) |
| 8 | 7 | 3ad2antr3 1208 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (-1𝑆𝐶) ∈ 𝑋) |
| 9 | 1, 2, 8 | 3jca 1145 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ (-1𝑆𝐶) ∈ 𝑋)) |
| 10 | eqid 2762 | . . . . 5 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 11 | 4, 10, 5 | nvdi 30993 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ (-1𝑆𝐶) ∈ 𝑋)) → (𝐴𝑆(𝐵( +𝑣 ‘𝑈)(-1𝑆𝐶))) = ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(𝐴𝑆(-1𝑆𝐶)))) |
| 12 | 9, 11 | syldan 602 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(𝐵( +𝑣 ‘𝑈)(-1𝑆𝐶))) = ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(𝐴𝑆(-1𝑆𝐶)))) |
| 13 | 4, 5 | nvscom 30992 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ -1 ∈ ℂ ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(-1𝑆𝐶)) = (-1𝑆(𝐴𝑆𝐶))) |
| 14 | 3, 13 | mp3anr2 1487 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(-1𝑆𝐶)) = (-1𝑆(𝐴𝑆𝐶))) |
| 15 | 14 | 3adantr2 1188 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(-1𝑆𝐶)) = (-1𝑆(𝐴𝑆𝐶))) |
| 16 | 15 | oveq2d 7428 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(𝐴𝑆(-1𝑆𝐶))) = ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(-1𝑆(𝐴𝑆𝐶)))) |
| 17 | 12, 16 | eqtrd 2797 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(𝐵( +𝑣 ‘𝑈)(-1𝑆𝐶))) = ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(-1𝑆(𝐴𝑆𝐶)))) |
| 18 | nvmdi.3 | . . . . 5 ⊢ 𝑀 = ( −𝑣 ‘𝑈) | |
| 19 | 4, 10, 5, 18 | nvmval 31005 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝑀𝐶) = (𝐵( +𝑣 ‘𝑈)(-1𝑆𝐶))) |
| 20 | 19 | 3adant3r1 1200 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝑀𝐶) = (𝐵( +𝑣 ‘𝑈)(-1𝑆𝐶))) |
| 21 | 20 | oveq2d 7428 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(𝐵𝑀𝐶)) = (𝐴𝑆(𝐵( +𝑣 ‘𝑈)(-1𝑆𝐶)))) |
| 22 | simpl 487 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → 𝑈 ∈ NrmCVec) | |
| 23 | 4, 5 | nvscl 30989 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋) → (𝐴𝑆𝐵) ∈ 𝑋) |
| 24 | 23 | 3adant3r3 1202 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆𝐵) ∈ 𝑋) |
| 25 | 4, 5 | nvscl 30989 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ ℂ ∧ 𝐶 ∈ 𝑋) → (𝐴𝑆𝐶) ∈ 𝑋) |
| 26 | 25 | 3adant3r2 1201 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆𝐶) ∈ 𝑋) |
| 27 | 4, 10, 5, 18 | nvmval 31005 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝑆𝐵) ∈ 𝑋 ∧ (𝐴𝑆𝐶) ∈ 𝑋) → ((𝐴𝑆𝐵)𝑀(𝐴𝑆𝐶)) = ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(-1𝑆(𝐴𝑆𝐶)))) |
| 28 | 22, 24, 26, 27 | syl3anc 1397 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝑆𝐵)𝑀(𝐴𝑆𝐶)) = ((𝐴𝑆𝐵)( +𝑣 ‘𝑈)(-1𝑆(𝐴𝑆𝐶)))) |
| 29 | 17, 21, 28 | 3eqtr4d 2807 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝑆(𝐵𝑀𝐶)) = ((𝐴𝑆𝐵)𝑀(𝐴𝑆𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 ‘cfv 6536 (class class class)co 7412 ℂcc 11104 1c1 11107 -cneg 11448 NrmCVeccnv 30947 +𝑣 cpv 30948 BaseSetcba 30949 ·𝑠OLD cns 30950 −𝑣 cnsb 30952 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-po 5568 df-so 5569 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7984 df-2nd 7985 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11251 df-mnf 11252 df-ltxr 11254 df-sub 11449 df-neg 11450 df-grpo 30856 df-gid 30857 df-ginv 30858 df-gdiv 30859 df-ablo 30908 df-vc 30922 df-nv 30955 df-va 30958 df-ba 30959 df-sm 30960 df-0v 30961 df-vs 30962 df-nmcv 30963 |
| This theorem is used by: smcnlem 31060 minvecolem2 31238 |
| Copyright terms: Public domain | W3C validator |