Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cdleme19f Unicode version

Theorem cdleme19f 30836
Description: Part of proof of Lemma E in [Crawley] p. 113, 5th paragraph on p. 114, line 3.  D,  F,  N,  Y,  G,  O 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 `  K )
cdleme19.j  |-  .\/  =  ( join `  K )
cdleme19.m  |-  ./\  =  ( meet `  K )
cdleme19.a  |-  A  =  ( Atoms `  K )
cdleme19.h  |-  H  =  ( LHyp `  K
)
cdleme19.u  |-  U  =  ( ( P  .\/  Q )  ./\  W )
cdleme19.f  |-  F  =  ( ( S  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  S )  ./\  W )
) )
cdleme19.g  |-  G  =  ( ( T  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  T )  ./\  W )
) )
cdleme19.d  |-  D  =  ( ( R  .\/  S )  ./\  W )
cdleme19.y  |-  Y  =  ( ( R  .\/  T )  ./\  W )
cdleme19.n  |-  N  =  ( ( P  .\/  Q )  ./\  ( F  .\/  D ) )
cdleme19.o  |-  O  =  ( ( P  .\/  Q )  ./\  ( G  .\/  Y ) )
Assertion
Ref Expression
cdleme19f  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  ( T  e.  A  /\  -.  T  .<_  W )  /\  R  e.  A
)  /\  ( ( P  =/=  Q  /\  S  =/=  T )  /\  ( -.  S  .<_  ( P 
.\/  Q )  /\  -.  T  .<_  ( P 
.\/  Q ) )  /\  ( R  .<_  ( P  .\/  Q )  /\  R  .<_  ( S 
.\/  T ) ) ) )  ->  N  =  O )

Proof of Theorem cdleme19f
StepHypRef Expression
1 cdleme19.l . . . 4  |-  .<_  =  ( le `  K )
2 cdleme19.j . . . 4  |-  .\/  =  ( join `  K )
3 cdleme19.m . . . 4  |-  ./\  =  ( meet `  K )
4 cdleme19.a . . . 4  |-  A  =  ( Atoms `  K )
5 cdleme19.h . . . 4  |-  H  =  ( LHyp `  K
)
6 cdleme19.u . . . 4  |-  U  =  ( ( P  .\/  Q )  ./\  W )
7 cdleme19.f . . . 4  |-  F  =  ( ( S  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  S )  ./\  W )
) )
8 cdleme19.g . . . 4  |-  G  =  ( ( T  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  T )  ./\  W )
) )
9 cdleme19.d . . . 4  |-  D  =  ( ( R  .\/  S )  ./\  W )
10 cdleme19.y . . . 4  |-  Y  =  ( ( R  .\/  T )  ./\  W )
111, 2, 3, 4, 5, 6, 7, 8, 9, 10cdleme19e 30835 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  ( T  e.  A  /\  -.  T  .<_  W )  /\  R  e.  A
)  /\  ( ( P  =/=  Q  /\  S  =/=  T )  /\  ( -.  S  .<_  ( P 
.\/  Q )  /\  -.  T  .<_  ( P 
.\/  Q ) )  /\  ( R  .<_  ( P  .\/  Q )  /\  R  .<_  ( S 
.\/  T ) ) ) )  ->  ( F  .\/  D )  =  ( G  .\/  Y
) )
1211oveq2d 6083 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  ( T  e.  A  /\  -.  T  .<_  W )  /\  R  e.  A
)  /\  ( ( P  =/=  Q  /\  S  =/=  T )  /\  ( -.  S  .<_  ( P 
.\/  Q )  /\  -.  T  .<_  ( P 
.\/  Q ) )  /\  ( R  .<_  ( P  .\/  Q )  /\  R  .<_  ( S 
.\/  T ) ) ) )  ->  (
( P  .\/  Q
)  ./\  ( F  .\/  D ) )  =  ( ( P  .\/  Q )  ./\  ( G  .\/  Y ) ) )
13 cdleme19.n . 2  |-  N  =  ( ( P  .\/  Q )  ./\  ( F  .\/  D ) )
14 cdleme19.o . 2  |-  O  =  ( ( P  .\/  Q )  ./\  ( G  .\/  Y ) )
1512, 13, 143eqtr4g 2487 1  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( ( S  e.  A  /\  -.  S  .<_  W )  /\  ( T  e.  A  /\  -.  T  .<_  W )  /\  R  e.  A
)  /\  ( ( P  =/=  Q  /\  S  =/=  T )  /\  ( -.  S  .<_  ( P 
.\/  Q )  /\  -.  T  .<_  ( P 
.\/  Q ) )  /\  ( R  .<_  ( P  .\/  Q )  /\  R  .<_  ( S 
.\/  T ) ) ) )  ->  N  =  O )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 359    /\ w3a 936    = wceq 1652    e. wcel 1725    =/= wne 2593   class class class wbr 4199   ` cfv 5440  (class class class)co 6067   lecple 13519   joincjn 14384   meetcmee 14385   Atomscatm 29792   HLchlt 29879   LHypclh 30512
This theorem is referenced by:  cdleme20  30852
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2411  ax-rep 4307  ax-sep 4317  ax-nul 4325  ax-pow 4364  ax-pr 4390  ax-un 4687
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2417  df-cleq 2423  df-clel 2426  df-nfc 2555  df-ne 2595  df-nel 2596  df-ral 2697  df-rex 2698  df-reu 2699  df-rab 2701  df-v 2945  df-sbc 3149  df-csb 3239  df-dif 3310  df-un 3312  df-in 3314  df-ss 3321  df-nul 3616  df-if 3727  df-pw 3788  df-sn 3807  df-pr 3808  df-op 3810  df-uni 4003  df-iun 4082  df-iin 4083  df-br 4200  df-opab 4254  df-mpt 4255  df-id 4485  df-xp 4870  df-rel 4871  df-cnv 4872  df-co 4873  df-dm 4874  df-rn 4875  df-res 4876  df-ima 4877  df-iota 5404  df-fun 5442  df-fn 5443  df-f 5444  df-f1 5445  df-fo 5446  df-f1o 5447  df-fv 5448  df-ov 6070  df-oprab 6071  df-mpt2 6072  df-1st 6335  df-2nd 6336  df-undef 6529  df-riota 6535  df-poset 14386  df-plt 14398  df-lub 14414  df-glb 14415  df-join 14416  df-meet 14417  df-p0 14451  df-p1 14452  df-lat 14458  df-clat 14520  df-oposet 29705  df-ol 29707  df-oml 29708  df-covers 29795  df-ats 29796  df-atl 29827  df-cvlat 29851  df-hlat 29880  df-llines 30026  df-lplanes 30027  df-lvols 30028  df-lines 30029  df-psubsp 30031  df-pmap 30032  df-padd 30324  df-lhyp 30516
  Copyright terms: Public domain W3C validator