HomeHome Metamath Proof Explorer
Theorem List (p. 374 of 429)
< Previous  Next >
Bad symbols? Try the
GIF version.

Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-27903)
  Hilbert Space Explorer  Hilbert Space Explorer
(27904-29428)
  Users' Mathboxes  Users' Mathboxes
(29429-42879)
 

Theorem List for Metamath Proof Explorer - 37301-37400   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremmapdpglem30a 37301 Lemma for mapdpg 37312. (Contributed by NM, 22-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐹)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))       (𝜑𝐺 ≠ (0g𝐶))
 
Theoremmapdpglem30b 37302 Lemma for mapdpg 37312. (Contributed by NM, 22-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐹)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))    &   (𝜑 → (𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅)}))))    &   (𝜑 → (𝑖𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑖}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅𝑖)}))))       (𝜑𝑖 ≠ (0g𝐶))
 
Theoremmapdpglem25 37303 Lemma for mapdpg 37312. Baer p. 45 line 12: "Then we have Gy' = Gy'' and G(x'-y') = G(x'-y'')." (Contributed by NM, 21-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐹)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))    &   (𝜑 → (𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅)}))))    &   (𝜑 → (𝑖𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑖}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅𝑖)}))))       (𝜑 → ((𝐽‘{}) = (𝐽‘{𝑖}) ∧ (𝐽‘{(𝐺𝑅)}) = (𝐽‘{(𝐺𝑅𝑖)})))
 
Theoremmapdpglem26 37304* Lemma for mapdpg 37312. Baer p. 45 line 14: "Consequently there exist numbers u,v in G neither of which is 0 such that y = uy'' and..." (We scope $d 𝑢𝜑 locally to avoid clashes with later substitutions into 𝜑.) (Contributed by NM, 22-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐹)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))    &   (𝜑 → (𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅)}))))    &   (𝜑 → (𝑖𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑖}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅𝑖)}))))    &   𝐴 = (Scalar‘𝑈)    &   𝐵 = (Base‘𝐴)    &    · = ( ·𝑠𝐶)    &   𝑂 = (0g𝐴)       (𝜑 → ∃𝑢 ∈ (𝐵 ∖ {𝑂}) = (𝑢 · 𝑖))
 
Theoremmapdpglem27 37305* Lemma for mapdpg 37312. Baer p. 45 line 16: "v(x'-y'') = x'-y'" (with equality swapped). (Contributed by NM, 22-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐹)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))    &   (𝜑 → (𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅)}))))    &   (𝜑 → (𝑖𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑖}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅𝑖)}))))    &   𝐴 = (Scalar‘𝑈)    &   𝐵 = (Base‘𝐴)    &    · = ( ·𝑠𝐶)    &   𝑂 = (0g𝐴)       (𝜑 → ∃𝑣 ∈ (𝐵 ∖ {𝑂})(𝐺𝑅) = (𝑣 · (𝐺𝑅𝑖)))
 
Theoremmapdpglem29 37306* Lemma for mapdpg 37312. Baer p. 45 line 16: "But Gx' and Gy'' are distinct points and so x' and y'' are independent elements in B. (Contributed by NM, 22-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐹)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))    &   (𝜑 → (𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅)}))))    &   (𝜑 → (𝑖𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑖}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅𝑖)}))))    &   𝐴 = (Scalar‘𝑈)    &   𝐵 = (Base‘𝐴)    &    · = ( ·𝑠𝐶)    &   𝑂 = (0g𝐴)    &   (𝜑𝑣𝐵)    &   (𝜑 = (𝑢 · 𝑖))    &   (𝜑 → (𝐺𝑅) = (𝑣 · (𝐺𝑅𝑖)))       (𝜑 → (𝐽‘{𝐺}) ≠ (𝐽‘{𝑖}))
 
Theoremmapdpglem28 37307* Lemma for mapdpg 37312. Baer p. 45 line 18: "vx'-vy'' = x'-uy''". (Contributed by NM, 22-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐹)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))    &   (𝜑 → (𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅)}))))    &   (𝜑 → (𝑖𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑖}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅𝑖)}))))    &   𝐴 = (Scalar‘𝑈)    &   𝐵 = (Base‘𝐴)    &    · = ( ·𝑠𝐶)    &   𝑂 = (0g𝐴)    &   (𝜑𝑣𝐵)    &   (𝜑 = (𝑢 · 𝑖))    &   (𝜑 → (𝐺𝑅) = (𝑣 · (𝐺𝑅𝑖)))       (𝜑 → ((𝑣 · 𝐺)𝑅(𝑣 · 𝑖)) = (𝐺𝑅(𝑢 · 𝑖)))
 
Theoremmapdpglem30 37308* Lemma for mapdpg 37312. Baer p. 45 line 18: "Hence we deduce (from mapdpglem28 37307, using lvecindp2 19187) that v = 1 and v = u...". TODO: would it be shorter to have only the 𝑣 = (1r𝐴) part and use mapdpglem28.u2 in mapdpglem31 37309? (Contributed by NM, 22-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐹)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))    &   (𝜑 → (𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅)}))))    &   (𝜑 → (𝑖𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑖}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅𝑖)}))))    &   𝐴 = (Scalar‘𝑈)    &   𝐵 = (Base‘𝐴)    &    · = ( ·𝑠𝐶)    &   𝑂 = (0g𝐴)    &   (𝜑𝑣𝐵)    &   (𝜑 = (𝑢 · 𝑖))    &   (𝜑 → (𝐺𝑅) = (𝑣 · (𝐺𝑅𝑖)))    &   (𝜑𝑢𝐵)       (𝜑 → (𝑣 = (1r𝐴) ∧ 𝑣 = 𝑢))
 
Theoremmapdpglem31 37309* Lemma for mapdpg 37312. Baer p. 45 line 19: "...and we have consequently that y' = y'', as we claimed." (Contributed by NM, 23-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐹)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))    &   (𝜑 → (𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅)}))))    &   (𝜑 → (𝑖𝐹 ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑖}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅𝑖)}))))    &   𝐴 = (Scalar‘𝑈)    &   𝐵 = (Base‘𝐴)    &    · = ( ·𝑠𝐶)    &   𝑂 = (0g𝐴)    &   (𝜑𝑣𝐵)    &   (𝜑 = (𝑢 · 𝑖))    &   (𝜑 → (𝐺𝑅) = (𝑣 · (𝐺𝑅𝑖)))    &   (𝜑𝑢𝐵)       (𝜑 = 𝑖)
 
