MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  onssneli Structured version   Visualization version   GIF version

Theorem onssneli 5754
Description: An ordering law for ordinal numbers. (Contributed by NM, 13-Jun-1994.)
Hypothesis
Ref Expression
on.1 𝐴 ∈ On
Assertion
Ref Expression
onssneli (𝐴𝐵 → ¬ 𝐵𝐴)

Proof of Theorem onssneli
StepHypRef Expression
1 ssel 3562 . . 3 (𝐴𝐵 → (𝐵𝐴𝐵𝐵))
2 on.1 . . . . 5 𝐴 ∈ On
32oneli 5752 . . . 4 (𝐵𝐴𝐵 ∈ On)
4 eloni 5650 . . . 4 (𝐵 ∈ On → Ord 𝐵)
5 ordirr 5658 . . . 4 (Ord 𝐵 → ¬ 𝐵𝐵)
63, 4, 53syl 18 . . 3 (𝐵𝐴 → ¬ 𝐵𝐵)
71, 6nsyli 154 . 2 (𝐴𝐵 → (𝐵𝐴 → ¬ 𝐵𝐴))
87pm2.01d 180 1 (𝐴𝐵 → ¬ 𝐵𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wcel 1977  wss 3540  Ord word 5639  Oncon0 5640
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-tr 4681  df-eprel 4949  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-ord 5643  df-on 5644
This theorem is referenced by:  onsucconi  31606
  Copyright terms: Public domain W3C validator