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

Theorem ltrnideq 30364
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 447 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =  (  _I  |`  B ) )  ->  F  =  (  _I  |`  B ) )
21fveq1d 5527 . . . 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 1010 . . . . 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 29479 . . . . 5  |-  ( P  e.  A  ->  P  e.  B )
7 fvresi 5711 . . . . 5  |-  ( P  e.  B  ->  (
(  _I  |`  B ) `
 P )  =  P )
83, 6, 73syl 18 . . . 4  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =  (  _I  |`  B ) )  ->  ( (  _I  |`  B ) `  P )  =  P )
92, 8eqtrd 2315 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =  (  _I  |`  B ) )  ->  ( F `  P )  =  P )
109ex 423 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  ( F  =  (  _I  |`  B )  ->  ( F `  P )  =  P ) )
11 simpl1 958 . . . . 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 959 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =/=  (  _I  |`  B ) )  ->  F  e.  T )
13 simpr 447 . . . . 5  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =/=  (  _I  |`  B ) )  ->  F  =/=  (  _I  |`  B ) )
14 simpl3 960 . . . . 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 30363 . . . . 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 1187 . . . 4  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  /\  F  =/=  (  _I  |`  B ) )  ->  ( F `  P )  =/=  P
)
2019ex 423 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  ( F  =/=  (  _I  |`  B )  ->  ( F `  P )  =/=  P
) )
2120necon4d 2509 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W ) )  ->  ( ( F `  P )  =  P  ->  F  =  (  _I  |`  B ) ) )
2210, 21impbid 183 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 176    /\ wa 358    /\ w3a 934    = wceq 1623    e. wcel 1684    =/= wne 2446   class class class wbr 4023    _I cid 4304    |` cres 4691   ` cfv 5255   Basecbs 13148   lecple 13215   Atomscatm 29453   HLchlt 29540   LHypclh 30173   LTrncltrn 30290
This theorem is referenced by:  trlid0  30365  trlnidatb  30366  ltrn2ateq  30369  cdlemd8  30394  ltrniotaidvalN  30772  cdlemkid4  31123  dia2dimlem7  31260
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-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-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-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-lhyp 30177  df-laut 30178  df-ldil 30293  df-ltrn 30294  df-trl 30348
  Copyright terms: Public domain W3C validator