Mathbox for Norm Megill < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cdleme17a Structured version   Visualization version   GIF version

Theorem cdleme17a 35092
 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.)
Hypotheses
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 𝐶 = ((𝑃 𝑆) 𝑊)
Assertion
Ref Expression
cdleme17a (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴 ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ¬ 𝑆 (𝑃 𝑄)) → 𝐺 = ((𝑃 𝑄) (𝑄 𝐶)))

Proof of Theorem cdleme17a
StepHypRef 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 𝐶 = ((𝑃 𝑆) 𝑊)
101, 2, 3, 4, 5, 6, 7, 8, 9cdleme7a 35049 . 2 𝐺 = ((𝑃 𝑄) (𝐹 𝐶))
111, 2, 3, 4, 5, 6, 7, 9cdleme9 35059 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴 ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ¬ 𝑆 (𝑃 𝑄)) → (𝐹 𝐶) = (𝑄 𝐶))
1211oveq2d 6631 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴 ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ¬ 𝑆 (𝑃 𝑄)) → ((𝑃 𝑄) (𝐹 𝐶)) = ((𝑃 𝑄) (𝑄 𝐶)))
1310, 12syl5eq 2667 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴 ∧ (𝑆𝐴 ∧ ¬ 𝑆 𝑊)) ∧ ¬ 𝑆 (𝑃 𝑄)) → 𝐺 = ((𝑃 𝑄) (𝑄 𝐶)))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 384   ∧ w3a 1036   = wceq 1480   ∈ wcel 1987   class class class wbr 4623  ‘cfv 5857  (class class class)co 6615  lecple 15888  joincjn 16884  meetcmee 16885  Atomscatm 34069  HLchlt 34156  LHypclh 34789 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4741  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2913  df-rex 2914  df-reu 2915  df-rab 2917  df-v 3192  df-sbc 3423  df-csb 3520  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-pw 4138  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-iun 4494  df-iin 4495  df-br 4624  df-opab 4684  df-mpt 4685  df-id 4999  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-res 5096  df-ima 5097  df-iota 5820  df-fun 5859  df-fn 5860  df-f 5861  df-f1 5862  df-fo 5863  df-f1o 5864  df-fv 5865  df-riota 6576  df-ov 6618  df-oprab 6619  df-mpt2 6620  df-1st 7128  df-2nd 7129  df-preset 16868  df-poset 16886  df-plt 16898  df-lub 16914  df-glb 16915  df-join 16916  df-meet 16917  df-p0 16979  df-p1 16980  df-lat 16986  df-clat 17048  df-oposet 33982  df-ol 33984  df-oml 33985  df-covers 34072  df-ats 34073  df-atl 34104  df-cvlat 34128  df-hlat 34157  df-psubsp 34308  df-pmap 34309  df-padd 34601  df-lhyp 34793 This theorem is referenced by:  cdleme17d1  35095
 Copyright terms: Public domain W3C validator