Theorem lnoval 31369

Description: The set of linear operators between two normed complex vector spaces. (Contributed by NM, 6-Nov-2007.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
lnoval.1	⊢ 𝑋 = (BaseSet‘𝑈)
lnoval.2	⊢ 𝑌 = (BaseSet‘𝑊)
lnoval.3	⊢ 𝐺 = ( +𝑣 ‘𝑈)
lnoval.4	⊢ 𝐻 = ( +𝑣 ‘𝑊)
lnoval.5	⊢ 𝑅 = ( ·𝑠OLD ‘𝑈)
lnoval.6	⊢ 𝑆 = ( ·𝑠OLD ‘𝑊)
lnoval.7	⊢ 𝐿 = (𝑈 LnOp 𝑊)

Assertion

Ref	Expression
lnoval	⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐿 = {𝑡 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡‘𝑦))𝐻(𝑡‘𝑧))})

Distinct variable groups:   𝑥,𝑡,𝑦,𝑧,𝑈   𝑡,𝑊,𝑥,𝑦,𝑧   𝑡,𝑋,𝑦,𝑧   𝑡,𝑌   𝑡,𝐺   𝑡,𝑅   𝑡,𝐻   𝑡,𝑆

Allowed substitution hints:   𝑅(𝑥, 𝑦, 𝑧)   𝑆(𝑥, 𝑦, 𝑧)   𝐺(𝑥, 𝑦, 𝑧)   𝐻(𝑥, 𝑦, 𝑧)   𝐿(𝑥, 𝑦, 𝑧, 𝑡)   𝑋(𝑥)   𝑌(𝑥, 𝑦, 𝑧)

Proof of Theorem lnoval

