MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  onpwsuc Structured version   Unicode version

Theorem onpwsuc 4798
Description: The collection of ordinal numbers in the power set of an ordinal number is its successor. (Contributed by NM, 19-Oct-2004.)
Assertion
Ref Expression
onpwsuc  |-  ( A  e.  On  ->  ( ~P A  i^i  On )  =  suc  A )

Proof of Theorem onpwsuc
StepHypRef Expression
1 eloni 4593 . 2  |-  ( A  e.  On  ->  Ord  A )
2 ordpwsuc 4797 . 2  |-  ( Ord 
A  ->  ( ~P A  i^i  On )  =  suc  A )
31, 2syl 16 1  |-  ( A  e.  On  ->  ( ~P A  i^i  On )  =  suc  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1653    e. wcel 1726    i^i cin 3321   ~Pcpw 3801   Ord word 4582   Oncon0 4583   suc csuc 4585
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-sep 4332  ax-nul 4340  ax-pr 4405  ax-un 4703
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 938  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2287  df-mo 2288  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-ral 2712  df-rex 2713  df-rab 2716  df-v 2960  df-sbc 3164  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-pss 3338  df-nul 3631  df-if 3742  df-pw 3803  df-sn 3822  df-pr 3823  df-tp 3824  df-op 3825  df-uni 4018  df-br 4215  df-opab 4269  df-tr 4305  df-eprel 4496  df-po 4505  df-so 4506  df-fr 4543  df-we 4545  df-ord 4586  df-on 4587  df-suc 4589
  Copyright terms: Public domain W3C validator