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 29228

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 5718	. . 3 ⊢ ^◡{⟨𝑢, 𝑡⟩ ∣ (𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))} = {⟨𝑡, 𝑢⟩ ∣ (𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))}
2		3ancoma 1119	. . . . 5 ⊢ ((𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)) ↔ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)))
3		ffvelrn 6551	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) → (𝑢‘𝑦) ∈ ℋ)
4		ax-his1 28416	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑢‘𝑦) ∈ ℋ ∧ 𝑥 ∈ ℋ) → ((𝑢‘𝑦) ·_ih 𝑥) = (∗‘(𝑥 ·_ih (𝑢‘𝑦))))
5	3, 4	sylan 575	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ 𝑥 ∈ ℋ) → ((𝑢‘𝑦) ·_ih 𝑥) = (∗‘(𝑥 ·_ih (𝑢‘𝑦))))
6	5	adantrl 707	. . . . . . . . . . . . . . . 16 ⊢ (((𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ (𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → ((𝑢‘𝑦) ·_ih 𝑥) = (∗‘(𝑥 ·_ih (𝑢‘𝑦))))
7		ffvelrn 6551	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) → (𝑡‘𝑥) ∈ ℋ)
8		ax-his1 28416	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ ℋ ∧ (𝑡‘𝑥) ∈ ℋ) → (𝑦 ·_ih (𝑡‘𝑥)) = (∗‘((𝑡‘𝑥) ·_ih 𝑦)))
9	7, 8	sylan2 586	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑦 ∈ ℋ ∧ (𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → (𝑦 ·_ih (𝑡‘𝑥)) = (∗‘((𝑡‘𝑥) ·_ih 𝑦)))
10	9	adantll 705	. . . . . . . . . . . . . . . 16 ⊢ (((𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ (𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → (𝑦 ·_ih (𝑡‘𝑥)) = (∗‘((𝑡‘𝑥) ·_ih 𝑦)))
11	6, 10	eqeq12d 2780	. . . . . . . . . . . . . . 15 ⊢ (((𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ) ∧ (𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ)) → (((𝑢‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑡‘𝑥)) ↔ (∗‘(𝑥 ·_ih (𝑢‘𝑦))) = (∗‘((𝑡‘𝑥) ·_ih 𝑦))))
12	11	ancoms 450	. . . . . . . . . . . . . 14 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (((𝑢‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑡‘𝑥)) ↔ (∗‘(𝑥 ·_ih (𝑢‘𝑦))) = (∗‘((𝑡‘𝑥) ·_ih 𝑦))))
13		hicl 28414	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ ℋ ∧ (𝑢‘𝑦) ∈ ℋ) → (𝑥 ·_ih (𝑢‘𝑦)) ∈ ℂ)
14	3, 13	sylan2 586	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℋ ∧ (𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·_ih (𝑢‘𝑦)) ∈ ℂ)
15	14	adantll 705	. . . . . . . . . . . . . . 15 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → (𝑥 ·_ih (𝑢‘𝑦)) ∈ ℂ)
16		hicl 28414	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑡‘𝑥) ∈ ℋ ∧ 𝑦 ∈ ℋ) → ((𝑡‘𝑥) ·_ih 𝑦) ∈ ℂ)
17	7, 16	sylan 575	. . . . . . . . . . . . . . . 16 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ 𝑦 ∈ ℋ) → ((𝑡‘𝑥) ·_ih 𝑦) ∈ ℂ)
18	17	adantrl 707	. . . . . . . . . . . . . . 15 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑡‘𝑥) ·_ih 𝑦) ∈ ℂ)
19		cj11 14201	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ·_ih (𝑢‘𝑦)) ∈ ℂ ∧ ((𝑡‘𝑥) ·_ih 𝑦) ∈ ℂ) → ((∗‘(𝑥 ·_ih (𝑢‘𝑦))) = (∗‘((𝑡‘𝑥) ·_ih 𝑦)) ↔ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)))
20	15, 18, 19	syl2anc 579	. . . . . . . . . . . . . 14 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → ((∗‘(𝑥 ·_ih (𝑢‘𝑦))) = (∗‘((𝑡‘𝑥) ·_ih 𝑦)) ↔ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)))
21	12, 20	bitr2d 271	. . . . . . . . . . . . 13 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑥 ∈ ℋ) ∧ (𝑢: ℋ⟶ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ ((𝑢‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑡‘𝑥))))
22	21	an4s 650	. . . . . . . . . . . 12 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ (𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ)) → ((𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ ((𝑢‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑡‘𝑥))))
23	22	anassrs 459	. . . . . . . . . . 11 ⊢ ((((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) ∧ 𝑦 ∈ ℋ) → ((𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ ((𝑢‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑡‘𝑥))))
24		eqcom 2772	. . . . . . . . . . 11 ⊢ (((𝑢‘𝑦) ·_ih 𝑥) = (𝑦 ·_ih (𝑡‘𝑥)) ↔ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥))
25	23, 24	syl6bb 278	. . . . . . . . . 10 ⊢ ((((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) ∧ 𝑦 ∈ ℋ) → ((𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
26	25	ralbidva 3132	. . . . . . . . 9 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ 𝑥 ∈ ℋ) → (∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
27	26	ralbidva 3132	. . . . . . . 8 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
28		ralcom 3245	. . . . . . . 8 ⊢ (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥) ↔ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥))
29	27, 28	syl6bb 278	. . . . . . 7 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) → (∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦) ↔ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
30	29	pm5.32i 570	. . . . . 6 ⊢ (((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)) ↔ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
31		df-3an 1109	. . . . . 6 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)) ↔ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)))
32		df-3an 1109	. . . . . 6 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)) ↔ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ) ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
33	30, 31, 32	3bitr4i 294	. . . . 5 ⊢ ((𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)) ↔ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
34	2, 33	bitri 266	. . . 4 ⊢ ((𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦)) ↔ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥)))
35	34	opabbii 4878	. . 3 ⊢ {⟨𝑡, 𝑢⟩ ∣ (𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))} = {⟨𝑡, 𝑢⟩ ∣ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥))}
36	1, 35	eqtri 2787	. 2 ⊢ ^◡{⟨𝑢, 𝑡⟩ ∣ (𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))} = {⟨𝑡, 𝑢⟩ ∣ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥))}
37		dfadj2 29221	. . 3 ⊢ adj_ℎ = {⟨𝑢, 𝑡⟩ ∣ (𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))}
38	37	cnveqi 5467	. 2 ⊢ ^◡adj_ℎ = ^◡{⟨𝑢, 𝑡⟩ ∣ (𝑢: ℋ⟶ ℋ ∧ 𝑡: ℋ⟶ ℋ ∧ ∀𝑥 ∈ ℋ ∀𝑦 ∈ ℋ (𝑥 ·_ih (𝑢‘𝑦)) = ((𝑡‘𝑥) ·_ih 𝑦))}
39		dfadj2 29221	. 2 ⊢ adj_ℎ = {⟨𝑡, 𝑢⟩ ∣ (𝑡: ℋ⟶ ℋ ∧ 𝑢: ℋ⟶ ℋ ∧ ∀𝑦 ∈ ℋ ∀𝑥 ∈ ℋ (𝑦 ·_ih (𝑡‘𝑥)) = ((𝑢‘𝑦) ·_ih 𝑥))}
40	36, 38, 39	3eqtr4i 2797	1 ⊢ ^◡adj_ℎ = adj_ℎ

