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 42946
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 7381 . . 3 (℩𝑗 ∈ 𝐵 ∀𝑥 ∈ (Base‘𝑈)(((HDMap‘𝐾)‘𝑊)‘(𝑘( ·𝑠 ‘𝑈)𝑥)) = (𝑗( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))(((HDMap‘𝐾)‘𝑊)‘𝑥))) ∈ V
2 eqid 2760 . . 3 (𝑘 ∈ 𝐵 ↦ (℩𝑗 ∈ 𝐵 ∀𝑥 ∈ (Base‘𝑈)(((HDMap‘𝐾)‘𝑊)‘(𝑘( ·𝑠 ‘𝑈)𝑥)) = (𝑗( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))(((HDMap‘𝐾)‘𝑊)‘𝑥)))) = (𝑘 ∈ 𝐵 ↦ (℩𝑗 ∈ 𝐵 ∀𝑥 ∈ (Base‘𝑈)(((HDMap‘𝐾)‘𝑊)‘(𝑘( ·𝑠 ‘𝑈)𝑥)) = (𝑗( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))(((HDMap‘𝐾)‘𝑊)‘𝑥))))
31, 2fnmpti 6682 . 2 (𝑘 ∈ 𝐵 ↦ (℩𝑗 ∈ 𝐵 ∀𝑥 ∈ (Base‘𝑈)(((HDMap‘𝐾)‘𝑊)‘(𝑘( ·𝑠 ‘𝑈)𝑥)) = (𝑗( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))(((HDMap‘𝐾)‘𝑊)‘𝑥)))) Fn 𝐵
4 hgmapfn.h . . . 4 𝐻 = (LHyp‘𝐾)
5 hgmapfn.u . . . 4 𝑈 = ((DVecH‘𝐾)‘𝑊)
6 eqid 2760 . . . 4 (Base‘𝑈) = (Base‘𝑈)
7 eqid 2760 . . . 4 ( ·𝑠 ‘𝑈) = ( ·𝑠 ‘𝑈)
8 hgmapfn.r . . . 4 𝑅 = (Scalar‘𝑈)
9 hgmapfn.b . . . 4 𝐵 = (Base‘𝑅)
10 eqid 2760 . . . 4 ((LCDual‘𝐾)‘𝑊) = ((LCDual‘𝐾)‘𝑊)
11 eqid 2760 . . . 4 ( ·𝑠 ‘((LCDual‘𝐾)‘𝑊)) = ( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))
12 eqid 2760 . . . 4 ((HDMap‘𝐾)‘𝑊) = ((HDMap‘𝐾)‘𝑊)
13 hgmapfn.g . . . 4 𝐺 = ((HGMap‘𝐾)‘𝑊)
14 hgmapfn.k . . . 4 (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
154, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14hgmapfval 42944 . . 3 (𝜑 → 𝐺 = (𝑘 ∈ 𝐵 ↦ (℩𝑗 ∈ 𝐵 ∀𝑥 ∈ (Base‘𝑈)(((HDMap‘𝐾)‘𝑊)‘(𝑘( ·𝑠 ‘𝑈)𝑥)) = (𝑗( ·𝑠 ‘((LCDual‘𝐾)‘𝑊))(((HDMap‘𝐾)‘𝑊)‘𝑥)))))
1615fneq1d 6632 . 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 1569   ∈ wcel 2144  ∀wral 3076   ↦ cmpt 5185   Fn wfn 6533  ‘cfv 6538  ℩crio 7376  (class class class)co 7420  Basecbs 17387  Scalarcsca 17431   ·𝑠 cvsca 17432  HLchlt 40408  LHypclh 41042  DVecHcdvh 42136  LCDualclcd 42644  HDMapchdma 42850  HGMapchg 42941
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3899  df-un 3901  df-in 3903  df-ss 3914  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-hgmap 42942
This theorem is used by:  hgmaprnlem1N  42954  hgmaprnN  42959  hgmapf1oN  42961
  Copyright terms: Public domain W3C validator