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

Theorem ordelpss 4601
Description: Corollary 7.8 of [TakeutiZaring] p. 37. (Contributed by NM, 17-Jun-1998.)
Assertion
Ref Expression
ordelpss  |-  ( ( Ord  A  /\  Ord  B )  ->  ( A  e.  B  <->  A  C.  B ) )

Proof of Theorem ordelpss
StepHypRef Expression
1 ordelssne 4600 . 2  |-  ( ( Ord  A  /\  Ord  B )  ->  ( A  e.  B  <->  ( A  C_  B  /\  A  =/=  B
) ) )
2 df-pss 3328 . 2  |-  ( A 
C.  B  <->  ( A  C_  B  /\  A  =/= 
B ) )
31, 2syl6bbr 255 1  |-  ( ( Ord  A  /\  Ord  B )  ->  ( A  e.  B  <->  A  C.  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 177    /\ wa 359    e. wcel 1725    =/= wne 2598    C_ wss 3312    C. wpss 3313   Ord word 4572
This theorem is referenced by:  ordsseleq  4602  ordtri3or  4605  ordtr2  4617  onpsssuc  4791  php4  7286  nndomo  7292  omsucdomOLD  7294  ordpss  27611
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-sep 4322  ax-nul 4330  ax-pr 4395
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-rab 2706  df-v 2950  df-sbc 3154  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-pss 3328  df-nul 3621  df-if 3732  df-sn 3812  df-pr 3813  df-op 3815  df-uni 4008  df-br 4205  df-opab 4259  df-tr 4295  df-eprel 4486  df-po 4495  df-so 4496  df-fr 4533  df-we 4535  df-ord 4576
  Copyright terms: Public domain W3C validator