Metamath Proof Explorer


Theorem mapdordlem2

Description: Lemma for mapdord . Ordering property of projectivity M . TODO: This was proved using some hacked-up older proofs. Maybe simplify; get rid of the T hypothesis. (Contributed by NM, 27-Jan-2015)

Ref Expression
Hypotheses mapdord.h 𝐻 = ( LHyp ‘ 𝐾 )
mapdord.u 𝑈 = ( ( DVecH ‘ 𝐾 ) ‘ 𝑊 )
mapdord.s 𝑆 = ( LSubSp ‘ 𝑈 )
mapdord.m 𝑀 = ( ( mapd ‘ 𝐾 ) ‘ 𝑊 )
mapdord.k ( 𝜑 → ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) )
mapdord.x ( 𝜑𝑋𝑆 )
mapdord.y ( 𝜑𝑌𝑆 )
mapdord.o 𝑂 = ( ( ocH ‘ 𝐾 ) ‘ 𝑊 )
mapdord.a 𝐴 = ( LSAtoms ‘ 𝑈 )
mapdord.f 𝐹 = ( LFnl ‘ 𝑈 )
mapdord.c 𝐽 = ( LSHyp ‘ 𝑈 )
mapdord.l 𝐿 = ( LKer ‘ 𝑈 )
mapdord.t 𝑇 = { 𝑔𝐹 ∣ ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑔 ) ) ) ∈ 𝐽 }
mapdord.q 𝐶 = { 𝑔𝐹 ∣ ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑔 ) ) ) = ( 𝐿𝑔 ) }
Assertion mapdordlem2 ( 𝜑 → ( ( 𝑀𝑋 ) ⊆ ( 𝑀𝑌 ) ↔ 𝑋𝑌 ) )

Proof

