| 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 12177 | . . . 4 ⊢ -1 ∈ ℂ | |
| 2 | nvnegneg.1 | . . . . 5 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 3 | nvnegneg.4 | . . . . 5 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈) | |
| 4 | 2, 3 | nvscl 30775 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) ∈ 𝑋) |
| 5 | 1, 4 | mp3an2 1469 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) ∈ 𝑋) |
| 6 | eqid 2761 | . . . 4 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈) | |
| 7 | eqid 2761 | . . . 4 ⊢ (inv‘( +𝑣 ‘𝑈)) = (inv‘( +𝑣 ‘𝑈)) | |
| 8 | 2, 6, 3, 7 | nvinv 30788 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (-1𝑆𝐴) ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = ((inv‘( +𝑣 ‘𝑈))‘(-1𝑆𝐴))) |
| 9 | 5, 8 | syldan 600 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = ((inv‘( +𝑣 ‘𝑈))‘(-1𝑆𝐴))) |
| 10 | 2, 6, 3, 7 | nvinv 30788 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆𝐴) = ((inv‘( +𝑣 ‘𝑈))‘𝐴)) |
| 11 | 10 | fveq2d 6867 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((inv‘( +𝑣 ‘𝑈))‘(-1𝑆𝐴)) = ((inv‘( +𝑣 ‘𝑈))‘((inv‘( +𝑣 ‘𝑈))‘𝐴))) |
| 12 | 6 | nvgrp 30766 | . . 3 ⊢ (𝑈 ∈ NrmCVec → ( +𝑣 ‘𝑈) ∈ GrpOp) |
| 13 | 2, 6 | bafval 30753 | . . . 4 ⊢ 𝑋 = ran ( +𝑣 ‘𝑈) |
| 14 | 13, 7 | grpo2inv 30680 | . . 3 ⊢ ((( +𝑣 ‘𝑈) ∈ GrpOp ∧ 𝐴 ∈ 𝑋) → ((inv‘( +𝑣 ‘𝑈))‘((inv‘( +𝑣 ‘𝑈))‘𝐴)) = 𝐴) |
| 15 | 12, 14 | sylan 589 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → ((inv‘( +𝑣 ‘𝑈))‘((inv‘( +𝑣 ‘𝑈))‘𝐴)) = 𝐴) |
| 16 | 9, 11, 15 | 3eqtrd 2800 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1𝑆(-1𝑆𝐴)) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ‘cfv 6517 (class class class)co 7392 ℂcc 11068 1c1 11071 -cneg 11412 GrpOpcgr 30638 invcgn 30640 NrmCVeccnv 30733 +𝑣 cpv 30734 BaseSetcba 30735 ·𝑠OLD cns 30736 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-po 5553 df-so 5554 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-1st 7966 df-2nd 7967 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-pnf 11215 df-mnf 11216 df-ltxr 11218 df-sub 11413 df-neg 11414 df-grpo 30642 df-gid 30643 df-ginv 30644 df-ablo 30694 df-vc 30708 df-nv 30741 df-va 30744 df-ba 30745 df-sm 30746 df-0v 30747 df-nmcv 30749 |
| This theorem is referenced by: nvdif 30815 |
| Copyright terms: Public domain | W3C validator |