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

Theorem trlat 30655
Description: If an atom differs from its translation, the trace is an atom. Equation above Lemma C in [Crawley] p. 112. (Contributed by NM, 23-May-2012.)
Hypotheses
Ref Expression
trlat.l  |-  .<_  =  ( le `  K )
trlat.a  |-  A  =  ( Atoms `  K )
trlat.h  |-  H  =  ( LHyp `  K
)
trlat.t  |-  T  =  ( ( LTrn `  K
) `  W )
trlat.r  |-  R  =  ( ( trL `  K
) `  W )
Assertion
Ref Expression
trlat  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  ( R `  F )  e.  A
)

Proof of Theorem trlat
StepHypRef Expression
1 simp1 957 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  ( K  e.  HL  /\  W  e.  H ) )
2 simp3l 985 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  F  e.  T
)
3 simp2 958 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  ( P  e.  A  /\  -.  P  .<_  W ) )
4 trlat.l . . . 4  |-  .<_  =  ( le `  K )
5 eqid 2408 . . . 4  |-  ( join `  K )  =  (
join `  K )
6 eqid 2408 . . . 4  |-  ( meet `  K )  =  (
meet `  K )
7 trlat.a . . . 4  |-  A  =  ( Atoms `  K )
8 trlat.h . . . 4  |-  H  =  ( LHyp `  K
)
9 trlat.t . . . 4  |-  T  =  ( ( LTrn `  K
) `  W )
10 trlat.r . . . 4  |-  R  =  ( ( trL `  K
) `  W )
114, 5, 6, 7, 8, 9, 10trlval2 30649 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  ( R `  F )  =  ( ( P ( join `  K ) ( F `
 P ) ) ( meet `  K
) W ) )
121, 2, 3, 11syl3anc 1184 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  ( R `  F )  =  ( ( P ( join `  K ) ( F `
 P ) ) ( meet `  K
) W ) )
13 simp2l 983 . . . 4  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  P  e.  A
)
144, 7, 8, 9ltrnat 30626 . . . 4  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  P  e.  A
)  ->  ( F `  P )  e.  A
)
151, 2, 13, 14syl3anc 1184 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  ( F `  P )  e.  A
)
16 simp3r 986 . . . 4  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  ( F `  P )  =/=  P
)
1716necomd 2654 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  P  =/=  ( F `  P )
)
184, 5, 6, 7, 8lhpat 30529 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  (
( F `  P
)  e.  A  /\  P  =/=  ( F `  P ) ) )  ->  ( ( P ( join `  K
) ( F `  P ) ) (
meet `  K ) W )  e.  A
)
191, 3, 15, 17, 18syl112anc 1188 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  ( ( P ( join `  K
) ( F `  P ) ) (
meet `  K ) W )  e.  A
)
2012, 19eqeltrd 2482 1  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  ( R `  F )  e.  A
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 359    /\ w3a 936    = wceq 1649    e. wcel 1721    =/= wne 2571   class class class wbr 4176   ` cfv 5417  (class class class)co 6044   lecple 13495   joincjn 14360   meetcmee 14361   Atomscatm 29750   HLchlt 29837   LHypclh 30470   LTrncltrn 30587   trLctrl 30644
This theorem is referenced by:  trlator0  30657  trlnidat  30659  trlnle  30672  trlval3  30673  trlval4  30674  cdlemc5  30681  cdlemg17dALTN  31150  cdlemg27a  31178  cdlemg31b0N  31180  cdlemg27b  31182  cdlemg31c  31185  cdlemg35  31199  dia2dimlem1  31551  dia2dimlem2  31552  dia2dimlem3  31553
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 2389  ax-rep 4284  ax-sep 4294  ax-nul 4302  ax-pow 4341  ax-pr 4367  ax-un 4664
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2262  df-mo 2263  df-clab 2395  df-cleq 2401  df-clel 2404  df-nfc 2533  df-ne 2573  df-nel 2574  df-ral 2675  df-rex 2676  df-reu 2677  df-rab 2679  df-v 2922  df-sbc 3126  df-csb 3216  df-dif 3287  df-un 3289  df-in 3291  df-ss 3298  df-nul 3593  df-if 3704  df-pw 3765  df-sn 3784  df-pr 3785  df-op 3787  df-uni 3980  df-iun 4059  df-br 4177  df-opab 4231  df-mpt 4232  df-id 4462  df-xp 4847  df-rel 4848  df-cnv 4849  df-co 4850  df-dm 4851  df-rn 4852  df-res 4853  df-ima 4854  df-iota 5381  df-fun 5419  df-fn 5420  df-f 5421  df-f1 5422  df-fo 5423  df-f1o 5424  df-fv 5425  df-ov 6047  df-oprab 6048  df-mpt2 6049  df-1st 6312  df-2nd 6313  df-undef 6506  df-riota 6512  df-map 6983  df-poset 14362  df-plt 14374  df-lub 14390  df-glb 14391  df-join 14392  df-meet 14393  df-p0 14427  df-p1 14428  df-lat 14434  df-clat 14496  df-oposet 29663  df-ol 29665  df-oml 29666  df-covers 29753  df-ats 29754  df-atl 29785  df-cvlat 29809  df-hlat 29838  df-lhyp 30474  df-laut 30475  df-ldil 30590  df-ltrn 30591  df-trl 30645
  Copyright terms: Public domain W3C validator