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 37412 | . 2 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐶)) |
11 | 1, 2, 3, 4, 5, 6, 7, 9 | cdleme9 37422 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → (𝐹 ∨ 𝐶) = (𝑄 ∨ 𝐶)) |
12 | 11 | oveq2d 7165 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝐶)) = ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝐶))) |
13 | 10, 12 | syl5eq 2867 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) → 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝑄 ∨ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∧ w3a 1082 = wceq 1536 ∈ wcel 2113 class class class wbr 5059 ‘cfv 6348 (class class class)co 7149 lecple 16567 joincjn 17549 meetcmee 17550 Atomscatm 36432 HLchlt 36519 LHypclh 37153 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-rep 5183 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5323 ax-un 7454 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-ral 3142 df-rex 3143 df-reu 3144 df-rab 3146 df-v 3493 df-sbc 3769 df-csb 3877 df-dif 3932 df-un 3934 df-in 3936 df-ss 3945 df-nul 4285 df-if 4461 df-pw 4534 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-iun 4914 df-iin 4915 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7107 df-ov 7152 df-oprab 7153 df-mpo 7154 df-1st 7682 df-2nd 7683 df-proset 17533 df-poset 17551 df-plt 17563 df-lub 17579 df-glb 17580 df-join 17581 df-meet 17582 df-p0 17644 df-p1 17645 df-lat 17651 df-clat 17713 df-oposet 36345 df-ol 36347 df-oml 36348 df-covers 36435 df-ats 36436 df-atl 36467 df-cvlat 36491 df-hlat 36520 df-psubsp 36672 df-pmap 36673 df-padd 36965 df-lhyp 37157 |
This theorem is referenced by: cdleme17d1 37458 |
Copyright terms: Public domain | W3C validator |