HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem onnbtwn 3762
Description: There is no set between an ordinal number and its successor. Proposition 7.25 of [TakeutiZaring] p. 41.
Assertion
Ref Expression
onnbtwn |- (A e. On -> -. (A e. B /\ B e. suc A))

Proof of Theorem onnbtwn
StepHypRef Expression
1 eloni 3667 . 2 |- (A e. On -> Ord A)
2 ordnbtwn 3761 . 2 |- (Ord A -> -. (A e. B /\ B e. suc A))
31, 2syl 12 1 |- (A e. On -> -. (A e. B /\ B e. suc A))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   /\ wa 240   e. wcel 1300  Ord word 3656  Oncon0 3657  suc csuc 3659
This theorem is referenced by:  ordunisuc2 3926  oalimcl 5242  omlimcl 5257  oneo 5260
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-3an 860  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-ral 2109  df-rex 2110  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-uni 3178  df-br 3339  df-opab 3396  df-tr 3412  df-eprel 3583  df-po 3591  df-so 3604  df-fr 3625  df-we 3644  df-ord 3660  df-on 3661  df-suc 3663
Copyright terms: Public domain