Theorem lcfrlem8 42699

Description: Lemma for lcf1o 42701 and lcfr 42735. (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

Step	Hyp	Ref	Expression
1		lcfrlem8.x	. 2 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 }))
2		sneq 4590	. . . . . . 7 ⊢ (𝑥 = 𝑋 → {𝑥} = {𝑋})
3	2	fveq2d 6889	. . . . . 6 ⊢ (𝑥 = 𝑋 → ( ⊥ ‘{𝑥}) = ( ⊥ ‘{𝑋}))
4		oveq2 7428	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝑘 · 𝑥) = (𝑘 · 𝑋))
5	4	oveq2d 7436	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑤 + (𝑘 · 𝑥)) = (𝑤 + (𝑘 · 𝑋)))
6	5	eqeq2d 2771	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ 𝑣 = (𝑤 + (𝑘 · 𝑋))))
7	3, 6	rexeqbidv 3335	. . . . 5 ⊢ (𝑥 = 𝑋 → (∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))
8	7	riotabidv 7379	. . . 4 ⊢ (𝑥 = 𝑋 → (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥))) = (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))
9	8	mpteq2dv 5198	. . 3 ⊢ (𝑥 = 𝑋 → (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))
10		lcf1o.j	. . 3 ⊢ 𝐽 = (𝑥 ∈ (𝑉 ∖ { 0 }) ↦ (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))))
11		lcf1o.v	. . 3 ⊢ 𝑉 = (Base‘𝑈)
12	9, 10, 11	mptfvmpt 7234	. 2 ⊢ (𝑋 ∈ (𝑉 ∖ { 0 }) → (𝐽‘𝑋) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))
13	1, 12	syl 18	1 ⊢ (𝜑 → (𝐽‘𝑋) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  {crab 3412   ∖ cdif 4045  {csn 4584   ↦ cmpt 5185  ‘cfv 6538  ℩crio 7376  (class class class)co 7420  Basecbs 17392  +_gcplusg 17433  Scalarcsca 17436   ·_𝑠 cvsca 17437  0_gc0g 17615  LFnlclfn 40207  LKerclk 40235  LDualcld 40273  HLchlt 40500  LHypclh 41134  DVecHcdvh 42228  ocHcoch 42497

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-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  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

This theorem is used by:  lcfrlem9  42700  lcfrlem10  42702  lcfrlem11  42703