| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > vc2OLD | Structured version Visualization version GIF version | ||
| Description: A vector plus itself is two times the vector. (Contributed by NM, 1-Feb-2007.) Obsolete theorem, use clmvs2 25019 together with cvsclm 25051 instead. (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| vciOLD.1 | ⊢ 𝐺 = (1st ‘𝑊) |
| vciOLD.2 | ⊢ 𝑆 = (2nd ‘𝑊) |
| vciOLD.3 | ⊢ 𝑋 = ran 𝐺 |
| Ref | Expression |
|---|---|
| vc2OLD | ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺𝐴) = (2𝑆𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vciOLD.1 | . . . 4 ⊢ 𝐺 = (1st ‘𝑊) | |
| 2 | vciOLD.2 | . . . 4 ⊢ 𝑆 = (2nd ‘𝑊) | |
| 3 | vciOLD.3 | . . . 4 ⊢ 𝑋 = ran 𝐺 | |
| 4 | 1, 2, 3 | vcidOLD 30539 | . . 3 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (1𝑆𝐴) = 𝐴) |
| 5 | 4, 4 | oveq12d 7364 | . 2 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → ((1𝑆𝐴)𝐺(1𝑆𝐴)) = (𝐴𝐺𝐴)) |
| 6 | df-2 12185 | . . . 4 ⊢ 2 = (1 + 1) | |
| 7 | 6 | oveq1i 7356 | . . 3 ⊢ (2𝑆𝐴) = ((1 + 1)𝑆𝐴) |
| 8 | ax-1cn 11061 | . . . 4 ⊢ 1 ∈ ℂ | |
| 9 | 1, 2, 3 | vcdir 30541 | . . . . 5 ⊢ ((𝑊 ∈ CVecOLD ∧ (1 ∈ ℂ ∧ 1 ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → ((1 + 1)𝑆𝐴) = ((1𝑆𝐴)𝐺(1𝑆𝐴))) |
| 10 | 8, 9 | mp3anr1 1460 | . . . 4 ⊢ ((𝑊 ∈ CVecOLD ∧ (1 ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → ((1 + 1)𝑆𝐴) = ((1𝑆𝐴)𝐺(1𝑆𝐴))) |
| 11 | 8, 10 | mpanr1 703 | . . 3 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → ((1 + 1)𝑆𝐴) = ((1𝑆𝐴)𝐺(1𝑆𝐴))) |
| 12 | 7, 11 | eqtr2id 2779 | . 2 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → ((1𝑆𝐴)𝐺(1𝑆𝐴)) = (2𝑆𝐴)) |
| 13 | 5, 12 | eqtr3d 2768 | 1 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺𝐴) = (2𝑆𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ran crn 5617 ‘cfv 6481 (class class class)co 7346 1st c1st 7919 2nd c2nd 7920 ℂcc 11001 1c1 11004 + caddc 11006 2c2 12177 CVecOLDcvc 30533 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5234 ax-nul 5244 ax-pr 5370 ax-un 7668 ax-1cn 11061 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4476 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5092 df-opab 5154 df-mpt 5173 df-id 5511 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-fv 6489 df-ov 7349 df-1st 7921 df-2nd 7922 df-2 12185 df-vc 30534 |
| This theorem is referenced by: nv2 30607 ipdirilem 30804 |
| Copyright terms: Public domain | W3C validator |