| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > hvnegdi | Structured version Visualization version GIF version | ||
| Description: Distribution of negative over subtraction. (Contributed by NM, 2-Apr-2000.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| hvnegdi | ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (-1 ·ℎ (𝐴 −ℎ 𝐵)) = (𝐵 −ℎ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq1 7397 | . . . 4 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (𝐴 −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) | |
| 2 | 1 | oveq2d 7406 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (-1 ·ℎ (𝐴 −ℎ 𝐵)) = (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵))) |
| 3 | oveq2 7398 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (𝐵 −ℎ 𝐴) = (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ))) | |
| 4 | 2, 3 | eqeq12d 2746 | . 2 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → ((-1 ·ℎ (𝐴 −ℎ 𝐵)) = (𝐵 −ℎ 𝐴) ↔ (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)))) |
| 5 | oveq2 7398 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) | |
| 6 | 5 | oveq2d 7406 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) |
| 7 | oveq1 7397 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)) = (if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ))) | |
| 8 | 6, 7 | eqeq12d 2746 | . 2 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → ((-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)) ↔ (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) = (if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)))) |
| 9 | ifhvhv0 30958 | . . 3 ⊢ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) ∈ ℋ | |
| 10 | ifhvhv0 30958 | . . 3 ⊢ if(𝐵 ∈ ℋ, 𝐵, 0ℎ) ∈ ℋ | |
| 11 | 9, 10 | hvnegdii 30998 | . 2 ⊢ (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) = (if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)) |
| 12 | 4, 8, 11 | dedth2h 4551 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (-1 ·ℎ (𝐴 −ℎ 𝐵)) = (𝐵 −ℎ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ifcif 4491 (class class class)co 7390 1c1 11076 -cneg 11413 ℋchba 30855 ·ℎ csm 30857 0ℎc0v 30860 −ℎ cmv 30861 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 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 ax-hvcom 30937 ax-hv0cl 30939 ax-hfvmul 30941 ax-hvmulid 30942 ax-hvmulass 30943 ax-hvdistr1 30944 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-po 5549 df-so 5550 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11217 df-mnf 11218 df-ltxr 11220 df-sub 11414 df-neg 11415 df-hvsub 30907 |
| This theorem is referenced by: hvsubcan2 31011 |
| Copyright terms: Public domain | W3C validator |