dfadj2 - Hilbert Space Explorer

	Hilbert Space Explorer		< Previous Next > Nearby theorems
Mirrors > Home > HSE Home > Th. List > dfadj2		Structured version Visualization version GIF version

Theorem dfadj2 29665

Description: Alternate definition of the adjoint of a Hilbert space operator. (Contributed by NM, 20-Feb-2006.) (New usage is discouraged.)

**Assertion**
Ref	Expression
dfadj2	⊢ adj_ℎ = {⟨𝑡, 𝑢⟩ ∣ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑡‘𝑦)) = ((𝑢‘𝑥) ·_ih 𝑦))}

Distinct variable group: 𝑢,𝑡,𝑥,𝑦

**Proof of Theorem dfadj2**
Step	Hyp	Ref	Expression
1		df-adjh 29629	. 2 ⊢ adj_ℎ = {⟨𝑡, 𝑢⟩ ∣ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑡‘𝑥) ·_ih 𝑦) = (𝑥 ·_ih (𝑢‘𝑦)))}
2		adjsym 29613	. . . . . 6 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑡‘𝑦)) = ((𝑢‘𝑥) ·_ih 𝑦) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)))
3		eqcom 2831	. . . . . . 7 ⊢ (((𝑡‘𝑥) ·_ih 𝑦) = (𝑥 ·_ih (𝑢‘𝑦)) ↔ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))
4	3	2ralbii 3169	. . . . . 6 ⊢ (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑡‘𝑥) ·_ih 𝑦) = (𝑥 ·_ih (𝑢‘𝑦)) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))
5	2, 4	syl6rbbr 292	. . . . 5 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑡‘𝑥) ·_ih 𝑦) = (𝑥 ·_ih (𝑢‘𝑦)) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑡‘𝑦)) = ((𝑢‘𝑥) ·_ih 𝑦)))
6	5	pm5.32i 577	. . . 4 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑡‘𝑥) ·_ih 𝑦) = (𝑥 ·_ih (𝑢‘𝑦))) ↔ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑡‘𝑦)) = ((𝑢‘𝑥) ·_ih 𝑦)))
7		df-3an 1085	. . . 4 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑡‘𝑥) ·_ih 𝑦) = (𝑥 ·_ih (𝑢‘𝑦))) ↔ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑡‘𝑥) ·_ih 𝑦) = (𝑥 ·_ih (𝑢‘𝑦))))
8		df-3an 1085	. . . 4 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑡‘𝑦)) = ((𝑢‘𝑥) ·_ih 𝑦)) ↔ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑡‘𝑦)) = ((𝑢‘𝑥) ·_ih 𝑦)))
9	6, 7, 8	3bitr4i 305	. . 3 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑡‘𝑥) ·_ih 𝑦) = (𝑥 ·_ih (𝑢‘𝑦))) ↔ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑡‘𝑦)) = ((𝑢‘𝑥) ·_ih 𝑦)))
10	9	opabbii 5136	. 2 ⊢ {⟨𝑡, 𝑢⟩ ∣ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑡‘𝑥) ·_ih 𝑦) = (𝑥 ·_ih (𝑢‘𝑦)))} = {⟨𝑡, 𝑢⟩ ∣ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑡‘𝑦)) = ((𝑢‘𝑥) ·_ih 𝑦))}
11	1, 10	eqtri 2847	1 ⊢ adj_ℎ = {⟨𝑡, 𝑢⟩ ∣ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑡‘𝑦)) = ((𝑢‘𝑥) ·_ih 𝑦))}

Colors of variables: wff setvar class

Syntax hints: ∧ wa 398 ∧ w3a 1083 = wceq 1536 ∀wral 3141 {copab 5131 ⟶wf 6354 ‘cfv 6358 (class class class)co 7159 ℋchba 28699 ·_ih csp 28702 adj_ℎcado 28735

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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 ax-hfi 28859 ax-his1 28862

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-po 5477 df-so 5478 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-div 11301 df-2 11703 df-cj 14461 df-re 14462 df-im 14463 df-adjh 29629

This theorem is referenced by: funadj 29666 dmadjss 29667 adjeu 29669 adjval 29670 cnvadj 29672 adj1 29713 cnlnssadj 29860

W3C validator