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 35530 | . 2 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐶)) |
11 | 1, 2, 3, 4, 5, 6, 7, 9 | cdleme9 35540 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → (𝐹 ∨ 𝐶) = (𝑄 ∨ 𝐶)) |
12 | 11 | oveq2d 6666 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐶)) = ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝐶))) |
13 | 10, 12 | syl5eq 2668 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 lecple 15948 joincjn 16944 meetcmee 16945 Atomscatm 34550 HLchlt 34637 LHypclh 35270 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-iin 4523 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-1st 7168 df-2nd 7169 df-preset 16928 df-poset 16946 df-plt 16958 df-lub 16974 df-glb 16975 df-join 16976 df-meet 16977 df-p0 17039 df-p1 17040 df-lat 17046 df-clat 17108 df-oposet 34463 df-ol 34465 df-oml 34466 df-covers 34553 df-ats 34554 df-atl 34585 df-cvlat 34609 df-hlat 34638 df-psubsp 34789 df-pmap 34790 df-padd 35082 df-lhyp 35274 |
This theorem is referenced by: cdleme17d1 35576 |
Copyright terms: Public domain | W3C validator |