![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemg3a | Structured version Visualization version GIF version |
Description: Part of proof of Lemma G in [Crawley] p. 116, line 19. Show p ∨ q = p ∨ u. TODO: reformat cdleme0cp 39085 to match this, then replace with cdleme0cp 39085. (Contributed by NM, 19-Apr-2013.) |
Ref | Expression |
---|---|
cdlemg3.l | ⊢ ≤ = (le‘𝐾) |
cdlemg3.j | ⊢ ∨ = (join‘𝐾) |
cdlemg3.m | ⊢ ∧ = (meet‘𝐾) |
cdlemg3.a | ⊢ 𝐴 = (Atoms‘𝐾) |
cdlemg3.h | ⊢ 𝐻 = (LHyp‘𝐾) |
cdlemg3.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
Ref | Expression |
---|---|
cdlemg3a | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑈)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cdlemg3.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
2 | cdlemg3.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
3 | cdlemg3.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
4 | cdlemg3.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
5 | cdlemg3.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
6 | cdlemg3.u | . . 3 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
7 | 1, 2, 3, 4, 5, 6 | cdleme8 39121 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑈) = (𝑃 ∨ 𝑄)) |
8 | 7 | eqcomd 2739 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑈)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 class class class wbr 5149 ‘cfv 6544 (class class class)co 7409 lecple 17204 joincjn 18264 meetcmee 18265 Atomscatm 38133 HLchlt 38220 LHypclh 38855 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-iin 5001 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5575 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-1st 7975 df-2nd 7976 df-proset 18248 df-poset 18266 df-plt 18283 df-lub 18299 df-glb 18300 df-join 18301 df-meet 18302 df-p0 18378 df-p1 18379 df-lat 18385 df-clat 18452 df-oposet 38046 df-ol 38048 df-oml 38049 df-covers 38136 df-ats 38137 df-atl 38168 df-cvlat 38192 df-hlat 38221 df-psubsp 38374 df-pmap 38375 df-padd 38667 df-lhyp 38859 |
This theorem is referenced by: cdlemg9a 39503 cdlemg9b 39504 cdlemg12b 39515 |
Copyright terms: Public domain | W3C validator |