| 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 42850. TODO: combine with hdmap1euOLDN 42850 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 42815 | . 2 ⊢ (𝜑 → ∃!𝑦 ∈ 𝐷 ∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉))) |
| 20 | hdmap1eulem.i | . . . . . . . . . 10 ⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊) | |
| 21 | 14 | ad2antrr 739 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
| 22 | 17 | ad2antrr 739 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑋 ∈ (𝑉 ∖ { 0 })) |
| 23 | 15 | ad2antrr 739 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝐹 ∈ 𝐷) |
| 24 | simplr 781 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑧 ∈ 𝑉) | |
| 25 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 20, 21, 22, 23, 24, 13 | hdmap1valc 42828 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝐼‘〈𝑋, 𝐹, 𝑧〉) = (𝐿‘〈𝑋, 𝐹, 𝑧〉)) |
| 26 | 25 | oteq2d 4846 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉 = 〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉) |
| 27 | 26 | fveq2d 6881 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉) = (𝐼‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)) |
| 28 | eqid 2761 | . . . . . . . . 9 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈) | |
| 29 | 1, 2, 14 | dvhlmod 42135 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑈 ∈ LMod) |
| 30 | 29 | ad2antrr 739 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑈 ∈ LMod) |
| 31 | 17 | eldifad 3911 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
| 32 | 3, 28, 6, 29, 31, 18 | lspprcl 21233 | . . . . . . . . . 10 ⊢ (𝜑 → (𝑁‘{𝑋, 𝑇}) ∈ (LSubSp‘𝑈)) |
| 33 | 32 | ad2antrr 739 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝑁‘{𝑋, 𝑇}) ∈ (LSubSp‘𝑈)) |
| 34 | simpr 490 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) | |
| 35 | 5, 28, 30, 33, 24, 34 | lssneln0 21208 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑧 ∈ (𝑉 ∖ { 0 })) |
| 36 | 16 | ad2antrr 739 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝑀‘(𝑁‘{𝑋})) = (𝐽‘{𝐹})) |
| 37 | 1, 2, 14 | dvhlvec 42134 | . . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑈 ∈ LVec) |
| 38 | 37 | ad2antrr 739 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑈 ∈ LVec) |
| 39 | 31 | ad2antrr 739 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑋 ∈ 𝑉) |
| 40 | 18 | ad2antrr 739 | . . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → 𝑇 ∈ 𝑉) |
| 41 | 3, 6, 38, 24, 39, 40, 34 | lspindpi 21390 | . . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → ((𝑁‘{𝑧}) ≠ (𝑁‘{𝑋}) ∧ (𝑁‘{𝑧}) ≠ (𝑁‘{𝑇}))) |
| 42 | 41 | simpld 500 | . . . . . . . . . 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 42752 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝐿‘〈𝑋, 𝐹, 𝑧〉) ∈ 𝐷) |
| 45 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 20, 21, 35, 44, 40, 13 | hdmap1valc 42828 | . . . . . . 7 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝐼‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉) = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)) |
| 46 | 27, 45 | eqtrd 2796 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉) = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)) |
| 47 | 46 | eqeq2d 2772 | . . . . 5 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝑉) ∧ ¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇})) → (𝑦 = (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉) ↔ 𝑦 = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉))) |
| 48 | 47 | pm5.74da 816 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑉) → ((¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)) ↔ (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)))) |
| 49 | 48 | ralbidva 3184 | . . 3 ⊢ (𝜑 → (∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)) ↔ ∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)))) |
| 50 | 49 | reubidv 3382 | . 2 ⊢ (𝜑 → (∃!𝑦 ∈ 𝐷 ∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)) ↔ ∃!𝑦 ∈ 𝐷 ∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐿‘〈𝑧, (𝐿‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉)))) |
| 51 | 19, 50 | mpbird 260 | 1 ⊢ (𝜑 → ∃!𝑦 ∈ 𝐷 ∀𝑧 ∈ 𝑉 (¬ 𝑧 ∈ (𝑁‘{𝑋, 𝑇}) → 𝑦 = (𝐼‘〈𝑧, (𝐼‘〈𝑋, 𝐹, 𝑧〉), 𝑇〉))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∀wral 3077 ∃!wreu 3364 Vcvv 3451 ∖ cdif 3896 ifcif 4482 {csn 4584 {cpr 4586 〈cotp 4592 ↦ cmpt 5186 ‘cfv 6531 ℩crio 7368 (class class class)co 7412 1st c1st 7988 2nd c2nd 7989 Basecbs 17367 0gc0g 17590 -gcsg 19126 LModclmod 21115 LSubSpclss 21186 LSpanclspn 21226 LVecclvec 21357 HLchlt 40375 LHypclh 41009 DVecHcdvh 42103 LCDualclcd 42611 mapdcmpd 42649 HDMap1chdma1 42816 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-riotaBAD 39978 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-ot 4593 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7682 df-om 7867 df-1st 7990 df-2nd 7991 df-tpos 8227 df-undef 8274 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-2o 8461 df-er 8701 df-map 8833 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-nn 12317 df-2 12386 df-3 12387 df-4 12388 df-5 12389 df-6 12390 df-n0 12588 df-z 12675 df-uz 12947 df-fz 13621 df-struct 17305 df-sets 17322 df-slot 17340 df-ndx 17352 df-base 17368 df-ress 17389 df-plusg 17421 df-mulr 17422 df-sca 17424 df-vsca 17425 df-0g 17592 df-mre 17736 df-mrc 17737 df-acs 17739 df-proset 18448 df-poset 18467 df-plt 18482 df-lub 18498 df-glb 18499 df-join 18500 df-meet 18501 df-p0 18577 df-p1 18578 df-lat 18586 df-clat 18653 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-submnd 18959 df-grp 19127 df-minusg 19128 df-sbg 19129 df-subg 19313 df-cntz 19511 df-oppg 19540 df-lsm 19830 df-cmn 19976 df-abl 19977 df-mgp 20341 df-rng 20355 df-ur 20388 df-ring 20441 df-oppr 20547 df-dvdsr 20567 df-unit 20568 df-invr 20598 df-dvr 20611 df-nzr 20743 df-rlreg 20926 df-domn 20927 df-drng 20962 df-lmod 21117 df-lss 21187 df-lsp 21227 df-lvec 21358 df-lsatoms 40001 df-lshyp 40002 df-lcv 40044 df-lfl 40083 df-lkr 40111 df-ldual 40149 df-oposet 40201 df-ol 40203 df-oml 40204 df-covers 40291 df-ats 40292 df-atl 40323 df-cvlat 40347 df-hlat 40376 df-llines 40523 df-lplanes 40524 df-lvols 40525 df-lines 40526 df-psubsp 40528 df-pmap 40529 df-padd 40821 df-lhyp 41013 df-laut 41014 df-ldil 41129 df-ltrn 41130 df-trl 41184 df-tgrp 41768 df-tendo 41780 df-edring 41782 df-dveca 42028 df-disoa 42054 df-dvech 42104 df-dib 42164 df-dic 42198 df-dih 42254 df-doch 42373 df-djh 42420 df-lcdual 42612 df-mapd 42650 df-hdmap1 42818 |
| This theorem is used by: hdmap1euOLDN 42850 |
| Copyright terms: Public domain | W3C validator |