| 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 25062 together with cvsclm 25094 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 30651 | . . 3 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (1𝑆𝐴) = 𝐴) |
| 5 | 4, 4 | oveq12d 7386 | . 2 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → ((1𝑆𝐴)𝐺(1𝑆𝐴)) = (𝐴𝐺𝐴)) |
| 6 | df-2 12220 | . . . 4 ⊢ 2 = (1 + 1) | |
| 7 | 6 | oveq1i 7378 | . . 3 ⊢ (2𝑆𝐴) = ((1 + 1)𝑆𝐴) |
| 8 | ax-1cn 11096 | . . . 4 ⊢ 1 ∈ ℂ | |
| 9 | 1, 2, 3 | vcdir 30653 | . . . . 5 ⊢ ((𝑊 ∈ CVecOLD ∧ (1 ∈ ℂ ∧ 1 ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → ((1 + 1)𝑆𝐴) = ((1𝑆𝐴)𝐺(1𝑆𝐴))) |
| 10 | 8, 9 | mp3anr1 1461 | . . . 4 ⊢ ((𝑊 ∈ CVecOLD ∧ (1 ∈ ℂ ∧ 𝐴 ∈ 𝑋)) → ((1 + 1)𝑆𝐴) = ((1𝑆𝐴)𝐺(1𝑆𝐴))) |
| 11 | 8, 10 | mpanr1 704 | . . 3 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → ((1 + 1)𝑆𝐴) = ((1𝑆𝐴)𝐺(1𝑆𝐴))) |
| 12 | 7, 11 | eqtr2id 2785 | . 2 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → ((1𝑆𝐴)𝐺(1𝑆𝐴)) = (2𝑆𝐴)) |
| 13 | 5, 12 | eqtr3d 2774 | 1 ⊢ ((𝑊 ∈ CVecOLD ∧ 𝐴 ∈ 𝑋) → (𝐴𝐺𝐴) = (2𝑆𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ran crn 5633 ‘cfv 6500 (class class class)co 7368 1st c1st 7941 2nd c2nd 7942 ℂcc 11036 1c1 11039 + caddc 11041 2c2 12212 CVecOLDcvc 30645 |
| 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 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379 ax-un 7690 ax-1cn 11096 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-fv 6508 df-ov 7371 df-1st 7943 df-2nd 7944 df-2 12220 df-vc 30646 |
| This theorem is referenced by: nv2 30719 ipdirilem 30916 |
| Copyright terms: Public domain | W3C validator |