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

Theorem trlat 29488
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 2256 . . . 4  |-  ( join `  K )  =  (
join `  K )
6 eqid 2256 . . . 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 29482 . . 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 29459 . . . 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 2502 . . 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 29362 . . 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 2330 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 2419   class class class wbr 3963   ` cfv 4638  (class class class)co 5757   lecple 13142   joincjn 14005   meetcmee 14006   Atomscatm 28583   HLchlt 28670   LHypclh 29303   LTrncltrn 29420   trLctrl 29477
This theorem is referenced by:  trlator0  29490  trlnidat  29492  trlnle  29505  trlval3  29506  trlval4  29507  cdlemc5  29514  cdlemg17dALTN  29983  cdlemg27a  30011  cdlemg31b0N  30013  cdlemg27b  30015  cdlemg31c  30018  cdlemg35  30032  dia2dimlem1  30384  dia2dimlem2  30385  dia2dimlem3  30386
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 1927  ax-ext 2237  ax-rep 4071  ax-sep 4081  ax-nul 4089  ax-pow 4126  ax-pr 4152  ax-un 4449
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 1884  df-eu 2121  df-mo 2122  df-clab 2243  df-cleq 2249  df-clel 2252  df-nfc 2381  df-ne 2421  df-nel 2422  df-ral 2520  df-rex 2521  df-reu 2522  df-rab 2523  df-v 2742  df-sbc 2936  df-csb 3024  df-dif 3097  df-un 3099  df-in 3101  df-ss 3108  df-nul 3398  df-if 3507  df-pw 3568  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3769  df-iun 3848  df-br 3964  df-opab 4018  df-mpt 4019  df-id 4246  df-xp 4640  df-rel 4641  df-cnv 4642  df-co 4643  df-dm 4644  df-rn 4645  df-res 4646  df-ima 4647  df-fun 4648  df-fn 4649  df-f 4650  df-f1 4651  df-fo 4652  df-f1o 4653  df-fv 4654  df-ov 5760  df-oprab 5761  df-mpt2 5762  df-1st 6021  df-2nd 6022  df-iota 6190  df-undef 6229  df-riota 6237  df-map 6707  df-poset 14007  df-plt 14019  df-lub 14035  df-glb 14036  df-join 14037  df-meet 14038  df-p0 14072  df-p1 14073  df-lat 14079  df-clat 14141  df-oposet 28496  df-ol 28498  df-oml 28499  df-covers 28586  df-ats 28587  df-atl 28618  df-cvlat 28642  df-hlat 28671  df-lhyp 29307  df-laut 29308  df-ldil 29423  df-ltrn 29424  df-trl 29478
  Copyright terms: Public domain W3C validator