| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme16g | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma E in [Crawley] p. 113, 3rd paragraph on p. 114, Eq. (1). 𝐹 and 𝐺 represent f(s) and f(t) respectively. We show, in their notation, (s ∨ t) ∧ w=(f(s) ∨ f(t)) ∧ w. (Contributed by NM, 11-Oct-2012.) |
| Ref | Expression |
|---|---|
| cdleme12.l | ⊢ ≤ = (le‘𝐾) |
| cdleme12.j | ⊢ ∨ = (join‘𝐾) |
| cdleme12.m | ⊢ ∧ = (meet‘𝐾) |
| cdleme12.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdleme12.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdleme12.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
| cdleme12.f | ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) |
| cdleme12.g | ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) |
| Ref | Expression |
|---|---|
| cdleme16g | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑆 ≠ 𝑇)) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑈 ≤ (𝑆 ∨ 𝑇))) → ((𝑆 ∨ 𝑇) ∧ 𝑊) = ((𝐹 ∨ 𝐺) ∧ 𝑊)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdleme12.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 2 | cdleme12.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 3 | cdleme12.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
| 4 | cdleme12.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | cdleme12.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 6 | cdleme12.u | . . 3 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
| 7 | cdleme12.f | . . 3 ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) | |
| 8 | cdleme12.g | . . 3 ⊢ 𝐺 = ((𝑇 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑇) ∧ 𝑊))) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | cdleme16e 40306 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑆 ≠ 𝑇)) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑈 ≤ (𝑆 ∨ 𝑇))) → ((𝑆 ∨ 𝑇) ∧ (𝐹 ∨ 𝐺)) = ((𝑆 ∨ 𝑇) ∧ 𝑊)) |
| 10 | 1, 2, 3, 4, 5, 6, 7, 8 | cdleme16f 40307 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑆 ≠ 𝑇)) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑈 ≤ (𝑆 ∨ 𝑇))) → ((𝑆 ∨ 𝑇) ∧ (𝐹 ∨ 𝐺)) = ((𝐹 ∨ 𝐺) ∧ 𝑊)) |
| 11 | 9, 10 | eqtr3d 2773 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑇 ∈ 𝐴 ∧ ¬ 𝑇 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑆 ≠ 𝑇)) ∧ (¬ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑇 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑈 ≤ (𝑆 ∨ 𝑇))) → ((𝑆 ∨ 𝑇) ∧ 𝑊) = ((𝐹 ∨ 𝐺) ∧ 𝑊)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2933 class class class wbr 5124 ‘cfv 6536 (class class class)co 7410 lecple 17283 joincjn 18328 meetcmee 18329 Atomscatm 39286 HLchlt 39373 LHypclh 40008 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-iun 4974 df-iin 4975 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-1st 7993 df-2nd 7994 df-proset 18311 df-poset 18330 df-plt 18345 df-lub 18361 df-glb 18362 df-join 18363 df-meet 18364 df-p0 18440 df-p1 18441 df-lat 18447 df-clat 18514 df-oposet 39199 df-ol 39201 df-oml 39202 df-covers 39289 df-ats 39290 df-atl 39321 df-cvlat 39345 df-hlat 39374 df-llines 39522 df-lplanes 39523 df-lvols 39524 df-lines 39525 df-psubsp 39527 df-pmap 39528 df-padd 39820 df-lhyp 40012 |
| This theorem is referenced by: cdleme16 40309 |
| Copyright terms: Public domain | W3C validator |