![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > hdmap1l6a | Structured version Visualization version GIF version |
Description: Lemma for hdmap1l6 41778. Part (6) in [Baer] p. 47, case 1. (Contributed by NM, 23-Apr-2015.) |
Ref | Expression |
---|---|
hdmap1l6.h | ⊢ 𝐻 = (LHyp‘𝐾) |
hdmap1l6.u | ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) |
hdmap1l6.v | ⊢ 𝑉 = (Base‘𝑈) |
hdmap1l6.p | ⊢ + = (+g‘𝑈) |
hdmap1l6.s | ⊢ − = (-g‘𝑈) |
hdmap1l6c.o | ⊢ 0 = (0g‘𝑈) |
hdmap1l6.n | ⊢ 𝑁 = (LSpan‘𝑈) |
hdmap1l6.c | ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊) |
hdmap1l6.d | ⊢ 𝐷 = (Base‘𝐶) |
hdmap1l6.a | ⊢ ✚ = (+g‘𝐶) |
hdmap1l6.r | ⊢ 𝑅 = (-g‘𝐶) |
hdmap1l6.q | ⊢ 𝑄 = (0g‘𝐶) |
hdmap1l6.l | ⊢ 𝐿 = (LSpan‘𝐶) |
hdmap1l6.m | ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊) |
hdmap1l6.i | ⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊) |
hdmap1l6.k | ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
hdmap1l6.f | ⊢ (𝜑 → 𝐹 ∈ 𝐷) |
hdmap1l6cl.x | ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 })) |
hdmap1l6.mn | ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐿‘{𝐹})) |
hdmap1l6e.y | ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 })) |
hdmap1l6e.z | ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 })) |
hdmap1l6e.xn | ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍})) |
hdmap1l6.yz | ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) |
hdmap1l6.fg | ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑌〉) = 𝐺) |
hdmap1l6.fe | ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑍〉) = 𝐸) |
Ref | Expression |
---|---|
hdmap1l6a | ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, (𝑌 + 𝑍)〉) = ((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hdmap1l6.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
2 | hdmap1l6.u | . . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) | |
3 | hdmap1l6.v | . . . 4 ⊢ 𝑉 = (Base‘𝑈) | |
4 | hdmap1l6.p | . . . 4 ⊢ + = (+g‘𝑈) | |
5 | hdmap1l6.s | . . . 4 ⊢ − = (-g‘𝑈) | |
6 | hdmap1l6c.o | . . . 4 ⊢ 0 = (0g‘𝑈) | |
7 | hdmap1l6.n | . . . 4 ⊢ 𝑁 = (LSpan‘𝑈) | |
8 | hdmap1l6.c | . . . 4 ⊢ 𝐶 = ((LCDual‘𝐾)‘𝑊) | |
9 | hdmap1l6.d | . . . 4 ⊢ 𝐷 = (Base‘𝐶) | |
10 | hdmap1l6.a | . . . 4 ⊢ ✚ = (+g‘𝐶) | |
11 | hdmap1l6.r | . . . 4 ⊢ 𝑅 = (-g‘𝐶) | |
12 | hdmap1l6.q | . . . 4 ⊢ 𝑄 = (0g‘𝐶) | |
13 | hdmap1l6.l | . . . 4 ⊢ 𝐿 = (LSpan‘𝐶) | |
14 | hdmap1l6.m | . . . 4 ⊢ 𝑀 = ((mapd‘𝐾)‘𝑊) | |
15 | hdmap1l6.i | . . . 4 ⊢ 𝐼 = ((HDMap1‘𝐾)‘𝑊) | |
16 | hdmap1l6.k | . . . 4 ⊢ (𝜑 → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
17 | hdmap1l6.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐷) | |
18 | hdmap1l6cl.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ (𝑉 ∖ { 0 })) | |
19 | hdmap1l6.mn | . . . 4 ⊢ (𝜑 → (𝑀‘(𝑁‘{𝑋})) = (𝐿‘{𝐹})) | |
20 | hdmap1l6e.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 })) | |
21 | hdmap1l6e.z | . . . 4 ⊢ (𝜑 → 𝑍 ∈ (𝑉 ∖ { 0 })) | |
22 | hdmap1l6e.xn | . . . 4 ⊢ (𝜑 → ¬ 𝑋 ∈ (𝑁‘{𝑌, 𝑍})) | |
23 | hdmap1l6.yz | . . . 4 ⊢ (𝜑 → (𝑁‘{𝑌}) ≠ (𝑁‘{𝑍})) | |
24 | hdmap1l6.fg | . . . 4 ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑌〉) = 𝐺) | |
25 | hdmap1l6.fe | . . . 4 ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑍〉) = 𝐸) | |
26 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25 | hdmap1l6lem2 41765 | . . 3 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑌 + 𝑍)})) = (𝐿‘{(𝐺 ✚ 𝐸)})) |
27 | 24, 25 | oveq12d 7466 | . . . . 5 ⊢ (𝜑 → ((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉)) = (𝐺 ✚ 𝐸)) |
28 | 27 | sneqd 4660 | . . . 4 ⊢ (𝜑 → {((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉))} = {(𝐺 ✚ 𝐸)}) |
29 | 28 | fveq2d 6924 | . . 3 ⊢ (𝜑 → (𝐿‘{((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉))}) = (𝐿‘{(𝐺 ✚ 𝐸)})) |
30 | 26, 29 | eqtr4d 2783 | . 2 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑌 + 𝑍)})) = (𝐿‘{((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉))})) |
31 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25 | hdmap1l6lem1 41764 | . . 3 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − (𝑌 + 𝑍))})) = (𝐿‘{(𝐹𝑅(𝐺 ✚ 𝐸))})) |
32 | 27 | oveq2d 7464 | . . . . 5 ⊢ (𝜑 → (𝐹𝑅((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉))) = (𝐹𝑅(𝐺 ✚ 𝐸))) |
33 | 32 | sneqd 4660 | . . . 4 ⊢ (𝜑 → {(𝐹𝑅((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉)))} = {(𝐹𝑅(𝐺 ✚ 𝐸))}) |
34 | 33 | fveq2d 6924 | . . 3 ⊢ (𝜑 → (𝐿‘{(𝐹𝑅((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉)))}) = (𝐿‘{(𝐹𝑅(𝐺 ✚ 𝐸))})) |
35 | 31, 34 | eqtr4d 2783 | . 2 ⊢ (𝜑 → (𝑀‘(𝑁‘{(𝑋 − (𝑌 + 𝑍))})) = (𝐿‘{(𝐹𝑅((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉)))})) |
36 | 1, 2, 16 | dvhlmod 41067 | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ LMod) |
37 | 20 | eldifad 3988 | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑉) |
38 | 21 | eldifad 3988 | . . . . 5 ⊢ (𝜑 → 𝑍 ∈ 𝑉) |
39 | 3, 4 | lmodvacl 20895 | . . . . 5 ⊢ ((𝑈 ∈ LMod ∧ 𝑌 ∈ 𝑉 ∧ 𝑍 ∈ 𝑉) → (𝑌 + 𝑍) ∈ 𝑉) |
40 | 36, 37, 38, 39 | syl3anc 1371 | . . . 4 ⊢ (𝜑 → (𝑌 + 𝑍) ∈ 𝑉) |
41 | 3, 4, 6, 7, 36, 37, 38, 23 | lmodindp1 21035 | . . . 4 ⊢ (𝜑 → (𝑌 + 𝑍) ≠ 0 ) |
42 | eldifsn 4811 | . . . 4 ⊢ ((𝑌 + 𝑍) ∈ (𝑉 ∖ { 0 }) ↔ ((𝑌 + 𝑍) ∈ 𝑉 ∧ (𝑌 + 𝑍) ≠ 0 )) | |
43 | 40, 41, 42 | sylanbrc 582 | . . 3 ⊢ (𝜑 → (𝑌 + 𝑍) ∈ (𝑉 ∖ { 0 })) |
44 | 1, 8, 16 | lcdlmod 41549 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ LMod) |
45 | 1, 2, 16 | dvhlvec 41066 | . . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ LVec) |
46 | 18 | eldifad 3988 | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
47 | 3, 6, 7, 45, 37, 21, 46, 23, 22 | lspindp2 21160 | . . . . . 6 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑌}) ∧ ¬ 𝑍 ∈ (𝑁‘{𝑋, 𝑌}))) |
48 | 47 | simpld 494 | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑌})) |
49 | 1, 2, 3, 6, 7, 8, 9, 13, 14, 15, 16, 17, 19, 48, 18, 37 | hdmap1cl 41761 | . . . 4 ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑌〉) ∈ 𝐷) |
50 | 3, 6, 7, 45, 20, 38, 46, 23, 22 | lspindp1 21158 | . . . . . 6 ⊢ (𝜑 → ((𝑁‘{𝑋}) ≠ (𝑁‘{𝑍}) ∧ ¬ 𝑌 ∈ (𝑁‘{𝑋, 𝑍}))) |
51 | 50 | simpld 494 | . . . . 5 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{𝑍})) |
52 | 1, 2, 3, 6, 7, 8, 9, 13, 14, 15, 16, 17, 19, 51, 18, 38 | hdmap1cl 41761 | . . . 4 ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑍〉) ∈ 𝐷) |
53 | 9, 10 | lmodvacl 20895 | . . . 4 ⊢ ((𝐶 ∈ LMod ∧ (𝐼‘〈𝑋, 𝐹, 𝑌〉) ∈ 𝐷 ∧ (𝐼‘〈𝑋, 𝐹, 𝑍〉) ∈ 𝐷) → ((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉)) ∈ 𝐷) |
54 | 44, 49, 52, 53 | syl3anc 1371 | . . 3 ⊢ (𝜑 → ((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉)) ∈ 𝐷) |
55 | eqid 2740 | . . . . . 6 ⊢ (LSubSp‘𝑈) = (LSubSp‘𝑈) | |
56 | 3, 55, 7, 36, 37, 38 | lspprcl 20999 | . . . . . 6 ⊢ (𝜑 → (𝑁‘{𝑌, 𝑍}) ∈ (LSubSp‘𝑈)) |
57 | 3, 4, 7, 36, 37, 38 | lspprvacl 21020 | . . . . . 6 ⊢ (𝜑 → (𝑌 + 𝑍) ∈ (𝑁‘{𝑌, 𝑍})) |
58 | 55, 7, 36, 56, 57 | ellspsn5 21017 | . . . . 5 ⊢ (𝜑 → (𝑁‘{(𝑌 + 𝑍)}) ⊆ (𝑁‘{𝑌, 𝑍})) |
59 | 3, 55, 7, 36, 56, 46 | ellspsn5b 21016 | . . . . . 6 ⊢ (𝜑 → (𝑋 ∈ (𝑁‘{𝑌, 𝑍}) ↔ (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑌, 𝑍}))) |
60 | 22, 59 | mtbid 324 | . . . . 5 ⊢ (𝜑 → ¬ (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑌, 𝑍})) |
61 | nssne2 4072 | . . . . 5 ⊢ (((𝑁‘{(𝑌 + 𝑍)}) ⊆ (𝑁‘{𝑌, 𝑍}) ∧ ¬ (𝑁‘{𝑋}) ⊆ (𝑁‘{𝑌, 𝑍})) → (𝑁‘{(𝑌 + 𝑍)}) ≠ (𝑁‘{𝑋})) | |
62 | 58, 60, 61 | syl2anc 583 | . . . 4 ⊢ (𝜑 → (𝑁‘{(𝑌 + 𝑍)}) ≠ (𝑁‘{𝑋})) |
63 | 62 | necomd 3002 | . . 3 ⊢ (𝜑 → (𝑁‘{𝑋}) ≠ (𝑁‘{(𝑌 + 𝑍)})) |
64 | 1, 2, 3, 5, 6, 7, 8, 9, 11, 13, 14, 15, 16, 18, 17, 43, 54, 63, 19 | hdmap1eq 41758 | . 2 ⊢ (𝜑 → ((𝐼‘〈𝑋, 𝐹, (𝑌 + 𝑍)〉) = ((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉)) ↔ ((𝑀‘(𝑁‘{(𝑌 + 𝑍)})) = (𝐿‘{((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉))}) ∧ (𝑀‘(𝑁‘{(𝑋 − (𝑌 + 𝑍))})) = (𝐿‘{(𝐹𝑅((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉)))})))) |
65 | 30, 35, 64 | mpbir2and 712 | 1 ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, (𝑌 + 𝑍)〉) = ((𝐼‘〈𝑋, 𝐹, 𝑌〉) ✚ (𝐼‘〈𝑋, 𝐹, 𝑍〉))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 ∖ cdif 3973 ⊆ wss 3976 {csn 4648 {cpr 4650 〈cotp 4656 ‘cfv 6573 (class class class)co 7448 Basecbs 17258 +gcplusg 17311 0gc0g 17499 -gcsg 18975 LModclmod 20880 LSubSpclss 20952 LSpanclspn 20992 HLchlt 39306 LHypclh 39941 DVecHcdvh 41035 LCDualclcd 41543 mapdcmpd 41581 HDMap1chdma1 41748 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-riotaBAD 38909 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-ot 4657 df-uni 4932 df-int 4971 df-iun 5017 df-iin 5018 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-of 7714 df-om 7904 df-1st 8030 df-2nd 8031 df-tpos 8267 df-undef 8314 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-2o 8523 df-er 8763 df-map 8886 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-n0 12554 df-z 12640 df-uz 12904 df-fz 13568 df-struct 17194 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-ress 17288 df-plusg 17324 df-mulr 17325 df-sca 17327 df-vsca 17328 df-0g 17501 df-mre 17644 df-mrc 17645 df-acs 17647 df-proset 18365 df-poset 18383 df-plt 18400 df-lub 18416 df-glb 18417 df-join 18418 df-meet 18419 df-p0 18495 df-p1 18496 df-lat 18502 df-clat 18569 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-submnd 18819 df-grp 18976 df-minusg 18977 df-sbg 18978 df-subg 19163 df-cntz 19357 df-oppg 19386 df-lsm 19678 df-cmn 19824 df-abl 19825 df-mgp 20162 df-rng 20180 df-ur 20209 df-ring 20262 df-oppr 20360 df-dvdsr 20383 df-unit 20384 df-invr 20414 df-dvr 20427 df-nzr 20539 df-rlreg 20716 df-domn 20717 df-drng 20753 df-lmod 20882 df-lss 20953 df-lsp 20993 df-lvec 21125 df-lsatoms 38932 df-lshyp 38933 df-lcv 38975 df-lfl 39014 df-lkr 39042 df-ldual 39080 df-oposet 39132 df-ol 39134 df-oml 39135 df-covers 39222 df-ats 39223 df-atl 39254 df-cvlat 39278 df-hlat 39307 df-llines 39455 df-lplanes 39456 df-lvols 39457 df-lines 39458 df-psubsp 39460 df-pmap 39461 df-padd 39753 df-lhyp 39945 df-laut 39946 df-ldil 40061 df-ltrn 40062 df-trl 40116 df-tgrp 40700 df-tendo 40712 df-edring 40714 df-dveca 40960 df-disoa 40986 df-dvech 41036 df-dib 41096 df-dic 41130 df-dih 41186 df-doch 41305 df-djh 41352 df-lcdual 41544 df-mapd 41582 df-hdmap1 41750 |
This theorem is referenced by: hdmap1l6d 41770 hdmap1l6e 41771 hdmap1l6f 41772 hdmap1l6j 41776 |
Copyright terms: Public domain | W3C validator |