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 42113

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 41370	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ LMod)
7		hdmaprnlem1.ve	. . . . . 6 ⊢ (𝜑 → 𝑣 ∈ 𝑉)
8		hdmaprnlem1.v	. . . . . . 7 ⊢ 𝑉 = (Base‘𝑈)
9	8, 1, 2	lspsncl 20928	. . . . . 6 ⊢ ((𝑈 ∈ LMod ∧ 𝑣 ∈ 𝑉) → (𝑁‘{𝑣}) ∈ (LSubSp‘𝑈))
10	6, 7, 9	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑁‘{𝑣}) ∈ (LSubSp‘𝑈))
11		hdmaprnlem1.t2	. . . . . 6 ⊢ (𝜑 → 𝑡 ∈ ((𝑁‘{𝑣}) ∖ { 0 }))
12	11	eldifad 3913	. . . . 5 ⊢ (𝜑 → 𝑡 ∈ (𝑁‘{𝑣}))
13	1, 2, 6, 10, 12	ellspsn5 20947	. . . 4 ⊢ (𝜑 → (𝑁‘{𝑡}) ⊆ (𝑁‘{𝑣}))
14		hdmaprnlem1.o	. . . . 5 ⊢ 0 = (0_g‘𝑈)
15	3, 4, 5	dvhlvec 41369	. . . . 5 ⊢ (𝜑 → 𝑈 ∈ LVec)
16	8, 1	lss1 20889	. . . . . . . . 9 ⊢ (𝑈 ∈ LMod → 𝑉 ∈ (LSubSp‘𝑈))
17	6, 16	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑉 ∈ (LSubSp‘𝑈))
18	1, 2, 6, 17, 7	ellspsn5 20947	. . . . . . 7 ⊢ (𝜑 → (𝑁‘{𝑣}) ⊆ 𝑉)
19	18	ssdifd 4097	. . . . . 6 ⊢ (𝜑 → ((𝑁‘{𝑣}) ∖ { 0 }) ⊆ (𝑉 ∖ { 0 }))
20	19, 11	sseldd 3934	. . . . 5 ⊢ (𝜑 → 𝑡 ∈ (𝑉 ∖ { 0 }))
21	8, 14, 2, 15, 20, 7	lspsncmp 21071	. . . 4 ⊢ (𝜑 → ((𝑁‘{𝑡}) ⊆ (𝑁‘{𝑣}) ↔ (𝑁‘{𝑡}) = (𝑁‘{𝑣})))
22	13, 21	mpbid 232	. . 3 ⊢ (𝜑 → (𝑁‘{𝑡}) = (𝑁‘{𝑣}))
23	22	fveq2d 6838	. 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 1541 ∈ wcel 2113 ∖ cdif 3898 ⊆ wss 3901 {csn 4580 ‘cfv 6492 Basecbs 17136 +_gcplusg 17177 0_gc0g 17359 LModclmod 20811 LSubSpclss 20882 LSpanclspn 20922 HLchlt 39610 LHypclh 40244 DVecHcdvh 41338 LCDualclcd 41846 mapdcmpd 41884 HDMapchdma 42052

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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-riotaBAD 39213

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-iin 4949 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-tpos 8168 df-undef 8215 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-5 12211 df-6 12212 df-n0 12402 df-z 12489 df-uz 12752 df-fz 13424 df-struct 17074 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-ress 17158 df-plusg 17190 df-mulr 17191 df-sca 17193 df-vsca 17194 df-0g 17361 df-proset 18217 df-poset 18236 df-plt 18251 df-lub 18267 df-glb 18268 df-join 18269 df-meet 18270 df-p0 18346 df-p1 18347 df-lat 18355 df-clat 18422 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 df-sbg 18868 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 df-oppr 20273 df-dvdsr 20293 df-unit 20294 df-invr 20324 df-dvr 20337 df-drng 20664 df-lmod 20813 df-lss 20883 df-lsp 20923 df-lvec 21055 df-oposet 39436 df-ol 39438 df-oml 39439 df-covers 39526 df-ats 39527 df-atl 39558 df-cvlat 39582 df-hlat 39611 df-llines 39758 df-lplanes 39759 df-lvols 39760 df-lines 39761 df-psubsp 39763 df-pmap 39764 df-padd 40056 df-lhyp 40248 df-laut 40249 df-ldil 40364 df-ltrn 40365 df-trl 40419 df-tendo 41015 df-edring 41017 df-dvech 41339

This theorem is referenced by: hdmaprnlem8N 42116 hdmaprnlem9N 42117

W3C validator