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 32468

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 3294	. . . 4 ⊢ (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦) ↔ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦))
2		fveq2 6911	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑆‘𝑧) = (𝑆‘𝑦))
3	2	oveq2d 7462	. . . . . . 7 ⊢ (𝑧 = 𝑦 → (𝑥 ·_ih (𝑆‘𝑧)) = (𝑥 ·_ih (𝑆‘𝑦)))
4		oveq2 7454	. . . . . . 7 ⊢ (𝑧 = 𝑦 → ((𝑇‘𝑥) ·_ih 𝑧) = ((𝑇‘𝑥) ·_ih 𝑦))
5	3, 4	eqeq12d 2779	. . . . . 6 ⊢ (𝑧 = 𝑦 → ((𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧) ↔ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦)))
6	5	ralbidv 3189	. . . . 5 ⊢ (𝑧 = 𝑦 → (∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧) ↔ ∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦)))
7	6	cbvralvw 3244	. . . 4 ⊢ (∀𝑧 ∈ ℋ ∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧) ↔ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦))
8	1, 7	bitr4i 281	. . 3 ⊢ (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦) ↔ ∀𝑧 ∈ ℋ ∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧))
9		oveq1 7453	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ·_ih (𝑆‘𝑧)) = (𝑦 ·_ih (𝑆‘𝑧)))
10		fveq2 6911	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑇‘𝑥) = (𝑇‘𝑦))
11	10	oveq1d 7461	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝑇‘𝑥) ·_ih 𝑧) = ((𝑇‘𝑦) ·_ih 𝑧))
12	9, 11	eqeq12d 2779	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧) ↔ (𝑦 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑦) ·_ih 𝑧)))
13	12	cbvralvw 3244	. . . 4 ⊢ (∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧) ↔ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑦) ·_ih 𝑧))
14	13	ralbii 3112	. . 3 ⊢ (∀𝑧 ∈ ℋ ∀𝑥 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑥) ·_ih 𝑧) ↔ ∀𝑧 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑦) ·_ih 𝑧))
15		fveq2 6911	. . . . . . 7 ⊢ (𝑧 = 𝑥 → (𝑆‘𝑧) = (𝑆‘𝑥))
16	15	oveq2d 7462	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝑦 ·_ih (𝑆‘𝑧)) = (𝑦 ·_ih (𝑆‘𝑥)))
17		oveq2 7454	. . . . . 6 ⊢ (𝑧 = 𝑥 → ((𝑇‘𝑦) ·_ih 𝑧) = ((𝑇‘𝑦) ·_ih 𝑥))
18	16, 17	eqeq12d 2779	. . . . 5 ⊢ (𝑧 = 𝑥 → ((𝑦 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑦) ·_ih 𝑧) ↔ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥)))
19	18	ralbidv 3189	. . . 4 ⊢ (𝑧 = 𝑥 → (∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑦) ·_ih 𝑧) ↔ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥)))
20	19	cbvralvw 3244	. . 3 ⊢ (∀𝑧 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑧)) = ((𝑇‘𝑦) ·_ih 𝑧) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥))
21	8, 14, 20	3bitri 300	. 2 ⊢ (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥))
22		ffvelcdm 7108	. . . . . . . . . . . 12 ⊢ ((𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) → (𝑇‘𝑦) ∈ ℋ)
23		ax-his1 31717	. . . . . . . . . . . 12 ⊢ (((𝑇‘𝑦) ∈ ℋ ∧ 𝑥 ∈ ℋ) → ((𝑇‘𝑦) ·_ih 𝑥) = (∗‘(𝑥 ·_ih (𝑇‘𝑦))))
24	22, 23	sylan 592	. . . . . . . . . . 11 ⊢ (((𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝑇‘𝑦) ·_ih 𝑥) = (∗‘(𝑥 ·_ih (𝑇‘𝑦))))
25	24	adantrl 729	. . . . . . . . . 10 ⊢ (((𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ (𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → ((𝑇‘𝑦) ·_ih 𝑥) = (∗‘(𝑥 ·_ih (𝑇‘𝑦))))
26		ffvelcdm 7108	. . . . . . . . . . . 12 ⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (𝑆‘𝑥) ∈ ℋ)
27		ax-his1 31717	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ ℋ ∧ (𝑆‘𝑥) ∈ ℋ) → (𝑦 ·_ih (𝑆‘𝑥)) = (∗‘((𝑆‘𝑥) ·_ih 𝑦)))
28	26, 27	sylan2 605	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ ℋ ∧ (𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → (𝑦 ·_ih (𝑆‘𝑥)) = (∗‘((𝑆‘𝑥) ·_ih 𝑦)))
29	28	adantll 727	. . . . . . . . . 10 ⊢ (((𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ (𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → (𝑦 ·_ih (𝑆‘𝑥)) = (∗‘((𝑆‘𝑥) ·_ih 𝑦)))
30	25, 29	eqeq12d 2779	. . . . . . . . 9 ⊢ (((𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ (𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → (((𝑇‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑆‘𝑥)) ↔ (∗‘(𝑥 ·_ih (𝑇‘𝑦))) = (∗‘((𝑆‘𝑥) ·_ih 𝑦))))
31	30	ancoms 464	. . . . . . . 8 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (((𝑇‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑆‘𝑥)) ↔ (∗‘(𝑥 ·_ih (𝑇‘𝑦))) = (∗‘((𝑆‘𝑥) ·_ih 𝑦))))
32		hicl 31715	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℋ ∧ (𝑇‘𝑦) ∈ ℋ) → (𝑥 ·_ih (𝑇‘𝑦)) ∈ ℂ)
33	22, 32	sylan2 605	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℋ ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·_ih (𝑇‘𝑦)) ∈ ℂ)
34	33	adantll 727	. . . . . . . . 9 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·_ih (𝑇‘𝑦)) ∈ ℂ)
35		hicl 31715	. . . . . . . . . . 11 ⊢ (((𝑆‘𝑥) ∈ ℋ ∧ 𝑦 ∈ ℋ) → ((𝑆‘𝑥) ·_ih 𝑦) ∈ ℂ)
36	26, 35	sylan 592	. . . . . . . . . 10 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ 𝑦 ∈ ℋ) → ((𝑆‘𝑥) ·_ih 𝑦) ∈ ℂ)
37	36	adantrl 729	. . . . . . . . 9 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑆‘𝑥) ·_ih 𝑦) ∈ ℂ)
38		cj11 15361	. . . . . . . . 9 ⊢ (((𝑥 ·_ih (𝑇‘𝑦)) ∈ ℂ ∧ ((𝑆‘𝑥) ·_ih 𝑦) ∈ ℂ) → ((∗‘(𝑥 ·_ih (𝑇‘𝑦))) = (∗‘((𝑆‘𝑥) ·_ih 𝑦)) ↔ (𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦)))
39	34, 37, 38	syl2anc 596	. . . . . . . 8 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → ((∗‘(𝑥 ·_ih (𝑇‘𝑦))) = (∗‘((𝑆‘𝑥) ·_ih 𝑦)) ↔ (𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦)))
40	31, 39	bitr2d 283	. . . . . . 7 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑇: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦) ↔ ((𝑇‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑆‘𝑥))))
41	40	an4s 673	. . . . . 6 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦) ↔ ((𝑇‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑆‘𝑥))))
42	41	anassrs 473	. . . . 5 ⊢ ((((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) ∧ 𝑦 ∈ ℋ) → ((𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦) ↔ ((𝑇‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑆‘𝑥))))
43		eqcom 2770	. . . . 5 ⊢ (((𝑇‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑆‘𝑥)) ↔ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥))
44	42, 43	bitrdi 290	. . . 4 ⊢ ((((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) ∧ 𝑦 ∈ ℋ) → ((𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦) ↔ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥)))
45	44	ralbidva 3187	. . 3 ⊢ (((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦) ↔ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥)))
46	45	ralbidva 3187	. 2 ⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑆‘𝑥)) = ((𝑇‘𝑦) ·_ih 𝑥)))
47	21, 46	bitr4id 293	1 ⊢ ((𝑆: ℋ⟶ ℋ ∧ 𝑇: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑆‘𝑦)) = ((𝑇‘𝑥) ·_ih 𝑦) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑇‘𝑦)) = ((𝑆‘𝑥) ·_ih 𝑦)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ⟶wf 6557 ‘cfv 6561 (class class class)co 7446 ℂcc 11228 ∗ccj 15295 ℋchba 31554 ·_ih csp 31557

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-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 ax-hfi 31714 ax-his1 31717

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 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-er 8748 df-en 9005 df-dom 9006 df-sdom 9007 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-div 12004 df-nn 12366 df-2 12435 df-cj 15298 df-re 15299 df-im 15300

This theorem is used by: dfadj2 32520 adjval2 32526 cnlnadjeui 32712 cnlnssadj 32715 adjbdln 32718

W3C validator