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

Theorem cdleme19f 29627
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 29626 . . 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 5773 . 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 2313 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 5    -> wi 6    /\ wa 360    /\ w3a 939    = wceq 1619    e. wcel 1621    =/= wne 2419   class class class wbr 3963   ` cfv 4638  (class class class)co 5757   lecple 13142   joincjn 14005   meetcmee 14006   Atomscatm 28583   HLchlt 28670   LHypclh 29303
This theorem is referenced by:  cdleme20  29643
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-13 1625  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1927  ax-ext 2237  ax-rep 4071  ax-sep 4081  ax-nul 4089  ax-pow 4126  ax-pr 4152  ax-un 4449
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 940  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1884  df-eu 2121  df-mo 2122  df-clab 2243  df-cleq 2249  df-clel 2252  df-nfc 2381  df-ne 2421  df-nel 2422  df-ral 2520  df-rex 2521  df-reu 2522  df-rab 2523  df-v 2742  df-sbc 2936  df-csb 3024  df-dif 3097  df-un 3099  df-in 3101  df-ss 3108  df-nul 3398  df-if 3507  df-pw 3568  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3769  df-iun 3848  df-iin 3849  df-br 3964  df-opab 4018  df-mpt 4019  df-id 4246  df-xp 4640  df-rel 4641  df-cnv 4642  df-co 4643  df-dm 4644  df-rn 4645  df-res 4646  df-ima 4647  df-fun 4648  df-fn 4649  df-f 4650  df-f1 4651  df-fo 4652  df-f1o 4653  df-fv 4654  df-ov 5760  df-oprab 5761  df-mpt2 5762  df-1st 6021  df-2nd 6022  df-iota 6190  df-undef 6229  df-riota 6237  df-poset 14007  df-plt 14019  df-lub 14035  df-glb 14036  df-join 14037  df-meet 14038  df-p0 14072  df-p1 14073  df-lat 14079  df-clat 14141  df-oposet 28496  df-ol 28498  df-oml 28499  df-covers 28586  df-ats 28587  df-atl 28618  df-cvlat 28642  df-hlat 28671  df-llines 28817  df-lplanes 28818  df-lvols 28819  df-lines 28820  df-psubsp 28822  df-pmap 28823  df-padd 29115  df-lhyp 29307
  Copyright terms: Public domain W3C validator