![]() |
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 41508 and lcfr 41542. (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 4658 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → {𝑥} = {𝑋}) | |
3 | 2 | fveq2d 6924 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ( ⊥ ‘{𝑥}) = ( ⊥ ‘{𝑋})) |
4 | oveq2 7456 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝑘 · 𝑥) = (𝑘 · 𝑋)) | |
5 | 4 | oveq2d 7464 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑤 + (𝑘 · 𝑥)) = (𝑤 + (𝑘 · 𝑋))) |
6 | 5 | eqeq2d 2751 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ 𝑣 = (𝑤 + (𝑘 · 𝑋)))) |
7 | 3, 6 | rexeqbidv 3355 | . . . . 5 ⊢ (𝑥 = 𝑋 → (∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))) |
8 | 7 | riotabidv 7406 | . . . 4 ⊢ (𝑥 = 𝑋 → (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥))) = (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))) |
9 | 8 | mpteq2dv 5268 | . . 3 ⊢ (𝑥 = 𝑋 → (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
10 | lcf1o.j | . . 3 ⊢ 𝐽 = (𝑥 ∈ (𝑉 ∖ { 0 }) ↦ (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥))))) | |
11 | lcf1o.v | . . 3 ⊢ 𝑉 = (Base‘𝑈) | |
12 | 9, 10, 11 | mptfvmpt 7265 | . 2 ⊢ (𝑋 ∈ (𝑉 ∖ { 0 }) → (𝐽‘𝑋) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
13 | 1, 12 | syl 17 | 1 ⊢ (𝜑 → (𝐽‘𝑋) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∃wrex 3076 {crab 3443 ∖ cdif 3973 {csn 4648 ↦ cmpt 5249 ‘cfv 6573 ℩crio 7403 (class class class)co 7448 Basecbs 17258 +gcplusg 17311 Scalarcsca 17314 ·𝑠 cvsca 17315 0gc0g 17499 LFnlclfn 39013 LKerclk 39041 LDualcld 39079 HLchlt 39306 LHypclh 39941 DVecHcdvh 41035 ocHcoch 41304 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 |
This theorem is referenced by: lcfrlem9 41507 lcfrlem10 41509 lcfrlem11 41510 |
Copyright terms: Public domain | W3C validator |