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

Theorem posasymb 14086
Description: A poset ordering is asymetric. (Contributed by NM, 21-Oct-2011.)
Hypotheses
Ref Expression
posi.b  |-  B  =  ( Base `  K
)
posi.l  |-  .<_  =  ( le `  K )
Assertion
Ref Expression
posasymb  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  (
( X  .<_  Y  /\  Y  .<_  X )  <->  X  =  Y ) )

Proof of Theorem posasymb
StepHypRef Expression
1 simp1 955 . . . 4  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  K  e.  Poset )
2 simp2 956 . . . 4  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  X  e.  B )
3 simp3 957 . . . 4  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  Y  e.  B )
4 posi.b . . . . 5  |-  B  =  ( Base `  K
)
5 posi.l . . . . 5  |-  .<_  =  ( le `  K )
64, 5posi 14084 . . . 4  |-  ( ( K  e.  Poset  /\  ( X  e.  B  /\  Y  e.  B  /\  Y  e.  B )
)  ->  ( X  .<_  X  /\  ( ( X  .<_  Y  /\  Y  .<_  X )  ->  X  =  Y )  /\  ( ( X  .<_  Y  /\  Y  .<_  Y )  ->  X  .<_  Y ) ) )
71, 2, 3, 3, 6syl13anc 1184 . . 3  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  .<_  X  /\  (
( X  .<_  Y  /\  Y  .<_  X )  ->  X  =  Y )  /\  ( ( X  .<_  Y  /\  Y  .<_  Y )  ->  X  .<_  Y ) ) )
87simp2d 968 . 2  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  (
( X  .<_  Y  /\  Y  .<_  X )  ->  X  =  Y )
)
94, 5posref 14085 . . . . 5  |-  ( ( K  e.  Poset  /\  X  e.  B )  ->  X  .<_  X )
10 breq2 4027 . . . . 5  |-  ( X  =  Y  ->  ( X  .<_  X  <->  X  .<_  Y ) )
119, 10syl5ibcom 211 . . . 4  |-  ( ( K  e.  Poset  /\  X  e.  B )  ->  ( X  =  Y  ->  X 
.<_  Y ) )
12 breq1 4026 . . . . 5  |-  ( X  =  Y  ->  ( X  .<_  X  <->  Y  .<_  X ) )
139, 12syl5ibcom 211 . . . 4  |-  ( ( K  e.  Poset  /\  X  e.  B )  ->  ( X  =  Y  ->  Y 
.<_  X ) )
1411, 13jcad 519 . . 3  |-  ( ( K  e.  Poset  /\  X  e.  B )  ->  ( X  =  Y  ->  ( X  .<_  Y  /\  Y  .<_  X ) ) )
15143adant3 975 . 2  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  =  Y  ->  ( X  .<_  Y  /\  Y  .<_  X ) ) )
168, 15impbid 183 1  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  (
( X  .<_  Y  /\  Y  .<_  X )  <->  X  =  Y ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934    = wceq 1623    e. wcel 1684   class class class wbr 4023   ` cfv 5255   Basecbs 13148   lecple 13215   Posetcpo 14074
This theorem is referenced by:  pltnle  14100  pltval3  14101  lubid  14116  latasymb  14160  latleeqj1  14169  latleeqm1  14185  odupos  14239  poslubmo  14250  ople0  29377  op1le  29382  atlle0  29495
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-poset 14080
  Copyright terms: Public domain W3C validator