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

Theorem posasymb 15561
Description: A poset ordering is asymmetric. (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 997 . . . 4  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  K  e.  Poset )
2 simp2 998 . . . 4  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  X  e.  B )
3 simp3 999 . . . 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 15558 . . . 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 1231 . . 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 1010 . 2  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  (
( X  .<_  Y  /\  Y  .<_  X )  ->  X  =  Y )
)
94, 5posref 15559 . . . . 5  |-  ( ( K  e.  Poset  /\  X  e.  B )  ->  X  .<_  X )
10 breq2 4441 . . . . 5  |-  ( X  =  Y  ->  ( X  .<_  X  <->  X  .<_  Y ) )
119, 10syl5ibcom 220 . . . 4  |-  ( ( K  e.  Poset  /\  X  e.  B )  ->  ( X  =  Y  ->  X 
.<_  Y ) )
12 breq1 4440 . . . . 5  |-  ( X  =  Y  ->  ( X  .<_  X  <->  Y  .<_  X ) )
139, 12syl5ibcom 220 . . . 4  |-  ( ( K  e.  Poset  /\  X  e.  B )  ->  ( X  =  Y  ->  Y 
.<_  X ) )
1411, 13jcad 533 . . 3  |-  ( ( K  e.  Poset  /\  X  e.  B )  ->  ( X  =  Y  ->  ( X  .<_  Y  /\  Y  .<_  X ) ) )
15143adant3 1017 . 2  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  ( X  =  Y  ->  ( X  .<_  Y  /\  Y  .<_  X ) ) )
168, 15impbid 191 1  |-  ( ( K  e.  Poset  /\  X  e.  B  /\  Y  e.  B )  ->  (
( X  .<_  Y  /\  Y  .<_  X )  <->  X  =  Y ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 974    = wceq 1383    e. wcel 1804   class class class wbr 4437   ` cfv 5578   Basecbs 14614   lecple 14686   Posetcpo 15548
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1605  ax-4 1618  ax-5 1691  ax-6 1734  ax-7 1776  ax-10 1823  ax-11 1828  ax-12 1840  ax-13 1985  ax-ext 2421  ax-nul 4566
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 976  df-tru 1386  df-ex 1600  df-nf 1604  df-sb 1727  df-eu 2272  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2593  df-ne 2640  df-ral 2798  df-rex 2799  df-rab 2802  df-v 3097  df-sbc 3314  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-nul 3771  df-if 3927  df-sn 4015  df-pr 4017  df-op 4021  df-uni 4235  df-br 4438  df-iota 5541  df-fv 5586  df-preset 15536  df-poset 15554
This theorem is referenced by:  pltnle  15575  pltval3  15576  lublecllem  15597  latasymb  15663  latleeqj1  15672  latleeqm1  15688  odupos  15744  poslubmo  15755  posglbmo  15756  posrasymb  27623  archirngz  27711  archiabllem1a  27713  ople0  34787  op1le  34792  atlle0  34905
  Copyright terms: Public domain W3C validator