Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > mapdcv | Structured version Visualization version GIF version |
Description: Covering property of the converse of the map defined by df-mapd 36914. (Contributed by NM, 14-Mar-2015.) |
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 | ⊢ (𝜑 → 𝑌 ∈ 𝑆) |
Ref | Expression |
---|---|
mapdcv | ⊢ (𝜑 → (𝑋𝐶𝑌 ↔ (𝑀‘𝑋)𝐸(𝑀‘𝑌))) |
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 36944 | . . 3 ⊢ (𝜑 → ((𝑀‘𝑋) ⊊ (𝑀‘𝑌) ↔ 𝑋 ⊊ 𝑌)) |
9 | mapdcv.d | . . . . . . 7 ⊢ 𝐷 = ((LCDual‘𝐾)‘𝑊) | |
10 | eqid 2622 | . . . . . . 7 ⊢ (LSubSp‘𝐷) = (LSubSp‘𝐷) | |
11 | 5 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
12 | simpr 477 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → 𝑣 ∈ 𝑆) | |
13 | 1, 2, 3, 4, 9, 10, 11, 12 | mapdcl2 36945 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → (𝑀‘𝑣) ∈ (LSubSp‘𝐷)) |
14 | 5 | adantr 481 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ (LSubSp‘𝐷)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
15 | 1, 2, 9, 10, 5 | mapdrn2 36940 | . . . . . . . . . 10 ⊢ (𝜑 → ran 𝑀 = (LSubSp‘𝐷)) |
16 | 15 | eleq2d 2687 | . . . . . . . . 9 ⊢ (𝜑 → (𝑓 ∈ ran 𝑀 ↔ 𝑓 ∈ (LSubSp‘𝐷))) |
17 | 16 | biimpar 502 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ (LSubSp‘𝐷)) → 𝑓 ∈ ran 𝑀) |
18 | 1, 2, 3, 4, 14, 17 | mapdcnvcl 36941 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ (LSubSp‘𝐷)) → (◡𝑀‘𝑓) ∈ 𝑆) |
19 | 1, 2, 14, 17 | mapdcnvid2 36946 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ (LSubSp‘𝐷)) → (𝑀‘(◡𝑀‘𝑓)) = 𝑓) |
20 | 19 | eqcomd 2628 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ (LSubSp‘𝐷)) → 𝑓 = (𝑀‘(◡𝑀‘𝑓))) |
21 | fveq2 6191 | . . . . . . . . 9 ⊢ (𝑣 = (◡𝑀‘𝑓) → (𝑀‘𝑣) = (𝑀‘(◡𝑀‘𝑓))) | |
22 | 21 | eqeq2d 2632 | . . . . . . . 8 ⊢ (𝑣 = (◡𝑀‘𝑓) → (𝑓 = (𝑀‘𝑣) ↔ 𝑓 = (𝑀‘(◡𝑀‘𝑓)))) |
23 | 22 | rspcev 3309 | . . . . . . 7 ⊢ (((◡𝑀‘𝑓) ∈ 𝑆 ∧ 𝑓 = (𝑀‘(◡𝑀‘𝑓))) → ∃𝑣 ∈ 𝑆 𝑓 = (𝑀‘𝑣)) |
24 | 18, 20, 23 | syl2anc 693 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ (LSubSp‘𝐷)) → ∃𝑣 ∈ 𝑆 𝑓 = (𝑀‘𝑣)) |
25 | psseq2 3695 | . . . . . . . 8 ⊢ (𝑓 = (𝑀‘𝑣) → ((𝑀‘𝑋) ⊊ 𝑓 ↔ (𝑀‘𝑋) ⊊ (𝑀‘𝑣))) | |
26 | psseq1 3694 | . . . . . . . 8 ⊢ (𝑓 = (𝑀‘𝑣) → (𝑓 ⊊ (𝑀‘𝑌) ↔ (𝑀‘𝑣) ⊊ (𝑀‘𝑌))) | |
27 | 25, 26 | anbi12d 747 | . . . . . . 7 ⊢ (𝑓 = (𝑀‘𝑣) → (((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌)) ↔ ((𝑀‘𝑋) ⊊ (𝑀‘𝑣) ∧ (𝑀‘𝑣) ⊊ (𝑀‘𝑌)))) |
28 | 27 | adantl 482 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑓 = (𝑀‘𝑣)) → (((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌)) ↔ ((𝑀‘𝑋) ⊊ (𝑀‘𝑣) ∧ (𝑀‘𝑣) ⊊ (𝑀‘𝑌)))) |
29 | 13, 24, 28 | rexxfrd 4881 | . . . . 5 ⊢ (𝜑 → (∃𝑓 ∈ (LSubSp‘𝐷)((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌)) ↔ ∃𝑣 ∈ 𝑆 ((𝑀‘𝑋) ⊊ (𝑀‘𝑣) ∧ (𝑀‘𝑣) ⊊ (𝑀‘𝑌)))) |
30 | 6 | adantr 481 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → 𝑋 ∈ 𝑆) |
31 | 1, 2, 3, 4, 11, 30, 12 | mapdsord 36944 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → ((𝑀‘𝑋) ⊊ (𝑀‘𝑣) ↔ 𝑋 ⊊ 𝑣)) |
32 | 7 | adantr 481 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → 𝑌 ∈ 𝑆) |
33 | 1, 2, 3, 4, 11, 12, 32 | mapdsord 36944 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → ((𝑀‘𝑣) ⊊ (𝑀‘𝑌) ↔ 𝑣 ⊊ 𝑌)) |
34 | 31, 33 | anbi12d 747 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑆) → (((𝑀‘𝑋) ⊊ (𝑀‘𝑣) ∧ (𝑀‘𝑣) ⊊ (𝑀‘𝑌)) ↔ (𝑋 ⊊ 𝑣 ∧ 𝑣 ⊊ 𝑌))) |
35 | 34 | rexbidva 3049 | . . . . 5 ⊢ (𝜑 → (∃𝑣 ∈ 𝑆 ((𝑀‘𝑋) ⊊ (𝑀‘𝑣) ∧ (𝑀‘𝑣) ⊊ (𝑀‘𝑌)) ↔ ∃𝑣 ∈ 𝑆 (𝑋 ⊊ 𝑣 ∧ 𝑣 ⊊ 𝑌))) |
36 | 29, 35 | bitrd 268 | . . . 4 ⊢ (𝜑 → (∃𝑓 ∈ (LSubSp‘𝐷)((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌)) ↔ ∃𝑣 ∈ 𝑆 (𝑋 ⊊ 𝑣 ∧ 𝑣 ⊊ 𝑌))) |
37 | 36 | notbid 308 | . . 3 ⊢ (𝜑 → (¬ ∃𝑓 ∈ (LSubSp‘𝐷)((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌)) ↔ ¬ ∃𝑣 ∈ 𝑆 (𝑋 ⊊ 𝑣 ∧ 𝑣 ⊊ 𝑌))) |
38 | 8, 37 | anbi12d 747 | . 2 ⊢ (𝜑 → (((𝑀‘𝑋) ⊊ (𝑀‘𝑌) ∧ ¬ ∃𝑓 ∈ (LSubSp‘𝐷)((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌))) ↔ (𝑋 ⊊ 𝑌 ∧ ¬ ∃𝑣 ∈ 𝑆 (𝑋 ⊊ 𝑣 ∧ 𝑣 ⊊ 𝑌)))) |
39 | mapdcv.e | . . 3 ⊢ 𝐸 = ( ⋖L ‘𝐷) | |
40 | 1, 9, 5 | lcdlmod 36881 | . . 3 ⊢ (𝜑 → 𝐷 ∈ LMod) |
41 | 1, 2, 3, 4, 9, 10, 5, 6 | mapdcl2 36945 | . . 3 ⊢ (𝜑 → (𝑀‘𝑋) ∈ (LSubSp‘𝐷)) |
42 | 1, 2, 3, 4, 9, 10, 5, 7 | mapdcl2 36945 | . . 3 ⊢ (𝜑 → (𝑀‘𝑌) ∈ (LSubSp‘𝐷)) |
43 | 10, 39, 40, 41, 42 | lcvbr 34308 | . 2 ⊢ (𝜑 → ((𝑀‘𝑋)𝐸(𝑀‘𝑌) ↔ ((𝑀‘𝑋) ⊊ (𝑀‘𝑌) ∧ ¬ ∃𝑓 ∈ (LSubSp‘𝐷)((𝑀‘𝑋) ⊊ 𝑓 ∧ 𝑓 ⊊ (𝑀‘𝑌))))) |
44 | mapdcv.c | . . 3 ⊢ 𝐶 = ( ⋖L ‘𝑈) | |
45 | 1, 3, 5 | dvhlmod 36399 | . . 3 ⊢ (𝜑 → 𝑈 ∈ LMod) |
46 | 4, 44, 45, 6, 7 | lcvbr 34308 | . 2 ⊢ (𝜑 → (𝑋𝐶𝑌 ↔ (𝑋 ⊊ 𝑌 ∧ ¬ ∃𝑣 ∈ 𝑆 (𝑋 ⊊ 𝑣 ∧ 𝑣 ⊊ 𝑌)))) |
47 | 38, 43, 46 | 3bitr4rd 301 | 1 ⊢ (𝜑 → (𝑋𝐶𝑌 ↔ (𝑀‘𝑋)𝐸(𝑀‘𝑌))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∃wrex 2913 ⊊ wpss 3575 class class class wbr 4653 ◡ccnv 5113 ran crn 5115 ‘cfv 5888 LModclmod 18863 LSubSpclss 18932 ⋖L clcv 34305 HLchlt 34637 LHypclh 35270 DVecHcdvh 36367 LCDualclcd 36875 mapdcmpd 36913 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-riotaBAD 34239 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-iin 4523 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-of 6897 df-om 7066 df-1st 7168 df-2nd 7169 df-tpos 7352 df-undef 7399 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-ress 15865 df-plusg 15954 df-mulr 15955 df-sca 15957 df-vsca 15958 df-0g 16102 df-mre 16246 df-mrc 16247 df-acs 16249 df-preset 16928 df-poset 16946 df-plt 16958 df-lub 16974 df-glb 16975 df-join 16976 df-meet 16977 df-p0 17039 df-p1 17040 df-lat 17046 df-clat 17108 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-submnd 17336 df-grp 17425 df-minusg 17426 df-sbg 17427 df-subg 17591 df-cntz 17750 df-oppg 17776 df-lsm 18051 df-cmn 18195 df-abl 18196 df-mgp 18490 df-ur 18502 df-ring 18549 df-oppr 18623 df-dvdsr 18641 df-unit 18642 df-invr 18672 df-dvr 18683 df-drng 18749 df-lmod 18865 df-lss 18933 df-lsp 18972 df-lvec 19103 df-lsatoms 34263 df-lshyp 34264 df-lcv 34306 df-lfl 34345 df-lkr 34373 df-ldual 34411 df-oposet 34463 df-ol 34465 df-oml 34466 df-covers 34553 df-ats 34554 df-atl 34585 df-cvlat 34609 df-hlat 34638 df-llines 34784 df-lplanes 34785 df-lvols 34786 df-lines 34787 df-psubsp 34789 df-pmap 34790 df-padd 35082 df-lhyp 35274 df-laut 35275 df-ldil 35390 df-ltrn 35391 df-trl 35446 df-tgrp 36031 df-tendo 36043 df-edring 36045 df-dveca 36291 df-disoa 36318 df-dvech 36368 df-dib 36428 df-dic 36462 df-dih 36518 df-doch 36637 df-djh 36684 df-lcdual 36876 df-mapd 36914 |
This theorem is referenced by: mapdcnvatN 36955 mapdat 36956 |
Copyright terms: Public domain | W3C validator |