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

Theorem sorpss 6519
Description: Express strict ordering under proper subsets, i.e. the notion of a chain of sets. (Contributed by Stefan O'Rear, 2-Nov-2014.)
Assertion
Ref Expression
sorpss  |-  ( [ C.]  Or  A  <->  A. x  e.  A  A. y  e.  A  ( x  C_  y  \/  y  C_  x )
)
Distinct variable group:    x, y, A

Proof of Theorem sorpss
StepHypRef Expression
1 porpss 6518 . . 3  |- [ C.]  Po  A
21biantrur 493 . 2  |-  ( A. x  e.  A  A. y  e.  A  (
x [ C.]  y  \/  x  =  y  \/  y [ C.]  x )  <->  ( [ C.]  Po  A  /\  A. x  e.  A  A. y  e.  A  ( x [ C.]  y  \/  x  =  y  \/  y [ C.]  x ) ) )
3 sspsstri 3441 . . . 4  |-  ( ( x  C_  y  \/  y  C_  x )  <->  ( x  C.  y  \/  x  =  y  \/  y  C.  x ) )
4 vex 2951 . . . . . 6  |-  y  e. 
_V
54brrpss 6517 . . . . 5  |-  ( x [
C.]  y  <->  x  C.  y )
6 biid 228 . . . . 5  |-  ( x  =  y  <->  x  =  y )
7 vex 2951 . . . . . 6  |-  x  e. 
_V
87brrpss 6517 . . . . 5  |-  ( y [
C.]  x  <->  y  C.  x )
95, 6, 83orbi123i 1143 . . . 4  |-  ( ( x [ C.]  y  \/  x  =  y  \/  y [ C.]  x )  <->  ( x  C.  y  \/  x  =  y  \/  y  C.  x ) )
103, 9bitr4i 244 . . 3  |-  ( ( x  C_  y  \/  y  C_  x )  <->  ( x [ C.]  y  \/  x  =  y  \/  y [ C.]  x ) )
11102ralbii 2723 . 2  |-  ( A. x  e.  A  A. y  e.  A  (
x  C_  y  \/  y  C_  x )  <->  A. x  e.  A  A. y  e.  A  ( x [ C.]  y  \/  x  =  y  \/  y [ C.]  x ) )
12 df-so 4496 . 2  |-  ( [ C.]  Or  A  <->  ( [ C.]  Po  A  /\  A. x  e.  A  A. y  e.  A  ( x [ C.]  y  \/  x  =  y  \/  y [ C.]  x )
) )
132, 11, 123bitr4ri 270 1  |-  ( [ C.]  Or  A  <->  A. x  e.  A  A. y  e.  A  ( x  C_  y  \/  y  C_  x )
)
Colors of variables: wff set class
Syntax hints:    <-> wb 177    \/ wo 358    /\ wa 359    \/ w3o 935   A.wral 2697    C_ wss 3312    C. wpss 3313   class class class wbr 4204    Po wpo 4493    Or wor 4494   [ C.] crpss 6513
This theorem is referenced by:  sorpsscmpl  6525  enfin2i  8193  fin1a2lem13  8284
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-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-br 4205  df-opab 4259  df-po 4495  df-so 4496  df-xp 4876  df-rel 4877  df-rpss 6514
  Copyright terms: Public domain W3C validator