adjsym - Hilbert Space Explorer

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

Theorem adjsym 30096

Description: Symmetry property of an adjoint. (Contributed by NM, 18-Feb-2006.) (New usage is discouraged.)

**Assertion**
Ref	Expression
adjsym	⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦)))

Distinct variable groups: 𝑥,𝑦,𝑆 𝑥,𝑇,𝑦

Proof of Theorem adjsym Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ralcom 3280	. . . 4 ⊢ (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦) ↔ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦))
2		fveq2 6756	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑆‘𝑧) = (𝑆‘𝑦))
3	2	oveq2d 7271	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (𝑥 ·_ih (𝑆‘𝑧)) = (𝑥 ·_ih (𝑆‘𝑦)))
4		oveq2 7263	. . . . . . 7 ⊢ (𝑧 = 𝑦 → ((𝑇‘𝑥) ·_ih 𝑧) = ((𝑇‘𝑥) ·_ih 𝑦))
5	3, 4	eqeq12d 2754	. . . . . 6 ⊢ (𝑧 = 𝑦 → ((𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧) ↔ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦)))
6	5	ralbidv 3120	. . . . 5 ⊢ (𝑧 = 𝑦 → (∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧) ↔ ∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦)))
7	6	cbvralvw 3372	. . . 4 ⊢ (∀𝑧 ∈ ℋ ∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧) ↔ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦))
8	1, 7	bitr4i 277	. . 3 ⊢ (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦) ↔ ∀𝑧 ∈ ℋ ∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧))
9		oveq1 7262	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ·_ih (𝑆‘𝑧)) = (𝑦 ·_ih (𝑆‘𝑧)))
10		fveq2 6756	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑇‘𝑥) = (𝑇‘𝑦))
11	10	oveq1d 7270	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝑇‘𝑥) ·_ih 𝑧) = ((𝑇‘𝑦) ·_ih 𝑧))
12	9, 11	eqeq12d 2754	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧) ↔ (𝑦 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑦) ·_ih 𝑧)))
13	12	cbvralvw 3372	. . . 4 ⊢ (∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧) ↔ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑦) ·_ih 𝑧))
14	13	ralbii 3090	. . 3 ⊢ (∀𝑧 ∈ ℋ ∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧) ↔ ∀𝑧 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑦) ·_ih 𝑧))
15		fveq2 6756	. . . . . . 7 ⊢ (𝑧 = 𝑥 → (𝑆‘𝑧) = (𝑆‘𝑥))
16	15	oveq2d 7271	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝑦 ·_ih (𝑆‘𝑧)) = (𝑦 ·_ih (𝑆‘𝑥)))
17		oveq2 7263	. . . . . 6 ⊢ (𝑧 = 𝑥 → ((𝑇‘𝑦) ·_ih 𝑧) = ((𝑇‘𝑦) ·_ih 𝑥))
18	16, 17	eqeq12d 2754	. . . . 5 ⊢ (𝑧 = 𝑥 → ((𝑦 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑦) ·_ih 𝑧) ↔ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥)))
19	18	ralbidv 3120	. . . 4 ⊢ (𝑧 = 𝑥 → (∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑦) ·_ih 𝑧) ↔ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥)))
20	19	cbvralvw 3372	. . 3 ⊢ (∀𝑧 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑦) ·_ih 𝑧) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥))
21	8, 14, 20	3bitri 296	. 2 ⊢ (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥))
22		ffvelrn 6941	. . . . . . . . . . . 12 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) → (𝑇‘𝑦) ∈ ℋ)
23		ax-his1 29345	. . . . . . . . . . . 12 ⊢ (((𝑇‘𝑦) ∈ ℋ ∧ 𝑥 ∈ ℋ) → ((𝑇‘𝑦) ·_ih 𝑥) = (∗‘(𝑥 ·_ih (𝑇‘𝑦))))
24	22, 23	sylan 579	. . . . . . . . . . 11 ⊢ (((𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝑇‘𝑦) ·_ih 𝑥) = (∗‘(𝑥 ·_ih (𝑇‘𝑦))))
25	24	adantrl 712	. . . . . . . . . 10 ⊢ (((𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ (𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → ((𝑇‘𝑦) ·_ih 𝑥) = (∗‘(𝑥 ·_ih (𝑇‘𝑦))))
26		ffvelrn 6941	. . . . . . . . . . . 12 ⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (𝑆‘𝑥) ∈ ℋ)
27		ax-his1 29345	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ ℋ ∧ (𝑆‘𝑥) ∈ ℋ) → (𝑦 ·_ih (𝑆‘𝑥)) = (∗‘((𝑆‘𝑥) ·_ih 𝑦)))
28	26, 27	sylan2 592	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ℋ ∧ (𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → (𝑦 ·_ih (𝑆‘𝑥)) = (∗‘((𝑆‘𝑥) ·_ih 𝑦)))
29	28	adantll 710	. . . . . . . . . 10 ⊢ (((𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ (𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → (𝑦 ·_ih (𝑆‘𝑥)) = (∗‘((𝑆‘𝑥) ·_ih 𝑦)))
30	25, 29	eqeq12d 2754	. . . . . . . . 9 ⊢ (((𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ (𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → (((𝑇‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑆‘𝑥)) ↔ (∗‘(𝑥 ·_ih (𝑇‘𝑦))) = (∗‘((𝑆‘𝑥) ·_ih 𝑦))))
31	30	ancoms 458	. . . . . . . 8 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (((𝑇‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑆‘𝑥)) ↔ (∗‘(𝑥 ·_ih (𝑇‘𝑦))) = (∗‘((𝑆‘𝑥) ·_ih 𝑦))))
32		hicl 29343	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℋ ∧ (𝑇‘𝑦) ∈ ℋ) → (𝑥 ·_ih (𝑇‘𝑦)) ∈ ℂ)
33	22, 32	sylan2 592	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℋ ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·_ih (𝑇‘𝑦)) ∈ ℂ)
34	33	adantll 710	. . . . . . . . 9 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·_ih (𝑇‘𝑦)) ∈ ℂ)
35		hicl 29343	. . . . . . . . . . 11 ⊢ (((𝑆‘𝑥) ∈ ℋ ∧ 𝑦 ∈ ℋ) → ((𝑆‘𝑥) ·_ih 𝑦) ∈ ℂ)
36	26, 35	sylan 579	. . . . . . . . . 10 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ 𝑦 ∈ ℋ) → ((𝑆‘𝑥) ·_ih 𝑦) ∈ ℂ)
37	36	adantrl 712	. . . . . . . . 9 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑆‘𝑥) ·_ih 𝑦) ∈ ℂ)
38		cj11 14801	. . . . . . . . 9 ⊢ (((𝑥 ·_ih (𝑇‘𝑦)) ∈ ℂ ∧ ((𝑆‘𝑥) ·_ih 𝑦) ∈ ℂ) → ((∗‘(𝑥 ·_ih (𝑇‘𝑦))) = (∗‘((𝑆‘𝑥) ·_ih 𝑦)) ↔ (𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦)))
39	34, 37, 38	syl2anc 583	. . . . . . . 8 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → ((∗‘(𝑥 ·_ih (𝑇‘𝑦))) = (∗‘((𝑆‘𝑥) ·_ih 𝑦)) ↔ (𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦)))
40	31, 39	bitr2d 279	. . . . . . 7 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦) ↔ ((𝑇‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑆‘𝑥))))
41	40	an4s 656	. . . . . 6 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦) ↔ ((𝑇‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑆‘𝑥))))
42	41	anassrs 467	. . . . 5 ⊢ ((((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) ∧ 𝑦 ∈ ℋ) → ((𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦) ↔ ((𝑇‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑆‘𝑥))))
43		eqcom 2745	. . . . 5 ⊢ (((𝑇‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑆‘𝑥)) ↔ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥))
44	42, 43	bitrdi 286	. . . 4 ⊢ ((((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) ∧ 𝑦 ∈ ℋ) → ((𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦) ↔ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥)))
45	44	ralbidva 3119	. . 3 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦) ↔ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥)))
46	45	ralbidva 3119	. 2 ⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥)))
47	21, 46	bitr4id 289	1 ⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∀wral 3063 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 ∗ccj 14735 ℋchba 29182 ·_ih csp 29185

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-hfi 29342 ax-his1 29345

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-po 5494 df-so 5495 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-2 11966 df-cj 14738 df-re 14739 df-im 14740

This theorem is referenced by: dfadj2 30148 adjval2 30154 cnlnadjeui 30340 cnlnssadj 30343 adjbdln 30346

W3C validator