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 32510

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 32467	. . . 4 ⊢ (𝑇 ∈ UniOp ↔ (𝑇: ℋ–onto→ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇‘𝑥) ·_ih (𝑇‘𝑦)) = (𝑥 ·_ih 𝑦)))
2	1	simprbi 503	. . 3 ⊢ (𝑇 ∈ UniOp → ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇‘𝑥) ·_ih (𝑇‘𝑦)) = (𝑥 ·_ih 𝑦))
3	2	3ad2ant1 1151	. 2 ⊢ ((𝑇 ∈ UniOp ∧ 𝐴 ∈ ℋ ∧ 𝐵 ∈ ℋ) → ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ ((𝑇‘𝑥) ·_ih (𝑇‘𝑦)) = (𝑥 ·_ih 𝑦))
4		fveq2 6883	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑇‘𝑥) = (𝑇‘𝐴))
5	4	oveq1d 7433	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑇‘𝑥) ·_ih (𝑇‘𝑦)) = ((𝑇‘𝐴) ·_ih (𝑇‘𝑦)))
6		oveq1 7425	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ·_ih 𝑦) = (𝐴 ·_ih 𝑦))
7	5, 6	eqeq12d 2777	. . . 4 ⊢ (𝑥 = 𝐴 → (((𝑇‘𝑥) ·_ih (𝑇‘𝑦)) = (𝑥 ·_ih 𝑦) ↔ ((𝑇‘𝐴) ·_ih (𝑇‘𝑦)) = (𝐴 ·_ih 𝑦)))
8		fveq2 6883	. . . . . 6 ⊢ (𝑦 = 𝐵 → (𝑇‘𝑦) = (𝑇‘𝐵))
9	8	oveq2d 7434	. . . . 5 ⊢ (𝑦 = 𝐵 → ((𝑇‘𝐴) ·_ih (𝑇‘𝑦)) = ((𝑇‘𝐴) ·_ih (𝑇‘𝐵)))
10		oveq2 7426	. . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 ·_ih 𝑦) = (𝐴 ·_ih 𝐵))
11	9, 10	eqeq12d 2777	. . . 4 ⊢ (𝑦 = 𝐵 → (((𝑇‘𝐴) ·_ih (𝑇‘𝑦)) = (𝐴 ·_ih 𝑦) ↔ ((𝑇‘𝐴) ·_ih (𝑇‘𝐵)) = (𝐴 ·_ih 𝐵)))
12	7, 11	rspc2v 3587	. . 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 2145 ∀wral 3077 –onto→wfo 6535 ‘cfv 6537 (class class class)co 7418 ℋchba 31514 ·_ih csp 31517 UniOpcuo 31544

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 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-hilex 31594

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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 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-ov 7421 df-unop 32438

This theorem is used by: unopf1o 32511 unopnorm 32512 cnvunop 32513 unopadj 32514 counop 32516

W3C validator