| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemeda | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma E in [Crawley] p. 113. Utility lemma. 𝐷 represents s2. (Contributed by NM, 13-Nov-2012.) |
| Ref | Expression |
|---|---|
| cdlemeda.l | ⊢ ≤ = (le‘𝐾) |
| cdlemeda.j | ⊢ ∨ = (join‘𝐾) |
| cdlemeda.m | ⊢ ∧ = (meet‘𝐾) |
| cdlemeda.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdlemeda.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemeda.d | ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) |
| Ref | Expression |
|---|---|
| cdlemeda | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝐷 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemeda.d | . 2 ⊢ 𝐷 = ((𝑅 ∨ 𝑆) ∧ 𝑊) | |
| 2 | simp1l 1214 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝐾 ∈ HL) | |
| 3 | simp31 1226 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑅 ∈ 𝐴) | |
| 4 | simp2l 1216 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑆 ∈ 𝐴) | |
| 5 | cdlemeda.j | . . . . . 6 ⊢ ∨ = (join‘𝐾) | |
| 6 | cdlemeda.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 7 | 5, 6 | hlatjcom 40031 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝑅 ∨ 𝑆) = (𝑆 ∨ 𝑅)) |
| 8 | 2, 3, 4, 7 | syl3anc 1396 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → (𝑅 ∨ 𝑆) = (𝑆 ∨ 𝑅)) |
| 9 | 8 | oveq1d 7426 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ((𝑅 ∨ 𝑆) ∧ 𝑊) = ((𝑆 ∨ 𝑅) ∧ 𝑊)) |
| 10 | simp1r 1215 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑊 ∈ 𝐻) | |
| 11 | simp2r 1217 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ¬ 𝑆 ≤ 𝑊) | |
| 12 | simp32 1227 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑅 ≤ (𝑃 ∨ 𝑄)) | |
| 13 | simp33 1228 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) | |
| 14 | cdlemeda.l | . . . . . 6 ⊢ ≤ = (le‘𝐾) | |
| 15 | cdlemeda.h | . . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 16 | 14, 5, 6, 15 | cdlemesner 40959 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) ∧ (𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑆 ≠ 𝑅) |
| 17 | 2, 3, 4, 12, 13, 16 | syl122anc 1404 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝑆 ≠ 𝑅) |
| 18 | cdlemeda.m | . . . . 5 ⊢ ∧ = (meet‘𝐾) | |
| 19 | 14, 5, 18, 6, 15 | lhpat 40706 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑆 ≠ 𝑅)) → ((𝑆 ∨ 𝑅) ∧ 𝑊) ∈ 𝐴) |
| 20 | 2, 10, 4, 11, 3, 17, 19 | syl222anc 1411 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ((𝑆 ∨ 𝑅) ∧ 𝑊) ∈ 𝐴) |
| 21 | 9, 20 | eqeltrd 2869 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → ((𝑅 ∨ 𝑆) ∧ 𝑊) ∈ 𝐴) |
| 22 | 1, 21 | eqeltrid 2873 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄))) → 𝐷 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 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-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-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-lhyp 40651 |
| This theorem is referenced by: cdlemednpq 40962 cdleme19d 40969 cdleme20aN 40972 cdleme20c 40974 cdleme20f 40977 cdleme20g 40978 cdleme20j 40981 cdleme20l1 40983 cdleme20l2 40984 |
| Copyright terms: Public domain | W3C validator |