![]() |
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 40205 and cdleme7 40206. (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 7459 | . . 3 ⊢ (𝐹 ∨ 𝑉) = (𝐹 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊)) |
4 | 3 | oveq2i 7459 | . 2 ⊢ ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝑉)) = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ ((𝑅 ∨ 𝑆) ∧ 𝑊))) |
5 | 1, 4 | eqtr4i 2771 | 1 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐹 ∨ 𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ‘cfv 6573 (class class class)co 7448 lecple 17318 joincjn 18381 meetcmee 18382 Atomscatm 39219 LHypclh 39941 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-iota 6525 df-fv 6581 df-ov 7451 |
This theorem is referenced by: cdleme7d 40203 cdleme17a 40243 |
Copyright terms: Public domain | W3C validator |