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

Theorem hgmapfnN 43211
Description: Functionality of scalar sigma map. (Contributed by NM, 7-Jun-2015.) (New usage is discouraged.)
Hypotheses
Ref Expression
hgmapfn.h 𝐻 = (LHyp‘𝐾)
hgmapfn.u 𝑈 = ((DVecH‘𝐾)‘𝑊)
hgmapfn.r 𝑅 = (Scalar‘𝑈)
hgmapfn.b 𝐵 = (Base‘𝑅)
hgmapfn.g 𝐺 = ((HGMap‘𝐾)‘𝑊)
hgmapfn.k (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
Assertion
Ref Expression
hgmapfnN (𝜑 → 𝐺 Fn 𝐵)

Proof of Theorem hgmapfnN
Dummy variables 𝑗 𝑘 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 riotaex 7412 . . 3 (℩𝑗 ∈ 𝐵 ∀𝑥 ∈ (Base‘𝑈)(((HDMap‘𝐾)‘𝑊)‘(𝑘( ·𝑠 ‘𝑈)𝑥)) = (𝑗( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))(((HDMap‘𝐾)‘𝑊)‘𝑥))) ∈ V
2 eqid 2763 . . 3 (𝑘 ∈ 𝐵 ↦ (℩𝑗 ∈ 𝐵 ∀𝑥 ∈ (Base‘𝑈)(((HDMap‘𝐾)‘𝑊)‘(𝑘( ·𝑠 ‘𝑈)𝑥)) = (𝑗( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))(((HDMap‘𝐾)‘𝑊)‘𝑥)))) = (𝑘 ∈ 𝐵 ↦ (℩𝑗 ∈ 𝐵 ∀𝑥 ∈ (Base‘𝑈)(((HDMap‘𝐾)‘𝑊)‘(𝑘( ·𝑠 ‘𝑈)𝑥)) = (𝑗( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))(((HDMap‘𝐾)‘𝑊)‘𝑥))))
31, 2fnmpti 6712 . 2 (𝑘 ∈ 𝐵 ↦ (℩𝑗 ∈ 𝐵 ∀𝑥 ∈ (Base‘𝑈)(((HDMap‘𝐾)‘𝑊)‘(𝑘( ·𝑠 ‘𝑈)𝑥)) = (𝑗( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))(((HDMap‘𝐾)‘𝑊)‘𝑥)))) Fn 𝐵
4 hgmapfn.h . . . 4 𝐻 = (LHyp‘𝐾)
5 hgmapfn.u . . . 4 𝑈 = ((DVecH‘𝐾)‘𝑊)
6 eqid 2763 . . . 4 (Base‘𝑈) = (Base‘𝑈)
7 eqid 2763 . . . 4 ( ·𝑠 ‘𝑈) = ( ·𝑠 ‘𝑈)
8 hgmapfn.r . . . 4 𝑅 = (Scalar‘𝑈)
9 hgmapfn.b . . . 4 𝐵 = (Base‘𝑅)
10 eqid 2763 . . . 4 ((LCDual‘𝐾)‘𝑊) = ((LCDual‘𝐾)‘𝑊)
11 eqid 2763 . . . 4 ( ·𝑠 ‘((LCDual‘𝐾)‘𝑊)) = ( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))
12 eqid 2763 . . . 4 ((HDMap‘𝐾)‘𝑊) = ((HDMap‘𝐾)‘𝑊)
13 hgmapfn.g . . . 4 𝐺 = ((HGMap‘𝐾)‘𝑊)
14 hgmapfn.k . . . 4 (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
154, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14hgmapfval 43209 . . 3 (𝜑 → 𝐺 = (𝑘 ∈ 𝐵 ↦ (℩𝑗 ∈ 𝐵 ∀𝑥 ∈ (Base‘𝑈)(((HDMap‘𝐾)‘𝑊)‘(𝑘( ·𝑠 ‘𝑈)𝑥)) = (𝑗( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))(((HDMap‘𝐾)‘𝑊)‘𝑥)))))
1615fneq1d 6662 . 2 (𝜑 → (𝐺 Fn 𝐵 ↔ (𝑘 ∈ 𝐵 ↦ (℩𝑗 ∈ 𝐵 ∀𝑥 ∈ (Base‘𝑈)(((HDMap‘𝐾)‘𝑊)‘(𝑘( ·𝑠 ‘𝑈)𝑥)) = (𝑗( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))(((HDMap‘𝐾)‘𝑊)‘𝑥)))) Fn 𝐵))
173, 16mpbiri 261 1 (𝜑 → 𝐺 Fn 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ↦ cmpt 5192   Fn wfn 6561  ‘cfv 6566  ℩crio 7407  (class class class)co 7451  Basecbs 17431  Scalarcsca 17475   ·𝑠 cvsca 17476  HLchlt 40673  LHypclh 41307  DVecHcdvh 42401  LCDualclcd 42909  HDMapchdma 43115  HGMapchg 43206
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-hgmap 43207
This theorem is used by:  hgmaprnlem1N  43219  hgmaprnN  43224  hgmapf1oN  43226
  Copyright terms: Public domain W3C validator