Theoremmapdpglem24 37310* Lemma for mapdpg 37312. Existence part - consolidate hypotheses in mapdpglem23 37300. (Contributed by NM, 21-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐹)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))       (𝜑 → ∃𝐹 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅)})))
 
Theoremmapdpglem32 37311* Lemma for mapdpg 37312. Uniqueness part - consolidate hypotheses in mapdpglem31 37309. (Contributed by NM, 23-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐹)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))       ((𝜑 ∧ (𝐹𝑖𝐹) ∧ (((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅)})) ∧ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝑖}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅𝑖)})))) → = 𝑖)
 
Theoremmapdpg 37312* Part 1 of proof of the first fundamental theorem of projective geometry. Part (1) in [Baer] p. 44. Our notation corresponds to Baer's as follows: 𝑀 for *, 𝑁‘{} for F(), 𝐽‘{} for G(), 𝑋 for x, 𝐺 for x', 𝑌 for y, for y'. TODO: Rename variables per mapdhval 37330. (Contributed by NM, 22-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐹)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐺}))       (𝜑 → ∃!𝐹 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐺𝑅)})))
 
Theorembaerlem3lem1 37313 Lemma for baerlem3 37319. (Contributed by NM, 9-Apr-2015.)
𝑉 = (Base‘𝑊)    &    = (-g𝑊)    &    0 = (0g𝑊)    &    = (LSSum‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑊)    &    · = ( ·𝑠𝑊)    &   𝑅 = (Scalar‘𝑊)    &   𝐵 = (Base‘𝑅)    &    = (+g𝑅)    &   𝐿 = (-g𝑅)    &   𝑄 = (0g𝑅)    &   𝐼 = (invg𝑅)    &   (𝜑𝑎𝐵)    &   (𝜑𝑏𝐵)    &   (𝜑𝑑𝐵)    &   (𝜑𝑒𝐵)    &   (𝜑𝑗 = ((𝑎 · 𝑌) + (𝑏 · 𝑍)))    &   (𝜑𝑗 = ((𝑑 · (𝑋 𝑌)) + (𝑒 · (𝑋 𝑍))))       (𝜑𝑗 = (𝑎 · (𝑌 𝑍)))
 
Theorembaerlem5alem1 37314 Lemma for baerlem5a 37320. (Contributed by NM, 13-Apr-2015.)
𝑉 = (Base‘𝑊)    &    = (-g𝑊)    &    0 = (0g𝑊)    &    = (LSSum‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑊)    &    · = ( ·𝑠𝑊)    &   𝑅 = (Scalar‘𝑊)    &   𝐵 = (Base‘𝑅)    &    = (+g𝑅)    &   𝐿 = (-g𝑅)    &   𝑄 = (0g𝑅)    &   𝐼 = (invg𝑅)    &   (𝜑𝑎𝐵)    &   (𝜑𝑏𝐵)    &   (𝜑𝑑𝐵)    &   (𝜑𝑒𝐵)    &   (𝜑𝑗 = ((𝑎 · (𝑋 𝑌)) + (𝑏 · 𝑍)))    &   (𝜑𝑗 = ((𝑑 · (𝑋 𝑍)) + (𝑒 · 𝑌)))       (𝜑𝑗 = (𝑎 · (𝑋 (𝑌 + 𝑍))))
 
Theorembaerlem5blem1 37315 Lemma for baerlem5b 37321. (Contributed by NM, 9-Apr-2015.)
𝑉 = (Base‘𝑊)    &    = (-g𝑊)    &    0 = (0g𝑊)    &    = (LSSum‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑊)    &    · = ( ·𝑠𝑊)    &   𝑅 = (Scalar‘𝑊)    &   𝐵 = (Base‘𝑅)    &    = (+g𝑅)    &   𝐿 = (-g𝑅)    &   𝑄 = (0g𝑅)    &   𝐼 = (invg𝑅)    &   (𝜑𝑎𝐵)    &   (𝜑𝑏𝐵)    &   (𝜑𝑑𝐵)    &   (𝜑𝑒𝐵)    &   (𝜑𝑗 = ((𝑎 · 𝑌) + (𝑏 · 𝑍)))    &   (𝜑𝑗 = ((𝑑 · (𝑋 (𝑌 + 𝑍))) + (𝑒 · 𝑋)))       (𝜑𝑗 = ((𝐼𝑑) · (𝑌 + 𝑍)))
 
Theorembaerlem3lem2 37316 Lemma for baerlem3 37319. (Contributed by NM, 9-Apr-2015.)
𝑉 = (Base‘𝑊)    &    = (-g𝑊)    &    0 = (0g𝑊)    &    = (LSSum‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑊)    &    · = ( ·𝑠𝑊)    &   𝑅 = (Scalar‘𝑊)    &   𝐵 = (Base‘𝑅)    &    = (+g𝑅)    &   𝐿 = (-g𝑅)    &   𝑄 = (0g𝑅)    &   𝐼 = (invg𝑅)       (𝜑 → (𝑁‘{(𝑌 𝑍)}) = (((𝑁‘{𝑌}) (𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 𝑌)}) (𝑁‘{(𝑋 𝑍)}))))
 
Theorembaerlem5alem2 37317 Lemma for baerlem5a 37320. (Contributed by NM, 9-Apr-2015.)
𝑉 = (Base‘𝑊)    &    = (-g𝑊)    &    0 = (0g𝑊)    &    = (LSSum‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑊)    &    · = ( ·𝑠𝑊)    &   𝑅 = (Scalar‘𝑊)    &   𝐵 = (Base‘𝑅)    &    = (+g𝑅)    &   𝐿 = (-g𝑅)    &   𝑄 = (0g𝑅)    &   𝐼 = (invg𝑅)       (𝜑 → (𝑁‘{(𝑋 (𝑌 + 𝑍))}) = (((𝑁‘{(𝑋 𝑌)}) (𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 𝑍)}) (𝑁‘{𝑌}))))
 
