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 42216
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 42215 . . . 4 ((𝐾𝑋𝑊𝐻) → 𝑀 = (𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)}))
101, 9syl 17 . . 3 (𝜑𝑀 = (𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)}))
1110fveq1d 6865 . 2 (𝜑 → (𝑀𝑇) = ((𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)})‘𝑇))
12 mapdval.t . . 3 (𝜑𝑇𝑆)
135fvexi 6877 . . . 4 𝐹 ∈ V
1413rabex 5294 . . 3 {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)} ∈ V
15 sseq2 3962 . . . . . 6 (𝑠 = 𝑇 → ((𝑂‘(𝐿𝑓)) ⊆ 𝑠 ↔ (𝑂‘(𝐿𝑓)) ⊆ 𝑇))
1615anbi2d 639 . . . . 5 (𝑠 = 𝑇 → (((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠) ↔ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)))
1716rabbidv 3420 . . . 4 (𝑠 = 𝑇 → {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)} = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
18 eqid 2761 . . . 4 (𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)}) = (𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)})
1917, 18fvmptg 6969 . . 3 ((𝑇𝑆 ∧ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)} ∈ V) → ((𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)})‘𝑇) = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
2012, 14, 19sylancl 595 . 2 (𝜑 → ((𝑠𝑆 ↦ {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑠)})‘𝑇) = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
2111, 20eqtrd 2796 1 (𝜑 → (𝑀𝑇) = {𝑓𝐹 ∣ ((𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓) ∧ (𝑂‘(𝐿𝑓)) ⊆ 𝑇)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1559  wcel 2141  {crab 3413  Vcvv 3453  wss 3904  cmpt 5180  cfv 6517  LSubSpclss 20978  LFnlclfn 39645  LKerclk 39673  LHypclh 40572  DVecHcdvh 41666  ocHcoch 41935  mapdcmpd 42212
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pr 5389
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-mapd 42213
This theorem is referenced by:  mapdvalc  42217  mapddlssN  42228  mapdsn  42229  mapd1o  42236  mapd0  42253
  Copyright terms: Public domain W3C validator