| 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 41589 and lcfr 41623. (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 4586 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → {𝑥} = {𝑋}) | |
| 3 | 2 | fveq2d 6826 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ( ⊥ ‘{𝑥}) = ( ⊥ ‘{𝑋})) |
| 4 | oveq2 7354 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝑘 · 𝑥) = (𝑘 · 𝑋)) | |
| 5 | 4 | oveq2d 7362 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑤 + (𝑘 · 𝑥)) = (𝑤 + (𝑘 · 𝑋))) |
| 6 | 5 | eqeq2d 2742 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ 𝑣 = (𝑤 + (𝑘 · 𝑋)))) |
| 7 | 3, 6 | rexeqbidv 3313 | . . . . 5 ⊢ (𝑥 = 𝑋 → (∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)) ↔ ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))) |
| 8 | 7 | riotabidv 7305 | . . . 4 ⊢ (𝑥 = 𝑋 → (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥))) = (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋)))) |
| 9 | 8 | mpteq2dv 5185 | . . 3 ⊢ (𝑥 = 𝑋 → (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥)))) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
| 10 | lcf1o.j | . . 3 ⊢ 𝐽 = (𝑥 ∈ (𝑉 ∖ { 0 }) ↦ (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑥})𝑣 = (𝑤 + (𝑘 · 𝑥))))) | |
| 11 | lcf1o.v | . . 3 ⊢ 𝑉 = (Base‘𝑈) | |
| 12 | 9, 10, 11 | mptfvmpt 7162 | . 2 ⊢ (𝑋 ∈ (𝑉 ∖ { 0 }) → (𝐽‘𝑋) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
| 13 | 1, 12 | syl 17 | 1 ⊢ (𝜑 → (𝐽‘𝑋) = (𝑣 ∈ 𝑉 ↦ (℩𝑘 ∈ 𝑅 ∃𝑤 ∈ ( ⊥ ‘{𝑋})𝑣 = (𝑤 + (𝑘 · 𝑋))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∃wrex 3056 {crab 3395 ∖ cdif 3899 {csn 4576 ↦ cmpt 5172 ‘cfv 6481 ℩crio 7302 (class class class)co 7346 Basecbs 17117 +gcplusg 17158 Scalarcsca 17161 ·𝑠 cvsca 17162 0gc0g 17340 LFnlclfn 39095 LKerclk 39123 LDualcld 39161 HLchlt 39388 LHypclh 40022 DVecHcdvh 41116 ocHcoch 41385 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4476 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4943 df-br 5092 df-opab 5154 df-mpt 5173 df-id 5511 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 |
| This theorem is referenced by: lcfrlem9 41588 lcfrlem10 41590 lcfrlem11 41591 |
| Copyright terms: Public domain | W3C validator |