| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nvnegneg | Structured version Visualization version GIF version | ||
| Description: Double negative of a vector. (Contributed by NM, 4-Dec-2007.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nvnegneg.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| nvnegneg.4 | ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) |
| Ref | Expression |
|---|---|
| nvnegneg | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | neg1cn 12194 | . . . 4 ⊢ -1 ∈ ℂ | |
| 2 | nvnegneg.1 | . . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 3 | nvnegneg.4 | . . . . 5 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 4 | 2, 3 | nvscl 30887 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) ∈ 𝑋) |
| 5 | 1, 4 | mp3an2 1473 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) ∈ 𝑋) |
| 6 | eqid 2765 | . . . 4 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 7 | eqid 2765 | . . . 4 ⊢ (inv‘( +𝑣 ‘𝑈)) = (inv‘( +𝑣 ‘𝑈)) | |
| 8 | 2, 6, 3, 7 | nvinv 30900 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (-1𝑆𝐴) ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = ((inv‘( +𝑣 ‘𝑈))‘(-1𝑆𝐴))) |
| 9 | 5, 8 | syldan 602 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = ((inv‘( +𝑣 ‘𝑈))‘(-1𝑆𝐴))) |
| 10 | 2, 6, 3, 7 | nvinv 30900 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) = ((inv‘( +𝑣 ‘𝑈))‘𝐴)) |
| 11 | 10 | fveq2d 6875 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((inv‘( +𝑣 ‘𝑈))‘(-1𝑆𝐴)) = ((inv‘( +𝑣 ‘𝑈))‘((inv‘( +𝑣 ‘𝑈))‘𝐴))) |
| 12 | 6 | nvgrp 30878 | . . 3 ⊢ (𝑈 ∈ NrmCVec → ( +𝑣 ‘𝑈) ∈ GrpOp) |
| 13 | 2, 6 | bafval 30865 | . . . 4 ⊢ 𝑋 = ran ( +𝑣 ‘𝑈) |
| 14 | 13, 7 | grpo2inv 30792 | . . 3 ⊢ ((( +𝑣 ‘𝑈) ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((inv‘( +𝑣 ‘𝑈))‘((inv‘( +𝑣 ‘𝑈))‘𝐴)) = 𝐴) |
| 15 | 12, 14 | sylan 591 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((inv‘( +𝑣 ‘𝑈))‘((inv‘( +𝑣 ‘𝑈))‘𝐴)) = 𝐴) |
| 16 | 9, 11, 15 | 3eqtrd 2804 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ‘cfv 6525 (class class class)co 7400 ℂcc 11086 1c1 11089 -cneg 11430 GrpOpcgr 30750 invcgn 30752 NrmCVeccnv 30845 +𝑣 cpv 30846 BaseSetcba 30847 ·𝑠OLD cns 30848 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-po 5560 df-so 5561 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-1st 7974 df-2nd 7975 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-ltxr 11236 df-sub 11431 df-neg 11432 df-grpo 30754 df-gid 30755 df-ginv 30756 df-ablo 30806 df-vc 30820 df-nv 30853 df-va 30856 df-ba 30857 df-sm 30858 df-0v 30859 df-nmcv 30861 |
| This theorem is referenced by: nvdif 30927 |
| Copyright terms: Public domain | W3C validator |