![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > trlco | Structured version Visualization version GIF version |
Description: The trace of a composition of translations is less than or equal to the join of their traces. Part of proof of Lemma G of [Crawley] p. 116, second paragraph on p. 117. (Contributed by NM, 2-Jun-2013.) |
Ref | Expression |
---|---|
trlco.l | ⊢ ≤ = (le‘𝐾) |
trlco.j | ⊢ ∨ = (join‘𝐾) |
trlco.h | ⊢ 𝐻 = (LHyp‘𝐾) |
trlco.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
trlco.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
Ref | Expression |
---|---|
trlco | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘(𝐹 ∘ 𝐺)) ≤ ((𝑅‘𝐹) ∨ (𝑅‘𝐺))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | trlco.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
2 | eqid 2760 | . . . 4 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
3 | trlco.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
4 | 1, 2, 3 | lhpexnle 35813 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝 ≤ 𝑊) |
5 | 4 | 3ad2ant1 1128 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝 ≤ 𝑊) |
6 | simpl1 1228 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
7 | simpl2 1230 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → 𝐹 ∈ 𝑇) | |
8 | simpl3 1232 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → 𝐺 ∈ 𝑇) | |
9 | simpr 479 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) | |
10 | trlco.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
11 | trlco.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
12 | trlco.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
13 | eqid 2760 | . . . 4 ⊢ (meet‘𝐾) = (meet‘𝐾) | |
14 | 1, 10, 3, 11, 12, 13, 2 | trlcolem 36534 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑅‘(𝐹 ∘ 𝐺)) ≤ ((𝑅‘𝐹) ∨ (𝑅‘𝐺))) |
15 | 6, 7, 8, 9, 14 | syl121anc 1482 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑅‘(𝐹 ∘ 𝐺)) ≤ ((𝑅‘𝐹) ∨ (𝑅‘𝐺))) |
16 | 5, 15 | rexlimddv 3173 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘(𝐹 ∘ 𝐺)) ≤ ((𝑅‘𝐹) ∨ (𝑅‘𝐺))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 ∧ w3a 1072 = wceq 1632 ∈ wcel 2139 ∃wrex 3051 class class class wbr 4804 ∘ ccom 5270 ‘cfv 6049 (class class class)co 6814 lecple 16170 joincjn 17165 meetcmee 17166 Atomscatm 35071 HLchlt 35158 LHypclh 35791 LTrncltrn 35908 trLctrl 35966 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-rep 4923 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7115 ax-riotaBAD 34760 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-nel 3036 df-ral 3055 df-rex 3056 df-reu 3057 df-rmo 3058 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-op 4328 df-uni 4589 df-iun 4674 df-iin 4675 df-br 4805 df-opab 4865 df-mpt 4882 df-id 5174 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-riota 6775 df-ov 6817 df-oprab 6818 df-mpt2 6819 df-1st 7334 df-2nd 7335 df-undef 7569 df-map 8027 df-preset 17149 df-poset 17167 df-plt 17179 df-lub 17195 df-glb 17196 df-join 17197 df-meet 17198 df-p0 17260 df-p1 17261 df-lat 17267 df-clat 17329 df-oposet 34984 df-ol 34986 df-oml 34987 df-covers 35074 df-ats 35075 df-atl 35106 df-cvlat 35130 df-hlat 35159 df-llines 35305 df-lplanes 35306 df-lvols 35307 df-lines 35308 df-psubsp 35310 df-pmap 35311 df-padd 35603 df-lhyp 35795 df-laut 35796 df-ldil 35911 df-ltrn 35912 df-trl 35967 |
This theorem is referenced by: trlcone 36536 cdlemg46 36543 trljco 36548 tendopltp 36588 dialss 36855 diblss 36979 |
Copyright terms: Public domain | W3C validator |