Dummy variables 𝑢 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lnoval.7	. 2 ⊢ 𝐿 = (𝑈 LnOp 𝑊)
2		fveq2 6896	. . . . . 6 ⊢ (𝑢 = 𝑈 → (BaseSet‘𝑢) = (BaseSet‘𝑈))
3		lnoval.1	. . . . . 6 ⊢ 𝑋 = (BaseSet‘𝑈)
4	2, 3	eqtr4di 2816	. . . . 5 ⊢ (𝑢 = 𝑈 → (BaseSet‘𝑢) = 𝑋)
5	4	oveq2d 7446	. . . 4 ⊢ (𝑢 = 𝑈 → ((BaseSet‘𝑤) ↑m (BaseSet‘𝑢)) = ((BaseSet‘𝑤) ↑m 𝑋))
6		fveq2 6896	. . . . . . . . . 10 ⊢ (𝑢 = 𝑈 → ( +𝑣 ‘𝑢) = ( +𝑣 ‘𝑈))
7		lnoval.3	. . . . . . . . . 10 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
8	6, 7	eqtr4di 2816	. . . . . . . . 9 ⊢ (𝑢 = 𝑈 → ( +𝑣 ‘𝑢) = 𝐺)
9		fveq2 6896	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑈 → ( ·𝑠OLD ‘𝑢) = ( ·𝑠OLD ‘𝑈))
10		lnoval.5	. . . . . . . . . . 11 ⊢ 𝑅 = ( ·𝑠OLD ‘𝑈)
11	9, 10	eqtr4di 2816	. . . . . . . . . 10 ⊢ (𝑢 = 𝑈 → ( ·𝑠OLD ‘𝑢) = 𝑅)
12	11	oveqd 7447	. . . . . . . . 9 ⊢ (𝑢 = 𝑈 → (𝑥( ·𝑠OLD ‘𝑢)𝑦) = (𝑥𝑅𝑦))
13		eqidd 2764	. . . . . . . . 9 ⊢ (𝑢 = 𝑈 → 𝑧 = 𝑧)
14	8, 12, 13	oveq123d 7451	. . . . . . . 8 ⊢ (𝑢 = 𝑈 → ((𝑥( ·𝑠OLD ‘𝑢)𝑦)( +𝑣 ‘𝑢)𝑧) = ((𝑥𝑅𝑦)𝐺𝑧))
15	14	fveqeq2d 6904	. . . . . . 7 ⊢ (𝑢 = 𝑈 → ((𝑡‘((𝑥( ·𝑠OLD ‘𝑢)𝑦)( +𝑣 ‘𝑢)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧)) ↔ (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧))))
16	4, 15	raleqbidv 3338	. . . . . 6 ⊢ (𝑢 = 𝑈 → (∀𝑧 ∈ (BaseSet‘𝑢)(𝑡‘((𝑥( ·𝑠OLD ‘𝑢)𝑦)( +𝑣 ‘𝑢)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧)) ↔ ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧))))
17	4, 16	raleqbidv 3338	. . . . 5 ⊢ (𝑢 = 𝑈 → (∀𝑦 ∈ (BaseSet‘𝑢)∀𝑧 ∈ (BaseSet‘𝑢)(𝑡‘((𝑥( ·𝑠OLD ‘𝑢)𝑦)( +𝑣 ‘𝑢)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧)) ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧))))
18	17	ralbidv 3189	. . . 4 ⊢ (𝑢 = 𝑈 → (∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑢)∀𝑧 ∈ (BaseSet‘𝑢)(𝑡‘((𝑥( ·𝑠OLD ‘𝑢)𝑦)( +𝑣 ‘𝑢)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧))))
19	5, 18	rabeqbidv 3433	. . 3 ⊢ (𝑢 = 𝑈 → {𝑡 ∈ ((BaseSet‘𝑤) ↑m (BaseSet‘𝑢)) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑢)∀𝑧 ∈ (BaseSet‘𝑢)(𝑡‘((𝑥( ·𝑠OLD ‘𝑢)𝑦)( +𝑣 ‘𝑢)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧))} = {𝑡 ∈ ((BaseSet‘𝑤) ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧))})
20		fveq2 6896	. . . . . 6 ⊢ (𝑤 = 𝑊 → (BaseSet‘𝑤) = (BaseSet‘𝑊))
21		lnoval.2	. . . . . 6 ⊢ 𝑌 = (BaseSet‘𝑊)
22	20, 21	eqtr4di 2816	. . . . 5 ⊢ (𝑤 = 𝑊 → (BaseSet‘𝑤) = 𝑌)
23	22	oveq1d 7445	. . . 4 ⊢ (𝑤 = 𝑊 → ((BaseSet‘𝑤) ↑m 𝑋) = (𝑌 ↑m 𝑋))
24		fveq2 6896	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ( +𝑣 ‘𝑤) = ( +𝑣 ‘𝑊))
25		lnoval.4	. . . . . . . . 9 ⊢ 𝐻 = ( +𝑣 ‘𝑊)
26	24, 25	eqtr4di 2816	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ( +𝑣 ‘𝑤) = 𝐻)
27		fveq2 6896	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → ( ·𝑠OLD ‘𝑤) = ( ·𝑠OLD ‘𝑊))
28		lnoval.6	. . . . . . . . . 10 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑊)
29	27, 28	eqtr4di 2816	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ( ·𝑠OLD ‘𝑤) = 𝑆)
30	29	oveqd 7447	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦)) = (𝑥𝑆(𝑡‘𝑦)))
31		eqidd 2764	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (𝑡‘𝑧) = (𝑡‘𝑧))
32	26, 30, 31	oveq123d 7451	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧)) = ((𝑥𝑆(𝑡‘𝑦))𝐻(𝑡‘𝑧)))
33	32	eqeq2d 2774	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧)) ↔ (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡‘𝑦))𝐻(𝑡‘𝑧))))
34	33	2ralbidv 3230	. . . . 5 ⊢ (𝑤 = 𝑊 → (∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧)) ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡‘𝑦))𝐻(𝑡‘𝑧))))
35	34	ralbidv 3189	. . . 4 ⊢ (𝑤 = 𝑊 → (∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡‘𝑦))𝐻(𝑡‘𝑧))))
36	23, 35	rabeqbidv 3433	. . 3 ⊢ (𝑤 = 𝑊 → {𝑡 ∈ ((BaseSet‘𝑤) ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧))} = {𝑡 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡‘𝑦))𝐻(𝑡‘𝑧))})
37		df-lno 31361	. . 3 ⊢ LnOp = (𝑢 ∈ NrmCVec, 𝑤 ∈ NrmCVec ↦ {𝑡 ∈ ((BaseSet‘𝑤) ↑m (BaseSet‘𝑢)) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ (BaseSet‘𝑢)∀𝑧 ∈ (BaseSet‘𝑢)(𝑡‘((𝑥( ·𝑠OLD ‘𝑢)𝑦)( +𝑣 ‘𝑢)𝑧)) = ((𝑥( ·𝑠OLD ‘𝑤)(𝑡‘𝑦))( +𝑣 ‘𝑤)(𝑡‘𝑧))})
38		ovex 7463	. . . 4 ⊢ (𝑌 ↑m 𝑋) ∈ V
39	38	rabex 5304	. . 3 ⊢ {𝑡 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡‘𝑦))𝐻(𝑡‘𝑧))} ∈ V
40	19, 36, 37, 39	ovmpo 7590	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑈 LnOp 𝑊) = {𝑡 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡‘𝑦))𝐻(𝑡‘𝑧))})
41	1, 40	eqtrid 2810	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐿 = {𝑡 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑡‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑡‘𝑦))𝐻(𝑡‘𝑧))})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∀wral 3080  {crab 3416  ‘cfv 6547  (class class class)co 7430   ↑_m cmap 8861  ℂcc 11211  NrmCVeccnv 31201   +_𝑣 cpv 31202  BaseSetcba 31203   ·_𝑠OLD cns 31204   LnOp clno 31357

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  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-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6501  df-fun 6549  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-lno 31361

This theorem is used by:  islno  31370  hhlnoi  32517