| 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 40903 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ∨ 𝐺) = (𝑃 ∨ 𝑄)) |
| 10 | 9 | oveq1d 7426 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ((𝑅 ∨ 𝐺) ∧ 𝑊) = ((𝑃 ∨ 𝑄) ∧ 𝑊)) |
| 11 | 10, 6 | eqtr4di 2822 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄))) → ((𝑅 ∨ 𝐺) ∧ 𝑊) = 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 class class class wbr 5113 ‘cfv 6537 (class class class)co 7411 lecple 17316 joincjn 18366 meetcmee 18367 Atomscatm 39926 HLchlt 40013 LHypclh 40647 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7985 df-2nd 7986 df-proset 18349 df-poset 18368 df-plt 18383 df-lub 18399 df-glb 18400 df-join 18401 df-meet 18402 df-p0 18478 df-p1 18479 df-lat 18487 df-clat 18554 df-oposet 39839 df-ol 39841 df-oml 39842 df-covers 39929 df-ats 39930 df-atl 39961 df-cvlat 39985 df-hlat 40014 df-psubsp 40166 df-pmap 40167 df-padd 40459 df-lhyp 40651 |
| This theorem is referenced by: cdleme7 40912 |
| Copyright terms: Public domain | W3C validator |