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

Theorem onsucuni 3091
Description: A class of ordinal numbers is a subclass of the successor of its union. Similar to Proposition 7.26 of [TakeutiZaring] p. 41.
Assertion
Ref Expression
onsucuni |- (A (_ On -> A (_ suc U.A)

Proof of Theorem onsucuni
StepHypRef Expression
1 ssorduni 2999 . 2 |- (A (_ On -> Ord U.A)
2 ssid 2083 . . 3 |- U.A (_ U.A
3 ordunisssuc 3089 . . 3 |- ((A (_ On /\ Ord U.A) -> (U.A (_ U.A <-> A (_ suc U.A))
42, 3mpbii 193 . 2 |- ((A (_ On /\ Ord U.A) -> A (_ suc U.A)
51, 4mpdan 706 1 |- (A (_ On -> A (_ suc U.A)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223   (_ wss 2050  U.cuni 2507  Ord word 2953  Oncon0 2954  suc csuc 2956
This theorem is referenced by:  ordsucuni 3092  tz9.12lem3 4671
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785  ax-un 2872
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 778  df-3an 779  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-tp 2419  df-op 2420  df-uni 2508  df-br 2625  df-opab 2672  df-tr 2686  df-eprel 2838  df-po 2846  df-so 2856  df-fr 2923  df-we 2940  df-ord 2957  df-on 2958  df-suc 2960
Copyright terms: Public domain