Theorem ordpwsucss 4671

Description: The collection of ordinals in the power class of an ordinal is a superset of its successor.

We can think of ( ~P A i^i On ) as another possible definition of successor, which would be equivalent to df-suc 4474 given excluded middle. It is an ordinal, and has some successor-like properties. For example, if A e. On then both U. suc A = A (onunisuci 4535) and U. { x e. On | x C_ A } = A (onuniss2 4616).

Constructively ( ~P A i^i On ) and suc A cannot be shown to be equivalent (as proved at ordpwsucexmid 4674). (Contributed by Jim Kingdon, 21-Jul-2019.)

Assertion

Ref	Expression
ordpwsucss	|- ( Ord A -> suc A C_ ( ~P A i^i On ) )

Proof of Theorem ordpwsucss

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ordsuc 4667	. . . . 5 |- ( Ord A <-> Ord suc A )
2		ordelon 4486	. . . . . 6 |- ( ( Ord suc A /\ x e. suc A ) -> x e. On )
3	2	ex 115	. . . . 5 |- ( Ord suc A -> ( x e. suc A -> x e. On ) )
4	1, 3	sylbi 121	. . . 4 |- ( Ord A -> ( x e. suc A -> x e. On ) )
5		ordtr 4481	. . . . 5 |- ( Ord A -> Tr A )
6		trsucss 4526	. . . . 5 |- ( Tr A -> ( x e. suc A -> x C_ A ) )
7	5, 6	syl 14	. . . 4 |- ( Ord A -> ( x e. suc A -> x C_ A ) )
8	4, 7	jcad 307	. . 3 |- ( Ord A -> ( x e. suc A -> ( x e. On /\ x C_ A ) ) )
9		elin 3392	. . . 4 |- ( x e. ( ~P A i^i On ) <-> ( x e. ~P A /\ x e. On ) )
10		velpw 3663	. . . . 5 |- ( x e. ~P A <-> x C_ A )
11	10	anbi2ci 459	. . . 4 |- ( ( x e. ~P A /\ x e. On ) <-> ( x e. On /\ x C_ A ) )
12	9, 11	bitri 184	. . 3 |- ( x e. ( ~P A i^i On ) <-> ( x e. On /\ x C_ A ) )
13	8, 12	imbitrrdi 162	. 2 |- ( Ord A -> ( x e. suc A -> x e. ( ~P A i^i On ) ) )
14	13	ssrdv 3234	1 |- ( Ord A -> suc A C_ ( ~P A i^i On ) )

Syntax hints:   -> wi 4   /\ wa 104   e. wcel 2202   i^i cin 3200   C_ wss 3201   ~Pcpw 3656   Tr wtr 4192   Ord word 4465   Oncon0 4466   suc csuc 4468

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213  ax-setind 4641

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-uni 3899  df-tr 4193  df-iord 4469  df-on 4471  df-suc 4474

This theorem is referenced by: (None)