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

Theorem sosn 4947
 Description: Strict ordering on a singleton. (Contributed by Mario Carneiro, 28-Dec-2014.)
Assertion
Ref Expression
sosn

Proof of Theorem sosn
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elsni 3838 . . . . . 6
2 elsni 3838 . . . . . . 7
32eqcomd 2441 . . . . . 6
41, 3sylan9eq 2488 . . . . 5
5 3mix2 1127 . . . . 5
64, 5syl 16 . . . 4
76rgen2a 2772 . . 3
8 df-so 4504 . . 3
97, 8mpbiran2 886 . 2
10 posn 4946 . 2
119, 10syl5bb 249 1
 Colors of variables: wff set class Syntax hints:   wn 3   wi 4   wb 177   wa 359   w3o 935   wcel 1725  wral 2705  csn 3814   class class class wbr 4212   wpo 4501   wor 4502   wrel 4883 This theorem is referenced by:  wesn  4949 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 2417  ax-sep 4330  ax-nul 4338  ax-pr 4403 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-clab 2423  df-cleq 2429  df-clel 2432  df-nfc 2561  df-ne 2601  df-ral 2710  df-rex 2711  df-rab 2714  df-v 2958  df-sbc 3162  df-dif 3323  df-un 3325  df-in 3327  df-ss 3334  df-nul 3629  df-if 3740  df-sn 3820  df-pr 3821  df-op 3823  df-br 4213  df-opab 4267  df-po 4503  df-so 4504  df-xp 4884  df-rel 4885
 Copyright terms: Public domain W3C validator