MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  latasym Unicode version

Theorem latasym 14447
Description: A lattice ordering is asymetric. (eqss 3331 analog.) (Contributed by NM, 8-Oct-2011.)
Hypotheses
Ref Expression
latref.b  |-  B  =  ( Base `  K
)
latref.l  |-  .<_  =  ( le `  K )
Assertion
Ref Expression
latasym  |-  ( ( K  e.  Lat  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( X  .<_  Y  /\  Y  .<_  X )  ->  X  =  Y ) )

Proof of Theorem latasym
StepHypRef Expression
1 latref.b . . 3  |-  B  =  ( Base `  K
)
2 latref.l . . 3  |-  .<_  =  ( le `  K )
31, 2latasymb 14446 . 2  |-  ( ( K  e.  Lat  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( X  .<_  Y  /\  Y  .<_  X )  <-> 
X  =  Y ) )
43biimpd 199 1  |-  ( ( K  e.  Lat  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( X  .<_  Y  /\  Y  .<_  X )  ->  X  =  Y ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    /\ w3a 936    = wceq 1649    e. wcel 1721   class class class wbr 4180   ` cfv 5421   Basecbs 13432   lecple 13499   Latclat 14437
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2393  ax-nul 4306
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2266  df-clab 2399  df-cleq 2405  df-clel 2408  df-nfc 2537  df-ne 2577  df-ral 2679  df-rex 2680  df-rab 2683  df-v 2926  df-sbc 3130  df-dif 3291  df-un 3293  df-in 3295  df-ss 3302  df-nul 3597  df-if 3708  df-sn 3788  df-pr 3789  df-op 3791  df-uni 3984  df-br 4181  df-iota 5385  df-fv 5429  df-ov 6051  df-poset 14366  df-lat 14438
  Copyright terms: Public domain W3C validator