| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > trlcoabs | Structured version Visualization version GIF version | ||
| Description: Absorption into a composition by joining with trace. (Contributed by NM, 22-Jul-2013.) |
| Ref | Expression |
|---|---|
| trlcoabs.l | ⊢ ≤ = (le‘𝐾) |
| trlcoabs.j | ⊢ ∨ = (join‘𝐾) |
| trlcoabs.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| trlcoabs.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| trlcoabs.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| trlcoabs.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| trlcoabs | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹 ∘ 𝐺)‘𝑃) ∨ (𝑅‘𝐹)) = ((𝐺‘𝑃) ∨ (𝑅‘𝐹))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | trlcoabs.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 2 | trlcoabs.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 3 | trlcoabs.h | . . . . 5 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 4 | trlcoabs.t | . . . . 5 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 5 | 1, 2, 3, 4 | ltrncoval 40637 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑃) = (𝐹‘(𝐺‘𝑃))) |
| 6 | 5 | 3adant3r 1188 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹 ∘ 𝐺)‘𝑃) = (𝐹‘(𝐺‘𝑃))) |
| 7 | 6 | oveq1d 7371 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹 ∘ 𝐺)‘𝑃) ∨ (𝑅‘𝐹)) = ((𝐹‘(𝐺‘𝑃)) ∨ (𝑅‘𝐹))) |
| 8 | simp1 1142 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 9 | simp2l 1206 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹 ∈ 𝑇) | |
| 10 | 1, 2, 3, 4 | ltrnel 40631 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺‘𝑃) ∈ 𝐴 ∧ ¬ (𝐺‘𝑃) ≤ 𝑊)) |
| 11 | 10 | 3adant2l 1185 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺‘𝑃) ∈ 𝐴 ∧ ¬ (𝐺‘𝑃) ≤ 𝑊)) |
| 12 | trlcoabs.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
| 13 | trlcoabs.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 14 | 1, 12, 2, 3, 4, 13 | trljat3 40660 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ ((𝐺‘𝑃) ∈ 𝐴 ∧ ¬ (𝐺‘𝑃) ≤ 𝑊)) → ((𝐺‘𝑃) ∨ (𝑅‘𝐹)) = ((𝐹‘(𝐺‘𝑃)) ∨ (𝑅‘𝐹))) |
| 15 | 8, 9, 11, 14 | syl3anc 1379 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺‘𝑃) ∨ (𝑅‘𝐹)) = ((𝐹‘(𝐺‘𝑃)) ∨ (𝑅‘𝐹))) |
| 16 | 7, 15 | eqtr4d 2777 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹 ∘ 𝐺)‘𝑃) ∨ (𝑅‘𝐹)) = ((𝐺‘𝑃) ∨ (𝑅‘𝐹))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 class class class wbr 5072 ∘ ccom 5622 ‘cfv 6485 (class class class)co 7356 lecple 17218 joincjn 18268 Atomscatm 39755 HLchlt 39842 LHypclh 40476 LTrncltrn 40593 trLctrl 40650 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-iin 4924 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-1st 7931 df-2nd 7932 df-map 8765 df-proset 18251 df-poset 18270 df-plt 18285 df-lub 18301 df-glb 18302 df-join 18303 df-meet 18304 df-p0 18380 df-p1 18381 df-lat 18389 df-clat 18456 df-oposet 39668 df-ol 39670 df-oml 39671 df-covers 39758 df-ats 39759 df-atl 39790 df-cvlat 39814 df-hlat 39843 df-psubsp 39995 df-pmap 39996 df-padd 40288 df-lhyp 40480 df-laut 40481 df-ldil 40596 df-ltrn 40597 df-trl 40651 |
| This theorem is referenced by: cdlemk48 41442 |
| Copyright terms: Public domain | W3C validator |