Colors of variables: wff setvar class

Syntax hints: ↔ wb 197 ∧ wa 384 ∧ w3a 1107 = wceq 1652 ∈ wcel 2155 ∀wral 3055 {copab 4873 ^◡ccnv 5278 ⟶wf 6066 ‘cfv 6070 (class class class)co 6846 ℂcc 10191 ∗ccj 14135 ℋchba 28253 ·_ih csp 28256 adj_ℎcado 28289

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1890 ax-4 1904 ax-5 2005 ax-6 2070 ax-7 2105 ax-8 2157 ax-9 2164 ax-10 2183 ax-11 2198 ax-12 2211 ax-13 2352 ax-ext 2743 ax-sep 4943 ax-nul 4951 ax-pow 5003 ax-pr 5064 ax-un 7151 ax-resscn 10250 ax-1cn 10251 ax-icn 10252 ax-addcl 10253 ax-addrcl 10254 ax-mulcl 10255 ax-mulrcl 10256 ax-mulcom 10257 ax-addass 10258 ax-mulass 10259 ax-distr 10260 ax-i2m1 10261 ax-1ne0 10262 ax-1rid 10263 ax-rnegex 10264 ax-rrecex 10265 ax-cnre 10266 ax-pre-lttri 10267 ax-pre-lttrn 10268 ax-pre-ltadd 10269 ax-pre-mulgt0 10270 ax-hfi 28413 ax-his1 28416

This theorem depends on definitions: df-bi 198 df-an 385 df-or 874 df-3or 1108 df-3an 1109 df-tru 1656 df-ex 1875 df-nf 1879 df-sb 2063 df-mo 2565 df-eu 2582 df-clab 2752 df-cleq 2758 df-clel 2761 df-nfc 2896 df-ne 2938 df-nel 3041 df-ral 3060 df-rex 3061 df-reu 3062 df-rmo 3063 df-rab 3064 df-v 3352 df-sbc 3599 df-csb 3694 df-dif 3737 df-un 3739 df-in 3741 df-ss 3748 df-nul 4082 df-if 4246 df-pw 4319 df-sn 4337 df-pr 4339 df-op 4343 df-uni 4597 df-iun 4680 df-br 4812 df-opab 4874 df-mpt 4891 df-id 5187 df-po 5200 df-so 5201 df-xp 5285 df-rel 5286 df-cnv 5287 df-co 5288 df-dm 5289 df-rn 5290 df-res 5291 df-ima 5292 df-iota 6033 df-fun 6072 df-fn 6073 df-f 6074 df-f1 6075 df-fo 6076 df-f1o 6077 df-fv 6078 df-riota 6807 df-ov 6849 df-oprab 6850 df-mpt2 6851 df-er 7951 df-en 8165 df-dom 8166 df-sdom 8167 df-pnf 10334 df-mnf 10335 df-xr 10336 df-ltxr 10337 df-le 10338 df-sub 10526 df-neg 10527 df-div 10943 df-2 11339 df-cj 14138 df-re 14139 df-im 14140 df-adjh 29185

This theorem is referenced by: funcnvadj 29229 adj1o 29230 adjbdlnb 29420

W3C validator