| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nvpncan2 | Structured version Visualization version GIF version | ||
| Description: Cancellation law for vector subtraction. (Contributed by NM, 27-Dec-2007.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nvpncan2.1 | ⊢ 𝑋 = (BaseSet‘𝑈) |
| nvpncan2.2 | ⊢ 𝐺 = ( +𝑣 ‘𝑈) |
| nvpncan2.3 | ⊢ 𝑀 = ( −𝑣 ‘𝑈) |
| Ref | Expression |
|---|---|
| nvpncan2 | ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺𝐵)𝑀𝐴) = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1150 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝑈 ∈ NrmCVec) | |
| 2 | nvpncan2.1 | . . . 4 ⊢ 𝑋 = (BaseSet‘𝑈) | |
| 3 | nvpncan2.2 | . . . 4 ⊢ 𝐺 = ( +𝑣 ‘𝑈) | |
| 4 | 2, 3 | nvgcl 30825 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺𝐵) ∈ 𝑋) |
| 5 | simp2 1151 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴 ∈ 𝑋) | |
| 6 | eqid 2764 | . . . 4 ⊢ ( ·𝑠OLD ‘𝑈) = ( ·𝑠OLD ‘𝑈) | |
| 7 | nvpncan2.3 | . . . 4 ⊢ 𝑀 = ( −𝑣 ‘𝑈) | |
| 8 | 2, 3, 6, 7 | nvmval 30847 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴𝐺𝐵) ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐴𝐺𝐵)𝑀𝐴) = ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)𝐴))) |
| 9 | 1, 4, 5, 8 | syl3anc 1392 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺𝐵)𝑀𝐴) = ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)𝐴))) |
| 10 | simp3 1152 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐵 ∈ 𝑋) | |
| 11 | neg1cn 12182 | . . . . . 6 ⊢ -1 ∈ ℂ | |
| 12 | 2, 6 | nvscl 30831 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ -1 ∈ ℂ ∧ 𝐴 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋) |
| 13 | 11, 12 | mp3an2 1472 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋) |
| 14 | 13 | 3adant3 1146 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (-1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋) |
| 15 | 2, 3 | nvadd32 30828 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ (-1( ·𝑠OLD ‘𝑈)𝐴) ∈ 𝑋)) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)𝐴)) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐴))𝐺𝐵)) |
| 16 | 1, 5, 10, 14, 15 | syl13anc 1393 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)𝐴)) = ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐴))𝐺𝐵)) |
| 17 | eqid 2764 | . . . . . . 7 ⊢ (0vec‘𝑈) = (0vec‘𝑈) | |
| 18 | 2, 3, 6, 17 | nvrinv 30856 | . . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐴)) = (0vec‘𝑈)) |
| 19 | 18 | 3adant3 1146 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐴)) = (0vec‘𝑈)) |
| 20 | 19 | oveq1d 7413 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐴))𝐺𝐵) = ((0vec‘𝑈)𝐺𝐵)) |
| 21 | 2, 3, 17 | nv0lid 30841 | . . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐵 ∈ 𝑋) → ((0vec‘𝑈)𝐺𝐵) = 𝐵) |
| 22 | 21 | 3adant2 1145 | . . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((0vec‘𝑈)𝐺𝐵) = 𝐵) |
| 23 | 20, 22 | eqtrd 2799 | . . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺(-1( ·𝑠OLD ‘𝑈)𝐴))𝐺𝐵) = 𝐵) |
| 24 | 16, 23 | eqtrd 2799 | . 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺𝐵)𝐺(-1( ·𝑠OLD ‘𝑈)𝐴)) = 𝐵) |
| 25 | 9, 24 | eqtrd 2799 | 1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐺𝐵)𝑀𝐴) = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1099 = wceq 1562 ∈ wcel 2144 ‘cfv 6523 (class class class)co 7398 ℂcc 11073 1c1 11076 -cneg 11417 NrmCVeccnv 30789 +𝑣 cpv 30790 BaseSetcba 30791 ·𝑠OLD cns 30792 0veccn0v 30793 −𝑣 cnsb 30794 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-rep 5229 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5544 df-po 5557 df-so 5558 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-riota 7355 df-ov 7401 df-oprab 7402 df-mpo 7403 df-1st 7972 df-2nd 7973 df-er 8680 df-en 8930 df-dom 8931 df-sdom 8932 df-pnf 11220 df-mnf 11221 df-ltxr 11223 df-sub 11418 df-neg 11419 df-grpo 30698 df-gid 30699 df-ginv 30700 df-gdiv 30701 df-ablo 30750 df-vc 30764 df-nv 30797 df-va 30800 df-ba 30801 df-sm 30802 df-0v 30803 df-vs 30804 df-nmcv 30805 |
| This theorem is referenced by: nvpncan 30859 blocnilem 31009 ubthlem2 31076 |
| Copyright terms: Public domain | W3C validator |