| 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 40591 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑃) = (𝐹‘(𝐺‘𝑃))) |
| 6 | 5 | 3adant3r 1183 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹 ∘ 𝐺)‘𝑃) = (𝐹‘(𝐺‘𝑃))) |
| 7 | 6 | oveq1d 7382 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹 ∘ 𝐺)‘𝑃) ∨ (𝑅‘𝐹)) = ((𝐹‘(𝐺‘𝑃)) ∨ (𝑅‘𝐹))) |
| 8 | simp1 1137 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 9 | simp2l 1201 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐹 ∈ 𝑇) | |
| 10 | 1, 2, 3, 4 | ltrnel 40585 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺‘𝑃) ∈ 𝐴 ∧ ¬ (𝐺‘𝑃) ≤ 𝑊)) |
| 11 | 10 | 3adant2l 1180 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺‘𝑃) ∈ 𝐴 ∧ ¬ (𝐺‘𝑃) ≤ 𝑊)) |
| 12 | trlcoabs.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
| 13 | trlcoabs.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 14 | 1, 12, 2, 3, 4, 13 | trljat3 40614 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ ((𝐺‘𝑃) ∈ 𝐴 ∧ ¬ (𝐺‘𝑃) ≤ 𝑊)) → ((𝐺‘𝑃) ∨ (𝑅‘𝐹)) = ((𝐹‘(𝐺‘𝑃)) ∨ (𝑅‘𝐹))) |
| 15 | 8, 9, 11, 14 | syl3anc 1374 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐺‘𝑃) ∨ (𝑅‘𝐹)) = ((𝐹‘(𝐺‘𝑃)) ∨ (𝑅‘𝐹))) |
| 16 | 7, 15 | eqtr4d 2774 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹 ∘ 𝐺)‘𝑃) ∨ (𝑅‘𝐹)) = ((𝐺‘𝑃) ∨ (𝑅‘𝐹))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5085 ∘ ccom 5635 ‘cfv 6498 (class class class)co 7367 lecple 17227 joincjn 18277 Atomscatm 39709 HLchlt 39796 LHypclh 40430 LTrncltrn 40547 trLctrl 40604 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-iin 4936 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-1st 7942 df-2nd 7943 df-map 8775 df-proset 18260 df-poset 18279 df-plt 18294 df-lub 18310 df-glb 18311 df-join 18312 df-meet 18313 df-p0 18389 df-p1 18390 df-lat 18398 df-clat 18465 df-oposet 39622 df-ol 39624 df-oml 39625 df-covers 39712 df-ats 39713 df-atl 39744 df-cvlat 39768 df-hlat 39797 df-psubsp 39949 df-pmap 39950 df-padd 40242 df-lhyp 40434 df-laut 40435 df-ldil 40550 df-ltrn 40551 df-trl 40605 |
| This theorem is referenced by: cdlemk48 41396 |
| Copyright terms: Public domain | W3C validator |