| 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 5702 | . . 3 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) → 〈𝐹, 𝑈〉 ∈ (𝑇 × 𝐸)) | |
| 2 | opelxpi 5702 | . . 3 ⊢ ((𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸) → 〈𝐺, 𝑉〉 ∈ (𝑇 × 𝐸)) | |
| 3 | dvhopadd.a | . . . 4 ⊢ 𝐴 = (𝑓 ∈ (𝑇 × 𝐸), 𝑔 ∈ (𝑇 × 𝐸) ↦ 〈((1st ‘𝑓) ∘ (1st ‘𝑔)), ((2nd ‘𝑓)𝑃(2nd ‘𝑔))〉) | |
| 4 | 3 | dvhvaddval 41814 | . . 3 ⊢ ((〈𝐹, 𝑈〉 ∈ (𝑇 × 𝐸) ∧ 〈𝐺, 𝑉〉 ∈ (𝑇 × 𝐸)) → (〈𝐹, 𝑈〉𝐴〈𝐺, 𝑉〉) = 〈((1st ‘〈𝐹, 𝑈〉) ∘ (1st ‘〈𝐺, 𝑉〉)), ((2nd ‘〈𝐹, 𝑈〉)𝑃(2nd ‘〈𝐺, 𝑉〉))〉) |
| 5 | 1, 2, 4 | syl2an 607 | . 2 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → (〈𝐹, 𝑈〉𝐴〈𝐺, 𝑉〉) = 〈((1st ‘〈𝐹, 𝑈〉) ∘ (1st ‘〈𝐺, 𝑉〉)), ((2nd ‘〈𝐹, 𝑈〉)𝑃(2nd ‘〈𝐺, 𝑉〉))〉) |
| 6 | op1stg 8001 | . . . . 5 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) → (1st ‘〈𝐹, 𝑈〉) = 𝐹) | |
| 7 | 6 | adantr 485 | . . . 4 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → (1st ‘〈𝐹, 𝑈〉) = 𝐹) |
| 8 | op1stg 8001 | . . . . 5 ⊢ ((𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸) → (1st ‘〈𝐺, 𝑉〉) = 𝐺) | |
| 9 | 8 | adantl 486 | . . . 4 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → (1st ‘〈𝐺, 𝑉〉) = 𝐺) |
| 10 | 7, 9 | coeq12d 5854 | . . 3 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → ((1st ‘〈𝐹, 𝑈〉) ∘ (1st ‘〈𝐺, 𝑉〉)) = (𝐹 ∘ 𝐺)) |
| 11 | op2ndg 8002 | . . . 4 ⊢ ((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) → (2nd ‘〈𝐹, 𝑈〉) = 𝑈) | |
| 12 | op2ndg 8002 | . . . 4 ⊢ ((𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸) → (2nd ‘〈𝐺, 𝑉〉) = 𝑉) | |
| 13 | 11, 12 | oveqan12d 7433 | . . 3 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → ((2nd ‘〈𝐹, 𝑈〉)𝑃(2nd ‘〈𝐺, 𝑉〉)) = (𝑈𝑃𝑉)) |
| 14 | 10, 13 | opeq12d 4851 | . 2 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → 〈((1st ‘〈𝐹, 𝑈〉) ∘ (1st ‘〈𝐺, 𝑉〉)), ((2nd ‘〈𝐹, 𝑈〉)𝑃(2nd ‘〈𝐺, 𝑉〉))〉 = 〈(𝐹 ∘ 𝐺), (𝑈𝑃𝑉)〉) |
| 15 | 5, 14 | eqtrd 2805 | 1 ⊢ (((𝐹 ∈ 𝑇 ∧ 𝑈 ∈ 𝐸) ∧ (𝐺 ∈ 𝑇 ∧ 𝑉 ∈ 𝐸)) → (〈𝐹, 𝑈〉𝐴〈𝐺, 𝑉〉) = 〈(𝐹 ∘ 𝐺), (𝑈𝑃𝑉)〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1568 ∈ wcel 2150 〈cop 4600 × cxp 5663 ∘ ccom 5669 ‘cfv 6540 (class class class)co 7414 ∈ cmpo 7416 1st c1st 7987 2nd c2nd 7988 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2199 ax-12 2220 ax-ext 2742 ax-sep 5262 ax-nul 5274 ax-pr 5408 ax-un 7736 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-mo 2574 df-eu 2604 df-clab 2749 df-cleq 2762 df-clel 2845 df-nfc 2919 df-ne 2966 df-ral 3087 df-rex 3097 df-rab 3424 df-v 3464 df-sbc 3753 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5560 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-iota 6496 df-fun 6542 df-fv 6548 df-ov 7417 df-oprab 7418 df-mpo 7419 df-1st 7989 df-2nd 7990 |
| This theorem is referenced by: dvhopN 41840 |
| Copyright terms: Public domain | W3C validator |