| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > kbmul | Structured version Visualization version GIF version | ||
| Description: Multiplication property of outer product. (Contributed by NM, 31-May-2006.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| kbmul | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·ℎ 𝐵) ketbra 𝐶) = (𝐵 ketbra ((∗‘𝐴) ·ℎ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hvmulcl 31672 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ) → (𝐴 ·ℎ 𝐵) ∈ ℋ) | |
| 2 | kbfval 32611 | . . 3 ⊢ (((𝐴 ·ℎ 𝐵) ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·ℎ 𝐵) ketbra 𝐶) = (𝑥 ∈ ℋ ↦ ((𝑥 ·ih 𝐶) ·ℎ (𝐴 ·ℎ 𝐵)))) | |
| 3 | 1, 2 | stoic3 1809 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·ℎ 𝐵) ketbra 𝐶) = (𝑥 ∈ ℋ ↦ ((𝑥 ·ih 𝐶) ·ℎ (𝐴 ·ℎ 𝐵)))) |
| 4 | simp2 1155 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → 𝐵 ∈ ℋ) | |
| 5 | cjcl 15315 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) ∈ ℂ) | |
| 6 | 5 | 3ad2ant1 1151 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (∗‘𝐴) ∈ ℂ) |
| 7 | simp3 1156 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → 𝐶 ∈ ℋ) | |
| 8 | hvmulcl 31672 | . . . . 5 ⊢ (((∗‘𝐴) ∈ ℂ ∧ 𝐶 ∈ ℋ) → ((∗‘𝐴) ·ℎ 𝐶) ∈ ℋ) | |
| 9 | 6, 7, 8 | syl2anc 596 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((∗‘𝐴) ·ℎ 𝐶) ∈ ℋ) |
| 10 | kbfval 32611 | . . . 4 ⊢ ((𝐵 ∈ ℋ ∧ ((∗‘𝐴) ·ℎ 𝐶) ∈ ℋ) → (𝐵 ketbra ((∗‘𝐴) ·ℎ 𝐶)) = (𝑥 ∈ ℋ ↦ ((𝑥 ·ih ((∗‘𝐴) ·ℎ 𝐶)) ·ℎ 𝐵))) | |
| 11 | 4, 9, 10 | syl2anc 596 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 ketbra ((∗‘𝐴) ·ℎ 𝐶)) = (𝑥 ∈ ℋ ↦ ((𝑥 ·ih ((∗‘𝐴) ·ℎ 𝐶)) ·ℎ 𝐵))) |
| 12 | simpr 490 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → 𝑥 ∈ ℋ) | |
| 13 | simpl3 1212 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → 𝐶 ∈ ℋ) | |
| 14 | hicl 31739 | . . . . . . 7 ⊢ ((𝑥 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝑥 ·ih 𝐶) ∈ ℂ) | |
| 15 | 12, 13, 14 | syl2anc 596 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → (𝑥 ·ih 𝐶) ∈ ℂ) |
| 16 | simpl1 1210 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → 𝐴 ∈ ℂ) | |
| 17 | simpl2 1211 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → 𝐵 ∈ ℋ) | |
| 18 | ax-hvmulass 31666 | . . . . . 6 ⊢ (((𝑥 ·ih 𝐶) ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ) → (((𝑥 ·ih 𝐶) · 𝐴) ·ℎ 𝐵) = ((𝑥 ·ih 𝐶) ·ℎ (𝐴 ·ℎ 𝐵))) | |
| 19 | 15, 16, 17, 18 | syl3anc 1399 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → (((𝑥 ·ih 𝐶) · 𝐴) ·ℎ 𝐵) = ((𝑥 ·ih 𝐶) ·ℎ (𝐴 ·ℎ 𝐵))) |
| 20 | 15, 16 | mulcomd 11369 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝑥 ·ih 𝐶) · 𝐴) = (𝐴 · (𝑥 ·ih 𝐶))) |
| 21 | his52 31746 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝑥 ·ih ((∗‘𝐴) ·ℎ 𝐶)) = (𝐴 · (𝑥 ·ih 𝐶))) | |
| 22 | 16, 12, 13, 21 | syl3anc 1399 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → (𝑥 ·ih ((∗‘𝐴) ·ℎ 𝐶)) = (𝐴 · (𝑥 ·ih 𝐶))) |
| 23 | 20, 22 | eqtr4d 2801 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝑥 ·ih 𝐶) · 𝐴) = (𝑥 ·ih ((∗‘𝐴) ·ℎ 𝐶))) |
| 24 | 23 | oveq1d 7466 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → (((𝑥 ·ih 𝐶) · 𝐴) ·ℎ 𝐵) = ((𝑥 ·ih ((∗‘𝐴) ·ℎ 𝐶)) ·ℎ 𝐵)) |
| 25 | 19, 24 | eqtr3d 2800 | . . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝑥 ·ih 𝐶) ·ℎ (𝐴 ·ℎ 𝐵)) = ((𝑥 ·ih ((∗‘𝐴) ·ℎ 𝐶)) ·ℎ 𝐵)) |
| 26 | 25 | mpteq2dva 5204 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝑥 ∈ ℋ ↦ ((𝑥 ·ih 𝐶) ·ℎ (𝐴 ·ℎ 𝐵))) = (𝑥 ∈ ℋ ↦ ((𝑥 ·ih ((∗‘𝐴) ·ℎ 𝐶)) ·ℎ 𝐵))) |
| 27 | 11, 26 | eqtr4d 2801 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → (𝐵 ketbra ((∗‘𝐴) ·ℎ 𝐶)) = (𝑥 ∈ ℋ ↦ ((𝑥 ·ih 𝐶) ·ℎ (𝐴 ·ℎ 𝐵)))) |
| 28 | 3, 27 | eqtr4d 2801 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℋ ∧ 𝐶 ∈ ℋ) → ((𝐴 ·ℎ 𝐵) ketbra 𝐶) = (𝐵 ketbra ((∗‘𝐴) ·ℎ 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ↦ cmpt 5192 ‘cfv 6566 (class class class)co 7451 ℂcc 11237 · cmul 11244 ∗ccj 15306 ℋchba 31578 ·ℎ csm 31580 ·ih csp 31581 ketbra ck 31616 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-hilex 31658 ax-hfvmul 31664 ax-hvmulass 31666 ax-hfi 31738 ax-his1 31741 ax-his3 31743 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-cj 15309 df-re 15310 df-im 15311 df-kb 32510 |
| This theorem is used by: kbass6 32780 |
| Copyright terms: Public domain | W3C validator |