| 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 7457 | . . . 4 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (𝐴 −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) | |
| 2 | 1 | oveq2d 7466 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → ( -1 ·ℎ (𝐴 −ℎ 𝐵)) = ( -1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵))) |
| 3 | oveq2 7458 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (𝐵 −ℎ 𝐴) = (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ))) | |
| 4 | 2, 3 | eqeq12d 2782 | . 2 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (( -1 ·ℎ (𝐴 −ℎ 𝐵)) = (𝐵 −ℎ 𝐴) ↔ ( -1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)))) |
| 5 | oveq2 7458 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) | |
| 6 | 5 | oveq2d 7466 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → ( -1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = ( -1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) |
| 7 | oveq1 7457 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)) = (if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ))) | |
| 8 | 6, 7 | eqeq12d 2782 | . 2 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (( -1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)) ↔ ( -1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) = (if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)))) |
| 9 | ifhvhv0 31683 | . . 3 ⊢ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) ∈ ℋ | |
| 10 | ifhvhv0 31683 | . . 3 ⊢ if(𝐵 ∈ ℋ, 𝐵, 0ℎ) ∈ ℋ | |
| 11 | 9, 10 | hvnegdii 31723 | . 2 ⊢ ( -1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) = (if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)) |
| 12 | 4, 8, 11 | dedth2h 4544 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ( -1 ·ℎ (𝐴 −ℎ 𝐵)) = (𝐵 −ℎ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ifcif 4484 (class class class)co 7450 1c1 11239 -cneg 11580 ℋchba 31580 ·ℎ csm 31582 0ℎc0v 31585 −ℎ cmv 31586 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-hvcom 31662 ax-hv0cl 31664 ax-hfvmul 31666 ax-hvmulid 31667 ax-hvmulass 31668 ax-hvdistr1 31669 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-po 5565 df-so 5566 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-pnf 11383 df-mnf 11384 df-ltxr 11386 df-sub 11581 df-neg 11582 df-hvsub 31632 |
| This theorem is used by: hvsubcan2 31736 |
| Copyright terms: Public domain | W3C validator |