Theorem ldualset 40275

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 3471	. 2 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
3		ldualset.d	. . 3 ⊢ 𝐷 = (LDual‘𝑊)
4		fveq2 6885	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (LFnl‘𝑤) = (LFnl‘𝑊))
5		ldualset.f	. . . . . . . 8 ⊢ 𝐹 = (LFnl‘𝑊)
6	4, 5	eqtr4di 2813	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (LFnl‘𝑤) = 𝐹)
7	6	opeq2d 4846	. . . . . 6 ⊢ (𝑤 = 𝑊 → ⟨(Base‘ndx), (LFnl‘𝑤)⟩ = ⟨(Base‘ndx), 𝐹⟩)
8		fveq2 6885	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑊 → (Scalar‘𝑤) = (Scalar‘𝑊))
9		ldualset.r	. . . . . . . . . . . . 13 ⊢ 𝑅 = (Scalar‘𝑊)
10	8, 9	eqtr4di 2813	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑊 → (Scalar‘𝑤) = 𝑅)
11	10	fveq2d 6889	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (+g‘(Scalar‘𝑤)) = (+g‘𝑅))
12		ldualset.a	. . . . . . . . . . 11 ⊢ + = (+g‘𝑅)
13	11, 12	eqtr4di 2813	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (+g‘(Scalar‘𝑤)) = + )
14	13	ofeqd 7695	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ∘f (+g‘(Scalar‘𝑤)) = ∘f + )
15	6	sqxpeqd 5682	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((LFnl‘𝑤) × (LFnl‘𝑤)) = (𝐹 × 𝐹))
16	14, 15	reseq12d 5970	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ( ∘f (+g‘(Scalar‘𝑤)) ↾ ((LFnl‘𝑤) × (LFnl‘𝑤))) = ( ∘f + ↾ (𝐹 × 𝐹)))
17		ldualset.p	. . . . . . . 8 ⊢ + = ( ∘f + ↾ (𝐹 × 𝐹))
18	16, 17	eqtr4di 2813	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ( ∘f (+g‘(Scalar‘𝑤)) ↾ ((LFnl‘𝑤) × (LFnl‘𝑤))) = + )
19	18	opeq2d 4846	. . . . . 6 ⊢ (𝑤 = 𝑊 → ⟨(+g‘ndx), ( ∘f (+g‘(Scalar‘𝑤)) ↾ ((LFnl‘𝑤) × (LFnl‘𝑤)))⟩ = ⟨(+g‘ndx), + ⟩)
20	10	fveq2d 6889	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (oppr‘(Scalar‘𝑤)) = (oppr‘𝑅))
21		ldualset.o	. . . . . . . 8 ⊢ 𝑂 = (oppr‘𝑅)
22	20, 21	eqtr4di 2813	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (oppr‘(Scalar‘𝑤)) = 𝑂)
23	22	opeq2d 4846	. . . . . 6 ⊢ (𝑤 = 𝑊 → ⟨(Scalar‘ndx), (oppr‘(Scalar‘𝑤))⟩ = ⟨(Scalar‘ndx), 𝑂⟩)
24	7, 19, 23	tpeq123d 4705	. . . . 5 ⊢ (𝑤 = 𝑊 → {⟨(Base‘ndx), (LFnl‘𝑤)⟩, ⟨(+g‘ndx), ( ∘f (+g‘(Scalar‘𝑤)) ↾ ((LFnl‘𝑤) × (LFnl‘𝑤)))⟩, ⟨(Scalar‘ndx), (oppr‘(Scalar‘𝑤))⟩} = {⟨(Base‘ndx), 𝐹⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝑂⟩})
25	10	fveq2d 6889	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = (Base‘𝑅))
26		ldualset.k	. . . . . . . . . 10 ⊢ 𝐾 = (Base‘𝑅)
27	25, 26	eqtr4di 2813	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (Base‘(Scalar‘𝑤)) = 𝐾)
28	10	fveq2d 6889	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑊 → (.r‘(Scalar‘𝑤)) = (.r‘𝑅))
29		ldualset.t	. . . . . . . . . . . 12 ⊢ · = (.r‘𝑅)
30	28, 29	eqtr4di 2813	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (.r‘(Scalar‘𝑤)) = · )
31	30	ofeqd 7695	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → ∘f (.r‘(Scalar‘𝑤)) = ∘f · )
32		eqidd 2761	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → 𝑓 = 𝑓)
33		fveq2 6885	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
34		ldualset.v	. . . . . . . . . . . 12 ⊢ 𝑉 = (Base‘𝑊)
35	33, 34	eqtr4di 2813	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
36	35	xpeq1d 5679	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → ((Base‘𝑤) × {𝑘}) = (𝑉 × {𝑘}))
37	31, 32, 36	oveq123d 7441	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝑓 ∘f (.r‘(Scalar‘𝑤))((Base‘𝑤) × {𝑘})) = (𝑓 ∘f · (𝑉 × {𝑘})))
38	27, 6, 37	mpoeq123dv 7495	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (𝑘 ∈ (Base‘(Scalar‘𝑤)), 𝑓 ∈ (LFnl‘𝑤) ↦ (𝑓 ∘f (.r‘(Scalar‘𝑤))((Base‘𝑤) × {𝑘}))) = (𝑘 ∈ 𝐾, 𝑓 ∈ 𝐹 ↦ (𝑓 ∘f · (𝑉 × {𝑘}))))
39		ldualset.s	. . . . . . . 8 ⊢ ∙ = (𝑘 ∈ 𝐾, 𝑓 ∈ 𝐹 ↦ (𝑓 ∘f · (𝑉 × {𝑘})))
40	38, 39	eqtr4di 2813	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝑘 ∈ (Base‘(Scalar‘𝑤)), 𝑓 ∈ (LFnl‘𝑤) ↦ (𝑓 ∘f (.r‘(Scalar‘𝑤))((Base‘𝑤) × {𝑘}))) = ∙ )
41	40	opeq2d 4846	. . . . . 6 ⊢ (𝑤 = 𝑊 → ⟨( ·𝑠 ‘ndx), (𝑘 ∈ (Base‘(Scalar‘𝑤)), 𝑓 ∈ (LFnl‘𝑤) ↦ (𝑓 ∘f (.r‘(Scalar‘𝑤))((Base‘𝑤) × {𝑘})))⟩ = ⟨( ·𝑠 ‘ndx), ∙ ⟩)
42	41	sneqd 4592	. . . . 5 ⊢ (𝑤 = 𝑊 → {⟨( ·𝑠 ‘ndx), (𝑘 ∈ (Base‘(Scalar‘𝑤)), 𝑓 ∈ (LFnl‘𝑤) ↦ (𝑓 ∘f (.r‘(Scalar‘𝑤))((Base‘𝑤) × {𝑘})))⟩} = {⟨( ·𝑠 ‘ndx), ∙ ⟩})
43	24, 42	uneq12d 4168	. . . 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 40274	. . . 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 7762	. . . . 5 ⊢ {⟨(Base‘ndx), 𝐹⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝑂⟩} ∈ V
46		snex 5396	. . . . 5 ⊢ {⟨( ·𝑠 ‘ndx), ∙ ⟩} ∈ V
47	45, 46	unex 7761	. . . 4 ⊢ ({⟨(Base‘ndx), 𝐹⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝑂⟩} ∪ {⟨( ·𝑠 ‘ndx), ∙ ⟩}) ∈ V
48	43, 44, 47	fvmpt 6993	. . 3 ⊢ (𝑊 ∈ V → (LDual‘𝑊) = ({⟨(Base‘ndx), 𝐹⟩, ⟨(+g‘ndx), + ⟩, ⟨(Scalar‘ndx), 𝑂⟩} ∪ {⟨( ·𝑠 ‘ndx), ∙ ⟩}))
49	3, 48	eqtrid 2807	. 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 1569   ∈ wcel 2144  Vcvv 3450   ∪ cun 4149  {csn 4584  {ctp 4588  ⟨cop 4834   × cxp 5648   ↾ cres 5652  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422   ∘_f cof 7691  ndxcnx 17376  Basecbs 17392  +_gcplusg 17433  ._rcmulr 17434  Scalarcsca 17436   ·_𝑠 cvsca 17437  opp_rcoppr 20571  LFnlclfn 40207  LDualcld 40273

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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390  ax-un 7751

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 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-res 5662  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7693  df-ldual 40274

This theorem is used by:  ldualvbase  40276  ldualfvadd  40278  ldualsca  40282  ldualfvs  40286