| 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 12132 | . . . 4 ⊢ -1 ∈ ℂ | |
| 2 | nvnegneg.1 | . . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 3 | nvnegneg.4 | . . . . 5 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 4 | 2, 3 | nvscl 30682 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) ∈ 𝑋) |
| 5 | 1, 4 | mp3an2 1452 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) ∈ 𝑋) |
| 6 | eqid 2735 | . . . 4 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 7 | eqid 2735 | . . . 4 ⊢ (inv‘( +𝑣 ‘𝑈)) = (inv‘( +𝑣 ‘𝑈)) | |
| 8 | 2, 6, 3, 7 | nvinv 30695 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (-1𝑆𝐴) ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = ((inv‘( +𝑣 ‘𝑈))‘(-1𝑆𝐴))) |
| 9 | 5, 8 | syldan 592 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = ((inv‘( +𝑣 ‘𝑈))‘(-1𝑆𝐴))) |
| 10 | 2, 6, 3, 7 | nvinv 30695 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) = ((inv‘( +𝑣 ‘𝑈))‘𝐴)) |
| 11 | 10 | fveq2d 6837 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((inv‘( +𝑣 ‘𝑈))‘(-1𝑆𝐴)) = ((inv‘( +𝑣 ‘𝑈))‘((inv‘( +𝑣 ‘𝑈))‘𝐴))) |
| 12 | 6 | nvgrp 30673 | . . 3 ⊢ (𝑈 ∈ NrmCVec → ( +𝑣 ‘𝑈) ∈ GrpOp) |
| 13 | 2, 6 | bafval 30660 | . . . 4 ⊢ 𝑋 = ran ( +𝑣 ‘𝑈) |
| 14 | 13, 7 | grpo2inv 30587 | . . 3 ⊢ ((( +𝑣 ‘𝑈) ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((inv‘( +𝑣 ‘𝑈))‘((inv‘( +𝑣 ‘𝑈))‘𝐴)) = 𝐴) |
| 15 | 12, 14 | sylan 581 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((inv‘( +𝑣 ‘𝑈))‘((inv‘( +𝑣 ‘𝑈))‘𝐴)) = 𝐴) |
| 16 | 9, 11, 15 | 3eqtrd 2774 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ‘cfv 6491 (class class class)co 7358 ℂcc 11026 1c1 11029 -cneg 11367 GrpOpcgr 30545 invcgn 30547 NrmCVeccnv 30640 +𝑣 cpv 30641 BaseSetcba 30642 ·𝑠OLD cns 30643 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-rep 5223 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5518 df-po 5531 df-so 5532 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-pnf 11170 df-mnf 11171 df-ltxr 11173 df-sub 11368 df-neg 11369 df-grpo 30549 df-gid 30550 df-ginv 30551 df-ablo 30601 df-vc 30615 df-nv 30648 df-va 30651 df-ba 30652 df-sm 30653 df-0v 30654 df-nmcv 30656 |
| This theorem is referenced by: nvdif 30722 |
| Copyright terms: Public domain | W3C validator |