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

Theorem sdomtr 7645
Description: Strict dominance is transitive. Theorem 21(iii) of [Suppes] p. 97. (Contributed by NM, 9-Jun-1998.)
Assertion
Ref Expression
sdomtr  |-  ( ( A  ~<  B  /\  B  ~<  C )  ->  A  ~<  C )

Proof of Theorem sdomtr
StepHypRef Expression
1 sdomdom 7533 . 2  |-  ( A 
~<  B  ->  A  ~<_  B )
2 domsdomtr 7642 . 2  |-  ( ( A  ~<_  B  /\  B  ~<  C )  ->  A  ~<  C )
31, 2sylan 471 1  |-  ( ( A  ~<  B  /\  B  ~<  C )  ->  A  ~<  C )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369   class class class wbr 4440    ~<_ cdom 7504    ~< csdm 7505
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-8 1764  ax-9 1766  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438  ax-sep 4561  ax-nul 4569  ax-pow 4618  ax-pr 4679  ax-un 6567
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-eu 2272  df-mo 2273  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-ne 2657  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3108  df-dif 3472  df-un 3474  df-in 3476  df-ss 3483  df-nul 3779  df-if 3933  df-pw 4005  df-sn 4021  df-pr 4023  df-op 4027  df-uni 4239  df-br 4441  df-opab 4499  df-id 4788  df-xp 4998  df-rel 4999  df-cnv 5000  df-co 5001  df-dm 5002  df-rn 5003  df-res 5004  df-ima 5005  df-fun 5581  df-fn 5582  df-f 5583  df-f1 5584  df-fo 5585  df-f1o 5586  df-er 7301  df-en 7507  df-dom 7508  df-sdom 7509
This theorem is referenced by:  sdomn2lp  7646  2pwuninel  7662  2pwne  7663  r1sdom  8181  alephordi  8444  pwsdompw  8573  gruina  9185  rexpen  13811
  Copyright terms: Public domain W3C validator