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 39565 and lcfr 39599. (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 4571 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → {𝑥} = {𝑋}) | |
3 | 2 | fveq2d 6778 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ( ⊥ ‘{𝑥}) = ( ⊥ ‘{𝑋})) |
4 | oveq2 7283 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝑘 · 𝑥) = (𝑘 · 𝑋)) | |
5 | 4 | oveq2d 7291 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑤 + (𝑘 · 𝑥)) = (𝑤 + (𝑘 · 𝑋))) |
6 | 5 | eqeq2d 2749 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ 𝑣 = (𝑤 + (𝑘 · 𝑋)))) |
7 | 3, 6 | rexeqbidv 3337 | . . . . 5 ⊢ (𝑥 = 𝑋 → (∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))) |
8 | 7 | riotabidv 7234 | . . . 4 ⊢ (𝑥 = 𝑋 → (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥))) = (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))) |
9 | 8 | mpteq2dv 5176 | . . 3 ⊢ (𝑥 = 𝑋 → (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
10 | lcf1o.j | . . 3 ⊢ 𝐽 = (𝑥 ∈ (𝑉 ∖ { 0 }) ↦ (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥))))) | |
11 | lcf1o.v | . . 3 ⊢ 𝑉 = (Base‘𝑈) | |
12 | 9, 10, 11 | mptfvmpt 7104 | . 2 ⊢ (𝑋 ∈ (𝑉 ∖ { 0 }) → (𝐽‘𝑋) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
13 | 1, 12 | syl 17 | 1 ⊢ (𝜑 → (𝐽‘𝑋) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ∃wrex 3065 {crab 3068 ∖ cdif 3884 {csn 4561 ↦ cmpt 5157 ‘cfv 6433 ℩crio 7231 (class class class)co 7275 Basecbs 16912 +gcplusg 16962 Scalarcsca 16965 ·𝑠 cvsca 16966 0gc0g 17150 LFnlclfn 37071 LKerclk 37099 LDualcld 37137 HLchlt 37364 LHypclh 37998 DVecHcdvh 39092 ocHcoch 39361 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 |
This theorem is referenced by: lcfrlem9 39564 lcfrlem10 39566 lcfrlem11 39567 |
Copyright terms: Public domain | W3C validator |