Theorembaerlem5blem2 37318 Lemma for baerlem5b 37321. (Contributed by NM, 13-Apr-2015.)
𝑉 = (Base‘𝑊)    &    = (-g𝑊)    &    0 = (0g𝑊)    &    = (LSSum‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑊)    &    · = ( ·𝑠𝑊)    &   𝑅 = (Scalar‘𝑊)    &   𝐵 = (Base‘𝑅)    &    = (+g𝑅)    &   𝐿 = (-g𝑅)    &   𝑄 = (0g𝑅)    &   𝐼 = (invg𝑅)       (𝜑 → (𝑁‘{(𝑌 + 𝑍)}) = (((𝑁‘{𝑌}) (𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 (𝑌 + 𝑍))}) (𝑁‘{𝑋}))))
 
Theorembaerlem3 37319 An equality that holds when 𝑋, 𝑌, 𝑍 are independent (non-colinear) vectors. Part (3) in [Baer] p. 45. TODO fix ref. (Contributed by NM, 9-Apr-2015.)
𝑉 = (Base‘𝑊)    &    = (-g𝑊)    &    0 = (0g𝑊)    &    = (LSSum‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝑁‘{(𝑌 𝑍)}) = (((𝑁‘{𝑌}) (𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 𝑌)}) (𝑁‘{(𝑋 𝑍)}))))
 
Theorembaerlem5a 37320 An equality that holds when 𝑋, 𝑌, 𝑍 are independent (non-colinear) vectors. First equation of part (5) in [Baer] p. 46. (Contributed by NM, 10-Apr-2015.)
𝑉 = (Base‘𝑊)    &    = (-g𝑊)    &    0 = (0g𝑊)    &    = (LSSum‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑊)       (𝜑 → (𝑁‘{(𝑋 (𝑌 + 𝑍))}) = (((𝑁‘{(𝑋 𝑌)}) (𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 𝑍)}) (𝑁‘{𝑌}))))
 
Theorembaerlem5b 37321 An equality that holds when 𝑋, 𝑌, 𝑍 are independent (non-colinear) vectors. Second equation of part (5) in [Baer] p. 46. (Contributed by NM, 13-Apr-2015.)
𝑉 = (Base‘𝑊)    &    = (-g𝑊)    &    0 = (0g𝑊)    &    = (LSSum‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑊)       (𝜑 → (𝑁‘{(𝑌 + 𝑍)}) = (((𝑁‘{𝑌}) (𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 (𝑌 + 𝑍))}) (𝑁‘{𝑋}))))
 
Theorembaerlem5amN 37322 An equality that holds when 𝑋, 𝑌, 𝑍 are independent (non-colinear) vectors. Subtraction version of first equation of part (5) in [Baer] p. 46. TODO: This is the subtraction version, may not be needed. TODO: delete if baerlem5abmN 37324 is used. (Contributed by NM, 24-May-2015.) (New usage is discouraged.)
𝑉 = (Base‘𝑊)    &    = (-g𝑊)    &    0 = (0g𝑊)    &    = (LSSum‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑊)       (𝜑 → (𝑁‘{(𝑋 (𝑌 𝑍))}) = (((𝑁‘{(𝑋 𝑌)}) (𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 + 𝑍)}) (𝑁‘{𝑌}))))
 
Theorembaerlem5bmN 37323 An equality that holds when 𝑋, 𝑌, 𝑍 are independent (non-colinear) vectors. Subtraction version of second equation of part (5) in [Baer] p. 46. TODO: This is the subtraction version, may not be needed. TODO: delete if baerlem5abmN 37324 is used. (Contributed by NM, 24-May-2015.) (New usage is discouraged.)
𝑉 = (Base‘𝑊)    &    = (-g𝑊)    &    0 = (0g𝑊)    &    = (LSSum‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑊)       (𝜑 → (𝑁‘{(𝑌 𝑍)}) = (((𝑁‘{𝑌}) (𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 (𝑌 𝑍))}) (𝑁‘{𝑋}))))
 
Theorembaerlem5abmN 37324 An equality that holds when 𝑋, 𝑌, 𝑍 are independent (non-colinear) vectors. Subtraction versions of first and second equations of part (5) in [Baer] p. 46, conjoined to share commonality in their proofs. TODO: Delete if not be needed. (Contributed by NM, 24-May-2015.) (New usage is discouraged.)
𝑉 = (Base‘𝑊)    &    = (-g𝑊)    &    0 = (0g𝑊)    &    = (LSSum‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑊)       (𝜑 → ((𝑁‘{(𝑋 (𝑌 𝑍))}) = (((𝑁‘{(𝑋 𝑌)}) (𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 + 𝑍)}) (𝑁‘{𝑌}))) ∧ (𝑁‘{(𝑌 𝑍)}) = (((𝑁‘{𝑌}) (𝑁‘{𝑍})) ∩ ((𝑁‘{(𝑋 (𝑌 𝑍))}) (𝑁‘{𝑋})))))
 
Theoremmapdindp0 37325 Vector independence lemma. (Contributed by NM, 29-Apr-2015.)
𝑉 = (Base‘𝑊)    &    + = (+g𝑊)    &    0 = (0g𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))    &   (𝜑 → (𝑌 + 𝑍) ≠ 0 )       (𝜑 → (𝑁‘{(𝑌 + 𝑍)}) = (𝑁‘{𝑌}))
 
Theoremmapdindp1 37326 Vector independence lemma. (Contributed by NM, 1-May-2015.)
𝑉 = (Base‘𝑊)    &    + = (+g𝑊)    &    0 = (0g𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))       (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{(𝑌 + 𝑍)}))
 
Theoremmapdindp2 37327 Vector independence lemma. (Contributed by NM, 1-May-2015.)
𝑉 = (Base‘𝑊)    &    + = (+g𝑊)    &    0 = (0g𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))       (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, (𝑌 + 𝑍)}))
 
Theoremmapdindp3 37328 Vector independence lemma. (Contributed by NM, 29-Apr-2015.)
𝑉 = (Base‘𝑊)    &    + = (+g𝑊)    &    0 = (0g𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))       (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{(𝑤 + 𝑌)}))
 
Theoremmapdindp4 37329 Vector independence lemma. (Contributed by NM, 29-Apr-2015.)
𝑉 = (Base‘𝑊)    &    + = (+g𝑊)    &    0 = (0g𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))       (𝜑 → ¬ 𝑍 ∈ (𝑁‘{𝑋, (𝑤 + 𝑌)}))
 