Step Hyp Ref Expression
1 mapdord.h 𝐻 = ( LHyp ‘ 𝐾 )
2 mapdord.u 𝑈 = ( ( DVecH ‘ 𝐾 ) ‘ 𝑊 )
3 mapdord.s 𝑆 = ( LSubSp ‘ 𝑈 )
4 mapdord.m 𝑀 = ( ( mapd ‘ 𝐾 ) ‘ 𝑊 )
5 mapdord.k ( 𝜑 → ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) )
6 mapdord.x ( 𝜑𝑋𝑆 )
7 mapdord.y ( 𝜑𝑌𝑆 )
8 mapdord.o 𝑂 = ( ( ocH ‘ 𝐾 ) ‘ 𝑊 )
9 mapdord.a 𝐴 = ( LSAtoms ‘ 𝑈 )
10 mapdord.f 𝐹 = ( LFnl ‘ 𝑈 )
11 mapdord.c 𝐽 = ( LSHyp ‘ 𝑈 )
12 mapdord.l 𝐿 = ( LKer ‘ 𝑈 )
13 mapdord.t 𝑇 = { 𝑔𝐹 ∣ ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑔 ) ) ) ∈ 𝐽 }
14 mapdord.q 𝐶 = { 𝑔𝐹 ∣ ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑔 ) ) ) = ( 𝐿𝑔 ) }
15 1 2 3 10 12 8 4 5 6 14 mapdvalc ( 𝜑 → ( 𝑀𝑋 ) = { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 } )
16 1 2 3 10 12 8 4 5 7 14 mapdvalc ( 𝜑 → ( 𝑀𝑌 ) = { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 } )
17 15 16 sseq12d ( 𝜑 → ( ( 𝑀𝑋 ) ⊆ ( 𝑀𝑌 ) ↔ { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 } ⊆ { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 } ) )
18 ss2rab ( { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 } ⊆ { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 } ↔ ∀ 𝑓𝐶 ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) )
19 eqid ( Base ‘ 𝑈 ) = ( Base ‘ 𝑈 )
20 1 8 2 19 11 10 12 13 14 5 mapdordlem1a ( 𝜑 → ( 𝑓𝑇 ↔ ( 𝑓𝐶 ∧ ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) ∈ 𝐽 ) ) )
21 simprl ( ( 𝜑 ∧ ( 𝑓𝐶 ∧ ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) ∈ 𝐽 ) ) → 𝑓𝐶 )
22 idd ( ( 𝜑 ∧ ( 𝑓𝐶 ∧ ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) ∈ 𝐽 ) ) → ( ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) → ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) )
23 21 22 embantd ( ( 𝜑 ∧ ( 𝑓𝐶 ∧ ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) ∈ 𝐽 ) ) → ( ( 𝑓𝐶 → ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) → ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) )
24 23 ex ( 𝜑 → ( ( 𝑓𝐶 ∧ ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) ∈ 𝐽 ) → ( ( 𝑓𝐶 → ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) → ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) ) )
25 20 24 sylbid ( 𝜑 → ( 𝑓𝑇 → ( ( 𝑓𝐶 → ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) → ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) ) )
26 25 com23 ( 𝜑 → ( ( 𝑓𝐶 → ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) → ( 𝑓𝑇 → ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) ) )
27 26 ralimdv2 ( 𝜑 → ( ∀ 𝑓𝐶 ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) → ∀ 𝑓𝑇 ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) )
28 18 27 biimtrid ( 𝜑 → ( { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 } ⊆ { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 } → ∀ 𝑓𝑇 ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) )
29 1 2 5 dvhlmod ( 𝜑𝑈 ∈ LMod )
30 3 9 29 6 7 lssatle ( 𝜑 → ( 𝑋𝑌 ↔ ∀ 𝑝𝐴 ( 𝑝𝑋𝑝𝑌 ) ) )
31 13 mapdordlem1 ( 𝑓𝑇 ↔ ( 𝑓𝐹 ∧ ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) ∈ 𝐽 ) )
32 31 simprbi ( 𝑓𝑇 → ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) ∈ 𝐽 )
33 32 adantl ( ( 𝜑𝑓𝑇 ) → ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) ∈ 𝐽 )
34 5 adantr ( ( 𝜑𝑓𝑇 ) → ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) )
35 31 simplbi ( 𝑓𝑇𝑓𝐹 )
36 35 adantl ( ( 𝜑𝑓𝑇 ) → 𝑓𝐹 )
37 1 8 2 10 11 12 34 36 dochlkr ( ( 𝜑𝑓𝑇 ) → ( ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) ∈ 𝐽 ↔ ( ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) = ( 𝐿𝑓 ) ∧ ( 𝐿𝑓 ) ∈ 𝐽 ) ) )
38 33 37 mpbid ( ( 𝜑𝑓𝑇 ) → ( ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) = ( 𝐿𝑓 ) ∧ ( 𝐿𝑓 ) ∈ 𝐽 ) )
39 38 simpld ( ( 𝜑𝑓𝑇 ) → ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) = ( 𝐿𝑓 ) )
40 38 simprd ( ( 𝜑𝑓𝑇 ) → ( 𝐿𝑓 ) ∈ 𝐽 )
41 1 8 2 9 11 34 40 dochshpsat ( ( 𝜑𝑓𝑇 ) → ( ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) = ( 𝐿𝑓 ) ↔ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ∈ 𝐴 ) )
42 39 41 mpbid ( ( 𝜑𝑓𝑇 ) → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ∈ 𝐴 )
43 1 2 5 dvhlvec ( 𝜑𝑈 ∈ LVec )
44 5 adantr ( ( 𝜑𝑝𝐴 ) → ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) )
45 simpr ( ( 𝜑𝑝𝐴 ) → 𝑝𝐴 )
46 1 2 8 9 11 44 45 dochsatshp ( ( 𝜑𝑝𝐴 ) → ( 𝑂𝑝 ) ∈ 𝐽 )
47 11 10 12 lshpkrex ( ( 𝑈 ∈ LVec ∧ ( 𝑂𝑝 ) ∈ 𝐽 ) → ∃ 𝑓𝐹 ( 𝐿𝑓 ) = ( 𝑂𝑝 ) )
48 43 46 47 syl2an2r ( ( 𝜑𝑝𝐴 ) → ∃ 𝑓𝐹 ( 𝐿𝑓 ) = ( 𝑂𝑝 ) )
49 simprl ( ( ( 𝜑𝑝𝐴 ) ∧ ( 𝑓𝐹 ∧ ( 𝐿𝑓 ) = ( 𝑂𝑝 ) ) ) → 𝑓𝐹 )
50 simprr ( ( ( 𝜑𝑝𝐴 ) ∧ ( 𝑓𝐹 ∧ ( 𝐿𝑓 ) = ( 𝑂𝑝 ) ) ) → ( 𝐿𝑓 ) = ( 𝑂𝑝 ) )
51 50 fveq2d ( ( ( 𝜑𝑝𝐴 ) ∧ ( 𝑓𝐹 ∧ ( 𝐿𝑓 ) = ( 𝑂𝑝 ) ) ) → ( 𝑂 ‘ ( 𝐿𝑓 ) ) = ( 𝑂 ‘ ( 𝑂𝑝 ) ) )
52 51 fveq2d ( ( ( 𝜑𝑝𝐴 ) ∧ ( 𝑓𝐹 ∧ ( 𝐿𝑓 ) = ( 𝑂𝑝 ) ) ) → ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) = ( 𝑂 ‘ ( 𝑂 ‘ ( 𝑂𝑝 ) ) ) )
53 29 adantr ( ( 𝜑𝑝𝐴 ) → 𝑈 ∈ LMod )
54 19 9 53 45 lsatssv ( ( 𝜑𝑝𝐴 ) → 𝑝 ⊆ ( Base ‘ 𝑈 ) )
55 eqid ( ( DIsoH ‘ 𝐾 ) ‘ 𝑊 ) = ( ( DIsoH ‘ 𝐾 ) ‘ 𝑊 )
56 1 55 2 19 8 dochcl ( ( ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) ∧ 𝑝 ⊆ ( Base ‘ 𝑈 ) ) → ( 𝑂𝑝 ) ∈ ran ( ( DIsoH ‘ 𝐾 ) ‘ 𝑊 ) )
57 5 54 56 syl2an2r ( ( 𝜑𝑝𝐴 ) → ( 𝑂𝑝 ) ∈ ran ( ( DIsoH ‘ 𝐾 ) ‘ 𝑊 ) )
58 1 55 8 dochoc ( ( ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) ∧ ( 𝑂𝑝 ) ∈ ran ( ( DIsoH ‘ 𝐾 ) ‘ 𝑊 ) ) → ( 𝑂 ‘ ( 𝑂 ‘ ( 𝑂𝑝 ) ) ) = ( 𝑂𝑝 ) )
59 5 57 58 syl2an2r ( ( 𝜑𝑝𝐴 ) → ( 𝑂 ‘ ( 𝑂 ‘ ( 𝑂𝑝 ) ) ) = ( 𝑂𝑝 ) )
60 59 adantr ( ( ( 𝜑𝑝𝐴 ) ∧ ( 𝑓𝐹 ∧ ( 𝐿𝑓 ) = ( 𝑂𝑝 ) ) ) → ( 𝑂 ‘ ( 𝑂 ‘ ( 𝑂𝑝 ) ) ) = ( 𝑂𝑝 ) )
61 52 60 eqtrd ( ( ( 𝜑𝑝𝐴 ) ∧ ( 𝑓𝐹 ∧ ( 𝐿𝑓 ) = ( 𝑂𝑝 ) ) ) → ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) = ( 𝑂𝑝 ) )
62 46 adantr ( ( ( 𝜑𝑝𝐴 ) ∧ ( 𝑓𝐹 ∧ ( 𝐿𝑓 ) = ( 𝑂𝑝 ) ) ) → ( 𝑂𝑝 ) ∈ 𝐽 )
63 61 62 eqeltrd ( ( ( 𝜑𝑝𝐴 ) ∧ ( 𝑓𝐹 ∧ ( 𝐿𝑓 ) = ( 𝑂𝑝 ) ) ) → ( 𝑂 ‘ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) ∈ 𝐽 )
64 49 63 31 sylanbrc ( ( ( 𝜑𝑝𝐴 ) ∧ ( 𝑓𝐹 ∧ ( 𝐿𝑓 ) = ( 𝑂𝑝 ) ) ) → 𝑓𝑇 )
65 1 2 55 9 dih1dimat ( ( ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) ∧ 𝑝𝐴 ) → 𝑝 ∈ ran ( ( DIsoH ‘ 𝐾 ) ‘ 𝑊 ) )
66 5 45 65 syl2an2r ( ( 𝜑𝑝𝐴 ) → 𝑝 ∈ ran ( ( DIsoH ‘ 𝐾 ) ‘ 𝑊 ) )
67 1 55 8 dochoc ( ( ( 𝐾 ∈ HL ∧ 𝑊𝐻 ) ∧ 𝑝 ∈ ran ( ( DIsoH ‘ 𝐾 ) ‘ 𝑊 ) ) → ( 𝑂 ‘ ( 𝑂𝑝 ) ) = 𝑝 )
68 5 66 67 syl2an2r ( ( 𝜑𝑝𝐴 ) → ( 𝑂 ‘ ( 𝑂𝑝 ) ) = 𝑝 )
69 68 adantr ( ( ( 𝜑𝑝𝐴 ) ∧ ( 𝑓𝐹 ∧ ( 𝐿𝑓 ) = ( 𝑂𝑝 ) ) ) → ( 𝑂 ‘ ( 𝑂𝑝 ) ) = 𝑝 )
70 51 69 eqtr2d ( ( ( 𝜑𝑝𝐴 ) ∧ ( 𝑓𝐹 ∧ ( 𝐿𝑓 ) = ( 𝑂𝑝 ) ) ) → 𝑝 = ( 𝑂 ‘ ( 𝐿𝑓 ) ) )
71 48 64 70 reximssdv ( ( 𝜑𝑝𝐴 ) → ∃ 𝑓𝑇 𝑝 = ( 𝑂 ‘ ( 𝐿𝑓 ) ) )
72 sseq1 ( 𝑝 = ( 𝑂 ‘ ( 𝐿𝑓 ) ) → ( 𝑝𝑋 ↔ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 ) )
73 sseq1 ( 𝑝 = ( 𝑂 ‘ ( 𝐿𝑓 ) ) → ( 𝑝𝑌 ↔ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) )
74 72 73 imbi12d ( 𝑝 = ( 𝑂 ‘ ( 𝐿𝑓 ) ) → ( ( 𝑝𝑋𝑝𝑌 ) ↔ ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) )
75 74 adantl ( ( 𝜑𝑝 = ( 𝑂 ‘ ( 𝐿𝑓 ) ) ) → ( ( 𝑝𝑋𝑝𝑌 ) ↔ ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) )
76 42 71 75 ralxfrd ( 𝜑 → ( ∀ 𝑝𝐴 ( 𝑝𝑋𝑝𝑌 ) ↔ ∀ 𝑓𝑇 ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ) )
77 30 76 bitr2d ( 𝜑 → ( ∀ 𝑓𝑇 ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) ↔ 𝑋𝑌 ) )
78 28 77 sylibd ( 𝜑 → ( { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 } ⊆ { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 } → 𝑋𝑌 ) )
79 simplr ( ( ( 𝜑𝑋𝑌 ) ∧ 𝑓𝐶 ) → 𝑋𝑌 )
80 sstr ( ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋𝑋𝑌 ) → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 )
81 80 ancoms ( ( 𝑋𝑌 ∧ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 ) → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 )
82 81 a1i ( ( ( 𝜑𝑋𝑌 ) ∧ 𝑓𝐶 ) → ( ( 𝑋𝑌 ∧ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 ) → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) )
83 79 82 mpand ( ( ( 𝜑𝑋𝑌 ) ∧ 𝑓𝐶 ) → ( ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 → ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 ) )
84 83 ss2rabdv ( ( 𝜑𝑋𝑌 ) → { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 } ⊆ { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 } )
85 84 ex ( 𝜑 → ( 𝑋𝑌 → { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 } ⊆ { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 } ) )
86 78 85 impbid ( 𝜑 → ( { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑋 } ⊆ { 𝑓𝐶 ∣ ( 𝑂 ‘ ( 𝐿𝑓 ) ) ⊆ 𝑌 } ↔ 𝑋𝑌 ) )
87 17 86 bitrd ( 𝜑 → ( ( 𝑀𝑋 ) ⊆ ( 𝑀𝑌 ) ↔ 𝑋𝑌 ) )