| 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 7369 | . . . 4 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (𝐴 −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) | |
| 2 | 1 | oveq2d 7378 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (-1 ·ℎ (𝐴 −ℎ 𝐵)) = (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵))) |
| 3 | oveq2 7370 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → (𝐵 −ℎ 𝐴) = (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ))) | |
| 4 | 2, 3 | eqeq12d 2753 | . 2 ⊢ (𝐴 = if(𝐴 ∈ ℋ, 𝐴, 0ℎ) → ((-1 ·ℎ (𝐴 −ℎ 𝐵)) = (𝐵 −ℎ 𝐴) ↔ (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)))) |
| 5 | oveq2 7370 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵) = (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) | |
| 6 | 5 | oveq2d 7378 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ)))) |
| 7 | oveq1 7369 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)) = (if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ))) | |
| 8 | 6, 7 | eqeq12d 2753 | . 2 ⊢ (𝐵 = if(𝐵 ∈ ℋ, 𝐵, 0ℎ) → ((-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ 𝐵)) = (𝐵 −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)) ↔ (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) = (if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)))) |
| 9 | ifhvhv0 31112 | . . 3 ⊢ if(𝐴 ∈ ℋ, 𝐴, 0ℎ) ∈ ℋ | |
| 10 | ifhvhv0 31112 | . . 3 ⊢ if(𝐵 ∈ ℋ, 𝐵, 0ℎ) ∈ ℋ | |
| 11 | 9, 10 | hvnegdii 31152 | . 2 ⊢ (-1 ·ℎ (if(𝐴 ∈ ℋ, 𝐴, 0ℎ) −ℎ if(𝐵 ∈ ℋ, 𝐵, 0ℎ))) = (if(𝐵 ∈ ℋ, 𝐵, 0ℎ) −ℎ if(𝐴 ∈ ℋ, 𝐴, 0ℎ)) |
| 12 | 4, 8, 11 | dedth2h 4527 | 1 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (-1 ·ℎ (𝐴 −ℎ 𝐵)) = (𝐵 −ℎ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ifcif 4467 (class class class)co 7362 1c1 11034 -cneg 11373 ℋchba 31009 ·ℎ csm 31011 0ℎc0v 31014 −ℎ cmv 31015 |
| 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 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-hvcom 31091 ax-hv0cl 31093 ax-hfvmul 31095 ax-hvmulid 31096 ax-hvmulass 31097 ax-hvdistr1 31098 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 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-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5521 df-po 5534 df-so 5535 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-riota 7319 df-ov 7365 df-oprab 7366 df-mpo 7367 df-er 8638 df-en 8889 df-dom 8890 df-sdom 8891 df-pnf 11176 df-mnf 11177 df-ltxr 11179 df-sub 11374 df-neg 11375 df-hvsub 31061 |
| This theorem is referenced by: hvsubcan2 31165 |
| Copyright terms: Public domain | W3C validator |