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

Theorem ltrnideq 30909
Description: Property of the identity lattice translation. (Contributed by NM, 27-May-2012.)
Hypotheses
Ref Expression
ltrnnidn.b  |-  B  =  ( Base `  K
)
ltrnnidn.l  |-  .<_  =  ( le `  K )
ltrnnidn.a  |-  A  =  ( Atoms `  K )
ltrnnidn.h  |-  H  =  ( LHyp `  K
)
ltrnnidn.t  |-  T  =  ( ( LTrn `  K
) `  W )
Assertion
Ref Expression
ltrnideq  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  ( F  =  (  _I  |`  B )  <-> 
( F `  P
)  =  P ) )

Proof of Theorem ltrnideq
StepHypRef Expression
1 simpr 448 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =  (  _I  |`  B ) )  ->  F  =  (  _I  |`  B ) )
21fveq1d 5722 . . . 4  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =  (  _I  |`  B ) )  ->  ( F `  P )  =  ( (  _I  |`  B ) `
 P ) )
3 simpl3l 1012 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =  (  _I  |`  B ) )  ->  P  e.  A )
4 ltrnnidn.b . . . . . 6  |-  B  =  ( Base `  K
)
5 ltrnnidn.a . . . . . 6  |-  A  =  ( Atoms `  K )
64, 5atbase 30024 . . . . 5  |-  ( P  e.  A  ->  P  e.  B )
7 fvresi 5916 . . . . 5  |-  ( P  e.  B  ->  (
(  _I  |`  B ) `
 P )  =  P )
83, 6, 73syl 19 . . . 4  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =  (  _I  |`  B ) )  ->  ( (  _I  |`  B ) `  P )  =  P )
92, 8eqtrd 2467 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =  (  _I  |`  B ) )  ->  ( F `  P )  =  P )
109ex 424 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  ( F  =  (  _I  |`  B )  ->  ( F `  P )  =  P ) )
11 simpl1 960 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =/=  (  _I  |`  B ) )  ->  ( K  e.  HL  /\  W  e.  H ) )
12 simpl2 961 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =/=  (  _I  |`  B ) )  ->  F  e.  T )
13 simpr 448 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =/=  (  _I  |`  B ) )  ->  F  =/=  (  _I  |`  B ) )
14 simpl3 962 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =/=  (  _I  |`  B ) )  ->  ( P  e.  A  /\  -.  P  .<_  W ) )
15 ltrnnidn.l . . . . . 6  |-  .<_  =  ( le `  K )
16 ltrnnidn.h . . . . . 6  |-  H  =  ( LHyp `  K
)
17 ltrnnidn.t . . . . . 6  |-  T  =  ( ( LTrn `  K
) `  W )
184, 15, 5, 16, 17ltrnnidn 30908 . . . . 5  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  F  =/=  (  _I  |`  B ) )  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  ( F `  P )  =/=  P
)
1911, 12, 13, 14, 18syl121anc 1189 . . . 4  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =/=  (  _I  |`  B ) )  ->  ( F `  P )  =/=  P
)
2019ex 424 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  ( F  =/=  (  _I  |`  B )  ->  ( F `  P )  =/=  P
) )
2120necon4d 2661 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  ( ( F `  P )  =  P  ->  F  =  (  _I  |`  B ) ) )
2210, 21impbid 184 1  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  ( F  =  (  _I  |`  B )  <-> 
( F `  P
)  =  P ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 177    /\ wa 359    /\ w3a 936    = wceq 1652    e. wcel 1725    =/= wne 2598   class class class wbr 4204    _I cid 4485    |` cres 4872   ` cfv 5446   Basecbs 13461   lecple 13528   Atomscatm 29998   HLchlt 30085   LHypclh 30718   LTrncltrn 30835
This theorem is referenced by:  trlid0  30910  trlnidatb  30911  ltrn2ateq  30914  cdlemd8  30939  ltrniotaidvalN  31317  cdlemkid4  31668  dia2dimlem7  31805
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-rep 4312  ax-sep 4322  ax-nul 4330  ax-pow 4369  ax-pr 4395  ax-un 4693
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-nel 2601  df-ral 2702  df-rex 2703  df-reu 2704  df-rab 2706  df-v 2950  df-sbc 3154  df-csb 3244  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-pw 3793  df-sn 3812  df-pr 3813  df-op 3815  df-uni 4008  df-iun 4087  df-br 4205  df-opab 4259  df-mpt 4260  df-id 4490  df-xp 4876  df-rel 4877  df-cnv 4878  df-co 4879  df-dm 4880  df-rn 4881  df-res 4882  df-ima 4883  df-iota 5410  df-fun 5448  df-fn 5449  df-f 5450  df-f1 5451  df-fo 5452  df-f1o 5453  df-fv 5454  df-ov 6076  df-oprab 6077  df-mpt2 6078  df-1st 6341  df-2nd 6342  df-undef 6535  df-riota 6541  df-map 7012  df-poset 14395  df-plt 14407  df-lub 14423  df-glb 14424  df-join 14425  df-meet 14426  df-p0 14460  df-p1 14461  df-lat 14467  df-clat 14529  df-oposet 29911  df-ol 29913  df-oml 29914  df-covers 30001  df-ats 30002  df-atl 30033  df-cvlat 30057  df-hlat 30086  df-lhyp 30722  df-laut 30723  df-ldil 30838  df-ltrn 30839  df-trl 30893
  Copyright terms: Public domain W3C validator