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

Theorem ordunisssuc 2334
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 2310 . . . . 5 |- ((x e. On /\ Ord B) -> (x (_ B <-> x e. suc B))
2 ssel2 1503 . . . . 5 |- ((A (_ On /\ x e. A) -> x e. On)
31, 2sylan 343 . . . 4 |- (((A (_ On /\ x e. A) /\ Ord B) -> (x (_ B <-> x e. suc B))
43an1rs 373 . . 3 |- (((A (_ On /\ Ord B) /\ x e. A) -> (x (_ B <-> x e. suc B))
54biraldva 1215 . 2 |- ((A (_ On /\ Ord B) -> (A.x e. A x (_ B <-> A.x e. A x e. suc B))
6 unissb 1941 . 2 |- (U.A (_ B <-> A.x e. A x (_ B)
7 dfss3 1498 . 2 |- (A (_ suc B <-> A.x e. A x e. suc B)
85, 6, 73bitr4g 428 1 |- ((A (_ On /\ Ord B) -> (U.A (_ B <-> A (_ suc B))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127   /\ wa 196   e. wcel 1092  A.wral 1201   (_ wss 1487  U.cuni 1919  Ord word 2198  Oncon0 2199  suc csuc 2201
This theorem is referenced by:  onsucuni 2335  isfinite2 3437
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-suc 2205
metamath.org