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

Theorem ordunisssuc 3079
Description: A subclass relationship for union and successor of ordinal classes.
Assertion
Ref Expression
ordunisssuc |- ((A (_ On /\ Ord B) -> (U.A (_ B <-> A (_ suc B))

Proof of Theorem ordunisssuc
StepHypRef Expression
1 ordsssuc 3053 . . . . 5 |- ((x e. On /\ Ord B) -> (x (_ B <-> x e. suc B))
2 ssel2 2061 . . . . 5 |- ((A (_ On /\ x e. A) -> x e. On)
31, 2sylan 448 . . . 4 |- (((A (_ On /\ x e. A) /\ Ord B) -> (x (_ B <-> x e. suc B))
43an1rs 489 . . 3 |- (((A (_ On /\ Ord B) /\ x e. A) -> (x (_ B <-> x e. suc B))
54ralbidva 1657 . 2 |- ((A (_ On /\ Ord B) -> (A.x e. A x (_ B <-> A.x e. A x e. suc B))
6 unissb 2524 . 2 |- (U.A (_ B <-> A.x e. A x (_ B)
7 dfss3 2056 . 2 |- (A (_ suc B <-> A.x e. A x e. suc B)
85, 6, 73bitr4g 554 1 |- ((A (_ On /\ Ord B) -> (U.A (_ B <-> A (_ suc B))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   e. wcel 957  A.wral 1643   (_ wss 2044  U.cuni 2499  Ord word 2943  Oncon0 2944  suc csuc 2946
This theorem is referenced by:  onsucuni 3081  isfinite2 4532  rankbnd2 4687
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1209  ax-11o 1217  ax-ext 1458  ax-sep 2699  ax-pow 2738  ax-pr 2775
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 775  df-3an 776  df-ex 980  df-sb 1171  df-eu 1381  df-mo 1382  df-clab 1463  df-cleq 1468  df-clel 1471  df-ne 1585  df-ral 1647  df-rex 1648  df-v 1809  df-dif 2046  df-un 2047  df-in 2048  df-ss 2050  df-nul 2278  df-pw 2399  df-sn 2409  df-pr 2410  df-op 2413  df-uni 2500  df-br 2616  df-opab 2663  df-tr 2677  df-eprel 2828  df-po 2836  df-so 2846  df-fr 2913  df-we 2930  df-ord 2947  df-on 2948  df-suc 2950
Copyright terms: Public domain