| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > hdmap1eulemOLDN | Structured version Visualization version GIF version | ||
| Description: Lemma for hdmap1euOLDN 42413. TODO: combine with hdmap1euOLDN 42413 or at least share some hypotheses. (Contributed by NM, 15-May-2015.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| hdmap1eulem.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| hdmap1eulem.u | ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) |
| hdmap1eulem.v | ⊢ 𝑉 = (Base‘𝑈) |
| hdmap1eulem.s | ⊢ − = (-g‘𝑈) |
| hdmap1eulem.o | ⊢ 0 = (0g‘𝑈) |
| hdmap1eulem.n | ⊢ 𝑁 = (LSpan‘𝑈) |
| hdmap1eulem.c | ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊) |
| hdmap1eulem.d | ⊢ 𝐷 = (Base‘𝐶) |
| hdmap1eulem.r | ⊢ 𝑅 = (-g‘𝐶) |
| hdmap1eulem.q | ⊢ 𝑄 = (0g‘𝐶) |
| hdmap1eulem.j | ⊢ 𝐽 = (LSpan‘𝐶) |
| hdmap1eulem.m | ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊) |
| hdmap1eulem.i | ⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊) |
| hdmap1eulem.k | ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
| hdmap1eulem.mn | ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹})) |
| hdmap1eulem.x | ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 })) |
| hdmap1eulem.f | ⊢ (𝜑 → 𝐹 ∈ 𝐷) |
| hdmap1eulem.y | ⊢ (𝜑 → 𝑇 ∈ 𝑉) |
| hdmap1eulem.l | ⊢ 𝐿 = (𝑥 ∈ V ↦ if((2nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘𝑥)) − (2nd ‘𝑥))})) = (𝐽‘{((2nd ‘(1st ‘𝑥))𝑅ℎ)}))))) |
| Ref | Expression |
|---|---|
| hdmap1eulemOLDN | ⊢ (𝜑 → ∃!𝑦 ∈ 𝐷 ∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hdmap1eulem.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 2 | hdmap1eulem.u | . . 3 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) | |
| 3 | hdmap1eulem.v | . . 3 ⊢ 𝑉 = (Base‘𝑈) | |
| 4 | hdmap1eulem.s | . . 3 ⊢ − = (-g‘𝑈) | |
| 5 | hdmap1eulem.o | . . 3 ⊢ 0 = (0g‘𝑈) | |
| 6 | hdmap1eulem.n | . . 3 ⊢ 𝑁 = (LSpan‘𝑈) | |
| 7 | hdmap1eulem.c | . . 3 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊) | |
| 8 | hdmap1eulem.d | . . 3 ⊢ 𝐷 = (Base‘𝐶) | |
| 9 | hdmap1eulem.r | . . 3 ⊢ 𝑅 = (-g‘𝐶) | |
| 10 | hdmap1eulem.q | . . 3 ⊢ 𝑄 = (0g‘𝐶) | |
| 11 | hdmap1eulem.j | . . 3 ⊢ 𝐽 = (LSpan‘𝐶) | |
| 12 | hdmap1eulem.m | . . 3 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊) | |
| 13 | hdmap1eulem.l | . . 3 ⊢ 𝐿 = (𝑥 ∈ V ↦ if((2nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘𝑥)) − (2nd ‘𝑥))})) = (𝐽‘{((2nd ‘(1st ‘𝑥))𝑅ℎ)}))))) | |
| 14 | hdmap1eulem.k | . . 3 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 15 | hdmap1eulem.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐷) | |
| 16 | hdmap1eulem.mn | . . 3 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹})) | |
| 17 | hdmap1eulem.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 })) | |
| 18 | hdmap1eulem.y | . . 3 ⊢ (𝜑 → 𝑇 ∈ 𝑉) | |
| 19 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18 | mapdh9aOLDN 42378 | . 2 ⊢ (𝜑 → ∃!𝑦 ∈ 𝐷 ∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉))) |
| 20 | hdmap1eulem.i | . . . . . . . . . 10 ⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊) | |
| 21 | 14 | ad2antrr 736 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
| 22 | 17 | ad2antrr 736 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑋 ∈ (𝑉 ∖ { 0 })) |
| 23 | 15 | ad2antrr 736 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝐹 ∈ 𝐷) |
| 24 | simplr 778 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑧 ∈ 𝑉) | |
| 25 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 20, 21, 22, 23, 24, 13 | hdmap1valc 42391 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝐼‘〈𝑋, 𝐹, 𝑧〉) = (𝐿‘〈𝑋, 𝐹, 𝑧〉)) |
| 26 | 25 | oteq2d 4843 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉 = 〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉) |
| 27 | 26 | fveq2d 6867 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉) = (𝐼‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)) |
| 28 | eqid 2761 | . . . . . . . . 9 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈) | |
| 29 | 1, 2, 14 | dvhlmod 41698 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑈 ∈ LMod) |
| 30 | 29 | ad2antrr 736 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑈 ∈ LMod) |
| 31 | 17 | eldifad 3916 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| 32 | 3, 28, 6, 29, 31, 18 | lspprcl 21025 | . . . . . . . . . 10 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑇}) ∈ (LSubSp‘𝑈)) |
| 33 | 32 | ad2antrr 736 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝑁‘{𝑋, 𝑇}) ∈ (LSubSp‘𝑈)) |
| 34 | simpr 488 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) | |
| 35 | 5, 28, 30, 33, 24, 34 | lssneln0 21000 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑧 ∈ (𝑉 ∖ { 0 })) |
| 36 | 16 | ad2antrr 736 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹})) |
| 37 | 1, 2, 14 | dvhlvec 41697 | . . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑈 ∈ LVec) |
| 38 | 37 | ad2antrr 736 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑈 ∈ LVec) |
| 39 | 31 | ad2antrr 736 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑋 ∈ 𝑉) |
| 40 | 18 | ad2antrr 736 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑇 ∈ 𝑉) |
| 41 | 3, 6, 38, 24, 39, 40, 34 | lspindpi 21182 | . . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → ((𝑁‘{𝑧}) ≠ (𝑁‘{𝑋}) ∧ (𝑁‘{𝑧}) ≠ (𝑁‘{𝑇}))) |
| 42 | 41 | simpld 498 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝑁‘{𝑧}) ≠ (𝑁‘{𝑋})) |
| 43 | 42 | necomd 3011 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑧})) |
| 44 | 10, 13, 1, 12, 2, 3, 4, 5, 6, 7, 8, 9, 11, 21, 23, 36, 22, 24, 43 | mapdhcl 42315 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝐿‘〈𝑋, 𝐹, 𝑧〉) ∈ 𝐷) |
| 45 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 20, 21, 35, 44, 40, 13 | hdmap1valc 42391 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝐼‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉) = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)) |
| 46 | 27, 45 | eqtrd 2796 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉) = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)) |
| 47 | 46 | eqeq2d 2772 | . . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝑦 = (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉) ↔ 𝑦 = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉))) |
| 48 | 47 | pm5.74da 813 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑉) → ((¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)) ↔ (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)))) |
| 49 | 48 | ralbidva 3182 | . . 3 ⊢ (𝜑 → (∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)) ↔ ∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)))) |
| 50 | 49 | reubidv 3382 | . 2 ⊢ (𝜑 → (∃!𝑦 ∈ 𝐷 ∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)) ↔ ∃!𝑦 ∈ 𝐷 ∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)))) |
| 51 | 19, 50 | mpbird 259 | 1 ⊢ (𝜑 → ∃!𝑦 ∈ 𝐷 ∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ∀wral 3075 ∃!wreu 3364 Vcvv 3453 ∖ cdif 3901 ifcif 4479 {csn 4581 {cpr 4583 〈cotp 4589 ↦ cmpt 5180 ‘cfv 6517 ℩crio 7348 (class class class)co 7392 1st c1st 7964 2nd c2nd 7965 Basecbs 17228 0gc0g 17451 -gcsg 18960 LModclmod 20907 LSubSpclss 20978 LSpanclspn 21018 LVecclvec 21149 HLchlt 39938 LHypclh 40572 DVecHcdvh 41666 LCDualclcd 42174 mapdcmpd 42212 HDMap1chdma1 42379 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147 ax-riotaBAD 39541 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-ot 4590 df-uni 4865 df-int 4905 df-iun 4950 df-iin 4951 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-of 7656 df-om 7843 df-1st 7966 df-2nd 7967 df-tpos 8201 df-undef 8248 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-1o 8432 df-2o 8433 df-er 8673 df-map 8805 df-en 8924 df-dom 8925 df-sdom 8926 df-fin 8927 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-nn 12208 df-2 12277 df-3 12278 df-4 12279 df-5 12280 df-6 12281 df-n0 12479 df-z 12566 df-uz 12837 df-fz 13510 df-struct 17166 df-sets 17183 df-slot 17201 df-ndx 17213 df-base 17229 df-ress 17250 df-plusg 17282 df-mulr 17283 df-sca 17285 df-vsca 17286 df-0g 17453 df-mre 17597 df-mrc 17598 df-acs 17600 df-proset 18309 df-poset 18328 df-plt 18343 df-lub 18359 df-glb 18360 df-join 18361 df-meet 18362 df-p0 18438 df-p1 18439 df-lat 18447 df-clat 18514 df-mgm 18657 df-sgrp 18736 df-mnd 18752 df-submnd 18801 df-grp 18961 df-minusg 18962 df-sbg 18963 df-subg 19148 df-cntz 19340 df-oppg 19369 df-lsm 19659 df-cmn 19805 df-abl 19806 df-mgp 20170 df-rng 20182 df-ur 20211 df-ring 20264 df-oppr 20365 df-dvdsr 20385 df-unit 20386 df-invr 20416 df-dvr 20429 df-nzr 20542 df-rlreg 20723 df-domn 20724 df-drng 20760 df-lmod 20909 df-lss 20979 df-lsp 21019 df-lvec 21150 df-lsatoms 39564 df-lshyp 39565 df-lcv 39607 df-lfl 39646 df-lkr 39674 df-ldual 39712 df-oposet 39764 df-ol 39766 df-oml 39767 df-covers 39854 df-ats 39855 df-atl 39886 df-cvlat 39910 df-hlat 39939 df-llines 40086 df-lplanes 40087 df-lvols 40088 df-lines 40089 df-psubsp 40091 df-pmap 40092 df-padd 40384 df-lhyp 40576 df-laut 40577 df-ldil 40692 df-ltrn 40693 df-trl 40747 df-tgrp 41331 df-tendo 41343 df-edring 41345 df-dveca 41591 df-disoa 41617 df-dvech 41667 df-dib 41727 df-dic 41761 df-dih 41817 df-doch 41936 df-djh 41983 df-lcdual 42175 df-mapd 42213 df-hdmap1 42381 |
| This theorem is referenced by: hdmap1euOLDN 42413 |
| Copyright terms: Public domain | W3C validator |