hdmaprnlem4N - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > hdmaprnlem4N		Structured version Visualization version GIF version

Theorem hdmaprnlem4N 41877

Description: Part of proof of part 12 in [Baer] p. 49 line 19. (T* =) (Ft)* = Gs. (Contributed by NM, 27-May-2015.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
hdmaprnlem1.h	⊢ 𝐻 = (LHyp‘𝐾)
hdmaprnlem1.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
hdmaprnlem1.v	⊢ 𝑉 = (Base‘𝑈)
hdmaprnlem1.n	⊢ 𝑁 = (LSpan‘𝑈)
hdmaprnlem1.c	⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊)
hdmaprnlem1.l	⊢ 𝐿 = (LSpan‘𝐶)
hdmaprnlem1.m	⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
hdmaprnlem1.s	⊢ 𝑆 = ((HDMap‘𝐾)‘𝑊)
hdmaprnlem1.k	⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
hdmaprnlem1.se	⊢ (𝜑 → 𝑠 ∈ (𝐷 ∖ {𝑄}))
hdmaprnlem1.ve	⊢ (𝜑 → 𝑣 ∈ 𝑉)
hdmaprnlem1.e	⊢ (𝜑 → (𝑀‘(𝑁‘{𝑣})) = (𝐿‘{𝑠}))
hdmaprnlem1.ue	⊢ (𝜑 → 𝑢 ∈ 𝑉)
hdmaprnlem1.un	⊢ (𝜑 → ¬ 𝑢 ∈ (𝑁‘{𝑣}))
hdmaprnlem1.d	⊢ 𝐷 = (Base‘𝐶)
hdmaprnlem1.q	⊢ 𝑄 = (0_g‘𝐶)
hdmaprnlem1.o	⊢ 0 = (0_g‘𝑈)
hdmaprnlem1.a	⊢ ✚ = (+_g‘𝐶)
hdmaprnlem1.t2	⊢ (𝜑 → 𝑡 ∈ ((𝑁‘{𝑣}) ∖ { 0 }))

**Assertion**
Ref	Expression
hdmaprnlem4N	⊢ (𝜑 → (𝑀‘(𝑁‘{𝑡})) = (𝐿‘{𝑠}))

