unop - Hilbert Space Explorer

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

Theorem unop 32314

Description: Basic inner product property of a unitary operator. (Contributed by NM, 22-Jan-2006.) (New usage is discouraged.)

**Assertion**
Ref	Expression
unop	⊢ ((𝑇 ∈ UniOp ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝑇‘𝐴) ·_ih (𝑇‘𝐵)) = (𝐴 ·_ih 𝐵))

Proof of Theorem unop Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elunop 32271	. . . 4 ⊢ (𝑇 ∈ UniOp ↔ (𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇‘𝑥) ·_ih (𝑇‘𝑦)) = (𝑥 ·_ih 𝑦)))
2	1	simprbi 503	. . 3 ⊢ (𝑇 ∈ UniOp → ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇‘𝑥) ·_ih (𝑇‘𝑦)) = (𝑥 ·_ih 𝑦))
3	2	3ad2ant1 1151	. 2 ⊢ ((𝑇 ∈ UniOp ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇‘𝑥) ·_ih (𝑇‘𝑦)) = (𝑥 ·_ih 𝑦))
4		fveq2 6885	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑇‘𝑥) = (𝑇‘𝐴))
5	4	oveq1d 7431	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑇‘𝑥) ·_ih (𝑇‘𝑦)) = ((𝑇‘𝐴) ·_ih (𝑇‘𝑦)))
6		oveq1 7423	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ·_ih 𝑦) = (𝐴 ·_ih 𝑦))
7	5, 6	eqeq12d 2781	. . . 4 ⊢ (𝑥 = 𝐴 → (((𝑇‘𝑥) ·_ih (𝑇‘𝑦)) = (𝑥 ·_ih 𝑦) ↔ ((𝑇‘𝐴) ·_ih (𝑇‘𝑦)) = (𝐴 ·_ih 𝑦)))
8		fveq2 6885	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝑇‘𝑦) = (𝑇‘𝐵))
9	8	oveq2d 7432	. . . . 5 ⊢ (𝑦 = 𝐵 → ((𝑇‘𝐴) ·_ih (𝑇‘𝑦)) = ((𝑇‘𝐴) ·_ih (𝑇‘𝐵)))
10		oveq2 7424	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 ·_ih 𝑦) = (𝐴 ·_ih 𝐵))
11	9, 10	eqeq12d 2781	. . . 4 ⊢ (𝑦 = 𝐵 → (((𝑇‘𝐴) ·_ih (𝑇‘𝑦)) = (𝐴 ·_ih 𝑦) ↔ ((𝑇‘𝐴) ·_ih (𝑇‘𝐵)) = (𝐴 ·_ih 𝐵)))
12	7, 11	rspc2v 3594	. . 3 ⊢ ((𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇‘𝑥) ·_ih (𝑇‘𝑦)) = (𝑥 ·_ih 𝑦) → ((𝑇‘𝐴) ·_ih (𝑇‘𝐵)) = (𝐴 ·_ih 𝐵)))
13	12	3adant1 1148	. 2 ⊢ ((𝑇 ∈ UniOp ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇‘𝑥) ·_ih (𝑇‘𝑦)) = (𝑥 ·_ih 𝑦) → ((𝑇‘𝐴) ·_ih (𝑇‘𝐵)) = (𝐴 ·_ih 𝐵)))
14	3, 13	mpd 16	1 ⊢ ((𝑇 ∈ UniOp ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ((𝑇‘𝐴) ·_ih (𝑇‘𝐵)) = (𝐴 ·_ih 𝐵))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∀wral 3081 –onto→wfo 6538 ‘cfv 6540 (class class class)co 7416 ℋchba 31318 ·_ih csp 31321 UniOpcuo 31348

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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-hilex 31398

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7419 df-unop 32242

This theorem is used by: unopf1o 32315 unopnorm 32316 cnvunop 32317 unopadj 32318 counop 32320

W3C validator