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

Theorem latasym 14161
Description: A lattice ordering is asymetric. (eqss 3194 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 14160 . 2  |-  ( ( K  e.  Lat  /\  X  e.  B  /\  Y  e.  B )  ->  ( ( X  .<_  Y  /\  Y  .<_  X )  <-> 
X  =  Y ) )
43biimpd 198 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 358    /\ w3a 934    = wceq 1623    e. wcel 1684   class class class wbr 4023   ` cfv 5255   Basecbs 13148   lecple 13215   Latclat 14151
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-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-nul 4149
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-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-br 4024  df-iota 5219  df-fv 5263  df-ov 5861  df-poset 14080  df-lat 14152
  Copyright terms: Public domain W3C validator