Theorem ldualset 40150

Description: Define the (left) dual of a left vector space (or module) in which the vectors are functionals. In many texts, this is defined as a right vector space, but by reversing the multiplication we achieve a left vector space, as is done in definition of dual vector space in [Holland95] p. 218. This allows to reuse our existing collection of left vector space theorems. Note the operation reversal in the scalar product to allow to use the original scalar ring instead of the opp_r ring, for convenience. (Contributed by NM, 18-Oct-2014.)

Hypotheses

Ref	Expression
ldualset.v	⊢ 𝑉 = (Base‘𝑊)
ldualset.a	⊢ + = (+g‘𝑅)
ldualset.p	⊢ ✚ = ( ∘f + ↾ (𝐹 × 𝐹))
ldualset.f	⊢ 𝐹 = (LFnl‘𝑊)
ldualset.d	⊢ 𝐷 = (LDual‘𝑊)
ldualset.r	⊢ 𝑅 = (Scalar‘𝑊)
ldualset.k	⊢ 𝐾 = (Base‘𝑅)
ldualset.t	⊢ · = (.r‘𝑅)
ldualset.o	⊢ 𝑂 = (oppr‘𝑅)
ldualset.s	⊢ ∙ = (𝑘 ∈ 𝐾, 𝑓 ∈ 𝐹 ↦ (𝑓 ∘f · (𝑉 × {𝑘})))
ldualset.w	⊢ (𝜑 → 𝑊 ∈ 𝑋)

Assertion

Ref	Expression
ldualset	⊢ (𝜑 → 𝐷 = ({⟨(Base‘ndx), 𝐹⟩, ⟨(+g‘ndx), ✚ ⟩, ⟨(Scalar‘ndx), 𝑂⟩} ∪ {⟨( ·𝑠 ‘ndx), ∙ ⟩}))

Distinct variable group:   𝑓,𝑘,𝑊

Allowed substitution hints:   𝜑(𝑓, 𝑘)   𝐷(𝑓, 𝑘)   + (𝑓, 𝑘)   ✚ (𝑓, 𝑘)   𝑅(𝑓, 𝑘)   ∙ (𝑓, 𝑘)   · (𝑓, 𝑘)   𝐹(𝑓, 𝑘)   𝐾(𝑓, 𝑘)   𝑂(𝑓, 𝑘)   𝑉(𝑓, 𝑘)   𝑋(𝑓, 𝑘)

