| 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 12204 | . . . 4 ⊢ -1 ∈ ℂ | |
| 2 | nvnegneg.1 | . . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 3 | nvnegneg.4 | . . . . 5 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 4 | 2, 3 | nvscl 30959 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) ∈ 𝑋) |
| 5 | 1, 4 | mp3an2 1478 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) ∈ 𝑋) |
| 6 | eqid 2763 | . . . 4 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 7 | eqid 2763 | . . . 4 ⊢ (inv‘( +𝑣 ‘𝑈)) = (inv‘( +𝑣 ‘𝑈)) | |
| 8 | 2, 6, 3, 7 | nvinv 30972 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (-1𝑆𝐴) ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = ((inv‘( +𝑣 ‘𝑈))‘(-1𝑆𝐴))) |
| 9 | 5, 8 | syldan 602 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = ((inv‘( +𝑣 ‘𝑈))‘(-1𝑆𝐴))) |
| 10 | 2, 6, 3, 7 | nvinv 30972 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) = ((inv‘( +𝑣 ‘𝑈))‘𝐴)) |
| 11 | 10 | fveq2d 6887 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((inv‘( +𝑣 ‘𝑈))‘(-1𝑆𝐴)) = ((inv‘( +𝑣 ‘𝑈))‘((inv‘( +𝑣 ‘𝑈))‘𝐴))) |
| 12 | 6 | nvgrp 30950 | . . 3 ⊢ (𝑈 ∈ NrmCVec → ( +𝑣 ‘𝑈) ∈ GrpOp) |
| 13 | 2, 6 | bafval 30937 | . . . 4 ⊢ 𝑋 = ran ( +𝑣 ‘𝑈) |
| 14 | 13, 7 | grpo2inv 30864 | . . 3 ⊢ ((( +𝑣 ‘𝑈) ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((inv‘( +𝑣 ‘𝑈))‘((inv‘( +𝑣 ‘𝑈))‘𝐴)) = 𝐴) |
| 15 | 12, 14 | sylan 591 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((inv‘( +𝑣 ‘𝑈))‘((inv‘( +𝑣 ‘𝑈))‘𝐴)) = 𝐴) |
| 16 | 9, 11, 15 | 3eqtrd 2802 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ‘cfv 6538 (class class class)co 7412 ℂcc 11099 1c1 11102 -cneg 11443 GrpOpcgr 30822 invcgn 30824 NrmCVeccnv 30917 +𝑣 cpv 30918 BaseSetcba 30919 ·𝑠OLD cns 30920 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7987 df-2nd 7988 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-ltxr 11249 df-sub 11444 df-neg 11445 df-grpo 30826 df-gid 30827 df-ginv 30828 df-ablo 30878 df-vc 30892 df-nv 30925 df-va 30928 df-ba 30929 df-sm 30930 df-0v 30931 df-nmcv 30933 |
| This theorem is referenced by: nvdif 30999 |
| Copyright terms: Public domain | W3C validator |