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

Theorem lautle 34036
Description: Less-than or equal property of a lattice automorphism. (Contributed by NM, 19-May-2012.)
Hypotheses
Ref Expression
lautset.b  |-  B  =  ( Base `  K
)
lautset.l  |-  .<_  =  ( le `  K )
lautset.i  |-  I  =  ( LAut `  K
)
Assertion
Ref Expression
lautle  |-  ( ( ( K  e.  V  /\  F  e.  I
)  /\  ( X  e.  B  /\  Y  e.  B ) )  -> 
( X  .<_  Y  <->  ( F `  X )  .<_  ( F `
 Y ) ) )

Proof of Theorem lautle
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lautset.b . . . 4  |-  B  =  ( Base `  K
)
2 lautset.l . . . 4  |-  .<_  =  ( le `  K )
3 lautset.i . . . 4  |-  I  =  ( LAut `  K
)
41, 2, 3islaut 34035 . . 3  |-  ( K  e.  V  ->  ( F  e.  I  <->  ( F : B -1-1-onto-> B  /\  A. x  e.  B  A. y  e.  B  ( x  .<_  y  <->  ( F `  x )  .<_  ( F `
 y ) ) ) ) )
54simplbda 624 . 2  |-  ( ( K  e.  V  /\  F  e.  I )  ->  A. x  e.  B  A. y  e.  B  ( x  .<_  y  <->  ( F `  x )  .<_  ( F `
 y ) ) )
6 breq1 4395 . . . 4  |-  ( x  =  X  ->  (
x  .<_  y  <->  X  .<_  y ) )
7 fveq2 5791 . . . . 5  |-  ( x  =  X  ->  ( F `  x )  =  ( F `  X ) )
87breq1d 4402 . . . 4  |-  ( x  =  X  ->  (
( F `  x
)  .<_  ( F `  y )  <->  ( F `  X )  .<_  ( F `
 y ) ) )
96, 8bibi12d 321 . . 3  |-  ( x  =  X  ->  (
( x  .<_  y  <->  ( F `  x )  .<_  ( F `
 y ) )  <-> 
( X  .<_  y  <->  ( F `  X )  .<_  ( F `
 y ) ) ) )
10 breq2 4396 . . . 4  |-  ( y  =  Y  ->  ( X  .<_  y  <->  X  .<_  Y ) )
11 fveq2 5791 . . . . 5  |-  ( y  =  Y  ->  ( F `  y )  =  ( F `  Y ) )
1211breq2d 4404 . . . 4  |-  ( y  =  Y  ->  (
( F `  X
)  .<_  ( F `  y )  <->  ( F `  X )  .<_  ( F `
 Y ) ) )
1310, 12bibi12d 321 . . 3  |-  ( y  =  Y  ->  (
( X  .<_  y  <->  ( F `  X )  .<_  ( F `
 y ) )  <-> 
( X  .<_  Y  <->  ( F `  X )  .<_  ( F `
 Y ) ) ) )
149, 13rspc2v 3178 . 2  |-  ( ( X  e.  B  /\  Y  e.  B )  ->  ( A. x  e.  B  A. y  e.  B  ( x  .<_  y  <-> 
( F `  x
)  .<_  ( F `  y ) )  -> 
( X  .<_  Y  <->  ( F `  X )  .<_  ( F `
 Y ) ) ) )
155, 14mpan9 469 1  |-  ( ( ( K  e.  V  /\  F  e.  I
)  /\  ( X  e.  B  /\  Y  e.  B ) )  -> 
( X  .<_  Y  <->  ( F `  X )  .<_  ( F `
 Y ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1370    e. wcel 1758   A.wral 2795   class class class wbr 4392   -1-1-onto->wf1o 5517   ` cfv 5518   Basecbs 14278   lecple 14349   LAutclaut 33937
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1952  ax-ext 2430  ax-rep 4503  ax-sep 4513  ax-nul 4521  ax-pow 4570  ax-pr 4631  ax-un 6474
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2264  df-mo 2265  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2601  df-ne 2646  df-ral 2800  df-rex 2801  df-reu 2802  df-rab 2804  df-v 3072  df-sbc 3287  df-csb 3389  df-dif 3431  df-un 3433  df-in 3435  df-ss 3442  df-nul 3738  df-if 3892  df-pw 3962  df-sn 3978  df-pr 3980  df-op 3984  df-uni 4192  df-iun 4273  df-br 4393  df-opab 4451  df-mpt 4452  df-id 4736  df-xp 4946  df-rel 4947  df-cnv 4948  df-co 4949  df-dm 4950  df-rn 4951  df-res 4952  df-ima 4953  df-iota 5481  df-fun 5520  df-fn 5521  df-f 5522  df-f1 5523  df-fo 5524  df-f1o 5525  df-fv 5526  df-ov 6195  df-oprab 6196  df-mpt2 6197  df-map 7318  df-laut 33941
This theorem is referenced by:  lautcnvle  34041  lautlt  34043  lautj  34045  lautm  34046  lauteq  34047  lautco  34049  ltrnle  34081
  Copyright terms: Public domain W3C validator