![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dihordlem6 | Structured version Visualization version GIF version |
Description: Part of proof of Lemma N of [Crawley] p. 122 line 35. (Contributed by NM, 3-Mar-2014.) |
Ref | Expression |
---|---|
dihordlem8.b | ⊢ 𝐵 = (Base‘𝐾) |
dihordlem8.l | ⊢ ≤ = (le‘𝐾) |
dihordlem8.a | ⊢ 𝐴 = (Atoms‘𝐾) |
dihordlem8.h | ⊢ 𝐻 = (LHyp‘𝐾) |
dihordlem8.p | ⊢ 𝑃 = ((oc‘𝐾)‘𝑊) |
dihordlem8.o | ⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵)) |
dihordlem8.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
dihordlem8.e | ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) |
dihordlem8.u | ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) |
dihordlem8.s | ⊢ + = (+g‘𝑈) |
dihordlem8.g | ⊢ 𝐺 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑅) |
Ref | Expression |
---|---|
dihordlem6 | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉) = 〈((𝑠‘𝐺) ∘ 𝑔), 𝑠〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1133 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
2 | simp2r 1197 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) | |
3 | simp2l 1196 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) | |
4 | simp3 1135 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) | |
5 | dihordlem8.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
6 | dihordlem8.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
7 | dihordlem8.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
8 | dihordlem8.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
9 | dihordlem8.p | . . 3 ⊢ 𝑃 = ((oc‘𝐾)‘𝑊) | |
10 | dihordlem8.o | . . 3 ⊢ 𝑂 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵)) | |
11 | dihordlem8.t | . . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
12 | dihordlem8.e | . . 3 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) | |
13 | dihordlem8.u | . . 3 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊) | |
14 | dihordlem8.s | . . 3 ⊢ + = (+g‘𝑈) | |
15 | dihordlem8.g | . . 3 ⊢ 𝐺 = (℩ℎ ∈ 𝑇 (ℎ‘𝑃) = 𝑅) | |
16 | 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 | cdlemn6 40901 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉) = 〈((𝑠‘𝐺) ∘ 𝑔), 𝑠〉) |
17 | 1, 2, 3, 4, 16 | syl121anc 1372 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑔 ∈ 𝑇)) → (〈(𝑠‘𝐺), 𝑠〉 + 〈𝑔, 𝑂〉) = 〈((𝑠‘𝐺) ∘ 𝑔), 𝑠〉) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 394 ∧ w3a 1084 = wceq 1534 ∈ wcel 2099 〈cop 4639 class class class wbr 5153 ↦ cmpt 5236 I cid 5579 ↾ cres 5684 ∘ ccom 5686 ‘cfv 6554 ℩crio 7379 (class class class)co 7424 Basecbs 17213 +gcplusg 17266 lecple 17273 occoc 17274 Atomscatm 38961 HLchlt 39048 LHypclh 39683 LTrncltrn 39800 TEndoctendo 40451 DVecHcdvh 40777 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-rep 5290 ax-sep 5304 ax-nul 5311 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-cnex 11214 ax-resscn 11215 ax-1cn 11216 ax-icn 11217 ax-addcl 11218 ax-addrcl 11219 ax-mulcl 11220 ax-mulrcl 11221 ax-mulcom 11222 ax-addass 11223 ax-mulass 11224 ax-distr 11225 ax-i2m1 11226 ax-1ne0 11227 ax-1rid 11228 ax-rnegex 11229 ax-rrecex 11230 ax-cnre 11231 ax-pre-lttri 11232 ax-pre-lttrn 11233 ax-pre-ltadd 11234 ax-pre-mulgt0 11235 ax-riotaBAD 38651 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3464 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3967 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-tp 4638 df-op 4640 df-uni 4914 df-iun 5003 df-iin 5004 df-br 5154 df-opab 5216 df-mpt 5237 df-tr 5271 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6312 df-ord 6379 df-on 6380 df-lim 6381 df-suc 6382 df-iota 6506 df-fun 6556 df-fn 6557 df-f 6558 df-f1 6559 df-fo 6560 df-f1o 6561 df-fv 6562 df-riota 7380 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7877 df-1st 8003 df-2nd 8004 df-undef 8288 df-frecs 8296 df-wrecs 8327 df-recs 8401 df-rdg 8440 df-1o 8496 df-er 8734 df-map 8857 df-en 8975 df-dom 8976 df-sdom 8977 df-fin 8978 df-pnf 11300 df-mnf 11301 df-xr 11302 df-ltxr 11303 df-le 11304 df-sub 11496 df-neg 11497 df-nn 12265 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-n0 12525 df-z 12611 df-uz 12875 df-fz 13539 df-struct 17149 df-slot 17184 df-ndx 17196 df-base 17214 df-plusg 17279 df-mulr 17280 df-sca 17282 df-vsca 17283 df-proset 18320 df-poset 18338 df-plt 18355 df-lub 18371 df-glb 18372 df-join 18373 df-meet 18374 df-p0 18450 df-p1 18451 df-lat 18457 df-clat 18524 df-oposet 38874 df-ol 38876 df-oml 38877 df-covers 38964 df-ats 38965 df-atl 38996 df-cvlat 39020 df-hlat 39049 df-llines 39197 df-lplanes 39198 df-lvols 39199 df-lines 39200 df-psubsp 39202 df-pmap 39203 df-padd 39495 df-lhyp 39687 df-laut 39688 df-ldil 39803 df-ltrn 39804 df-trl 39858 df-tendo 40454 df-edring 40456 df-dvech 40778 |
This theorem is referenced by: dihordlem7 40913 |
Copyright terms: Public domain | W3C validator |