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

Theorem trlat 29047
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 960 . . 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 988 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  F  e.  T
)
3 simp2 961 . . 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 2253 . . . 4  |-  ( join `  K )  =  (
join `  K )
6 eqid 2253 . . . 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 29041 . . 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 1187 . 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 986 . . . 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 29018 . . . 4  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  P  e.  A
)  ->  ( F `  P )  e.  A
)
151, 2, 13, 14syl3anc 1187 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  ( F `  P )  e.  A
)
16 simp3r 989 . . . 4  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( F  e.  T  /\  ( F `  P )  =/=  P ) )  ->  ( F `  P )  =/=  P
)
1716necomd 2495 . . 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 28921 . . 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 1191 . 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 2327 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 5    -> wi 6    /\ wa 360    /\ w3a 939    = wceq 1619    e. wcel 1621    =/= wne 2412   class class class wbr 3920   ` cfv 4592  (class class class)co 5710   lecple 13089   joincjn 13922   meetcmee 13923   Atomscatm 28142   HLchlt 28229   LHypclh 28862   LTrncltrn 28979   trLctrl 29036
This theorem is referenced by:  trlator0  29049  trlnidat  29051  trlnle  29064  trlval3  29065  trlval4  29066  cdlemc5  29073  cdlemg17dALTN  29542  cdlemg27a  29570  cdlemg31b0N  29572  cdlemg27b  29574  cdlemg31c  29577  cdlemg35  29591  dia2dimlem1  29943  dia2dimlem2  29944  dia2dimlem3  29945
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 1926  ax-ext 2234  ax-rep 4028  ax-sep 4038  ax-nul 4046  ax-pow 4082  ax-pr 4108  ax-un 4403
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1883  df-eu 2118  df-mo 2119  df-clab 2240  df-cleq 2246  df-clel 2249  df-nfc 2374  df-ne 2414  df-nel 2415  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2516  df-v 2729  df-sbc 2922  df-csb 3010  df-dif 3081  df-un 3083  df-in 3085  df-ss 3089  df-nul 3363  df-if 3471  df-pw 3532  df-sn 3550  df-pr 3551  df-op 3553  df-uni 3728  df-iun 3805  df-br 3921  df-opab 3975  df-mpt 3976  df-id 4202  df-xp 4594  df-rel 4595  df-cnv 4596  df-co 4597  df-dm 4598  df-rn 4599  df-res 4600  df-ima 4601  df-fun 4602  df-fn 4603  df-f 4604  df-f1 4605  df-fo 4606  df-f1o 4607  df-fv 4608  df-ov 5713  df-oprab 5714  df-mpt2 5715  df-1st 5974  df-2nd 5975  df-iota 6143  df-undef 6182  df-riota 6190  df-map 6660  df-poset 13924  df-plt 13936  df-lub 13952  df-glb 13953  df-join 13954  df-meet 13955  df-p0 13989  df-p1 13990  df-lat 13996  df-clat 14058  df-oposet 28055  df-ol 28057  df-oml 28058  df-covers 28145  df-ats 28146  df-atl 28177  df-cvlat 28201  df-hlat 28230  df-lhyp 28866  df-laut 28867  df-ldil 28982  df-ltrn 28983  df-trl 29037
  Copyright terms: Public domain W3C validator