mapdcv - Mathbox for Norm Megill

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

Theorem mapdcv 37681

Description: Covering property of the converse of the map defined by df-mapd 37646. (Contributed by NM, 14-Mar-2015.)

**Hypotheses**
Ref	Expression
mapdcv.h	⊢ 𝐻 = (LHyp‘𝐾)
mapdcv.m	⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
mapdcv.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
mapdcv.s	⊢ 𝑆 = (LSubSp‘𝑈)
mapdcv.c	⊢ 𝐶 = ( ⋖_L ‘𝑈)
mapdcv.d	⊢ 𝐷 = ((LCDual‘𝐾)‘𝑊)
mapdcv.e	⊢ 𝐸 = ( ⋖_L ‘𝐷)
mapdcv.k	⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
mapdcv.x	⊢ (𝜑 → 𝑋 ∈ 𝑆)
mapdcv.y	⊢ (𝜑 → 𝑌 ∈ 𝑆)

**Assertion**
Ref	Expression
mapdcv	⊢ (𝜑 → (𝑋𝐶𝑌 ↔ (𝑀‘𝑋)𝐸(𝑀‘𝑌)))

Proof of Theorem mapdcv Dummy variables 𝑣 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mapdcv.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
2		mapdcv.m	. . . 4 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊)
3		mapdcv.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
4		mapdcv.s	. . . 4 ⊢ 𝑆 = (LSubSp‘𝑈)
5		mapdcv.k	. . . 4 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
6		mapdcv.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑆)
7		mapdcv.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑆)
8	1, 2, 3, 4, 5, 6, 7	mapdsord 37676	. . 3 ⊢ (𝜑 → ((𝑀‘𝑋) ⊊ (𝑀‘𝑌) ↔ 𝑋 ⊊ 𝑌))
9		mapdcv.d	. . . . . . 7 ⊢ 𝐷 = ((LCDual‘𝐾)‘𝑊)
10		eqid 2799	. . . . . . 7 ⊢ (LSubSp‘𝐷) = (LSubSp‘𝐷)
11	5	adantr 473	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
12		simpr 478	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → 𝑣 ∈ 𝑆)
13	1, 2, 3, 4, 9, 10, 11, 12	mapdcl2 37677	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → (𝑀‘𝑣) ∈ (LSubSp‘𝐷))
14	5	adantr 473	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ (LSubSp‘𝐷)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
15	1, 2, 9, 10, 5	mapdrn2 37672	. . . . . . . . . 10 ⊢ (𝜑 → ran 𝑀 = (LSubSp‘𝐷))
16	15	eleq2d 2864	. . . . . . . . 9 ⊢ (𝜑 → (𝑓 ∈ ran 𝑀 ↔ 𝑓 ∈ (LSubSp‘𝐷)))
17	16	biimpar 470	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ (LSubSp‘𝐷)) → 𝑓 ∈ ran 𝑀)
18	1, 2, 3, 4, 14, 17	mapdcnvcl 37673	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ (LSubSp‘𝐷)) → (^◡𝑀‘𝑓) ∈ 𝑆)
19	1, 2, 14, 17	mapdcnvid2 37678	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ (LSubSp‘𝐷)) → (𝑀‘(^◡𝑀‘𝑓)) = 𝑓)
20	19	eqcomd 2805	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ (LSubSp‘𝐷)) → 𝑓 = (𝑀‘(^◡𝑀‘𝑓)))
21		fveq2 6411	. . . . . . . 8 ⊢ (𝑣 = (^◡𝑀‘𝑓) → (𝑀‘𝑣) = (𝑀‘(^◡𝑀‘𝑓)))
22	21	rspceeqv 3515	. . . . . . 7 ⊢ (((^◡𝑀‘𝑓) ∈ 𝑆 ∧ 𝑓 = (𝑀‘(^◡𝑀‘𝑓))) → ∃𝑣 ∈ 𝑆 𝑓 = (𝑀‘𝑣))
23	18, 20, 22	syl2anc 580	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (LSubSp‘𝐷)) → ∃𝑣 ∈ 𝑆 𝑓 = (𝑀‘𝑣))
24		psseq2 3892	. . . . . . . 8 ⊢ (𝑓 = (𝑀‘𝑣) → ((𝑀‘𝑋) ⊊ 𝑓 ↔ (𝑀‘𝑋) ⊊ (𝑀‘𝑣)))
25		psseq1 3891	. . . . . . . 8 ⊢ (𝑓 = (𝑀‘𝑣) → (𝑓 ⊊ (𝑀‘𝑌) ↔ (𝑀‘𝑣) ⊊ (𝑀‘𝑌)))
26	24, 25	anbi12d 625	. . . . . . 7 ⊢ (𝑓 = (𝑀‘𝑣) → (((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌)) ↔ ((𝑀‘𝑋) ⊊ (𝑀‘𝑣) ∧ (𝑀‘𝑣) ⊊ (𝑀‘𝑌))))
27	26	adantl 474	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 = (𝑀‘𝑣)) → (((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌)) ↔ ((𝑀‘𝑋) ⊊ (𝑀‘𝑣) ∧ (𝑀‘𝑣) ⊊ (𝑀‘𝑌))))
28	13, 23, 27	rexxfrd 5079	. . . . 5 ⊢ (𝜑 → (∃𝑓 ∈ (LSubSp‘𝐷)((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌)) ↔ ∃𝑣 ∈ 𝑆 ((𝑀‘𝑋) ⊊ (𝑀‘𝑣) ∧ (𝑀‘𝑣) ⊊ (𝑀‘𝑌))))
29	6	adantr 473	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → 𝑋 ∈ 𝑆)
30	1, 2, 3, 4, 11, 29, 12	mapdsord 37676	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → ((𝑀‘𝑋) ⊊ (𝑀‘𝑣) ↔ 𝑋 ⊊ 𝑣))
31	7	adantr 473	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → 𝑌 ∈ 𝑆)
32	1, 2, 3, 4, 11, 12, 31	mapdsord 37676	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → ((𝑀‘𝑣) ⊊ (𝑀‘𝑌) ↔ 𝑣 ⊊ 𝑌))
33	30, 32	anbi12d 625	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → (((𝑀‘𝑋) ⊊ (𝑀‘𝑣) ∧ (𝑀‘𝑣) ⊊ (𝑀‘𝑌)) ↔ (𝑋 ⊊ 𝑣 ∧ 𝑣 ⊊ 𝑌)))
34	33	rexbidva 3230	. . . . 5 ⊢ (𝜑 → (∃𝑣 ∈ 𝑆 ((𝑀‘𝑋) ⊊ (𝑀‘𝑣) ∧ (𝑀‘𝑣) ⊊ (𝑀‘𝑌)) ↔ ∃𝑣 ∈ 𝑆 (𝑋 ⊊ 𝑣 ∧ 𝑣 ⊊ 𝑌)))
35	28, 34	bitrd 271	. . . 4 ⊢ (𝜑 → (∃𝑓 ∈ (LSubSp‘𝐷)((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌)) ↔ ∃𝑣 ∈ 𝑆 (𝑋 ⊊ 𝑣 ∧ 𝑣 ⊊ 𝑌)))
36	35	notbid 310	. . 3 ⊢ (𝜑 → (¬ ∃𝑓 ∈ (LSubSp‘𝐷)((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌)) ↔ ¬ ∃𝑣 ∈ 𝑆 (𝑋 ⊊ 𝑣 ∧ 𝑣 ⊊ 𝑌)))
37	8, 36	anbi12d 625	. 2 ⊢ (𝜑 → (((𝑀‘𝑋) ⊊ (𝑀‘𝑌) ∧ ¬ ∃𝑓 ∈ (LSubSp‘𝐷)((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌))) ↔ (𝑋 ⊊ 𝑌 ∧ ¬ ∃𝑣 ∈ 𝑆 (𝑋 ⊊ 𝑣 ∧ 𝑣 ⊊ 𝑌))))
38		mapdcv.e	. . 3 ⊢ 𝐸 = ( ⋖_L ‘𝐷)
39	1, 9, 5	lcdlmod 37613	. . 3 ⊢ (𝜑 → 𝐷 ∈ LMod)
40	1, 2, 3, 4, 9, 10, 5, 6	mapdcl2 37677	. . 3 ⊢ (𝜑 → (𝑀‘𝑋) ∈ (LSubSp‘𝐷))
41	1, 2, 3, 4, 9, 10, 5, 7	mapdcl2 37677	. . 3 ⊢ (𝜑 → (𝑀‘𝑌) ∈ (LSubSp‘𝐷))
42	10, 38, 39, 40, 41	lcvbr 35042	. 2 ⊢ (𝜑 → ((𝑀‘𝑋)𝐸(𝑀‘𝑌) ↔ ((𝑀‘𝑋) ⊊ (𝑀‘𝑌) ∧ ¬ ∃𝑓 ∈ (LSubSp‘𝐷)((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌)))))
43		mapdcv.c	. . 3 ⊢ 𝐶 = ( ⋖_L ‘𝑈)
44	1, 3, 5	dvhlmod 37131	. . 3 ⊢ (𝜑 → 𝑈 ∈ LMod)
45	4, 43, 44, 6, 7	lcvbr 35042	. 2 ⊢ (𝜑 → (𝑋𝐶𝑌 ↔ (𝑋 ⊊ 𝑌 ∧ ¬ ∃𝑣 ∈ 𝑆 (𝑋 ⊊ 𝑣 ∧ 𝑣 ⊊ 𝑌))))
46	37, 42, 45	3bitr4rd 304	1 ⊢ (𝜑 → (𝑋𝐶𝑌 ↔ (𝑀‘𝑋)𝐸(𝑀‘𝑌)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 198 ∧ wa 385 = wceq 1653 ∈ wcel 2157 ∃wrex 3090 ⊊ wpss 3770 class class class wbr 4843 ^◡ccnv 5311 ran crn 5313 ‘cfv 6101 LModclmod 19181 LSubSpclss 19250 ⋖_L clcv 35039 HLchlt 35371 LHypclh 36005 DVecHcdvh 37099 LCDualclcd 37607 mapdcmpd 37645

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-8 2159 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2377 ax-ext 2777 ax-rep 4964 ax-sep 4975 ax-nul 4983 ax-pow 5035 ax-pr 5097 ax-un 7183 ax-cnex 10280 ax-resscn 10281 ax-1cn 10282 ax-icn 10283 ax-addcl 10284 ax-addrcl 10285 ax-mulcl 10286 ax-mulrcl 10287 ax-mulcom 10288 ax-addass 10289 ax-mulass 10290 ax-distr 10291 ax-i2m1 10292 ax-1ne0 10293 ax-1rid 10294 ax-rnegex 10295 ax-rrecex 10296 ax-cnre 10297 ax-pre-lttri 10298 ax-pre-lttrn 10299 ax-pre-ltadd 10300 ax-pre-mulgt0 10301 ax-riotaBAD 34974

This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3or 1109 df-3an 1110 df-tru 1657 df-fal 1667 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2591 df-eu 2609 df-clab 2786 df-cleq 2792 df-clel 2795 df-nfc 2930 df-ne 2972 df-nel 3075 df-ral 3094 df-rex 3095 df-reu 3096 df-rmo 3097 df-rab 3098 df-v 3387 df-sbc 3634 df-csb 3729 df-dif 3772 df-un 3774 df-in 3776 df-ss 3783 df-pss 3785 df-nul 4116 df-if 4278 df-pw 4351 df-sn 4369 df-pr 4371 df-tp 4373 df-op 4375 df-uni 4629 df-int 4668 df-iun 4712 df-iin 4713 df-br 4844 df-opab 4906 df-mpt 4923 df-tr 4946 df-id 5220 df-eprel 5225 df-po 5233 df-so 5234 df-fr 5271 df-we 5273 df-xp 5318 df-rel 5319 df-cnv 5320 df-co 5321 df-dm 5322 df-rn 5323 df-res 5324 df-ima 5325 df-pred 5898 df-ord 5944 df-on 5945 df-lim 5946 df-suc 5947 df-iota 6064 df-fun 6103 df-fn 6104 df-f 6105 df-f1 6106 df-fo 6107 df-f1o 6108 df-fv 6109 df-riota 6839 df-ov 6881 df-oprab 6882 df-mpt2 6883 df-of 7131 df-om 7300 df-1st 7401 df-2nd 7402 df-tpos 7590 df-undef 7637 df-wrecs 7645 df-recs 7707 df-rdg 7745 df-1o 7799 df-oadd 7803 df-er 7982 df-map 8097 df-en 8196 df-dom 8197 df-sdom 8198 df-fin 8199 df-pnf 10365 df-mnf 10366 df-xr 10367 df-ltxr 10368 df-le 10369 df-sub 10558 df-neg 10559 df-nn 11313 df-2 11376 df-3 11377 df-4 11378 df-5 11379 df-6 11380 df-n0 11581 df-z 11667 df-uz 11931 df-fz 12581 df-struct 16186 df-ndx 16187 df-slot 16188 df-base 16190 df-sets 16191 df-ress 16192 df-plusg 16280 df-mulr 16281 df-sca 16283 df-vsca 16284 df-0g 16417 df-mre 16561 df-mrc 16562 df-acs 16564 df-proset 17243 df-poset 17261 df-plt 17273 df-lub 17289 df-glb 17290 df-join 17291 df-meet 17292 df-p0 17354 df-p1 17355 df-lat 17361 df-clat 17423 df-mgm 17557 df-sgrp 17599 df-mnd 17610 df-submnd 17651 df-grp 17741 df-minusg 17742 df-sbg 17743 df-subg 17904 df-cntz 18062 df-oppg 18088 df-lsm 18364 df-cmn 18510 df-abl 18511 df-mgp 18806 df-ur 18818 df-ring 18865 df-oppr 18939 df-dvdsr 18957 df-unit 18958 df-invr 18988 df-dvr 18999 df-drng 19067 df-lmod 19183 df-lss 19251 df-lsp 19293 df-lvec 19424 df-lsatoms 34997 df-lshyp 34998 df-lcv 35040 df-lfl 35079 df-lkr 35107 df-ldual 35145 df-oposet 35197 df-ol 35199 df-oml 35200 df-covers 35287 df-ats 35288 df-atl 35319 df-cvlat 35343 df-hlat 35372 df-llines 35519 df-lplanes 35520 df-lvols 35521 df-lines 35522 df-psubsp 35524 df-pmap 35525 df-padd 35817 df-lhyp 36009 df-laut 36010 df-ldil 36125 df-ltrn 36126 df-trl 36180 df-tgrp 36764 df-tendo 36776 df-edring 36778 df-dveca 37024 df-disoa 37050 df-dvech 37100 df-dib 37160 df-dic 37194 df-dih 37250 df-doch 37369 df-djh 37416 df-lcdual 37608 df-mapd 37646

This theorem is referenced by: mapdcnvatN 37687 mapdat 37688

W3C validator