| 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 7423 | . . . 4 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (𝐴 −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) | |
| 2 | 1 | oveq2d 7432 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (-1 ·ℎ (𝐴 −ℎ 𝐵)) = (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵))) |
| 3 | oveq2 7424 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (𝐵 −ℎ 𝐴) = (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ))) | |
| 4 | 2, 3 | eqeq12d 2778 | . 2 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → ((-1 ·ℎ (𝐴 −ℎ 𝐵)) = (𝐵 −ℎ 𝐴) ↔ (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)))) |
| 5 | oveq2 7424 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) | |
| 6 | 5 | oveq2d 7432 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) |
| 7 | oveq1 7423 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)) = (if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ))) | |
| 8 | 6, 7 | eqeq12d 2778 | . 2 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → ((-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)) ↔ (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) = (if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)))) |
| 9 | ifhvhv0 31487 | . . 3 ⊢ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) ∈ ℋ | |
| 10 | ifhvhv0 31487 | . . 3 ⊢ if(𝐵 ∈ ℋ, 𝐵, 0ℎ) ∈ ℋ | |
| 11 | 9, 10 | hvnegdii 31527 | . 2 ⊢ (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) = (if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)) |
| 12 | 4, 8, 11 | dedth2h 4545 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (-1 ·ℎ (𝐴 −ℎ 𝐵)) = (𝐵 −ℎ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ifcif 4485 (class class class)co 7416 1c1 11126 -cneg 11467 ℋchba 31384 ·ℎ csm 31386 0ℎc0v 31389 −ℎ cmv 31390 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-hvcom 31466 ax-hv0cl 31468 ax-hfvmul 31470 ax-hvmulid 31471 ax-hvmulass 31472 ax-hvdistr1 31473 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-po 5567 df-so 5568 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11270 df-mnf 11271 df-ltxr 11273 df-sub 11468 df-neg 11469 df-hvsub 31436 |
| This theorem is used by: hvsubcan2 31540 |
| Copyright terms: Public domain | W3C validator |