| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dvhopaddN | Structured version Visualization version GIF version | ||
| Description: Sum of DVecH vectors expressed as ordered pair. (Contributed by NM, 20-Nov-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| dvhopadd.a | ⊢ 𝐴 = (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ 〈((1st ‘𝑓) ∘ (1st ‘𝑔)), ((2nd ‘𝑓)𝑃(2nd ‘𝑔))〉) |
| Ref | Expression |
|---|---|
| dvhopaddN | ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → (〈𝐹, 𝑈〉𝐴〈𝐺, 𝑉〉) = 〈(𝐹 ∘ 𝐺), (𝑈𝑃𝑉)〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opelxpi 5659 | . . 3 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) → 〈𝐹, 𝑈〉 ∈ (𝑇 × 𝐸)) | |
| 2 | opelxpi 5659 | . . 3 ⊢ ((𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸) → 〈𝐺, 𝑉〉 ∈ (𝑇 × 𝐸)) | |
| 3 | dvhopadd.a | . . . 4 ⊢ 𝐴 = (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ 〈((1st ‘𝑓) ∘ (1st ‘𝑔)), ((2nd ‘𝑓)𝑃(2nd ‘𝑔))〉) | |
| 4 | 3 | dvhvaddval 41527 | . . 3 ⊢ ((〈𝐹, 𝑈〉 ∈ (𝑇 × 𝐸) ∧ 〈𝐺, 𝑉〉 ∈ (𝑇 × 𝐸)) → (〈𝐹, 𝑈〉𝐴〈𝐺, 𝑉〉) = 〈((1st ‘〈𝐹, 𝑈〉) ∘ (1st ‘〈𝐺, 𝑉〉)), ((2nd ‘〈𝐹, 𝑈〉)𝑃(2nd ‘〈𝐺, 𝑉〉))〉) |
| 5 | 1, 2, 4 | syl2an 597 | . 2 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → (〈𝐹, 𝑈〉𝐴〈𝐺, 𝑉〉) = 〈((1st ‘〈𝐹, 𝑈〉) ∘ (1st ‘〈𝐺, 𝑉〉)), ((2nd ‘〈𝐹, 𝑈〉)𝑃(2nd ‘〈𝐺, 𝑉〉))〉) |
| 6 | op1stg 7945 | . . . . 5 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) → (1st ‘〈𝐹, 𝑈〉) = 𝐹) | |
| 7 | 6 | adantr 480 | . . . 4 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → (1st ‘〈𝐹, 𝑈〉) = 𝐹) |
| 8 | op1stg 7945 | . . . . 5 ⊢ ((𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸) → (1st ‘〈𝐺, 𝑉〉) = 𝐺) | |
| 9 | 8 | adantl 481 | . . . 4 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → (1st ‘〈𝐺, 𝑉〉) = 𝐺) |
| 10 | 7, 9 | coeq12d 5811 | . . 3 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → ((1st ‘〈𝐹, 𝑈〉) ∘ (1st ‘〈𝐺, 𝑉〉)) = (𝐹 ∘ 𝐺)) |
| 11 | op2ndg 7946 | . . . 4 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) → (2nd ‘〈𝐹, 𝑈〉) = 𝑈) | |
| 12 | op2ndg 7946 | . . . 4 ⊢ ((𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸) → (2nd ‘〈𝐺, 𝑉〉) = 𝑉) | |
| 13 | 11, 12 | oveqan12d 7377 | . . 3 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → ((2nd ‘〈𝐹, 𝑈〉)𝑃(2nd ‘〈𝐺, 𝑉〉)) = (𝑈𝑃𝑉)) |
| 14 | 10, 13 | opeq12d 4825 | . 2 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → 〈((1st ‘〈𝐹, 𝑈〉) ∘ (1st ‘〈𝐺, 𝑉〉)), ((2nd ‘〈𝐹, 𝑈〉)𝑃(2nd ‘〈𝐺, 𝑉〉))〉 = 〈(𝐹 ∘ 𝐺), (𝑈𝑃𝑉)〉) |
| 15 | 5, 14 | eqtrd 2772 | 1 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → (〈𝐹, 𝑈〉𝐴〈𝐺, 𝑉〉) = 〈(𝐹 ∘ 𝐺), (𝑈𝑃𝑉)〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 〈cop 4574 × cxp 5620 ∘ ccom 5626 ‘cfv 6490 (class class class)co 7358 ∈ cmpo 7360 1st c1st 7931 2nd c2nd 7932 |
| 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 5231 ax-nul 5241 ax-pr 5368 ax-un 7680 |
| 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 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-iota 6446 df-fun 6492 df-fv 6498 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 |
| This theorem is referenced by: dvhopN 41553 |
| Copyright terms: Public domain | W3C validator |