Proof of Theorem ldualset

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ldualset.w	. 2 ⊢ (𝜑 → 𝑊 ∈ 𝑋)
2		elex 3472	. 2 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
3		ldualset.d	. . 3 ⊢ 𝐷 = (LDual‘𝑊)
4		fveq2 6877	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LFnl‘𝑤) = (LFnl‘𝑊))
5		ldualset.f	. . . . . . . 8 ⊢ 𝐹 = (LFnl‘𝑊)
6	4, 5	eqtr4di 2814	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LFnl‘𝑤) = 𝐹)
7	6	opeq2d 4840	. . . . . 6 ⊢ (𝑤 = 𝑊 → ⟨(Base‘ndx), (LFnl‘𝑤)⟩ = ⟨(Base‘ndx), 𝐹⟩)
8		fveq2 6877	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑊 → (Scalar‘𝑤) = (Scalar‘𝑊))
9		ldualset.r	. . . . . . . . . . . . 13 ⊢ 𝑅 = (Scalar‘𝑊)
10	8, 9	eqtr4di 2814	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑊 → (Scalar‘𝑤) = 𝑅)
11	10	fveq2d 6881	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (+g‘(Scalar‘𝑤)) = (+g‘𝑅))
12		ldualset.a	. . . . . . . . . . 11 ⊢ + = (+g‘𝑅)
13	11, 12	eqtr4di 2814	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (+g‘(Scalar‘𝑤)) = + )
14	13	ofeqd 7684	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ∘f (+g‘(Scalar‘𝑤)) = ∘f + )
15	6	sqxpeqd 5683	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((LFnl‘𝑤) × (LFnl‘𝑤)) = (𝐹 × 𝐹))
16	14, 15	reseq12d 5971	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ( ∘f (+g‘(Scalar‘𝑤)) ↾ ((LFnl‘𝑤) × (LFnl‘𝑤))) = ( ∘f + ↾ (𝐹 × 𝐹)))
17		ldualset.p	. . . . . . . 8 ⊢ ✚ = ( ∘f + ↾ (𝐹 × 𝐹))
18	16, 17	eqtr4di 2814	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ( ∘f (+g‘(Scalar‘𝑤)) ↾ ((LFnl‘𝑤) × (LFnl‘𝑤))) = ✚ )
19	18	opeq2d 4840	. . . . . 6 ⊢ (𝑤 = 𝑊 → ⟨(+g‘ndx), ( ∘f (+g‘(Scalar‘𝑤)) ↾ ((LFnl‘𝑤) × (LFnl‘𝑤)))⟩ = ⟨(+g‘ndx), ✚ ⟩)
20	10	fveq2d 6881	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (oppr‘(Scalar‘𝑤)) = (oppr‘𝑅))
21		ldualset.o	. . . . . . . 8 ⊢ 𝑂 = (oppr‘𝑅)
22	20, 21	eqtr4di 2814	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (oppr‘(Scalar‘𝑤)) = 𝑂)
23	22	opeq2d 4840	. . . . . 6 ⊢ (𝑤 = 𝑊 → ⟨(Scalar‘ndx), (oppr‘(Scalar‘𝑤))⟩ = ⟨(Scalar‘ndx), 𝑂⟩)
24	7, 19, 23	tpeq123d 4709	. . . . 5 ⊢ (𝑤 = 𝑊 → {⟨(Base‘ndx), (LFnl‘𝑤)⟩, ⟨(+g‘ndx), ( ∘f (+g‘(Scalar‘𝑤)) ↾ ((LFnl‘𝑤) × (LFnl‘𝑤)))⟩, ⟨(Scalar‘ndx), (oppr‘(Scalar‘𝑤))⟩} = {⟨(Base‘ndx), 𝐹⟩, ⟨(+g‘ndx), ✚ ⟩, ⟨(Scalar‘ndx), 𝑂⟩})
25	10	fveq2d 6881	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = (Base‘𝑅))
26		ldualset.k	. . . . . . . . . 10 ⊢ 𝐾 = (Base‘𝑅)
27	25, 26	eqtr4di 2814	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = 𝐾)
28	10	fveq2d 6881	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑊 → (.r‘(Scalar‘𝑤)) = (.r‘𝑅))
29		ldualset.t	. . . . . . . . . . . 12 ⊢ · = (.r‘𝑅)
30	28, 29	eqtr4di 2814	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (.r‘(Scalar‘𝑤)) = · )
31	30	ofeqd 7684	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → ∘f (.r‘(Scalar‘𝑤)) = ∘f · )
32		eqidd 2762	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → 𝑓 = 𝑓)
33		fveq2 6877	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
34		ldualset.v	. . . . . . . . . . . 12 ⊢ 𝑉 = (Base‘𝑊)
35	33, 34	eqtr4di 2814	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
36	35	xpeq1d 5680	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → ((Base‘𝑤) × {𝑘}) = (𝑉 × {𝑘}))
37	31, 32, 36	oveq123d 7433	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝑓 ∘f (.r‘(Scalar‘𝑤))((Base‘𝑤) × {𝑘})) = (𝑓 ∘f · (𝑉 × {𝑘})))
38	27, 6, 37	mpoeq123dv 7487	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (𝑘 ∈ (Base‘(Scalar‘𝑤)), 𝑓 ∈ (LFnl‘𝑤) ↦ (𝑓 ∘f (.r‘(Scalar‘𝑤))((Base‘𝑤) × {𝑘}))) = (𝑘 ∈ 𝐾, 𝑓 ∈ 𝐹 ↦ (𝑓 ∘f · (𝑉 × {𝑘}))))
39		ldualset.s	. . . . . . . 8 ⊢ ∙ = (𝑘 ∈ 𝐾, 𝑓 ∈ 𝐹 ↦ (𝑓 ∘f · (𝑉 × {𝑘})))
40	38, 39	eqtr4di 2814	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝑘 ∈ (Base‘(Scalar‘𝑤)), 𝑓 ∈ (LFnl‘𝑤) ↦ (𝑓 ∘f (.r‘(Scalar‘𝑤))((Base‘𝑤) × {𝑘}))) = ∙ )
41	40	opeq2d 4840	. . . . . 6 ⊢ (𝑤 = 𝑊 → ⟨( ·𝑠 ‘ndx), (𝑘 ∈ (Base‘(Scalar‘𝑤)), 𝑓 ∈ (LFnl‘𝑤) ↦ (𝑓 ∘f (.r‘(Scalar‘𝑤))((Base‘𝑤) × {𝑘})))⟩ = ⟨( ·𝑠 ‘ndx), ∙ ⟩)
42	41	sneqd 4596	. . . . 5 ⊢ (𝑤 = 𝑊 → {⟨( ·𝑠 ‘ndx), (𝑘 ∈ (Base‘(Scalar‘𝑤)), 𝑓 ∈ (LFnl‘𝑤) ↦ (𝑓 ∘f (.r‘(Scalar‘𝑤))((Base‘𝑤) × {𝑘})))⟩} = {⟨( ·𝑠 ‘ndx), ∙ ⟩})
43	24, 42	uneq12d 4116	. . . 4 ⊢ (𝑤 = 𝑊 → ({⟨(Base‘ndx), (LFnl‘𝑤)⟩, ⟨(+g‘ndx), ( ∘f (+g‘(Scalar‘𝑤)) ↾ ((LFnl‘𝑤) × (LFnl‘𝑤)))⟩, ⟨(Scalar‘ndx), (oppr‘(Scalar‘𝑤))⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑘 ∈ (Base‘(Scalar‘𝑤)), 𝑓 ∈ (LFnl‘𝑤) ↦ (𝑓 ∘f (.r‘(Scalar‘𝑤))((Base‘𝑤) × {𝑘})))⟩}) = ({⟨(Base‘ndx), 𝐹⟩, ⟨(+g‘ndx), ✚ ⟩, ⟨(Scalar‘ndx), 𝑂⟩} ∪ {⟨( ·𝑠 ‘ndx), ∙ ⟩}))
44		df-ldual 40149	. . . 4 ⊢ LDual = (𝑤 ∈ V ↦ ({⟨(Base‘ndx), (LFnl‘𝑤)⟩, ⟨(+g‘ndx), ( ∘f (+g‘(Scalar‘𝑤)) ↾ ((LFnl‘𝑤) × (LFnl‘𝑤)))⟩, ⟨(Scalar‘ndx), (oppr‘(Scalar‘𝑤))⟩} ∪ {⟨( ·𝑠 ‘ndx), (𝑘 ∈ (Base‘(Scalar‘𝑤)), 𝑓 ∈ (LFnl‘𝑤) ↦ (𝑓 ∘f (.r‘(Scalar‘𝑤))((Base‘𝑤) × {𝑘})))⟩}))
45		tpex 7751	. . . . 5 ⊢ {⟨(Base‘ndx), 𝐹⟩, ⟨(+g‘ndx), ✚ ⟩, ⟨(Scalar‘ndx), 𝑂⟩} ∈ V
46		snex 5397	. . . . 5 ⊢ {⟨( ·𝑠 ‘ndx), ∙ ⟩} ∈ V
47	45, 46	unex 7750	. . . 4 ⊢ ({⟨(Base‘ndx), 𝐹⟩, ⟨(+g‘ndx), ✚ ⟩, ⟨(Scalar‘ndx), 𝑂⟩} ∪ {⟨( ·𝑠 ‘ndx), ∙ ⟩}) ∈ V
48	43, 44, 47	fvmpt 6985	. . 3 ⊢ (𝑊 ∈ V → (LDual‘𝑊) = ({⟨(Base‘ndx), 𝐹⟩, ⟨(+g‘ndx), ✚ ⟩, ⟨(Scalar‘ndx), 𝑂⟩} ∪ {⟨( ·𝑠 ‘ndx), ∙ ⟩}))
49	3, 48	eqtrid 2808	. 2 ⊢ (𝑊 ∈ V → 𝐷 = ({⟨(Base‘ndx), 𝐹⟩, ⟨(+g‘ndx), ✚ ⟩, ⟨(Scalar‘ndx), 𝑂⟩} ∪ {⟨( ·𝑠 ‘ndx), ∙ ⟩}))
50	1, 2, 49	3syl 19	1 ⊢ (𝜑 → 𝐷 = ({⟨(Base‘ndx), 𝐹⟩, ⟨(+g‘ndx), ✚ ⟩, ⟨(Scalar‘ndx), 𝑂⟩} ∪ {⟨( ·𝑠 ‘ndx), ∙ ⟩}))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∪ cun 3897  {csn 4584  {ctp 4588  ⟨cop 4590   × cxp 5649   ↾ cres 5653  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414   ∘_f cof 7680  ndxcnx 17351  Basecbs 17367  +_gcplusg 17408  ._rcmulr 17409  Scalarcsca 17411   ·_𝑠 cvsca 17412  opp_rcoppr 20546  LFnlclfn 40082  LDualcld 40148

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-res 5663  df-iota 6487  df-fun 6533  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-of 7682  df-ldual 40149

This theorem is used by:  ldualvbase  40151  ldualfvadd  40153  ldualsca  40157  ldualfvs  40161