| 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 2731 | . . . 4 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 3 | trlco.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 4 | 1, 2, 3 | lhpexnle 40045 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝 ≤ 𝑊) |
| 5 | 4 | 3ad2ant1 1133 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝 ≤ 𝑊) |
| 6 | simpl1 1192 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 7 | simpl2 1193 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → 𝐹 ∈ 𝑇) | |
| 8 | simpl3 1194 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → 𝐺 ∈ 𝑇) | |
| 9 | simpr 484 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) | |
| 10 | trlco.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
| 11 | trlco.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 12 | trlco.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 13 | eqid 2731 | . . . 4 ⊢ (meet‘𝐾) = (meet‘𝐾) | |
| 14 | 1, 10, 3, 11, 12, 13, 2 | trlcolem 40765 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑅‘(𝐹 ∘ 𝐺)) ≤ ((𝑅‘𝐹) ∨ (𝑅‘𝐺))) |
| 15 | 6, 7, 8, 9, 14 | syl121anc 1377 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑅‘(𝐹 ∘ 𝐺)) ≤ ((𝑅‘𝐹) ∨ (𝑅‘𝐺))) |
| 16 | 5, 15 | rexlimddv 3139 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘(𝐹 ∘ 𝐺)) ≤ ((𝑅‘𝐹) ∨ (𝑅‘𝐺))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ∃wrex 3056 class class class wbr 5086 ∘ ccom 5615 ‘cfv 6476 (class class class)co 7341 lecple 17163 joincjn 18212 meetcmee 18213 Atomscatm 39302 HLchlt 39389 LHypclh 40023 LTrncltrn 40140 trLctrl 40197 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5212 ax-sep 5229 ax-nul 5239 ax-pow 5298 ax-pr 5365 ax-un 7663 ax-riotaBAD 38992 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4279 df-if 4471 df-pw 4547 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-iun 4938 df-iin 4939 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5506 df-xp 5617 df-rel 5618 df-cnv 5619 df-co 5620 df-dm 5621 df-rn 5622 df-res 5623 df-ima 5624 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 df-riota 7298 df-ov 7344 df-oprab 7345 df-mpo 7346 df-1st 7916 df-2nd 7917 df-undef 8198 df-map 8747 df-proset 18195 df-poset 18214 df-plt 18229 df-lub 18245 df-glb 18246 df-join 18247 df-meet 18248 df-p0 18324 df-p1 18325 df-lat 18333 df-clat 18400 df-oposet 39215 df-ol 39217 df-oml 39218 df-covers 39305 df-ats 39306 df-atl 39337 df-cvlat 39361 df-hlat 39390 df-llines 39537 df-lplanes 39538 df-lvols 39539 df-lines 39540 df-psubsp 39542 df-pmap 39543 df-padd 39835 df-lhyp 40027 df-laut 40028 df-ldil 40143 df-ltrn 40144 df-trl 40198 |
| This theorem is referenced by: trlcone 40767 cdlemg46 40774 trljco 40779 tendopltp 40819 dialss 41085 diblss 41209 |
| Copyright terms: Public domain | W3C validator |