Theorem ajval 30936

Description: Value of the adjoint function. (Contributed by NM, 25-Jan-2008.) (New usage is discouraged.)

Hypotheses

Ref	Expression
ajval.1	⊢ 𝑋 = (BaseSet‘𝑈)
ajval.2	⊢ 𝑌 = (BaseSet‘𝑊)
ajval.3	⊢ 𝑃 = (·𝑖OLD‘𝑈)
ajval.4	⊢ 𝑄 = (·𝑖OLD‘𝑊)
ajval.5	⊢ 𝐴 = (𝑈adj𝑊)

Assertion

Ref	Expression
ajval	⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (𝐴‘𝑇) = (℩𝑠(𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))))

Distinct variable groups:   𝑥,𝑠,𝑦,𝑇   𝑈,𝑠,𝑥,𝑦   𝑊,𝑠,𝑥,𝑦   𝑋,𝑠,𝑥,𝑦   𝑌,𝑠,𝑦

Allowed substitution hints:   𝐴(𝑥,𝑦,𝑠)   𝑃(𝑥,𝑦,𝑠)   𝑄(𝑥,𝑦,𝑠)   𝑌(𝑥)

Proof of Theorem ajval

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		phnv 30889	. . . . 5 ⊢ (𝑈 ∈ CPreHilOLD → 𝑈 ∈ NrmCVec)
2		ajval.1	. . . . . 6 ⊢ 𝑋 = (BaseSet‘𝑈)
3		ajval.2	. . . . . 6 ⊢ 𝑌 = (BaseSet‘𝑊)
4		ajval.3	. . . . . 6 ⊢ 𝑃 = (·𝑖OLD‘𝑈)
5		ajval.4	. . . . . 6 ⊢ 𝑄 = (·𝑖OLD‘𝑊)
6		ajval.5	. . . . . 6 ⊢ 𝐴 = (𝑈adj𝑊)
7	2, 3, 4, 5, 6	ajfval 30884	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐴 = {⟨𝑡, 𝑠⟩ ∣ (𝑡:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))})
8	1, 7	sylan 580	. . . 4 ⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝑊 ∈ NrmCVec) → 𝐴 = {⟨𝑡, 𝑠⟩ ∣ (𝑡:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))})
9	8	fveq1d 6836	. . 3 ⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝑊 ∈ NrmCVec) → (𝐴‘𝑇) = ({⟨𝑡, 𝑠⟩ ∣ (𝑡:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))}‘𝑇))
10	9	3adant3 1132	. 2 ⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (𝐴‘𝑇) = ({⟨𝑡, 𝑠⟩ ∣ (𝑡:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))}‘𝑇))
11	2	fvexi 6848	. . . . . 6 ⊢ 𝑋 ∈ V
12		fex 7172	. . . . . 6 ⊢ ((𝑇:𝑋⟶𝑌 ∧ 𝑋 ∈ V) → 𝑇 ∈ V)
13	11, 12	mpan2 691	. . . . 5 ⊢ (𝑇:𝑋⟶𝑌 → 𝑇 ∈ V)
14		eqid 2736	. . . . . 6 ⊢ {⟨𝑡, 𝑠⟩ ∣ (𝑡:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))} = {⟨𝑡, 𝑠⟩ ∣ (𝑡:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))}
15		feq1 6640	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑡:𝑋⟶𝑌 ↔ 𝑇:𝑋⟶𝑌))
16		fveq1 6833	. . . . . . . . . 10 ⊢ (𝑡 = 𝑇 → (𝑡‘𝑥) = (𝑇‘𝑥))
17	16	oveq1d 7373	. . . . . . . . 9 ⊢ (𝑡 = 𝑇 → ((𝑡‘𝑥)𝑄𝑦) = ((𝑇‘𝑥)𝑄𝑦))
18	17	eqeq1d 2738	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → (((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)) ↔ ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦))))
19	18	2ralbidv 3200	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦))))
20	15, 19	3anbi13d 1440	. . . . . 6 ⊢ (𝑡 = 𝑇 → ((𝑡:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦))) ↔ (𝑇:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))))
21	14, 20	fvopab5 6974	. . . . 5 ⊢ (𝑇 ∈ V → ({⟨𝑡, 𝑠⟩ ∣ (𝑡:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))}‘𝑇) = (℩𝑠(𝑇:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))))
22	13, 21	syl 17	. . . 4 ⊢ (𝑇:𝑋⟶𝑌 → ({⟨𝑡, 𝑠⟩ ∣ (𝑡:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))}‘𝑇) = (℩𝑠(𝑇:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))))
23		3anass 1094	. . . . . 6 ⊢ ((𝑇:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦))) ↔ (𝑇:𝑋⟶𝑌 ∧ (𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))))
24	23	baib 535	. . . . 5 ⊢ (𝑇:𝑋⟶𝑌 → ((𝑇:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦))) ↔ (𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))))
25	24	iotabidv 6476	. . . 4 ⊢ (𝑇:𝑋⟶𝑌 → (℩𝑠(𝑇:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))) = (℩𝑠(𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))))
26	22, 25	eqtrd 2771	. . 3 ⊢ (𝑇:𝑋⟶𝑌 → ({⟨𝑡, 𝑠⟩ ∣ (𝑡:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))}‘𝑇) = (℩𝑠(𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))))
27	26	3ad2ant3 1135	. 2 ⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → ({⟨𝑡, 𝑠⟩ ∣ (𝑡:𝑋⟶𝑌 ∧ 𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑡‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))}‘𝑇) = (℩𝑠(𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))))
28	10, 27	eqtrd 2771	1 ⊢ ((𝑈 ∈ CPreHilOLD ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (𝐴‘𝑇) = (℩𝑠(𝑠:𝑌⟶𝑋 ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑌 ((𝑇‘𝑥)𝑄𝑦) = (𝑥𝑃(𝑠‘𝑦)))))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3051  Vcvv 3440  {copab 5160  ℩cio 6446  ⟶wf 6488  ‘cfv 6492  (class class class)co 7358  NrmCVeccnv 30659  BaseSetcba 30661  ·_𝑖OLDcdip 30775  adjcaj 30823  CPreHil_OLDccphlo 30887

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-map 8765  df-aj 30825  df-ph 30888

This theorem is referenced by: (None)