| 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 40215 and cdleme7 40216. (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 7380 | . . 3 ⊢ (𝐹 ∨ 𝑉) = (𝐹 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)) |
| 4 | 3 | oveq2i 7380 | . 2 ⊢ ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝑉)) = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
| 5 | 1, 4 | eqtr4i 2755 | 1 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1540 ‘cfv 6499 (class class class)co 7369 lecple 17203 joincjn 18248 meetcmee 18249 Atomscatm 39229 LHypclh 39951 |
| 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 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-rab 3403 df-v 3446 df-dif 3914 df-un 3916 df-ss 3928 df-nul 4293 df-if 4485 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5103 df-iota 6452 df-fv 6507 df-ov 7372 |
| This theorem is referenced by: cdleme7d 40213 cdleme17a 40253 |
| Copyright terms: Public domain | W3C validator |