| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme6 | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma E in [Crawley] p. 113. This expresses (r ∨ fs(r)) ∧ w = u at the top of p. 114. (Contributed by NM, 7-Jun-2012.) |
| Ref | Expression |
|---|---|
| cdleme4.l | ⊢ ≤ = (le‘𝐾) |
| cdleme4.j | ⊢ ∨ = (join‘𝐾) |
| cdleme4.m | ⊢ ∧ = (meet‘𝐾) |
| cdleme4.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdleme4.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdleme4.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
| cdleme4.f | ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) |
| cdleme4.g | ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
| Ref | Expression |
|---|---|
| cdleme6 | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ((𝑅 ∨ 𝐺) ∧ 𝑊) = 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdleme4.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 2 | cdleme4.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
| 3 | cdleme4.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
| 4 | cdleme4.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | cdleme4.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 6 | cdleme4.u | . . . 4 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
| 7 | cdleme4.f | . . . 4 ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) | |
| 8 | cdleme4.g | . . . 4 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | cdleme5 40287 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ∨ 𝐺) = (𝑃 ∨ 𝑄)) |
| 10 | 9 | oveq1d 7361 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ((𝑅 ∨ 𝐺) ∧ 𝑊) = ((𝑃 ∨ 𝑄) ∧ 𝑊)) |
| 11 | 10, 6 | eqtr4di 2784 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ((𝑅 ∨ 𝐺) ∧ 𝑊) = 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 class class class wbr 5089 ‘cfv 6481 (class class class)co 7346 lecple 17168 joincjn 18217 meetcmee 18218 Atomscatm 39310 HLchlt 39397 LHypclh 40031 |
| 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 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 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 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-iun 4941 df-iin 4942 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-1st 7921 df-2nd 7922 df-proset 18200 df-poset 18219 df-plt 18234 df-lub 18250 df-glb 18251 df-join 18252 df-meet 18253 df-p0 18329 df-p1 18330 df-lat 18338 df-clat 18405 df-oposet 39223 df-ol 39225 df-oml 39226 df-covers 39313 df-ats 39314 df-atl 39345 df-cvlat 39369 df-hlat 39398 df-psubsp 39550 df-pmap 39551 df-padd 39843 df-lhyp 40035 |
| This theorem is referenced by: cdleme7 40296 |
| Copyright terms: Public domain | W3C validator |