| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nvdif | Structured version Visualization version GIF version | ||
| Description: The norm of the difference between two vectors. (Contributed by NM, 1-Dec-2006.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nvdif.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| nvdif.2 | ⊢ 𝐺 = ( +𝑣 ‘𝑈) |
| nvdif.4 | ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) |
| nvdif.6 | ⊢ 𝑁 = (normCV‘𝑈) |
| Ref | Expression |
|---|---|
| nvdif | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐺( -1𝑆𝐵))) = (𝑁‘(𝐵𝐺( -1𝑆𝐴)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝑈 ∈ NrmCVec) | |
| 2 | neg1cn 12343 | . . . . . 6 ⊢ -1 ∈ ℂ | |
| 3 | 2 | a1i 11 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → -1 ∈ ℂ) |
| 4 | simp3 1156 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ∈ 𝑋) | |
| 5 | nvdif.1 | . . . . . . . 8 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 6 | nvdif.4 | . . . . . . . 8 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 7 | 5, 6 | nvscl 31274 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋) → ( -1𝑆𝐴) ∈ 𝑋) |
| 8 | 2, 7 | mp3an2 1479 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ( -1𝑆𝐴) ∈ 𝑋) |
| 9 | 8 | 3adant3 1150 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ( -1𝑆𝐴) ∈ 𝑋) |
| 10 | nvdif.2 | . . . . . 6 ⊢ 𝐺 = ( +𝑣 ‘𝑈) | |
| 11 | 5, 10, 6 | nvdi 31278 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ ( -1 ∈ ℂ ∧ 𝐵 ∈ 𝑋 ∧ ( -1𝑆𝐴) ∈ 𝑋)) → ( -1𝑆(𝐵𝐺( -1𝑆𝐴))) = (( -1𝑆𝐵)𝐺( -1𝑆( -1𝑆𝐴)))) |
| 12 | 1, 3, 4, 9, 11 | syl13anc 1400 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ( -1𝑆(𝐵𝐺( -1𝑆𝐴))) = (( -1𝑆𝐵)𝐺( -1𝑆( -1𝑆𝐴)))) |
| 13 | 5, 6 | nvnegneg 31297 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ( -1𝑆( -1𝑆𝐴)) = 𝐴) |
| 14 | 13 | 3adant3 1150 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ( -1𝑆( -1𝑆𝐴)) = 𝐴) |
| 15 | 14 | oveq2d 7465 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (( -1𝑆𝐵)𝐺( -1𝑆( -1𝑆𝐴))) = (( -1𝑆𝐵)𝐺𝐴)) |
| 16 | 5, 6 | nvscl 31274 | . . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐵 ∈ 𝑋) → ( -1𝑆𝐵) ∈ 𝑋) |
| 17 | 2, 16 | mp3an2 1479 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → ( -1𝑆𝐵) ∈ 𝑋) |
| 18 | 17 | 3adant2 1149 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ( -1𝑆𝐵) ∈ 𝑋) |
| 19 | simp2 1155 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
| 20 | 5, 10 | nvcom 31269 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ ( -1𝑆𝐵) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (( -1𝑆𝐵)𝐺𝐴) = (𝐴𝐺( -1𝑆𝐵))) |
| 21 | 1, 18, 19, 20 | syl3anc 1399 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (( -1𝑆𝐵)𝐺𝐴) = (𝐴𝐺( -1𝑆𝐵))) |
| 22 | 12, 15, 21 | 3eqtrd 2802 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ( -1𝑆(𝐵𝐺( -1𝑆𝐴))) = (𝐴𝐺( -1𝑆𝐵))) |
| 23 | 22 | fveq2d 6918 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘( -1𝑆(𝐵𝐺( -1𝑆𝐴)))) = (𝑁‘(𝐴𝐺( -1𝑆𝐵)))) |
| 24 | 5, 10 | nvgcl 31268 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋 ∧ ( -1𝑆𝐴) ∈ 𝑋) → (𝐵𝐺( -1𝑆𝐴)) ∈ 𝑋) |
| 25 | 1, 4, 9, 24 | syl3anc 1399 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐵𝐺( -1𝑆𝐴)) ∈ 𝑋) |
| 26 | nvdif.6 | . . . 4 ⊢ 𝑁 = (normCV‘𝑈) | |
| 27 | 5, 6, 26 | nvm1 31313 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐵𝐺( -1𝑆𝐴)) ∈ 𝑋) → (𝑁‘( -1𝑆(𝐵𝐺( -1𝑆𝐴)))) = (𝑁‘(𝐵𝐺( -1𝑆𝐴)))) |
| 28 | 1, 25, 27 | syl2anc 596 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘( -1𝑆(𝐵𝐺( -1𝑆𝐴)))) = (𝑁‘(𝐵𝐺( -1𝑆𝐴)))) |
| 29 | 23, 28 | eqtr3d 2800 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑁‘(𝐴𝐺( -1𝑆𝐵))) = (𝑁‘(𝐵𝐺( -1𝑆𝐴)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ‘cfv 6564 (class class class)co 7449 ℂcc 11235 1c1 11238 -cneg 11579 NrmCVeccnv 31232 +𝑣 cpv 31233 BaseSetcba 31234 ·𝑠OLD cns 31235 normCVcnmcv 31238 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7781 ax-cnex 11293 ax-resscn 11294 ax-1cn 11295 ax-icn 11296 ax-addcl 11297 ax-addrcl 11298 ax-mulcl 11299 ax-mulrcl 11300 ax-mulcom 11301 ax-addass 11302 ax-mulass 11303 ax-distr 11304 ax-i2m1 11305 ax-1ne0 11306 ax-1rid 11307 ax-rnegex 11308 ax-rrecex 11309 ax-cnre 11310 ax-pre-lttri 11311 ax-pre-lttrn 11312 ax-pre-ltadd 11313 ax-pre-mulgt0 11314 ax-pre-sup 11315 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6328 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6518 df-fun 6566 df-fn 6567 df-f 6568 df-f1 6569 df-fo 6570 df-f1o 6571 df-fv 6572 df-riota 7406 df-ov 7452 df-oprab 7453 df-mpo 7454 df-om 7910 df-1st 8033 df-2nd 8034 df-frecs 8335 df-wrecs 8366 df-recs 8415 df-rdg 8454 df-er 8753 df-en 9010 df-dom 9011 df-sdom 9012 df-sup 9469 df-pnf 11382 df-mnf 11383 df-xr 11384 df-ltxr 11385 df-le 11386 df-sub 11580 df-neg 11581 df-div 12012 df-nn 12374 df-2 12443 df-3 12444 df-n0 12645 df-z 12732 df-uz 13004 df-rp 13159 df-seq 14183 df-exp 14243 df-cj 15307 df-re 15308 df-im 15309 df-sqrt 15443 df-abs 15444 df-grpo 31141 df-gid 31142 df-ginv 31143 df-ablo 31193 df-vc 31207 df-nv 31240 df-va 31243 df-ba 31244 df-sm 31245 df-0v 31246 df-nmcv 31248 |
| This theorem is used by: nvabs 31320 imsmetlem 31338 dipcj 31362 |
| Copyright terms: Public domain | W3C validator |