Theoremmapdhval 37330* Lemmma for ~? mapdh . (Contributed by NM, 3-Apr-2015.) (Revised by Mario Carneiro, 6-May-2015.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑𝑋𝐴)    &   (𝜑𝐹𝐵)    &   (𝜑𝑌𝐸)       (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))))
 
Theoremmapdhval0 37331* Lemmma for ~? mapdh . (Contributed by NM, 3-Apr-2015.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &    0 = (0g𝑈)    &   (𝜑𝑋𝐴)    &   (𝜑𝐹𝐵)       (𝜑 → (𝐼‘⟨𝑋, 𝐹, 0 ⟩) = 𝑄)
 
Theoremmapdhval2 37332* Lemmma for ~? mapdh . (Contributed by NM, 3-Apr-2015.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑𝑋𝐴)    &   (𝜑𝐹𝐵)    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)}))))
 
Theoremmapdhcl 37333* Lemmma for ~? mapdh . (Contributed by NM, 3-Apr-2015.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌𝑉)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))       (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) ∈ 𝐷)
 
Theoremmapdheq 37334* Lemmma for ~? mapdh . The defining equation for h(x,x',y)=y' in part (2) in [Baer] p. 45 line 24. (Contributed by NM, 4-Apr-2015.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐷)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))       (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺 ↔ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝐺}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅𝐺)}))))
 
Theoremmapdheq2 37335* Lemmma for ~? mapdh . One direction of part (2) in [Baer] p. 45. (Contributed by NM, 4-Apr-2015.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐷)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))       (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺 → (𝐼‘⟨𝑌, 𝐺, 𝑋⟩) = 𝐹))
 
Theoremmapdheq2biN 37336* Lemmma for ~? mapdh . Part (2) in [Baer] p. 45. The bidirectional version of mapdheq2 37335 seems to require an additional hypothesis not mentioned in Baer. TODO fix ref. TODO: We probably don't need this; delete if never used. (Contributed by NM, 4-Apr-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝐺𝐷)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝐺}))       (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺 ↔ (𝐼‘⟨𝑌, 𝐺, 𝑋⟩) = 𝐹))
 
Theoremmapdheq4lem 37337* Lemma for mapdheq4 37338. Part (4) in [Baer] p. 46. (Contributed by NM, 12-Apr-2015.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)       (𝜑 → (𝑀‘(𝑁‘{(𝑌 𝑍)})) = (𝐽‘{(𝐺𝑅𝐸)}))
 
Theoremmapdheq4 37338* Lemma for ~? mapdh . Part (4) in [Baer] p. 46. (Contributed by NM, 12-Apr-2015.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑍⟩) = 𝐸)
 
Theoremmapdh6lem1N 37339* Lemma for mapdh6N 37353. Part (6) in [Baer] p. 47, lines 16-18. (Contributed by NM, 13-Apr-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)       (𝜑 → (𝑀‘(𝑁‘{(𝑋 (𝑌 + 𝑍))})) = (𝐽‘{(𝐹𝑅(𝐺 𝐸))}))
 
Theoremmapdh6lem2N 37340* Lemma for mapdh6N 37353. Part (6) in [Baer] p. 47, lines 20-22. (Contributed by NM, 13-Apr-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)       (𝜑 → (𝑀‘(𝑁‘{(𝑌 + 𝑍)})) = (𝐽‘{(𝐺 𝐸)}))
 
Theoremmapdh6aN 37341* Lemma for mapdh6N 37353. Part (6) in [Baer] p. 47, case 1. (Contributed by NM, 23-Apr-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)       (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
 
Theoremmapdh6b0N 37342* Lemmma for mapdh6N 37353. (Contributed by NM, 23-Apr-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑𝑌𝑉)    &   (𝜑𝑍𝑉)    &   (𝜑 → ((𝑁‘{𝑋}) ∩ (𝑁‘{𝑌, 𝑍})) = { 0 })       (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))
 
Theoremmapdh6bN 37343* Lemmma for mapdh6N 37353. (Contributed by NM, 24-Apr-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑𝑌 = 0 )    &   (𝜑𝑍𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))       (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
 
Theoremmapdh6cN 37344* Lemmma for mapdh6N 37353. (Contributed by NM, 24-Apr-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑𝑌𝑉)    &   (𝜑𝑍 = 0 )    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))       (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
 
Theoremmapdh6dN 37345* Lemmma for mapdh6N 37353. (Contributed by NM, 1-May-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))       (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑤 + (𝑌 + 𝑍))⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑤⟩) (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩)))
 
Theoremmapdh6eN 37346* Lemmma for mapdh6N 37353. Part (6) in [Baer] p. 47 line 38. (Contributed by NM, 1-May-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))       (𝜑 → (𝐼‘⟨𝑋, 𝐹, ((𝑤 + 𝑌) + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, (𝑤 + 𝑌)⟩) (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
 
Theoremmapdh6fN 37347* Lemmma for mapdh6N 37353. Part (6) in [Baer] p. 47 line 38. (Contributed by NM, 1-May-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))       (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑤 + 𝑌)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑤⟩) (𝐼‘⟨𝑋, 𝐹, 𝑌⟩)))
 
