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

Theorem onsucuni 3085
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 2993 . 2 |- (A (_ On -> Ord U.A)
2 ssid 2080 . . 3 |- U.A (_ U.A
3 ordunisssuc 3083 . . 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 704 1 |- (A (_ On -> A (_ suc U.A)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223   (_ wss 2047  U.cuni 2503  Ord word 2947  Oncon0 2948  suc csuc 2950
This theorem is referenced by:  ordsucuni 3086  tz9.12lem3 4661
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 776  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-tp 2415  df-op 2416  df-uni 2504  df-br 2620  df-opab 2667  df-tr 2681  df-eprel 2832  df-po 2840  df-so 2850  df-fr 2917  df-we 2934  df-ord 2951  df-on 2952  df-suc 2954
Copyright terms: Public domain