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

Theorem hdmap1ffval 36103
 Description: Preliminary map from vectors to functionals in the closed kernel dual space. (Contributed by NM, 14-May-2015.)
Hypothesis
Ref Expression
hdmap1val.h 𝐻 = (LHyp‘𝐾)
Assertion
Ref Expression
hdmap1ffval (𝐾𝑋 → (HDMap1‘𝐾) = (𝑤𝐻 ↦ {𝑎[((DVecH‘𝐾)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝐾)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))}))
Distinct variable groups:   𝑤,𝐻   𝑎,𝑐,𝑑,𝑗,𝑚,𝑛,𝑢,𝑣,𝑤,𝐾   ,𝑎,𝑥,𝑐,𝑑,𝑗,𝑚,𝑛,𝑢,𝑣,𝑤
Allowed substitution hints:   𝐻(𝑥,𝑣,𝑢,,𝑗,𝑚,𝑛,𝑎,𝑐,𝑑)   𝐾(𝑥,)   𝑋(𝑥,𝑤,𝑣,𝑢,,𝑗,𝑚,𝑛,𝑎,𝑐,𝑑)

Proof of Theorem hdmap1ffval
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 elex 3185 . 2 (𝐾𝑋𝐾 ∈ V)
2 fveq2 6103 . . . . 5 (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3 hdmap1val.h . . . . 5 𝐻 = (LHyp‘𝐾)
42, 3syl6eqr 2662 . . . 4 (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5 fveq2 6103 . . . . . . 7 (𝑘 = 𝐾 → (DVecH‘𝑘) = (DVecH‘𝐾))
65fveq1d 6105 . . . . . 6 (𝑘 = 𝐾 → ((DVecH‘𝑘)‘𝑤) = ((DVecH‘𝐾)‘𝑤))
7 fveq2 6103 . . . . . . . . . 10 (𝑘 = 𝐾 → (LCDual‘𝑘) = (LCDual‘𝐾))
87fveq1d 6105 . . . . . . . . 9 (𝑘 = 𝐾 → ((LCDual‘𝑘)‘𝑤) = ((LCDual‘𝐾)‘𝑤))
9 fveq2 6103 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (mapd‘𝑘) = (mapd‘𝐾))
109fveq1d 6105 . . . . . . . . . . . 12 (𝑘 = 𝐾 → ((mapd‘𝑘)‘𝑤) = ((mapd‘𝐾)‘𝑤))
1110sbceq1d 3407 . . . . . . . . . . 11 (𝑘 = 𝐾 → ([((mapd‘𝑘)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))}))))) ↔ [((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))))
1211sbcbidv 3457 . . . . . . . . . 10 (𝑘 = 𝐾 → ([(LSpan‘𝑐) / 𝑗][((mapd‘𝑘)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))}))))) ↔ [(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))))
1312sbcbidv 3457 . . . . . . . . 9 (𝑘 = 𝐾 → ([(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝑘)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))}))))) ↔ [(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))))
148, 13sbceqbid 3409 . . . . . . . 8 (𝑘 = 𝐾 → ([((LCDual‘𝑘)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝑘)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))}))))) ↔ [((LCDual‘𝐾)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))))
1514sbcbidv 3457 . . . . . . 7 (𝑘 = 𝐾 → ([(LSpan‘𝑢) / 𝑛][((LCDual‘𝑘)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝑘)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))}))))) ↔ [(LSpan‘𝑢) / 𝑛][((LCDual‘𝐾)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))))
1615sbcbidv 3457 . . . . . 6 (𝑘 = 𝐾 → ([(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝑘)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝑘)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))}))))) ↔ [(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝐾)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))))
176, 16sbceqbid 3409 . . . . 5 (𝑘 = 𝐾 → ([((DVecH‘𝑘)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝑘)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝑘)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))}))))) ↔ [((DVecH‘𝐾)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝐾)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))))
1817abbidv 2728 . . . 4 (𝑘 = 𝐾 → {𝑎[((DVecH‘𝑘)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝑘)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝑘)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))} = {𝑎[((DVecH‘𝐾)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝐾)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))})
194, 18mpteq12dv 4663 . . 3 (𝑘 = 𝐾 → (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑎[((DVecH‘𝑘)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝑘)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝑘)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))}) = (𝑤𝐻 ↦ {𝑎[((DVecH‘𝐾)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝐾)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))}))
20 df-hdmap1 36101 . . 3 HDMap1 = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑎[((DVecH‘𝑘)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝑘)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝑘)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))}))
21 fvex 6113 . . . . 5 (LHyp‘𝐾) ∈ V
223, 21eqeltri 2684 . . . 4 𝐻 ∈ V
2322mptex 6390 . . 3 (𝑤𝐻 ↦ {𝑎[((DVecH‘𝐾)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝐾)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))}) ∈ V
2419, 20, 23fvmpt 6191 . 2 (𝐾 ∈ V → (HDMap1‘𝐾) = (𝑤𝐻 ↦ {𝑎[((DVecH‘𝐾)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝐾)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))}))
251, 24syl 17 1 (𝐾𝑋 → (HDMap1‘𝐾) = (𝑤𝐻 ↦ {𝑎[((DVecH‘𝐾)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝐾)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))}))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  {cab 2596  Vcvv 3173  [wsbc 3402  ifcif 4036  {csn 4125   ↦ cmpt 4643   × cxp 5036  ‘cfv 5804  ℩crio 6510  (class class class)co 6549  1st c1st 7057  2nd c2nd 7058  Basecbs 15695  0gc0g 15923  -gcsg 17247  LSpanclspn 18792  LHypclh 34288  DVecHcdvh 35385  LCDualclcd 35893  mapdcmpd 35931  HDMap1chdma1 36099 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-hdmap1 36101 This theorem is referenced by:  hdmap1fval  36104
 Copyright terms: Public domain W3C validator