Theoremmapdh6gN 37348* Lemmma for mapdh6N 37353. Part (6) of [Baer] p. 47 line 39. (Contributed by NM, 1-May-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))       (𝜑 → ((𝐼‘⟨𝑋, 𝐹, 𝑤⟩) (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩)) = (((𝐼‘⟨𝑋, 𝐹, 𝑤⟩) (𝐼‘⟨𝑋, 𝐹, 𝑌⟩)) (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
 
Theoremmapdh6hN 37349* Lemmma for mapdh6N 37353. Part (6) of [Baer] p. 48 line 2. (Contributed by NM, 1-May-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑋, 𝑌}))       (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
 
Theoremmapdh6iN 37350* Lemmma for mapdh6N 37353. Eliminate auxiliary vector 𝑤. (Contributed by NM, 1-May-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) = (𝑁‘{𝑍}))       (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
 
Theoremmapdh6jN 37351* Lemmma for mapdh6N 37353. Eliminate (𝑁 { Y } ) = ( N {𝑍}) hypothesis. (Contributed by NM, 1-May-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
 
Theoremmapdh6kN 37352* Lemmma for mapdh6N 37353. Eliminate nonzero vector requirement. (Contributed by NM, 1-May-2015.) (New usage is discouraged.)
𝑄 = (0g𝐶)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   𝐻 = (LHyp‘𝐾)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &    + = (+g𝑈)    &    = (+g𝐶)    &   (𝜑𝑌𝑉)    &   (𝜑𝑍𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))       (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
 
Theoremmapdh6N 37353* Part (6) of [Baer] p. 47 line 6. Note that we use ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}) which is equivalent to Baer's "Fx (Fy + Fz)" by lspdisjb 19174. TODO: If $ds with 𝐼 and 𝜑 becomes a problem later, cbv's on 𝐼 variables here to get rid of them. . Maybe reorder hypotheses in lemmas to the more consistent order of this theorem, so they can be shared with this theorem. (Contributed by NM, 1-May-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    + = (+g𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &    = (+g𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌𝑉)    &   (𝜑𝑍𝑉)    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))       (𝜑 → (𝐼‘⟨𝑋, 𝐹, (𝑌 + 𝑍)⟩) = ((𝐼‘⟨𝑋, 𝐹, 𝑌⟩) (𝐼‘⟨𝑋, 𝐹, 𝑍⟩)))
 
Theoremmapdh7eN 37354* Part (7) of [Baer] p. 48 line 10 (5 of 6 cases). (Note: 1 of 6 and 2 of 6 are hypotheses a and b.) (Contributed by NM, 2-May-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑢})) = (𝐽‘{𝐹}))    &   (𝜑𝑢 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑣 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑢}) ≠ (𝑁‘{𝑣}))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑢, 𝑣}))    &   (𝜑 → (𝐼‘⟨𝑢, 𝐹, 𝑤⟩) = 𝐸)       (𝜑 → (𝐼‘⟨𝑤, 𝐸, 𝑢⟩) = 𝐹)
 
Theoremmapdh7cN 37355* Part (7) of [Baer] p. 48 line 10 (3 of 6 cases). (Contributed by NM, 2-May-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑢})) = (𝐽‘{𝐹}))    &   (𝜑𝑢 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑣 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑢}) ≠ (𝑁‘{𝑣}))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑢, 𝑣}))    &   (𝜑 → (𝐼‘⟨𝑢, 𝐹, 𝑣⟩) = 𝐺)       (𝜑 → (𝐼‘⟨𝑣, 𝐺, 𝑢⟩) = 𝐹)
 
Theoremmapdh7dN 37356* Part (7) of [Baer] p. 48 line 10 (4 of 6 cases). (Contributed by NM, 2-May-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑢})) = (𝐽‘{𝐹}))    &   (𝜑𝑢 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑣 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑢}) ≠ (𝑁‘{𝑣}))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑢, 𝑣}))    &   (𝜑 → (𝐼‘⟨𝑢, 𝐹, 𝑣⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑢, 𝐹, 𝑤⟩) = 𝐸)       (𝜑 → (𝐼‘⟨𝑣, 𝐺, 𝑤⟩) = 𝐸)
 
Theoremmapdh7fN 37357* Part (7) of [Baer] p. 48 line 10 (6 of 6 cases). (Contributed by NM, 2-May-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑢})) = (𝐽‘{𝐹}))    &   (𝜑𝑢 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑣 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑢}) ≠ (𝑁‘{𝑣}))    &   (𝜑 → ¬ 𝑤 ∈ (𝑁‘{𝑢, 𝑣}))    &   (𝜑 → (𝐼‘⟨𝑢, 𝐹, 𝑣⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑢, 𝐹, 𝑤⟩) = 𝐸)       (𝜑 → (𝐼‘⟨𝑤, 𝐸, 𝑣⟩) = 𝐺)
 
Theoremmapdh75e 37358* Part (7) of [Baer] p. 48 line 10 (5 of 6 cases). 𝑋, 𝑌, 𝑍 are Baer's u, v, w. (Note: Cases 1 of 6 and 2 of 6 are hypotheses mapdh75b here and mapdh75a in mapdh75cN 37359.) (Contributed by NM, 2-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑍}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝐼‘⟨𝑍, 𝐸, 𝑋⟩) = 𝐹)
 
Theoremmapdh75cN 37359* Part (7) of [Baer] p. 48 line 10 (3 of 6 cases). (Contributed by NM, 2-May-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑋⟩) = 𝐹)
 
Theoremmapdh75d 37360* Part (7) of [Baer] p. 48 line 10 (4 of 6 cases). (Contributed by NM, 2-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑍⟩) = 𝐸)
 
Theoremmapdh75fN 37361* Part (7) of [Baer] p. 48 line 10 (6 of 6 cases). (Contributed by NM, 2-May-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝐼‘⟨𝑍, 𝐸, 𝑌⟩) = 𝐺)
 
Syntaxchvm 37362 Extend class notation with vector to dual map.
class HVMap
 
Definitiondf-hvmap 37363* Extend class notation with a map from each nonzero vector 𝑥 to a unique nonzero functional in the closed kernel dual space. (We could extend it to include the zero vector, but that is unnecessary for our purposes.) TODO: This pattern is used several times earlier e.g. lcf1o 37157, dochfl1 37082- should we update those to use this definition? (Contributed by NM, 23-Mar-2015.)
HVMap = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑥 ∈ ((Base‘((DVecH‘𝑘)‘𝑤)) ∖ {(0g‘((DVecH‘𝑘)‘𝑤))}) ↦ (𝑣 ∈ (Base‘((DVecH‘𝑘)‘𝑤)) ↦ (𝑗 ∈ (Base‘(Scalar‘((DVecH‘𝑘)‘𝑤)))∃𝑡 ∈ (((ocH‘𝑘)‘𝑤)‘{𝑥})𝑣 = (𝑡(+g‘((DVecH‘𝑘)‘𝑤))(𝑗( ·𝑠 ‘((DVecH‘𝑘)‘𝑤))𝑥)))))))
 
