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 41919
Description: Lemma for lcf1o 41921 and lcfr 41955. (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 4592 . . . . . . 7 (𝑥 = 𝑋 → {𝑥} = {𝑋})
32fveq2d 6846 . . . . . 6 (𝑥 = 𝑋 → ( ‘{𝑥}) = ( ‘{𝑋}))
4 oveq2 7376 . . . . . . . 8 (𝑥 = 𝑋 → (𝑘 · 𝑥) = (𝑘 · 𝑋))
54oveq2d 7384 . . . . . . 7 (𝑥 = 𝑋 → (𝑤 + (𝑘 · 𝑥)) = (𝑤 + (𝑘 · 𝑋)))
65eqeq2d 2748 . . . . . 6 (𝑥 = 𝑋 → (𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ 𝑣 = (𝑤 + (𝑘 · 𝑋))))
73, 6rexeqbidv 3319 . . . . 5 (𝑥 = 𝑋 → (∃𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ ∃𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))
87riotabidv 7327 . . . 4 (𝑥 = 𝑋 → (𝑘𝑅𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥))) = (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))
98mpteq2dv 5194 . . 3 (𝑥 = 𝑋 → (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))) = (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))
10 lcf1o.j . . 3 𝐽 = (𝑥 ∈ (𝑉 ∖ { 0 }) ↦ (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))))
11 lcf1o.v . . 3 𝑉 = (Base‘𝑈)
129, 10, 11mptfvmpt 7184 . 2 (𝑋 ∈ (𝑉 ∖ { 0 }) → (𝐽𝑋) = (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))
131, 12syl 17 1 (𝜑 → (𝐽𝑋) = (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wrex 3062  {crab 3401  cdif 3900  {csn 4582  cmpt 5181  cfv 6500  crio 7324  (class class class)co 7368  Basecbs 17148  +gcplusg 17189  Scalarcsca 17192   ·𝑠 cvsca 17193  0gc0g 17371  LFnlclfn 39427  LKerclk 39455  LDualcld 39493  HLchlt 39720  LHypclh 40354  DVecHcdvh 41448  ocHcoch 41717
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371
This theorem is referenced by:  lcfrlem9  41920  lcfrlem10  41922  lcfrlem11  41923
  Copyright terms: Public domain W3C validator