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

Theorem cdleme19f 37484
 Description: Part of proof of Lemma E in [Crawley] p. 113, 5th paragraph on p. 114, line 3. 𝐷, 𝐹, 𝑁, 𝑌, 𝐺, 𝑂 represent s2, f(s), fs(r), t2, f(t), ft(r). We prove that if r ≤ s ∨ t, then ft(r) = ft(r). (Contributed by NM, 14-Nov-2012.)
Hypotheses
Ref Expression
cdleme19.l = (le‘𝐾)
cdleme19.j = (join‘𝐾)
cdleme19.m = (meet‘𝐾)
cdleme19.a 𝐴 = (Atoms‘𝐾)
cdleme19.h 𝐻 = (LHyp‘𝐾)
cdleme19.u 𝑈 = ((𝑃 𝑄) 𝑊)
cdleme19.f 𝐹 = ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊)))
cdleme19.g 𝐺 = ((𝑇 𝑈) (𝑄 ((𝑃 𝑇) 𝑊)))
cdleme19.d 𝐷 = ((𝑅 𝑆) 𝑊)
cdleme19.y 𝑌 = ((𝑅 𝑇) 𝑊)
cdleme19.n 𝑁 = ((𝑃 𝑄) (𝐹 𝐷))
cdleme19.o 𝑂 = ((𝑃 𝑄) (𝐺 𝑌))
Assertion
Ref Expression
cdleme19f ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ 𝑅𝐴) ∧ ((𝑃𝑄𝑆𝑇) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄)) ∧ (𝑅 (𝑃 𝑄) ∧ 𝑅 (𝑆 𝑇)))) → 𝑁 = 𝑂)

Proof of Theorem cdleme19f
StepHypRef Expression
1 cdleme19.l . . . 4 = (le‘𝐾)
2 cdleme19.j . . . 4 = (join‘𝐾)
3 cdleme19.m . . . 4 = (meet‘𝐾)
4 cdleme19.a . . . 4 𝐴 = (Atoms‘𝐾)
5 cdleme19.h . . . 4 𝐻 = (LHyp‘𝐾)
6 cdleme19.u . . . 4 𝑈 = ((𝑃 𝑄) 𝑊)
7 cdleme19.f . . . 4 𝐹 = ((𝑆 𝑈) (𝑄 ((𝑃 𝑆) 𝑊)))
8 cdleme19.g . . . 4 𝐺 = ((𝑇 𝑈) (𝑄 ((𝑃 𝑇) 𝑊)))
9 cdleme19.d . . . 4 𝐷 = ((𝑅 𝑆) 𝑊)
10 cdleme19.y . . . 4 𝑌 = ((𝑅 𝑇) 𝑊)
111, 2, 3, 4, 5, 6, 7, 8, 9, 10cdleme19e 37483 . . 3 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ 𝑅𝐴) ∧ ((𝑃𝑄𝑆𝑇) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄)) ∧ (𝑅 (𝑃 𝑄) ∧ 𝑅 (𝑆 𝑇)))) → (𝐹 𝐷) = (𝐺 𝑌))
1211oveq2d 7146 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ 𝑅𝐴) ∧ ((𝑃𝑄𝑆𝑇) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄)) ∧ (𝑅 (𝑃 𝑄) ∧ 𝑅 (𝑆 𝑇)))) → ((𝑃 𝑄) (𝐹 𝐷)) = ((𝑃 𝑄) (𝐺 𝑌)))
13 cdleme19.n . 2 𝑁 = ((𝑃 𝑄) (𝐹 𝐷))
14 cdleme19.o . 2 𝑂 = ((𝑃 𝑄) (𝐺 𝑌))
1512, 13, 143eqtr4g 2881 1 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ((𝑆𝐴 ∧ ¬ 𝑆 𝑊) ∧ (𝑇𝐴 ∧ ¬ 𝑇 𝑊) ∧ 𝑅𝐴) ∧ ((𝑃𝑄𝑆𝑇) ∧ (¬ 𝑆 (𝑃 𝑄) ∧ ¬ 𝑇 (𝑃 𝑄)) ∧ (𝑅 (𝑃 𝑄) ∧ 𝑅 (𝑆 𝑇)))) → 𝑁 = 𝑂)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2115   ≠ wne 3007   class class class wbr 5039  ‘cfv 6328  (class class class)co 7130  lecple 16550  joincjn 17532  meetcmee 17533  Atomscatm 36439  HLchlt 36526  LHypclh 37160 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-rep 5163  ax-sep 5176  ax-nul 5183  ax-pow 5239  ax-pr 5303  ax-un 7436 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ne 3008  df-ral 3131  df-rex 3132  df-reu 3133  df-rab 3135  df-v 3473  df-sbc 3750  df-csb 3858  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4267  df-if 4441  df-pw 4514  df-sn 4541  df-pr 4543  df-op 4547  df-uni 4812  df-iun 4894  df-iin 4895  df-br 5040  df-opab 5102  df-mpt 5120  df-id 5433  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-rn 5539  df-res 5540  df-ima 5541  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-riota 7088  df-ov 7133  df-oprab 7134  df-mpo 7135  df-1st 7664  df-2nd 7665  df-proset 17516  df-poset 17534  df-plt 17546  df-lub 17562  df-glb 17563  df-join 17564  df-meet 17565  df-p0 17627  df-p1 17628  df-lat 17634  df-clat 17696  df-oposet 36352  df-ol 36354  df-oml 36355  df-covers 36442  df-ats 36443  df-atl 36474  df-cvlat 36498  df-hlat 36527  df-llines 36674  df-lplanes 36675  df-lvols 36676  df-lines 36677  df-psubsp 36679  df-pmap 36680  df-padd 36972  df-lhyp 37164 This theorem is referenced by:  cdleme20  37500
 Copyright terms: Public domain W3C validator