Theoremhvmapffval 37364* Map from nonzero vectors to nonzero functionals in the closed kernel dual space. (Contributed by NM, 23-Mar-2015.)
𝐻 = (LHyp‘𝐾)       (𝐾𝑋 → (HVMap‘𝐾) = (𝑤𝐻 ↦ (𝑥 ∈ ((Base‘((DVecH‘𝐾)‘𝑤)) ∖ {(0g‘((DVecH‘𝐾)‘𝑤))}) ↦ (𝑣 ∈ (Base‘((DVecH‘𝐾)‘𝑤)) ↦ (𝑗 ∈ (Base‘(Scalar‘((DVecH‘𝐾)‘𝑤)))∃𝑡 ∈ (((ocH‘𝐾)‘𝑤)‘{𝑥})𝑣 = (𝑡(+g‘((DVecH‘𝐾)‘𝑤))(𝑗( ·𝑠 ‘((DVecH‘𝐾)‘𝑤))𝑥)))))))
 
Theoremhvmapfval 37365* Map from nonzero vectors to nonzero functionals in the closed kernel dual space. (Contributed by NM, 23-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑂 = ((ocH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    + = (+g𝑈)    &    · = ( ·𝑠𝑈)    &    0 = (0g𝑈)    &   𝑆 = (Scalar‘𝑈)    &   𝑅 = (Base‘𝑆)    &   𝑀 = ((HVMap‘𝐾)‘𝑊)    &   (𝜑 → (𝐾𝐴𝑊𝐻))       (𝜑𝑀 = (𝑥 ∈ (𝑉 ∖ { 0 }) ↦ (𝑣𝑉 ↦ (𝑗𝑅𝑡 ∈ (𝑂‘{𝑥})𝑣 = (𝑡 + (𝑗 · 𝑥))))))
 
Theoremhvmapval 37366* Value of map from nonzero vectors to nonzero functionals in the closed kernel dual space. (Contributed by NM, 23-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑂 = ((ocH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    + = (+g𝑈)    &    · = ( ·𝑠𝑈)    &    0 = (0g𝑈)    &   𝑆 = (Scalar‘𝑈)    &   𝑅 = (Base‘𝑆)    &   𝑀 = ((HVMap‘𝐾)‘𝑊)    &   (𝜑 → (𝐾𝐴𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝑀𝑋) = (𝑣𝑉 ↦ (𝑗𝑅𝑡 ∈ (𝑂‘{𝑋})𝑣 = (𝑡 + (𝑗 · 𝑋)))))
 
TheoremhvmapvalvalN 37367* Value of value of map (i.e. functional value) from nonzero vectors to nonzero functionals in the closed kernel dual space. (Contributed by NM, 23-Mar-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑂 = ((ocH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    + = (+g𝑈)    &    · = ( ·𝑠𝑈)    &    0 = (0g𝑈)    &   𝑆 = (Scalar‘𝑈)    &   𝑅 = (Base‘𝑆)    &   𝑀 = ((HVMap‘𝐾)‘𝑊)    &   (𝜑 → (𝐾𝐴𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌𝑉)       (𝜑 → ((𝑀𝑋)‘𝑌) = (𝑗𝑅𝑡 ∈ (𝑂‘{𝑋})𝑌 = (𝑡 + (𝑗 · 𝑋))))
 
TheoremhvmapidN 37368 The value of the vector to functional map, at the vector, is one. (Contributed by NM, 23-Mar-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    0 = (0g𝑈)    &   𝑆 = (Scalar‘𝑈)    &    1 = (1r𝑆)    &   𝑀 = ((HVMap‘𝐾)‘𝑊)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))       (𝜑 → ((𝑀𝑋)‘𝑋) = 1 )
 
Theoremhvmap1o 37369* The vector to functional map provides a bijection from nonzero vectors 𝑉 to nonzero functionals with closed kernels 𝐶. (Contributed by NM, 27-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑂 = ((ocH‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    0 = (0g𝑈)    &   𝐹 = (LFnl‘𝑈)    &   𝐿 = (LKer‘𝑈)    &   𝐷 = (LDual‘𝑈)    &   𝑄 = (0g𝐷)    &   𝐶 = {𝑓𝐹 ∣ (𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓)}    &   𝑀 = ((HVMap‘𝐾)‘𝑊)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))       (𝜑𝑀:(𝑉 ∖ { 0 })–1-1-onto→(𝐶 ∖ {𝑄}))
 
TheoremhvmapclN 37370* Closure of the vector to functional map. (Contributed by NM, 27-Mar-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑂 = ((ocH‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    0 = (0g𝑈)    &   𝐹 = (LFnl‘𝑈)    &   𝐿 = (LKer‘𝑈)    &   𝐷 = (LDual‘𝑈)    &   𝑄 = (0g𝐷)    &   𝐶 = {𝑓𝐹 ∣ (𝑂‘(𝑂‘(𝐿𝑓))) = (𝐿𝑓)}    &   𝑀 = ((HVMap‘𝐾)‘𝑊)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝑀𝑋) ∈ (𝐶 ∖ {𝑄}))
 
Theoremhvmap1o2 37371 The vector to functional map provides a bijection from nonzero vectors 𝑉 to nonzero functionals with closed kernels 𝐶. (Contributed by NM, 27-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    0 = (0g𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑂 = (0g𝐶)    &   𝑀 = ((HVMap‘𝐾)‘𝑊)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))       (𝜑𝑀:(𝑉 ∖ { 0 })–1-1-onto→(𝐹 ∖ {𝑂}))
 
Theoremhvmapcl2 37372 Closure of the vector to functional map. (Contributed by NM, 27-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    0 = (0g𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐹 = (Base‘𝐶)    &   𝑂 = (0g𝐶)    &   𝑀 = ((HVMap‘𝐾)‘𝑊)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝑀𝑋) ∈ (𝐹 ∖ {𝑂}))
 
Theoremhvmaplfl 37373 The vector to functional map value is a functional. (Contributed by NM, 28-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    0 = (0g𝑈)    &   𝐹 = (LFnl‘𝑈)    &   𝑀 = ((HVMap‘𝐾)‘𝑊)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝑀𝑋) ∈ 𝐹)
 
Theoremhvmaplkr 37374 Kernel of the vector to functional map. TODO: make this become lcfrlem11 37159. (Contributed by NM, 29-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑂 = ((ocH‘𝐾)‘𝑊)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    0 = (0g𝑈)    &   𝐿 = (LKer‘𝑈)    &   𝑀 = ((HVMap‘𝐾)‘𝑊)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝐿‘(𝑀𝑋)) = (𝑂‘{𝑋}))
 
Theoremmapdhvmap 37375 Relationship between mapd and HVMap, which can be used to satify the last hypothesis of mapdpg 37312. Equation 10 of [Baer] p. 48. (Contributed by NM, 29-Mar-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝑃 = ((HVMap‘𝐾)‘𝑊)    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{(𝑃𝑋)}))
 
Theoremlspindp5 37376 Obtain an independent vector set 𝑈, 𝑋, 𝑌 from a vector 𝑈 dependent on 𝑋 and 𝑍 and another independent set 𝑍, 𝑋, 𝑌. (Here we don't show the (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) part of the independence, which passes straight through. We also don't show nonzero vector requirements that are redundant for this theorem. Different orderings can be obtained using lspexch 19177 and prcom 4299.) (Contributed by NM, 4-May-2015.)
𝑉 = (Base‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑𝑌𝑉)    &   (𝜑𝑈𝑉)    &   (𝜑𝑍 ∈ (𝑁‘{𝑋, 𝑈}))    &   (𝜑 → ¬ 𝑍 ∈ (𝑁‘{𝑋, 𝑌}))       (𝜑 → ¬ 𝑈 ∈ (𝑁‘{𝑋, 𝑌}))
 
Theoremhdmaplem1 37377 Lemma to convert a frequently-used union condition. TODO: see if this can be applied to other hdmap* theorems. (Contributed by NM, 17-May-2015.)
𝑉 = (Base‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LMod)    &   (𝜑𝑍𝑉)    &   (𝜑 → ¬ 𝑍 ∈ ((𝑁‘{𝑋}) ∪ (𝑁‘{𝑌})))    &   (𝜑𝑋𝑉)       (𝜑 → (𝑁‘{𝑍}) ≠ (𝑁‘{𝑋}))
 
Theoremhdmaplem2N 37378 Lemma to convert a frequently-used union condition. TODO: see if this can be applied to other hdmap* theorems. (Contributed by NM, 17-May-2015.) (New usage is discouraged.)
𝑉 = (Base‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LMod)    &   (𝜑𝑍𝑉)    &   (𝜑 → ¬ 𝑍 ∈ ((𝑁‘{𝑋}) ∪ (𝑁‘{𝑌})))    &   (𝜑𝑌𝑉)       (𝜑 → (𝑁‘{𝑍}) ≠ (𝑁‘{𝑌}))
 
Theoremhdmaplem3 37379 Lemma to convert a frequently-used union condition. TODO: see if this can be applied to other hdmap* theorems. (Contributed by NM, 17-May-2015.)
𝑉 = (Base‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &   (𝜑𝑊 ∈ LMod)    &   (𝜑𝑍𝑉)    &   (𝜑 → ¬ 𝑍 ∈ ((𝑁‘{𝑋}) ∪ (𝑁‘{𝑌})))    &   (𝜑𝑌𝑉)    &    0 = (0g𝑊)       (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))
 
Theoremhdmaplem4 37380 Lemma to convert a frequently-used union condition. TODO: see if this can be applied to other hdmap* theorems. (Contributed by NM, 17-May-2015.)
𝑉 = (Base‘𝑊)    &   𝑁 = (LSpan‘𝑊)    &    0 = (0g𝑊)    &   (𝜑𝑊 ∈ LVec)    &   (𝜑𝑋𝑉)    &   (𝜑𝑌𝑉)    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑍}) ≠ (𝑁‘{𝑋}))    &   (𝜑 → (𝑁‘{𝑍}) ≠ (𝑁‘{𝑌}))       (𝜑 → ¬ 𝑍 ∈ ((𝑁‘{𝑋}) ∪ (𝑁‘{𝑌})))
 
Theoremmapdh8a 37381* Part of Part (8) in [Baer] p. 48. (Contributed by NM, 5-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇}))       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))
 
Theoremmapdh8aa 37382* Part of Part (8) in [Baer] p. 48. (Contributed by NM, 12-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑍}) ≠ (𝑁‘{𝑇}))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → ¬ 𝑌 ∈ (𝑁‘{𝑍, 𝑇}))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑍, 𝐸, 𝑇⟩))
 
