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

Theorem cdlemksat 31035
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 985 . 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 31034 . 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 1074 . 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 30329 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( S `  G )  e.  T  /\  P  e.  A
)  ->  ( ( S `  G ) `  P )  e.  A
)
141, 11, 12, 13syl3anc 1182 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 358    /\ w3a 934    = wceq 1623    e. wcel 1684    =/= wne 2446   class class class wbr 4023    e. cmpt 4077    _I cid 4304   `'ccnv 4688    |` cres 4691    o. ccom 4693   ` cfv 5255  (class class class)co 5858   iota_crio 6297   Basecbs 13148   lecple 13215   joincjn 14078   meetcmee 14079   Atomscatm 29453   HLchlt 29540   LHypclh 30173   LTrncltrn 30290   trLctrl 30347
This theorem is referenced by:  cdlemk7  31037  cdlemk11  31038  cdlemk12  31039  cdlemk14  31043  cdlemk15  31044
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-nel 2449  df-ral 2548  df-rex 2549  df-reu 2550  df-rmo 2551  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-iin 3908  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-1st 6122  df-2nd 6123  df-undef 6298  df-riota 6304  df-map 6774  df-poset 14080  df-plt 14092  df-lub 14108  df-glb 14109  df-join 14110  df-meet 14111  df-p0 14145  df-p1 14146  df-lat 14152  df-clat 14214  df-oposet 29366  df-ol 29368  df-oml 29369  df-covers 29456  df-ats 29457  df-atl 29488  df-cvlat 29512  df-hlat 29541  df-llines 29687  df-lplanes 29688  df-lvols 29689  df-lines 29690  df-psubsp 29692  df-pmap 29693  df-padd 29985  df-lhyp 30177  df-laut 30178  df-ldil 30293  df-ltrn 30294  df-trl 30348
  Copyright terms: Public domain W3C validator