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

Theorem cdlemkoatnle 31649
Description: Utility lemma. (Contributed by NM, 2-Jul-2013.)
Hypotheses
Ref Expression
cdlemk1.b  |-  B  =  ( Base `  K
)
cdlemk1.l  |-  .<_  =  ( le `  K )
cdlemk1.j  |-  .\/  =  ( join `  K )
cdlemk1.m  |-  ./\  =  ( meet `  K )
cdlemk1.a  |-  A  =  ( Atoms `  K )
cdlemk1.h  |-  H  =  ( LHyp `  K
)
cdlemk1.t  |-  T  =  ( ( LTrn `  K
) `  W )
cdlemk1.r  |-  R  =  ( ( trL `  K
) `  W )
cdlemk1.s  |-  S  =  ( f  e.  T  |->  ( iota_ i  e.  T
( i `  P
)  =  ( ( P  .\/  ( R `
 f ) ) 
./\  ( ( N `
 P )  .\/  ( R `  ( f  o.  `' F ) ) ) ) ) )
cdlemk1.o  |-  O  =  ( S `  D
)
Assertion
Ref Expression
cdlemkoatnle  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  D  e.  T )  /\  ( N  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( R `  F )  =  ( R `  N ) )  /\  ( F  =/=  (  _I  |`  B )  /\  D  =/=  (  _I  |`  B )  /\  ( R `  D )  =/=  ( R `  F ) ) )  ->  ( ( O `
 P )  e.  A  /\  -.  ( O `  P )  .<_  W ) )
Distinct variable groups:    f, i,  ./\    .<_ , i    .\/ , f, i    A, i    D, f, i    f, F, i    i, H    i, K    f, N, i    P, f, i    R, f, i    T, f, i    f, W, i
Allowed substitution hints:    A( f)    B( f, i)    S( f, i)    H( f)    K( f)    .<_ ( f)    O( f, i)

Proof of Theorem cdlemkoatnle
StepHypRef Expression
1 simp11 988 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  D  e.  T )  /\  ( N  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( R `  F )  =  ( R `  N ) )  /\  ( F  =/=  (  _I  |`  B )  /\  D  =/=  (  _I  |`  B )  /\  ( R `  D )  =/=  ( R `  F ) ) )  ->  ( K  e.  HL  /\  W  e.  H ) )
2 cdlemk1.o . . 3  |-  O  =  ( S `  D
)
3 cdlemk1.b . . . 4  |-  B  =  ( Base `  K
)
4 cdlemk1.l . . . 4  |-  .<_  =  ( le `  K )
5 cdlemk1.j . . . 4  |-  .\/  =  ( join `  K )
6 cdlemk1.a . . . 4  |-  A  =  ( Atoms `  K )
7 cdlemk1.h . . . 4  |-  H  =  ( LHyp `  K
)
8 cdlemk1.t . . . 4  |-  T  =  ( ( LTrn `  K
) `  W )
9 cdlemk1.r . . . 4  |-  R  =  ( ( trL `  K
) `  W )
10 cdlemk1.m . . . 4  |-  ./\  =  ( meet `  K )
11 cdlemk1.s . . . 4  |-  S  =  ( f  e.  T  |->  ( iota_ i  e.  T
( i `  P
)  =  ( ( P  .\/  ( R `
 f ) ) 
./\  ( ( N `
 P )  .\/  ( R `  ( f  o.  `' F ) ) ) ) ) )
123, 4, 5, 6, 7, 8, 9, 10, 11cdlemksel 31643 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  D  e.  T )  /\  ( N  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( R `  F )  =  ( R `  N ) )  /\  ( F  =/=  (  _I  |`  B )  /\  D  =/=  (  _I  |`  B )  /\  ( R `  D )  =/=  ( R `  F ) ) )  ->  ( S `  D )  e.  T
)
132, 12syl5eqel 2521 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  D  e.  T )  /\  ( N  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( R `  F )  =  ( R `  N ) )  /\  ( F  =/=  (  _I  |`  B )  /\  D  =/=  (  _I  |`  B )  /\  ( R `  D )  =/=  ( R `  F ) ) )  ->  O  e.  T
)
14 simp22 992 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  D  e.  T )  /\  ( N  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( R `  F )  =  ( R `  N ) )  /\  ( F  =/=  (  _I  |`  B )  /\  D  =/=  (  _I  |`  B )  /\  ( R `  D )  =/=  ( R `  F ) ) )  ->  ( P  e.  A  /\  -.  P  .<_  W ) )
154, 6, 7, 8ltrnel 30937 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  O  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  ( ( O `  P )  e.  A  /\  -.  ( O `  P )  .<_  W ) )
161, 13, 14, 15syl3anc 1185 1  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  D  e.  T )  /\  ( N  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( R `  F )  =  ( R `  N ) )  /\  ( F  =/=  (  _I  |`  B )  /\  D  =/=  (  _I  |`  B )  /\  ( R `  D )  =/=  ( R `  F ) ) )  ->  ( ( O `
 P )  e.  A  /\  -.  ( O `  P )  .<_  W ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 360    /\ w3a 937    = wceq 1653    e. wcel 1726    =/= wne 2600   class class class wbr 4213    e. cmpt 4267    _I cid 4494   `'ccnv 4878    |` cres 4881    o. ccom 4883   ` cfv 5455  (class class class)co 6082   iota_crio 6543   Basecbs 13470   lecple 13537   joincjn 14402   meetcmee 14403   Atomscatm 30062   HLchlt 30149   LHypclh 30782   LTrncltrn 30899   trLctrl 30956
This theorem is referenced by:  cdlemk14  31652  cdlemk16a  31654  cdlemk1u  31657  cdlemk5u  31659  cdlemk6u  31660  cdlemk7u  31668  cdlemk12u  31670  cdlemkoatnle-2N  31673
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2418  ax-rep 4321  ax-sep 4331  ax-nul 4339  ax-pow 4378  ax-pr 4404  ax-un 4702
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 938  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2286  df-mo 2287  df-clab 2424  df-cleq 2430  df-clel 2433  df-nfc 2562  df-ne 2602  df-nel 2603  df-ral 2711  df-rex 2712  df-reu 2713  df-rmo 2714  df-rab 2715  df-v 2959  df-sbc 3163  df-csb 3253  df-dif 3324  df-un 3326  df-in 3328  df-ss 3335  df-nul 3630  df-if 3741  df-pw 3802  df-sn 3821  df-pr 3822  df-op 3824  df-uni 4017  df-iun 4096  df-iin 4097  df-br 4214  df-opab 4268  df-mpt 4269  df-id 4499  df-xp 4885  df-rel 4886  df-cnv 4887  df-co 4888  df-dm 4889  df-rn 4890  df-res 4891  df-ima 4892  df-iota 5419  df-fun 5457  df-fn 5458  df-f 5459  df-f1 5460  df-fo 5461  df-f1o 5462  df-fv 5463  df-ov 6085  df-oprab 6086  df-mpt2 6087  df-1st 6350  df-2nd 6351  df-undef 6544  df-riota 6550  df-map 7021  df-poset 14404  df-plt 14416  df-lub 14432  df-glb 14433  df-join 14434  df-meet 14435  df-p0 14469  df-p1 14470  df-lat 14476  df-clat 14538  df-oposet 29975  df-ol 29977  df-oml 29978  df-covers 30065  df-ats 30066  df-atl 30097  df-cvlat 30121  df-hlat 30150  df-llines 30296  df-lplanes 30297  df-lvols 30298  df-lines 30299  df-psubsp 30301  df-pmap 30302  df-padd 30594  df-lhyp 30786  df-laut 30787  df-ldil 30902  df-ltrn 30903  df-trl 30957
  Copyright terms: Public domain W3C validator