Theoremmapdh8ab 37383* Part of Part (8) in [Baer] p. 48. (Contributed by NM, 13-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍}))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍}))    &   (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{𝑇}))       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑍, 𝐸, 𝑇⟩))
 
Theoremmapdh8ac 37384* Part of Part (8) in [Baer] p. 48. (Contributed by NM, 13-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{𝑇}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑤⟩) = 𝐵)    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑤}))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑤}))    &   (𝜑 → (𝑁‘{𝑤}) ≠ (𝑁‘{𝑍}))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑤, 𝑍}))       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑍, 𝐸, 𝑇⟩))
 
Theoremmapdh8ad 37385* Part of Part (8) in [Baer] p. 48. (Contributed by NM, 13-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑍⟩) = 𝐸)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑋}) = (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑍}))       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑍, 𝐸, 𝑇⟩))
 
Theoremmapdh8b 37386* Part of Part (8) in [Baer] p. 48. (Contributed by NM, 6-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐺𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑌})) = (𝐽‘{𝐺}))    &   (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑤⟩) = 𝐸)    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑤}) ≠ (𝑁‘{𝑇}))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑤}))    &   (𝜑𝑋 ∈ (𝑁‘{𝑌, 𝑇}))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑤}))       (𝜑 → (𝐼‘⟨𝑤, 𝐸, 𝑇⟩) = (𝐼‘⟨𝑌, 𝐺, 𝑇⟩))
 
Theoremmapdh8c 37387* Part of Part (8) in [Baer] p. 48. (Contributed by NM, 6-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑤⟩) = 𝐸)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑤}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑤}))    &   (𝜑𝑋 ∈ (𝑁‘{𝑌, 𝑇}))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑤}))       (𝜑 → (𝐼‘⟨𝑤, 𝐸, 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))
 
Theoremmapdh8d0N 37388* Part of Part (8) in [Baer] p. 48. (Contributed by NM, 10-May-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑤}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑤}))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑤}))    &   (𝜑𝑋 ∈ (𝑁‘{𝑌, 𝑇}))       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))
 
Theoremmapdh8d 37389* Part of Part (8) in [Baer] p. 48. (Contributed by NM, 6-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))    &   (𝜑𝑤 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑤}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑤}))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑤}))       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))
 
Theoremmapdh8e 37390* Part of Part (8) in [Baer] p. 48. Eliminate 𝑤. (Contributed by NM, 10-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))    &   (𝜑𝑋 ∈ (𝑁‘{𝑌, 𝑇}))       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))
 
