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

Theorem hdmap1ffval 37085
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 3212 . 2 (𝐾𝑋𝐾 ∈ V)
2 fveq2 6191 . . . . 5 (𝑘 = 𝐾 → (LHyp‘𝑘) = (LHyp‘𝐾))
3 hdmap1val.h . . . . 5 𝐻 = (LHyp‘𝐾)
42, 3syl6eqr 2674 . . . 4 (𝑘 = 𝐾 → (LHyp‘𝑘) = 𝐻)
5 fveq2 6191 . . . . . . 7 (𝑘 = 𝐾 → (DVecH‘𝑘) = (DVecH‘𝐾))
65fveq1d 6193 . . . . . 6 (𝑘 = 𝐾 → ((DVecH‘𝑘)‘𝑤) = ((DVecH‘𝐾)‘𝑤))
7 fveq2 6191 . . . . . . . . . 10 (𝑘 = 𝐾 → (LCDual‘𝑘) = (LCDual‘𝐾))
87fveq1d 6193 . . . . . . . . 9 (𝑘 = 𝐾 → ((LCDual‘𝑘)‘𝑤) = ((LCDual‘𝐾)‘𝑤))
9 fveq2 6191 . . . . . . . . . . . . 13 (𝑘 = 𝐾 → (mapd‘𝑘) = (mapd‘𝐾))
109fveq1d 6193 . . . . . . . . . . . 12 (𝑘 = 𝐾 → ((mapd‘𝑘)‘𝑤) = ((mapd‘𝐾)‘𝑤))
1110sbceq1d 3440 . . . . . . . . . . 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 3490 . . . . . . . . . 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 3490 . . . . . . . . 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 3442 . . . . . . . 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 3490 . . . . . . 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 3490 . . . . . 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 3442 . . . . 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 2741 . . . 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 4733 . . 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 37083 . . 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 6201 . . . . 5 (LHyp‘𝐾) ∈ V
223, 21eqeltri 2697 . . . 4 𝐻 ∈ V
2322mptex 6486 . . 3 (𝑤𝐻 ↦ {𝑎[((DVecH‘𝐾)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝐾)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝐾)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))}) ∈ V
2419, 20, 23fvmpt 6282 . 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 384   = wceq 1483  wcel 1990  {cab 2608  Vcvv 3200  [wsbc 3435  ifcif 4086  {csn 4177  cmpt 4729   × cxp 5112  cfv 5888  crio 6610  (class class class)co 6650  1st c1st 7166  2nd c2nd 7167  Basecbs 15857  0gc0g 16100  -gcsg 17424  LSpanclspn 18971  LHypclh 35270  DVecHcdvh 36367  LCDualclcd 36875  mapdcmpd 36913  HDMap1chdma1 37081
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-hdmap1 37083
This theorem is referenced by:  hdmap1fval  37086
  Copyright terms: Public domain W3C validator