| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme17a | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma E in [Crawley] p. 114, first part of 4th paragraph. 𝐹, 𝐺, and 𝐶 represent f(s), fs(p), and s1 respectively. We show, in their notation, fs(p)=(p ∨ q) ∧ (q ∨ s1). (Contributed by NM, 11-Oct-2012.) |
| Ref | Expression |
|---|---|
| cdleme17.l | ⊢ ≤ = (le‘𝐾) |
| cdleme17.j | ⊢ ∨ = (join‘𝐾) |
| cdleme17.m | ⊢ ∧ = (meet‘𝐾) |
| cdleme17.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdleme17.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdleme17.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
| cdleme17.f | ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) |
| cdleme17.g | ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) |
| cdleme17.c | ⊢ 𝐶 = ((𝑃 ∨ 𝑆) ∧ 𝑊) |
| Ref | Expression |
|---|---|
| cdleme17a | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdleme17.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 2 | cdleme17.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 3 | cdleme17.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
| 4 | cdleme17.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | cdleme17.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 6 | cdleme17.u | . . 3 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
| 7 | cdleme17.f | . . 3 ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) | |
| 8 | cdleme17.g | . . 3 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) | |
| 9 | cdleme17.c | . . 3 ⊢ 𝐶 = ((𝑃 ∨ 𝑆) ∧ 𝑊) | |
| 10 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | cdleme7a 41117 | . 2 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐶)) |
| 11 | 1, 2, 3, 4, 5, 6, 7, 9 | cdleme9 41127 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → (𝐹 ∨ 𝐶) = (𝑄 ∨ 𝐶)) |
| 12 | 11 | oveq2d 7430 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐶)) = ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝐶))) |
| 13 | 10, 12 | eqtrid 2807 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6533 (class class class)co 7414 lecple 17350 joincjn 18400 meetcmee 18401 Atomscatm 40137 HLchlt 40224 LHypclh 40858 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-1st 7987 df-2nd 7988 df-proset 18383 df-poset 18402 df-plt 18417 df-lub 18433 df-glb 18434 df-join 18435 df-meet 18436 df-p0 18512 df-p1 18513 df-lat 18521 df-clat 18588 df-oposet 40050 df-ol 40052 df-oml 40053 df-covers 40140 df-ats 40141 df-atl 40172 df-cvlat 40196 df-hlat 40225 df-psubsp 40377 df-pmap 40378 df-padd 40670 df-lhyp 40862 |
| This theorem is used by: cdleme17d1 41163 |
| Copyright terms: Public domain | W3C validator |