![]() |
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 38498 | . 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 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 〈cop 4531 class class class wbr 5030 ↦ cmpt 5110 I cid 5424 ↾ cres 5521 ∘ ccom 5523 ‘cfv 6324 ℩crio 7092 (class class class)co 7135 Basecbs 16475 +gcplusg 16557 lecple 16564 occoc 16565 Atomscatm 36559 HLchlt 36646 LHypclh 37280 LTrncltrn 37397 TEndoctendo 38048 DVecHcdvh 38374 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-riotaBAD 36249 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-iin 4884 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-undef 7922 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-plusg 16570 df-mulr 16571 df-sca 16573 df-vsca 16574 df-proset 17530 df-poset 17548 df-plt 17560 df-lub 17576 df-glb 17577 df-join 17578 df-meet 17579 df-p0 17641 df-p1 17642 df-lat 17648 df-clat 17710 df-oposet 36472 df-ol 36474 df-oml 36475 df-covers 36562 df-ats 36563 df-atl 36594 df-cvlat 36618 df-hlat 36647 df-llines 36794 df-lplanes 36795 df-lvols 36796 df-lines 36797 df-psubsp 36799 df-pmap 36800 df-padd 37092 df-lhyp 37284 df-laut 37285 df-ldil 37400 df-ltrn 37401 df-trl 37455 df-tendo 38051 df-edring 38053 df-dvech 38375 |
This theorem is referenced by: dihordlem7 38510 |
Copyright terms: Public domain | W3C validator |