Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mapdval Structured version   Visualization version   GIF version

Theorem mapdval 42443
Description: Value of projectivity from vector space H to dual space. (Contributed by NM, 27-Jan-2015.)
Hypotheses
Ref Expression
mapdval.h 𝐻 = (LHyp‘𝐾)
mapdval.u 𝑈 = ((DVecH‘𝐾)‘𝑊)
mapdval.s 𝑆 = (LSubSp‘𝑈)
mapdval.f 𝐹 = (LFnl‘𝑈)
mapdval.l 𝐿 = (LKer‘𝑈)
mapdval.o 𝑂 = ((ocH‘𝐾)‘𝑊)
mapdval.m 𝑀 = ((mapd‘𝐾)‘𝑊)
mapdval.k (𝜑 → (𝐾𝑋𝑊𝐻))
mapdval.t (𝜑𝑇𝑆)
Assertion
Ref Expression
mapdval (𝜑 → (𝑀𝑇) = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
Distinct variable groups:   𝑓,𝐾   𝑓,𝐹   𝑓,𝑊   𝑇,𝑓
Allowed substitution hints:   𝜑(𝑓)   𝑆(𝑓)   𝑈(𝑓)   𝐻(𝑓)   𝐿(𝑓)   𝑀(𝑓)   𝑂(𝑓)   𝑋(𝑓)

Proof of Theorem mapdval
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 mapdval.k . . . 4 (𝜑 → (𝐾𝑋𝑊𝐻))
2 mapdval.h . . . . 5 𝐻 = (LHyp‘𝐾)
3 mapdval.u . . . . 5 𝑈 = ((DVecH‘𝐾)‘𝑊)
4 mapdval.s . . . . 5 𝑆 = (LSubSp‘𝑈)
5 mapdval.f . . . . 5 𝐹 = (LFnl‘𝑈)
6 mapdval.l . . . . 5 𝐿 = (LKer‘𝑈)
7 mapdval.o . . . . 5 𝑂 = ((ocH‘𝐾)‘𝑊)
8 mapdval.m . . . . 5 𝑀 = ((mapd‘𝐾)‘𝑊)
92, 3, 4, 5, 6, 7, 8mapdfval 42442 . . . 4 ((𝐾𝑋𝑊𝐻) → 𝑀 = (𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)}))
101, 9syl 18 . . 3 (𝜑𝑀 = (𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)}))
1110fveq1d 6890 . 2 (𝜑 → (𝑀𝑇) = ((𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)})‘𝑇))
12 mapdval.t . . 3 (𝜑𝑇𝑆)
135fvexi 6902 . . . 4 𝐹 ∈ V
1413rabex 5314 . . 3 {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)} ∈ V
15 sseq2 3966 . . . . . 6 (𝑠 = 𝑇 → ((𝑂‘(𝐿𝑓)) ⊆ 𝑠 ↔ (𝑂‘(𝐿𝑓)) ⊆ 𝑇))
1615anbi2d 642 . . . . 5 (𝑠 = 𝑇 → (((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠) ↔ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)))
1716rabbidv 3426 . . . 4 (𝑠 = 𝑇 → {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)} = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
18 eqid 2766 . . . 4 (𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)}) = (𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)})
1917, 18fvmptg 6994 . . 3 ((𝑇𝑆 ∧ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)} ∈ V) → ((𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)})‘𝑇) = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
2012, 14, 19sylancl 598 . 2 (𝜑 → ((𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)})‘𝑇) = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
2111, 20eqtrd 2801 1 (𝜑 → (𝑀𝑇) = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  {crab 3419  Vcvv 3458  wss 3908  cmpt 5197  cfv 6543  LSubSpclss 21089  LFnlclfn 39872  LKerclk 39900  LHypclh 40799  DVecHcdvh 41893  ocHcoch 42162  mapdcmpd 42439
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pr 5409
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-mapd 42440
This theorem is used by:  mapdvalc  42444  mapddlssN  42455  mapdsn  42456  mapd1o  42463  mapd0  42480
  Copyright terms: Public domain W3C validator