| 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 2736 | . . . 4 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 3 | trlco.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 4 | 1, 2, 3 | lhpexnle 40266 | . . 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 2736 | . . . 4 ⊢ (meet‘𝐾) = (meet‘𝐾) | |
| 14 | 1, 10, 3, 11, 12, 13, 2 | trlcolem 40986 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑅‘(𝐹 ∘ 𝐺)) ≤ ((𝑅‘𝐹) ∨ (𝑅‘𝐺))) |
| 15 | 6, 7, 8, 9, 14 | syl121anc 1377 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑅‘(𝐹 ∘ 𝐺)) ≤ ((𝑅‘𝐹) ∨ (𝑅‘𝐺))) |
| 16 | 5, 15 | rexlimddv 3143 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘(𝐹 ∘ 𝐺)) ≤ ((𝑅‘𝐹) ∨ (𝑅‘𝐺))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∃wrex 3060 class class class wbr 5098 ∘ ccom 5628 ‘cfv 6492 (class class class)co 7358 lecple 17184 joincjn 18234 meetcmee 18235 Atomscatm 39523 HLchlt 39610 LHypclh 40244 LTrncltrn 40361 trLctrl 40418 |
| 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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-riotaBAD 39213 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-iin 4949 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-undef 8215 df-map 8765 df-proset 18217 df-poset 18236 df-plt 18251 df-lub 18267 df-glb 18268 df-join 18269 df-meet 18270 df-p0 18346 df-p1 18347 df-lat 18355 df-clat 18422 df-oposet 39436 df-ol 39438 df-oml 39439 df-covers 39526 df-ats 39527 df-atl 39558 df-cvlat 39582 df-hlat 39611 df-llines 39758 df-lplanes 39759 df-lvols 39760 df-lines 39761 df-psubsp 39763 df-pmap 39764 df-padd 40056 df-lhyp 40248 df-laut 40249 df-ldil 40364 df-ltrn 40365 df-trl 40419 |
| This theorem is referenced by: trlcone 40988 cdlemg46 40995 trljco 41000 tendopltp 41040 dialss 41306 diblss 41430 |
| Copyright terms: Public domain | W3C validator |