**Proof of Theorem hdmaprnlem4N**
Step	Hyp	Ref	Expression
1		eqid 2736	. . . . 5 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈)
2		hdmaprnlem1.n	. . . . 5 ⊢ 𝑁 = (LSpan‘𝑈)
3		hdmaprnlem1.h	. . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾)
4		hdmaprnlem1.u	. . . . . 6 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
5		hdmaprnlem1.k	. . . . . 6 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
6	3, 4, 5	dvhlmod 41134	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ LMod)
7		hdmaprnlem1.ve	. . . . . 6 ⊢ (𝜑 → 𝑣 ∈ 𝑉)
8		hdmaprnlem1.v	. . . . . . 7 ⊢ 𝑉 = (Base‘𝑈)
9	8, 1, 2	lspsncl 20939	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ 𝑣 ∈ 𝑉) → (𝑁‘{𝑣}) ∈ (LSubSp‘𝑈))
10	6, 7, 9	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑣}) ∈ (LSubSp‘𝑈))
11		hdmaprnlem1.t2	. . . . . 6 ⊢ (𝜑 → 𝑡 ∈ ((𝑁‘{𝑣}) ∖ { 0 }))
12	11	eldifad 3943	. . . . 5 ⊢ (𝜑 → 𝑡 ∈ (𝑁‘{𝑣}))
13	1, 2, 6, 10, 12	ellspsn5 20958	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑡}) ⊆ (𝑁‘{𝑣}))
14		hdmaprnlem1.o	. . . . 5 ⊢ 0 = (0_g‘𝑈)
15	3, 4, 5	dvhlvec 41133	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ LVec)
16	8, 1	lss1 20900	. . . . . . . . 9 ⊢ (𝑈 ∈ LMod → 𝑉 ∈ (LSubSp‘𝑈))
17	6, 16	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑉 ∈ (LSubSp‘𝑈))
18	1, 2, 6, 17, 7	ellspsn5 20958	. . . . . . 7 ⊢ (𝜑 → (𝑁‘{𝑣}) ⊆ 𝑉)
19	18	ssdifd 4125	. . . . . 6 ⊢ (𝜑 → ((𝑁‘{𝑣}) ∖ { 0 }) ⊆ (𝑉 ∖ { 0 }))
20	19, 11	sseldd 3964	. . . . 5 ⊢ (𝜑 → 𝑡 ∈ (𝑉 ∖ { 0 }))
21	8, 14, 2, 15, 20, 7	lspsncmp 21082	. . . 4 ⊢ (𝜑 → ((𝑁‘{𝑡}) ⊆ (𝑁‘{𝑣}) ↔ (𝑁‘{𝑡}) = (𝑁‘{𝑣})))
22	13, 21	mpbid 232	. . 3 ⊢ (𝜑 → (𝑁‘{𝑡}) = (𝑁‘{𝑣}))
23	22	fveq2d 6885	. 2 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑡})) = (𝑀‘(𝑁‘{𝑣})))
24		hdmaprnlem1.e	. 2 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑣})) = (𝐿‘{𝑠}))
25	23, 24	eqtrd 2771	1 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑡})) = (𝐿‘{𝑠}))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∖ cdif 3928 ⊆ wss 3931 {csn 4606 ‘cfv 6536 Basecbs 17233 +_gcplusg 17276 0_gc0g 17458 LModclmod 20822 LSubSpclss 20893 LSpanclspn 20933 HLchlt 39373 LHypclh 40008 DVecHcdvh 41102 LCDualclcd 41610 mapdcmpd 41648 HDMapchdma 41816

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 ax-riotaBAD 38976

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-tp 4611 df-op 4613 df-uni 4889 df-int 4928 df-iun 4974 df-iin 4975 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7867 df-1st 7993 df-2nd 7994 df-tpos 8230 df-undef 8277 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8724 df-map 8847 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-nn 12246 df-2 12308 df-3 12309 df-4 12310 df-5 12311 df-6 12312 df-n0 12507 df-z 12594 df-uz 12858 df-fz 13530 df-struct 17171 df-sets 17188 df-slot 17206 df-ndx 17218 df-base 17234 df-ress 17257 df-plusg 17289 df-mulr 17290 df-sca 17292 df-vsca 17293 df-0g 17460 df-proset 18311 df-poset 18330 df-plt 18345 df-lub 18361 df-glb 18362 df-join 18363 df-meet 18364 df-p0 18440 df-p1 18441 df-lat 18447 df-clat 18514 df-mgm 18623 df-sgrp 18702 df-mnd 18718 df-grp 18924 df-minusg 18925 df-sbg 18926 df-cmn 19768 df-abl 19769 df-mgp 20106 df-rng 20118 df-ur 20147 df-ring 20200 df-oppr 20302 df-dvdsr 20322 df-unit 20323 df-invr 20353 df-dvr 20366 df-drng 20696 df-lmod 20824 df-lss 20894 df-lsp 20934 df-lvec 21066 df-oposet 39199 df-ol 39201 df-oml 39202 df-covers 39289 df-ats 39290 df-atl 39321 df-cvlat 39345 df-hlat 39374 df-llines 39522 df-lplanes 39523 df-lvols 39524 df-lines 39525 df-psubsp 39527 df-pmap 39528 df-padd 39820 df-lhyp 40012 df-laut 40013 df-ldil 40128 df-ltrn 40129 df-trl 40183 df-tendo 40779 df-edring 40781 df-dvech 41103

This theorem is referenced by: hdmaprnlem8N 41880 hdmaprnlem9N 41881

W3C validator