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 41998
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 41997 . . . 4 ((𝐾𝑋𝑊𝐻) → 𝑀 = (𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)}))
101, 9syl 17 . . 3 (𝜑𝑀 = (𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)}))
1110fveq1d 6844 . 2 (𝜑 → (𝑀𝑇) = ((𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)})‘𝑇))
12 mapdval.t . . 3 (𝜑𝑇𝑆)
135fvexi 6856 . . . 4 𝐹 ∈ V
1413rabex 5286 . . 3 {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)} ∈ V
15 sseq2 3962 . . . . . 6 (𝑠 = 𝑇 → ((𝑂‘(𝐿𝑓)) ⊆ 𝑠 ↔ (𝑂‘(𝐿𝑓)) ⊆ 𝑇))
1615anbi2d 631 . . . . 5 (𝑠 = 𝑇 → (((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠) ↔ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)))
1716rabbidv 3408 . . . 4 (𝑠 = 𝑇 → {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)} = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
18 eqid 2737 . . . 4 (𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)}) = (𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)})
1917, 18fvmptg 6947 . . 3 ((𝑇𝑆 ∧ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)} ∈ V) → ((𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)})‘𝑇) = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
2012, 14, 19sylancl 587 . 2 (𝜑 → ((𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)})‘𝑇) = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
2111, 20eqtrd 2772 1 (𝜑 → (𝑀𝑇) = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {crab 3401  Vcvv 3442  wss 3903  cmpt 5181  cfv 6500  LSubSpclss 20894  LFnlclfn 39427  LKerclk 39455  LHypclh 40354  DVecHcdvh 41448  ocHcoch 41717  mapdcmpd 41994
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-mapd 41995
This theorem is referenced by:  mapdvalc  41999  mapddlssN  42010  mapdsn  42011  mapd1o  42018  mapd0  42035
  Copyright terms: Public domain W3C validator