cnvadj - Hilbert Space Explorer

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

Theorem cnvadj 31145

Description: The adjoint function equals its converse. (Contributed by NM, 15-Feb-2006.) (New usage is discouraged.)

**Assertion**
Ref	Expression
cnvadj	⊢ ^◡adj_ℎ = adj_ℎ

Proof of Theorem cnvadj Dummy variables 𝑢 𝑡 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnvopab 6139	. . 3 ⊢ ^◡{⟨𝑢, 𝑡⟩ ∣ (𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))} = {⟨𝑡, 𝑢⟩ ∣ (𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))}
2		3ancoma 1099	. . . . 5 ⊢ ((𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)) ↔ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)))
3		ffvelcdm 7084	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) → (𝑢‘𝑦) ∈ ℋ)
4		ax-his1 30335	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑢‘𝑦) ∈ ℋ ∧ 𝑥 ∈ ℋ) → ((𝑢‘𝑦) ·_ih 𝑥) = (∗‘(𝑥 ·_ih (𝑢‘𝑦))))
5	3, 4	sylan 581	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝑢‘𝑦) ·_ih 𝑥) = (∗‘(𝑥 ·_ih (𝑢‘𝑦))))
6	5	adantrl 715	. . . . . . . . . . . . . . . 16 ⊢ (((𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ (𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → ((𝑢‘𝑦) ·_ih 𝑥) = (∗‘(𝑥 ·_ih (𝑢‘𝑦))))
7		ffvelcdm 7084	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (𝑡‘𝑥) ∈ ℋ)
8		ax-his1 30335	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ ℋ ∧ (𝑡‘𝑥) ∈ ℋ) → (𝑦 ·_ih (𝑡‘𝑥)) = (∗‘((𝑡‘𝑥) ·_ih 𝑦)))
9	7, 8	sylan2 594	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑦 ∈ ℋ ∧ (𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → (𝑦 ·_ih (𝑡‘𝑥)) = (∗‘((𝑡‘𝑥) ·_ih 𝑦)))
10	9	adantll 713	. . . . . . . . . . . . . . . 16 ⊢ (((𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ (𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → (𝑦 ·_ih (𝑡‘𝑥)) = (∗‘((𝑡‘𝑥) ·_ih 𝑦)))
11	6, 10	eqeq12d 2749	. . . . . . . . . . . . . . 15 ⊢ (((𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ (𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → (((𝑢‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑡‘𝑥)) ↔ (∗‘(𝑥 ·_ih (𝑢‘𝑦))) = (∗‘((𝑡‘𝑥) ·_ih 𝑦))))
12	11	ancoms 460	. . . . . . . . . . . . . 14 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (((𝑢‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑡‘𝑥)) ↔ (∗‘(𝑥 ·_ih (𝑢‘𝑦))) = (∗‘((𝑡‘𝑥) ·_ih 𝑦))))
13		hicl 30333	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℋ ∧ (𝑢‘𝑦) ∈ ℋ) → (𝑥 ·_ih (𝑢‘𝑦)) ∈ ℂ)
14	3, 13	sylan2 594	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℋ ∧ (𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·_ih (𝑢‘𝑦)) ∈ ℂ)
15	14	adantll 713	. . . . . . . . . . . . . . 15 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·_ih (𝑢‘𝑦)) ∈ ℂ)
16		hicl 30333	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑡‘𝑥) ∈ ℋ ∧ 𝑦 ∈ ℋ) → ((𝑡‘𝑥) ·_ih 𝑦) ∈ ℂ)
17	7, 16	sylan 581	. . . . . . . . . . . . . . . 16 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ 𝑦 ∈ ℋ) → ((𝑡‘𝑥) ·_ih 𝑦) ∈ ℂ)
18	17	adantrl 715	. . . . . . . . . . . . . . 15 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑡‘𝑥) ·_ih 𝑦) ∈ ℂ)
19		cj11 15109	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ·_ih (𝑢‘𝑦)) ∈ ℂ ∧ ((𝑡‘𝑥) ·_ih 𝑦) ∈ ℂ) → ((∗‘(𝑥 ·_ih (𝑢‘𝑦))) = (∗‘((𝑡‘𝑥) ·_ih 𝑦)) ↔ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)))
20	15, 18, 19	syl2anc 585	. . . . . . . . . . . . . 14 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → ((∗‘(𝑥 ·_ih (𝑢‘𝑦))) = (∗‘((𝑡‘𝑥) ·_ih 𝑦)) ↔ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)))
21	12, 20	bitr2d 280	. . . . . . . . . . . . 13 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ ((𝑢‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑡‘𝑥))))
22	21	an4s 659	. . . . . . . . . . . 12 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ ((𝑢‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑡‘𝑥))))
23	22	anassrs 469	. . . . . . . . . . 11 ⊢ ((((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) ∧ 𝑦 ∈ ℋ) → ((𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ ((𝑢‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑡‘𝑥))))
24		eqcom 2740	. . . . . . . . . . 11 ⊢ (((𝑢‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑡‘𝑥)) ↔ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥))
25	23, 24	bitrdi 287	. . . . . . . . . 10 ⊢ ((((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) ∧ 𝑦 ∈ ℋ) → ((𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
26	25	ralbidva 3176	. . . . . . . . 9 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
27	26	ralbidva 3176	. . . . . . . 8 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
28		ralcom 3287	. . . . . . . 8 ⊢ (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥) ↔ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥))
29	27, 28	bitrdi 287	. . . . . . 7 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
30	29	pm5.32i 576	. . . . . 6 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)) ↔ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
31		df-3an 1090	. . . . . 6 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)) ↔ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)))
32		df-3an 1090	. . . . . 6 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)) ↔ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
33	30, 31, 32	3bitr4i 303	. . . . 5 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)) ↔ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
34	2, 33	bitri 275	. . . 4 ⊢ ((𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)) ↔ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
35	34	opabbii 5216	. . 3 ⊢ {⟨𝑡, 𝑢⟩ ∣ (𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))} = {⟨𝑡, 𝑢⟩ ∣ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥))}
36	1, 35	eqtri 2761	. 2 ⊢ ^◡{⟨𝑢, 𝑡⟩ ∣ (𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))} = {⟨𝑡, 𝑢⟩ ∣ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥))}
37		dfadj2 31138	. . 3 ⊢ adj_ℎ = {⟨𝑢, 𝑡⟩ ∣ (𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))}
38	37	cnveqi 5875	. 2 ⊢ ^◡adj_ℎ = ^◡{⟨𝑢, 𝑡⟩ ∣ (𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))}
39		dfadj2 31138	. 2 ⊢ adj_ℎ = {⟨𝑡, 𝑢⟩ ∣ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥))}
40	36, 38, 39	3eqtr4i 2771	1 ⊢ ^◡adj_ℎ = adj_ℎ

Colors of variables: wff setvar class

Syntax hints: ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∀wral 3062 {copab 5211 ^◡ccnv 5676 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 ℂcc 11108 ∗ccj 15043 ℋchba 30172 ·_ih csp 30175 adj_ℎcado 30208

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-hfi 30332 ax-his1 30335

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5575 df-po 5589 df-so 5590 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-2 12275 df-cj 15046 df-re 15047 df-im 15048 df-adjh 31102

This theorem is referenced by: funcnvadj 31146 adj1o 31147 adjbdlnb 31337

W3C validator