| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme7a | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma E in [Crawley] p. 113. Lemma leading to cdleme7ga 41082 and cdleme7 41083. (Contributed by NM, 7-Jun-2012.) |
| Ref | Expression |
|---|---|
| cdleme4.l | ⊢ ≤ = (le‘𝐾) |
| cdleme4.j | ⊢ ∨ = (join‘𝐾) |
| cdleme4.m | ⊢ ∧ = (meet‘𝐾) |
| cdleme4.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdleme4.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdleme4.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
| cdleme4.f | ⊢ 𝐹 = ((𝑆 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑆) ∧ 𝑊))) |
| cdleme4.g | ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
| cdleme7.v | ⊢ 𝑉 = ((𝑅 ∨ 𝑆) ∧ 𝑊) |
| Ref | Expression |
|---|---|
| cdleme7a | ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝑉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdleme4.g | . 2 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) | |
| 2 | cdleme7.v | . . . 4 ⊢ 𝑉 = ((𝑅 ∨ 𝑆) ∧ 𝑊) | |
| 3 | 2 | oveq2i 7430 | . . 3 ⊢ (𝐹 ∨ 𝑉) = (𝐹 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)) |
| 4 | 3 | oveq2i 7430 | . 2 ⊢ ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝑉)) = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
| 5 | 1, 4 | eqtr4i 2791 | 1 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝑉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ‘cfv 6540 (class class class)co 7419 lecple 17341 joincjn 18391 meetcmee 18392 Atomscatm 40097 LHypclh 40818 |
| 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 2148 ax-9 2156 ax-ext 2737 |
| 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-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-iota 6496 df-fv 6548 df-ov 7422 |
| This theorem is used by: cdleme7d 41080 cdleme17a 41120 |
| Copyright terms: Public domain | W3C validator |