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

Theorem poeq2 4441
Description: Equality theorem for partial ordering predicate. (Contributed by NM, 27-Mar-1997.)
Assertion
Ref Expression
poeq2  |-  ( A  =  B  ->  ( R  Po  A  <->  R  Po  B ) )

Proof of Theorem poeq2
StepHypRef Expression
1 eqimss2 3337 . . 3  |-  ( A  =  B  ->  B  C_  A )
2 poss 4439 . . 3  |-  ( B 
C_  A  ->  ( R  Po  A  ->  R  Po  B ) )
31, 2syl 16 . 2  |-  ( A  =  B  ->  ( R  Po  A  ->  R  Po  B ) )
4 eqimss 3336 . . 3  |-  ( A  =  B  ->  A  C_  B )
5 poss 4439 . . 3  |-  ( A 
C_  B  ->  ( R  Po  B  ->  R  Po  A ) )
64, 5syl 16 . 2  |-  ( A  =  B  ->  ( R  Po  B  ->  R  Po  A ) )
73, 6impbid 184 1  |-  ( A  =  B  ->  ( R  Po  A  <->  R  Po  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    = wceq 1649    C_ wss 3256    Po wpo 4435
This theorem is referenced by:  posn  4879  frfi  7281  dfpo2  25129  ipo0  27313
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 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2361
This theorem depends on definitions:  df-bi 178  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2367  df-cleq 2373  df-clel 2376  df-ral 2647  df-in 3263  df-ss 3270  df-po 4437
  Copyright terms: Public domain W3C validator