Theorem ordpwsucss 4490

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

We can think of (𝒫 𝐴 ∩ On) as another possible definition of successor, which would be equivalent to df-suc 4301 given excluded middle. It is an ordinal, and has some successor-like properties. For example, if 𝐴 ∈ On then both ∪ suc 𝐴 = 𝐴 (onunisuci 4362) and ∪ {𝑥 ∈ On ∣ 𝑥 ⊆ 𝐴} = 𝐴 (onuniss2 4436).

Constructively (𝒫 𝐴 ∩ On) and suc 𝐴 cannot be shown to be equivalent (as proved at ordpwsucexmid 4493). (Contributed by Jim Kingdon, 21-Jul-2019.)

Assertion

Ref	Expression
ordpwsucss	⊢ (Ord 𝐴 → suc 𝐴 ⊆ (𝒫 𝐴 ∩ On))

Proof of Theorem ordpwsucss

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ordsuc 4486	. . . . 5 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴)
2		ordelon 4313	. . . . . 6 ⊢ ((Ord suc 𝐴 ∧ 𝑥 ∈ suc 𝐴) → 𝑥 ∈ On)
3	2	ex 114	. . . . 5 ⊢ (Ord suc 𝐴 → (𝑥 ∈ suc 𝐴 → 𝑥 ∈ On))
4	1, 3	sylbi 120	. . . 4 ⊢ (Ord 𝐴 → (𝑥 ∈ suc 𝐴 → 𝑥 ∈ On))
5		ordtr 4308	. . . . 5 ⊢ (Ord 𝐴 → Tr 𝐴)
6		trsucss 4353	. . . . 5 ⊢ (Tr 𝐴 → (𝑥 ∈ suc 𝐴 → 𝑥 ⊆ 𝐴))
7	5, 6	syl 14	. . . 4 ⊢ (Ord 𝐴 → (𝑥 ∈ suc 𝐴 → 𝑥 ⊆ 𝐴))
8	4, 7	jcad 305	. . 3 ⊢ (Ord 𝐴 → (𝑥 ∈ suc 𝐴 → (𝑥 ∈ On ∧ 𝑥 ⊆ 𝐴)))
9		elin 3264	. . . 4 ⊢ (𝑥 ∈ (𝒫 𝐴 ∩ On) ↔ (𝑥 ∈ 𝒫 𝐴 ∧ 𝑥 ∈ On))
10		velpw 3522	. . . . 5 ⊢ (𝑥 ∈ 𝒫 𝐴 ↔ 𝑥 ⊆ 𝐴)
11	10	anbi2ci 455	. . . 4 ⊢ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑥 ∈ On) ↔ (𝑥 ∈ On ∧ 𝑥 ⊆ 𝐴))
12	9, 11	bitri 183	. . 3 ⊢ (𝑥 ∈ (𝒫 𝐴 ∩ On) ↔ (𝑥 ∈ On ∧ 𝑥 ⊆ 𝐴))
13	8, 12	syl6ibr 161	. 2 ⊢ (Ord 𝐴 → (𝑥 ∈ suc 𝐴 → 𝑥 ∈ (𝒫 𝐴 ∩ On)))
14	13	ssrdv 3108	1 ⊢ (Ord 𝐴 → suc 𝐴 ⊆ (𝒫 𝐴 ∩ On))

Syntax hints:   → wi 4   ∧ wa 103   ∈ wcel 1481   ∩ cin 3075   ⊆ wss 3076  𝒫 cpw 3515  Tr wtr 4034  Ord word 4292  Oncon0 4293  suc csuc 4295

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-setind 4460

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-uni 3745  df-tr 4035  df-iord 4296  df-on 4298  df-suc 4301

This theorem is referenced by: (None)