| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemedb | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma E in [Crawley] p. 113. Utility lemma. 𝐷 represents s2. (Contributed by NM, 20-Nov-2012.) |
| Ref | Expression |
|---|---|
| cdlemeda.l | ⊢ ≤ = (le‘𝐾) |
| cdlemeda.j | ⊢ ∨ = (join‘𝐾) |
| cdlemeda.m | ⊢ ∧ = (meet‘𝐾) |
| cdlemeda.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdlemeda.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemeda.d | ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) |
| cdlemedb.b | ⊢ 𝐵 = (Base‘𝐾) |
| Ref | Expression |
|---|---|
| cdlemedb | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐷 ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemeda.d | . 2 ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) | |
| 2 | hllat 40237 | . . . 4 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
| 3 | 2 | ad2antrr 739 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ Lat) |
| 4 | simpll 779 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐾 ∈ HL) | |
| 5 | simprl 783 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑅 ∈ 𝐴) | |
| 6 | simprr 785 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑆 ∈ 𝐴) | |
| 7 | cdlemedb.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 8 | cdlemeda.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
| 9 | cdlemeda.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 10 | 7, 8, 9 | hlatjcl 40241 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝑅 ∨ 𝑆) ∈ 𝐵) |
| 11 | 4, 5, 6, 10 | syl3anc 1398 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → (𝑅 ∨ 𝑆) ∈ 𝐵) |
| 12 | cdlemeda.h | . . . . 5 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 13 | 7, 12 | lhpbase 40872 | . . . 4 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵) |
| 14 | 13 | ad2antlr 740 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝑊 ∈ 𝐵) |
| 15 | cdlemeda.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
| 16 | 7, 15 | latmcl 18529 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑅 ∨ 𝑆) ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → ((𝑅 ∨ 𝑆) ∧ 𝑊) ∈ 𝐵) |
| 17 | 3, 11, 14, 16 | syl3anc 1398 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑅 ∨ 𝑆) ∧ 𝑊) ∈ 𝐵) |
| 18 | 1, 17 | eqeltrid 2864 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → 𝐷 ∈ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ‘cfv 6533 (class class class)co 7414 Basecbs 17302 lecple 17350 joincjn 18400 meetcmee 18401 Latclat 18520 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-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-lub 18433 df-glb 18434 df-join 18435 df-meet 18436 df-lat 18521 df-ats 40141 df-atl 40172 df-cvlat 40196 df-hlat 40225 df-lhyp 40862 |
| This theorem is used by: cdleme20k 41193 cdleme20l2 41195 cdleme20l 41196 cdleme20m 41197 |
| Copyright terms: Public domain | W3C validator |