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

Theorem lcfrlem8 42048
Description: Lemma for lcf1o 42050 and lcfr 42084. (Contributed by NM, 21-Feb-2015.)
Hypotheses
Ref Expression
lcf1o.h 𝐻 = (LHyp‘𝐾)
lcf1o.o = ((ocH‘𝐾)‘𝑊)
lcf1o.u 𝑈 = ((DVecH‘𝐾)‘𝑊)
lcf1o.v 𝑉 = (Base‘𝑈)
lcf1o.a + = (+g𝑈)
lcf1o.t · = ( ·𝑠𝑈)
lcf1o.s 𝑆 = (Scalar‘𝑈)
lcf1o.r 𝑅 = (Base‘𝑆)
lcf1o.z 0 = (0g𝑈)
lcf1o.f 𝐹 = (LFnl‘𝑈)
lcf1o.l 𝐿 = (LKer‘𝑈)
lcf1o.d 𝐷 = (LDual‘𝑈)
lcf1o.q 𝑄 = (0g𝐷)
lcf1o.c 𝐶 = {𝑓𝐹 ∣ ( ‘( ‘(𝐿𝑓))) = (𝐿𝑓)}
lcf1o.j 𝐽 = (𝑥 ∈ (𝑉 ∖ { 0 }) ↦ (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))))
lcflo.k (𝜑 → (𝐾 ∈ HL ∧ 𝑊𝐻))
lcfrlem8.x (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))
Assertion
Ref Expression
lcfrlem8 (𝜑 → (𝐽𝑋) = (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))
Distinct variable groups:   𝑥,𝑤,   𝑥, 0   𝑥,𝑣,𝑉   𝑥, ·   𝑣,𝑘,𝑤,𝑥,𝑋   𝑥, +   𝑥,𝑅
Allowed substitution hints:   𝜑(𝑥,𝑤,𝑣,𝑓,𝑘)   𝐶(𝑥,𝑤,𝑣,𝑓,𝑘)   𝐷(𝑥,𝑤,𝑣,𝑓,𝑘)   + (𝑤,𝑣,𝑓,𝑘)   𝑄(𝑥,𝑤,𝑣,𝑓,𝑘)   𝑅(𝑤,𝑣,𝑓,𝑘)   𝑆(𝑥,𝑤,𝑣,𝑓,𝑘)   · (𝑤,𝑣,𝑓,𝑘)   𝑈(𝑥,𝑤,𝑣,𝑓,𝑘)   𝐹(𝑥,𝑤,𝑣,𝑓,𝑘)   𝐻(𝑥,𝑤,𝑣,𝑓,𝑘)   𝐽(𝑥,𝑤,𝑣,𝑓,𝑘)   𝐾(𝑥,𝑤,𝑣,𝑓,𝑘)   𝐿(𝑥,𝑤,𝑣,𝑓,𝑘)   (𝑣,𝑓,𝑘)   𝑉(𝑤,𝑓,𝑘)   𝑊(𝑥,𝑤,𝑣,𝑓,𝑘)   𝑋(𝑓)   0 (𝑤,𝑣,𝑓,𝑘)

Proof of Theorem lcfrlem8
StepHypRef Expression
1 lcfrlem8.x . 2 (𝜑𝑋 ∈ (𝑉 ∖ { 0 }))
2 sneq 4572 . . . . . . 7 (𝑥 = 𝑋 → {𝑥} = {𝑋})
32fveq2d 6838 . . . . . 6 (𝑥 = 𝑋 → ( ‘{𝑥}) = ( ‘{𝑋}))
4 oveq2 7371 . . . . . . . 8 (𝑥 = 𝑋 → (𝑘 · 𝑥) = (𝑘 · 𝑋))
54oveq2d 7379 . . . . . . 7 (𝑥 = 𝑋 → (𝑤 + (𝑘 · 𝑥)) = (𝑤 + (𝑘 · 𝑋)))
65eqeq2d 2751 . . . . . 6 (𝑥 = 𝑋 → (𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ 𝑣 = (𝑤 + (𝑘 · 𝑋))))
73, 6rexeqbidv 3315 . . . . 5 (𝑥 = 𝑋 → (∃𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ ∃𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))
87riotabidv 7322 . . . 4 (𝑥 = 𝑋 → (𝑘𝑅𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥))) = (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))
98mpteq2dv 5173 . . 3 (𝑥 = 𝑋 → (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))) = (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))
10 lcf1o.j . . 3 𝐽 = (𝑥 ∈ (𝑉 ∖ { 0 }) ↦ (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))))
11 lcf1o.v . . 3 𝑉 = (Base‘𝑈)
129, 10, 11mptfvmpt 7179 . 2 (𝑋 ∈ (𝑉 ∖ { 0 }) → (𝐽𝑋) = (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))
131, 12syl 17 1 (𝜑 → (𝐽𝑋) = (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wcel 2119  wrex 3064  {crab 3392  cdif 3887  {csn 4562  cmpt 5160  cfv 6492  crio 7319  (class class class)co 7363  Basecbs 17177  +gcplusg 17218  Scalarcsca 17221   ·𝑠 cvsca 17222  0gc0g 17400  LFnlclfn 39556  LKerclk 39584  LDualcld 39622  HLchlt 39849  LHypclh 40483  DVecHcdvh 41577  ocHcoch 41846
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366
This theorem is referenced by:  lcfrlem9  42049  lcfrlem10  42051  lcfrlem11  42052
  Copyright terms: Public domain W3C validator