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

Theorem cdlemksat 31328
Description: Part of proof of Lemma K of [Crawley] p. 118. (Contributed by NM, 27-Jun-2013.)
Hypotheses
Ref Expression
cdlemk.b  |-  B  =  ( Base `  K
)
cdlemk.l  |-  .<_  =  ( le `  K )
cdlemk.j  |-  .\/  =  ( join `  K )
cdlemk.a  |-  A  =  ( Atoms `  K )
cdlemk.h  |-  H  =  ( LHyp `  K
)
cdlemk.t  |-  T  =  ( ( LTrn `  K
) `  W )
cdlemk.r  |-  R  =  ( ( trL `  K
) `  W )
cdlemk.m  |-  ./\  =  ( meet `  K )
cdlemk.s  |-  S  =  ( f  e.  T  |->  ( iota_ i  e.  T
( i `  P
)  =  ( ( P  .\/  ( R `
 f ) ) 
./\  ( ( N `
 P )  .\/  ( R `  ( f  o.  `' F ) ) ) ) ) )
Assertion
Ref Expression
cdlemksat  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( N  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( R `  F )  =  ( R `  N ) )  /\  ( F  =/=  (  _I  |`  B )  /\  G  =/=  (  _I  |`  B )  /\  ( R `  G )  =/=  ( R `  F ) ) )  ->  ( ( S `
 G ) `  P )  e.  A
)
Distinct variable groups:    ./\ , f    .\/ , f    f, F, i    f, G, i    f, N    P, f    R, f    T, f   
f, W    ./\ , i    .<_ , i    .\/ , i    A, i    i, F   
i, H    i, K    i, N    P, i    R, i    T, i    i, W
Allowed substitution hints:    A( f)    B( f, i)    S( f, i)    H( f)    K( f)    .<_ ( f)

Proof of Theorem cdlemksat
StepHypRef Expression
1 simp11 987 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( N  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( R `  F )  =  ( R `  N ) )  /\  ( F  =/=  (  _I  |`  B )  /\  G  =/=  (  _I  |`  B )  /\  ( R `  G )  =/=  ( R `  F ) ) )  ->  ( K  e.  HL  /\  W  e.  H ) )
2 cdlemk.b . . 3  |-  B  =  ( Base `  K
)
3 cdlemk.l . . 3  |-  .<_  =  ( le `  K )
4 cdlemk.j . . 3  |-  .\/  =  ( join `  K )
5 cdlemk.a . . 3  |-  A  =  ( Atoms `  K )
6 cdlemk.h . . 3  |-  H  =  ( LHyp `  K
)
7 cdlemk.t . . 3  |-  T  =  ( ( LTrn `  K
) `  W )
8 cdlemk.r . . 3  |-  R  =  ( ( trL `  K
) `  W )
9 cdlemk.m . . 3  |-  ./\  =  ( meet `  K )
10 cdlemk.s . . 3  |-  S  =  ( f  e.  T  |->  ( iota_ i  e.  T
( i `  P
)  =  ( ( P  .\/  ( R `
 f ) ) 
./\  ( ( N `
 P )  .\/  ( R `  ( f  o.  `' F ) ) ) ) ) )
112, 3, 4, 5, 6, 7, 8, 9, 10cdlemksel 31327 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( N  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( R `  F )  =  ( R `  N ) )  /\  ( F  =/=  (  _I  |`  B )  /\  G  =/=  (  _I  |`  B )  /\  ( R `  G )  =/=  ( R `  F ) ) )  ->  ( S `  G )  e.  T
)
12 simp22l 1076 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( N  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( R `  F )  =  ( R `  N ) )  /\  ( F  =/=  (  _I  |`  B )  /\  G  =/=  (  _I  |`  B )  /\  ( R `  G )  =/=  ( R `  F ) ) )  ->  P  e.  A
)
133, 5, 6, 7ltrnat 30622 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( S `  G )  e.  T  /\  P  e.  A
)  ->  ( ( S `  G ) `  P )  e.  A
)
141, 11, 12, 13syl3anc 1184 1  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  G  e.  T )  /\  ( N  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( R `  F )  =  ( R `  N ) )  /\  ( F  =/=  (  _I  |`  B )  /\  G  =/=  (  _I  |`  B )  /\  ( R `  G )  =/=  ( R `  F ) ) )  ->  ( ( S `
 G ) `  P )  e.  A
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 359    /\ w3a 936    = wceq 1649    e. wcel 1721    =/= wne 2567   class class class wbr 4172    e. cmpt 4226    _I cid 4453   `'ccnv 4836    |` cres 4839    o. ccom 4841   ` cfv 5413  (class class class)co 6040   iota_crio 6501   Basecbs 13424   lecple 13491   joincjn 14356   meetcmee 14357   Atomscatm 29746   HLchlt 29833   LHypclh 30466   LTrncltrn 30583   trLctrl 30640
This theorem is referenced by:  cdlemk7  31330  cdlemk11  31331  cdlemk12  31332  cdlemk14  31336  cdlemk15  31337
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-rep 4280  ax-sep 4290  ax-nul 4298  ax-pow 4337  ax-pr 4363  ax-un 4660
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2258  df-mo 2259  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ne 2569  df-nel 2570  df-ral 2671  df-rex 2672  df-reu 2673  df-rmo 2674  df-rab 2675  df-v 2918  df-sbc 3122  df-csb 3212  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-nul 3589  df-if 3700  df-pw 3761  df-sn 3780  df-pr 3781  df-op 3783  df-uni 3976  df-iun 4055  df-iin 4056  df-br 4173  df-opab 4227  df-mpt 4228  df-id 4458  df-xp 4843  df-rel 4844  df-cnv 4845  df-co 4846  df-dm 4847  df-rn 4848  df-res 4849  df-ima 4850  df-iota 5377  df-fun 5415  df-fn 5416  df-f 5417  df-f1 5418  df-fo 5419  df-f1o 5420  df-fv 5421  df-ov 6043  df-oprab 6044  df-mpt2 6045  df-1st 6308  df-2nd 6309  df-undef 6502  df-riota 6508  df-map 6979  df-poset 14358  df-plt 14370  df-lub 14386  df-glb 14387  df-join 14388  df-meet 14389  df-p0 14423  df-p1 14424  df-lat 14430  df-clat 14492  df-oposet 29659  df-ol 29661  df-oml 29662  df-covers 29749  df-ats 29750  df-atl 29781  df-cvlat 29805  df-hlat 29834  df-llines 29980  df-lplanes 29981  df-lvols 29982  df-lines 29983  df-psubsp 29985  df-pmap 29986  df-padd 30278  df-lhyp 30470  df-laut 30471  df-ldil 30586  df-ltrn 30587  df-trl 30641
  Copyright terms: Public domain W3C validator