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 42185
Description: Lemma for lcf1o 42187 and lcfr 42221. (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 4595 . . . . . . 7 (𝑥 = 𝑋 → {𝑥} = {𝑋})
32fveq2d 6875 . . . . . 6 (𝑥 = 𝑋 → ( ‘{𝑥}) = ( ‘{𝑋}))
4 oveq2 7408 . . . . . . . 8 (𝑥 = 𝑋 → (𝑘 · 𝑥) = (𝑘 · 𝑋))
54oveq2d 7416 . . . . . . 7 (𝑥 = 𝑋 → (𝑤 + (𝑘 · 𝑥)) = (𝑤 + (𝑘 · 𝑋)))
65eqeq2d 2776 . . . . . 6 (𝑥 = 𝑋 → (𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ 𝑣 = (𝑤 + (𝑘 · 𝑋))))
73, 6rexeqbidv 3340 . . . . 5 (𝑥 = 𝑋 → (∃𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ ∃𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))
87riotabidv 7359 . . . 4 (𝑥 = 𝑋 → (𝑘𝑅𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥))) = (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))
98mpteq2dv 5199 . . 3 (𝑥 = 𝑋 → (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))) = (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))
10 lcf1o.j . . 3 𝐽 = (𝑥 ∈ (𝑉 ∖ { 0 }) ↦ (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))))
11 lcf1o.v . . 3 𝑉 = (Base‘𝑈)
129, 10, 11mptfvmpt 7216 . 2 (𝑋 ∈ (𝑉 ∖ { 0 }) → (𝐽𝑋) = (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))
131, 12syl 18 1 (𝜑 → (𝐽𝑋) = (𝑣𝑉 ↦ (𝑘𝑅𝑤 ∈ ( ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1563  wcel 2145  wrex 3089  {crab 3417  cdif 3904  {csn 4585  cmpt 5186  cfv 6525  crio 7356  (class class class)co 7400  Basecbs 17259  +gcplusg 17300  Scalarcsca 17303   ·𝑠 cvsca 17304  0gc0g 17482  LFnlclfn 39693  LKerclk 39721  LDualcld 39759  HLchlt 39986  LHypclh 40620  DVecHcdvh 41714  ocHcoch 41983
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-ov 7403
This theorem is referenced by:  lcfrlem9  42186  lcfrlem10  42188  lcfrlem11  42189
  Copyright terms: Public domain W3C validator