![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > lcfrlem8 | Structured version Visualization version GIF version |
Description: Lemma for lcf1o 37357 and lcfr 37391. (Contributed by NM, 21-Feb-2015.) |
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 })) |
Ref | Expression |
---|---|
lcfrlem8 | ⊢ (𝜑 → (𝐽‘𝑋) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lcfrlem8.x | . 2 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 })) | |
2 | sneq 4326 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → {𝑥} = {𝑋}) | |
3 | 2 | fveq2d 6336 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ( ⊥ ‘{𝑥}) = ( ⊥ ‘{𝑋})) |
4 | oveq2 6800 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝑘 · 𝑥) = (𝑘 · 𝑋)) | |
5 | 4 | oveq2d 6808 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑤 + (𝑘 · 𝑥)) = (𝑤 + (𝑘 · 𝑋))) |
6 | 5 | eqeq2d 2781 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ 𝑣 = (𝑤 + (𝑘 · 𝑋)))) |
7 | 3, 6 | rexeqbidv 3302 | . . . . 5 ⊢ (𝑥 = 𝑋 → (∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))) |
8 | 7 | riotabidv 6755 | . . . 4 ⊢ (𝑥 = 𝑋 → (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥))) = (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))) |
9 | 8 | mpteq2dv 4879 | . . 3 ⊢ (𝑥 = 𝑋 → (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
10 | lcf1o.j | . . 3 ⊢ 𝐽 = (𝑥 ∈ (𝑉 ∖ { 0 }) ↦ (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥))))) | |
11 | lcf1o.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑈) | |
12 | fvex 6342 | . . . . 5 ⊢ (Base‘𝑈) ∈ V | |
13 | 11, 12 | eqeltri 2846 | . . . 4 ⊢ 𝑉 ∈ V |
14 | 13 | mptex 6629 | . . 3 ⊢ (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))) ∈ V |
15 | 9, 10, 14 | fvmpt 6424 | . 2 ⊢ (𝑋 ∈ (𝑉 ∖ { 0 }) → (𝐽‘𝑋) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
16 | 1, 15 | syl 17 | 1 ⊢ (𝜑 → (𝐽‘𝑋) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 382 = wceq 1631 ∈ wcel 2145 ∃wrex 3062 {crab 3065 Vcvv 3351 ∖ cdif 3720 {csn 4316 ↦ cmpt 4863 ‘cfv 6031 ℩crio 6752 (class class class)co 6792 Basecbs 16063 +gcplusg 16148 Scalarcsca 16151 ·𝑠 cvsca 16152 0gc0g 16307 LFnlclfn 34862 LKerclk 34890 LDualcld 34928 HLchlt 35155 LHypclh 35788 DVecHcdvh 36884 ocHcoch 37153 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4904 ax-sep 4915 ax-nul 4923 ax-pr 5034 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 827 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-nul 4064 df-if 4226 df-sn 4317 df-pr 4319 df-op 4323 df-uni 4575 df-iun 4656 df-br 4787 df-opab 4847 df-mpt 4864 df-id 5157 df-xp 5255 df-rel 5256 df-cnv 5257 df-co 5258 df-dm 5259 df-rn 5260 df-res 5261 df-ima 5262 df-iota 5994 df-fun 6033 df-fn 6034 df-f 6035 df-f1 6036 df-fo 6037 df-f1o 6038 df-fv 6039 df-riota 6753 df-ov 6795 |
This theorem is referenced by: lcfrlem9 37356 lcfrlem10 37358 lcfrlem11 37359 |
Copyright terms: Public domain | W3C validator |