Theoremmapdh8fN 37391* Part of Part (8) in [Baer] p. 48. Eliminate 𝑤. TODO: this is an instance of mapdh8a 37381- delete this? (Contributed by NM, 10-May-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑇}))       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))
 
Theoremmapdh8g 37392* Part of Part (8) in [Baer] p. 48. Eliminate 𝑋 ∈ (𝑁‘{𝑌, 𝑇}). TODO: break out 𝑇0 in mapdh8e 37390 so we can share hypotheses. Also, look at hypothesis sharing for earlier mapdh8* and mapdh75* stuff. (Contributed by NM, 10-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = 𝐺)    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))       (𝜑 → (𝐼‘⟨𝑌, 𝐺, 𝑇⟩) = (𝐼‘⟨𝑋, 𝐹, 𝑇⟩))
 
Theoremmapdh8i 37393* Part of Part (8) in [Baer] p. 48. (Contributed by NM, 11-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑍}) ≠ (𝑁‘{𝑇}))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑇}))       (𝜑 → (𝐼‘⟨𝑌, (𝐼‘⟨𝑋, 𝐹, 𝑌⟩), 𝑇⟩) = (𝐼‘⟨𝑍, (𝐼‘⟨𝑋, 𝐹, 𝑍⟩), 𝑇⟩))
 
Theoremmapdh8j 37394* Part of Part (8) in [Baer] p. 48. (Contributed by NM, 13-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑍}) ≠ (𝑁‘{𝑇}))    &   (𝜑𝑇 ∈ (𝑉 ∖ { 0 }))       (𝜑 → (𝐼‘⟨𝑌, (𝐼‘⟨𝑋, 𝐹, 𝑌⟩), 𝑇⟩) = (𝐼‘⟨𝑍, (𝐼‘⟨𝑋, 𝐹, 𝑍⟩), 𝑇⟩))
 
Theoremmapdh8 37395* Part (8) in [Baer] p. 48. Given a reference vector 𝑋, the value of function 𝐼 at a vector 𝑇 is independent of the choice of auxiliary vectors 𝑌 and 𝑍. Unlike Baer's, our version does not require 𝑋, 𝑌, and 𝑍 to be independent, and also is defined for all 𝑌 and 𝑍 that are not colinear with 𝑋 or 𝑇. We do this to make the definition of Baer's sigma function more straightforward. (This part eliminates 𝑇0.) (Contributed by NM, 13-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑌 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑍 ∈ (𝑉 ∖ { 0 }))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}))    &   (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑍}))    &   (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑇}))    &   (𝜑 → (𝑁‘{𝑍}) ≠ (𝑁‘{𝑇}))    &   (𝜑𝑇𝑉)       (𝜑 → (𝐼‘⟨𝑌, (𝐼‘⟨𝑋, 𝐹, 𝑌⟩), 𝑇⟩) = (𝐼‘⟨𝑍, (𝐼‘⟨𝑋, 𝐹, 𝑍⟩), 𝑇⟩))
 
Theoremmapdh9a 37396* Lemma for part (9) in [Baer] p. 48. TODO: why is this 50% larger than mapdh9aOLDN 37397? (Contributed by NM, 14-May-2015.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑇𝑉)       (𝜑 → ∃!𝑦𝐷𝑧𝑉𝑧 ∈ ((𝑁‘{𝑋}) ∪ (𝑁‘{𝑇})) → 𝑦 = (𝐼‘⟨𝑧, (𝐼‘⟨𝑋, 𝐹, 𝑧⟩), 𝑇⟩)))
 
Theoremmapdh9aOLDN 37397* Lemma for part (9) in [Baer] p. 48. (Contributed by NM, 14-May-2015.) (New usage is discouraged.)
𝐻 = (LHyp‘𝐾)    &   𝑈 = ((DVecH‘𝐾)‘𝑊)    &   𝑉 = (Base‘𝑈)    &    = (-g𝑈)    &    0 = (0g𝑈)    &   𝑁 = (LSpan‘𝑈)    &   𝐶 = ((LCDual‘𝐾)‘𝑊)    &   𝐷 = (Base‘𝐶)    &   𝑅 = (-g𝐶)    &   𝑄 = (0g𝐶)    &   𝐽 = (LSpan‘𝐶)    &   𝑀 = ((mapd‘𝐾)‘𝑊)    &   𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))    &   (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))    &   (𝜑𝐹𝐷)    &   (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹}))    &   (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))    &   (𝜑𝑇𝑉)       (𝜑 → ∃!𝑦𝐷𝑧𝑉𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐼‘⟨𝑧, (𝐼‘⟨𝑋, 𝐹, 𝑧⟩), 𝑇⟩)))
 
Syntaxchdma1 37398 Extend class notation with preliminary map from vectors to functionals in the closed kernel dual space.
class HDMap1
 
Syntaxchdma 37399 Extend class notation with map from vectors to functionals in the closed kernel dual space.
class HDMap
 
Definitiondf-hdmap1 37400* Define preliminary map from vectors to functionals in the closed kernel dual space. See hdmap1fval 37403 description for more details. (Contributed by NM, 14-May-2015.)
HDMap1 = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑎[((DVecH‘𝑘)‘𝑤) / 𝑢][(Base‘𝑢) / 𝑣][(LSpan‘𝑢) / 𝑛][((LCDual‘𝑘)‘𝑤) / 𝑐][(Base‘𝑐) / 𝑑][(LSpan‘𝑐) / 𝑗][((mapd‘𝑘)‘𝑤) / 𝑚]𝑎 ∈ (𝑥 ∈ ((𝑣 × 𝑑) × 𝑣) ↦ if((2nd𝑥) = (0g𝑢), (0g𝑐), (𝑑 ((𝑚‘(𝑛‘{(2nd𝑥)})) = (𝑗‘{}) ∧ (𝑚‘(𝑛‘{((1st ‘(1st𝑥))(-g𝑢)(2nd𝑥))})) = (𝑗‘{((2nd ‘(1st𝑥))(-g𝑐))})))))}))
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42400 425 42401-42500 426 42501-42600 427 42601-42700 428 42701-42800 429 42801-42879
  Copyright terms: Public domain < Previous  Next >