Theorem onsucsuccmpi 37070

Description: The successor of a successor ordinal number is a compact topology, proven without the Axiom of Regularity. (Contributed by Chen-Pang He, 18-Oct-2015.)

Hypothesis

Ref	Expression
onsucsuccmpi.1	⊢ 𝐴 ∈ On

Assertion

Ref	Expression
onsucsuccmpi	⊢ suc suc 𝐴 ∈ Comp

Proof of Theorem onsucsuccmpi

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		onsucsuccmpi.1	. . . 4 ⊢ 𝐴 ∈ On
2	1	onsuci 7839	. . 3 ⊢ suc 𝐴 ∈ On
3		onsuctop 37060	. . 3 ⊢ (suc 𝐴 ∈ On → suc suc 𝐴 ∈ Top)
4	2, 3	ax-mp 5	. 2 ⊢ suc suc 𝐴 ∈ Top
5	1	onirri 6476	. . . . . . 7 ⊢ ¬ 𝐴 ∈ 𝐴
6	1, 1	onsucssi 7841	. . . . . . 7 ⊢ (𝐴 ∈ 𝐴 ↔ suc 𝐴 ⊆ 𝐴)
7	5, 6	mtbi 325	. . . . . 6 ⊢ ¬ suc 𝐴 ⊆ 𝐴
8		sseq1 3959	. . . . . 6 ⊢ (suc 𝐴 = ∪ 𝑦 → (suc 𝐴 ⊆ 𝐴 ↔ ∪ 𝑦 ⊆ 𝐴))
9	7, 8	mtbii 329	. . . . 5 ⊢ (suc 𝐴 = ∪ 𝑦 → ¬ ∪ 𝑦 ⊆ 𝐴)
10		elpwi 4567	. . . . . . 7 ⊢ (𝑦 ∈ 𝒫 suc 𝐴 → 𝑦 ⊆ suc 𝐴)
11	10	unissd 4880	. . . . . 6 ⊢ (𝑦 ∈ 𝒫 suc 𝐴 → ∪ 𝑦 ⊆ ∪ suc 𝐴)
12	1	onunisuci 6483	. . . . . 6 ⊢ ∪ suc 𝐴 = 𝐴
13	11, 12	sseqtrdi 3974	. . . . 5 ⊢ (𝑦 ∈ 𝒫 suc 𝐴 → ∪ 𝑦 ⊆ 𝐴)
14	9, 13	nsyl 141	. . . 4 ⊢ (suc 𝐴 = ∪ 𝑦 → ¬ 𝑦 ∈ 𝒫 suc 𝐴)
15		eldif 3912	. . . . . . 7 ⊢ (𝑦 ∈ (𝒫 (suc 𝐴 ∪ {suc 𝐴}) ∖ 𝒫 suc 𝐴) ↔ (𝑦 ∈ 𝒫 (suc 𝐴 ∪ {suc 𝐴}) ∧ ¬ 𝑦 ∈ 𝒫 suc 𝐴))
16		elpwunsn 4648	. . . . . . 7 ⊢ (𝑦 ∈ (𝒫 (suc 𝐴 ∪ {suc 𝐴}) ∖ 𝒫 suc 𝐴) → suc 𝐴 ∈ 𝑦)
17	15, 16	sylbir 238	. . . . . 6 ⊢ ((𝑦 ∈ 𝒫 (suc 𝐴 ∪ {suc 𝐴}) ∧ ¬ 𝑦 ∈ 𝒫 suc 𝐴) → suc 𝐴 ∈ 𝑦)
18	17	ex 418	. . . . 5 ⊢ (𝑦 ∈ 𝒫 (suc 𝐴 ∪ {suc 𝐴}) → (¬ 𝑦 ∈ 𝒫 suc 𝐴 → suc 𝐴 ∈ 𝑦))
19		df-suc 6367	. . . . . 6 ⊢ suc suc 𝐴 = (suc 𝐴 ∪ {suc 𝐴})
20	19	pweqi 4576	. . . . 5 ⊢ 𝒫 suc suc 𝐴 = 𝒫 (suc 𝐴 ∪ {suc 𝐴})
21	18, 20	eleq2s 2880	. . . 4 ⊢ (𝑦 ∈ 𝒫 suc suc 𝐴 → (¬ 𝑦 ∈ 𝒫 suc 𝐴 → suc 𝐴 ∈ 𝑦))
22		snelpwi 5423	. . . . 5 ⊢ (suc 𝐴 ∈ 𝑦 → {suc 𝐴} ∈ 𝒫 𝑦)
23		snfi 9054	. . . . . . . 8 ⊢ {suc 𝐴} ∈ Fin
24	23	jctr 534	. . . . . . 7 ⊢ ({suc 𝐴} ∈ 𝒫 𝑦 → ({suc 𝐴} ∈ 𝒫 𝑦 ∧ {suc 𝐴} ∈ Fin))
25		elin 3918	. . . . . . 7 ⊢ ({suc 𝐴} ∈ (𝒫 𝑦 ∩ Fin) ↔ ({suc 𝐴} ∈ 𝒫 𝑦 ∧ {suc 𝐴} ∈ Fin))
26	24, 25	sylibr 237	. . . . . 6 ⊢ ({suc 𝐴} ∈ 𝒫 𝑦 → {suc 𝐴} ∈ (𝒫 𝑦 ∩ Fin))
27	2	elexi 3475	. . . . . . . 8 ⊢ suc 𝐴 ∈ V
28	27	unisn 4889	. . . . . . 7 ⊢ ∪ {suc 𝐴} = suc 𝐴
29	28	eqcomi 2771	. . . . . 6 ⊢ suc 𝐴 = ∪ {suc 𝐴}
30		unieq 4881	. . . . . . 7 ⊢ (𝑧 = {suc 𝐴} → ∪ 𝑧 = ∪ {suc 𝐴})
31	30	rspceeqv 3602	. . . . . 6 ⊢ (({suc 𝐴} ∈ (𝒫 𝑦 ∩ Fin) ∧ suc 𝐴 = ∪ {suc 𝐴}) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = ∪ 𝑧)
32	26, 29, 31	sylancl 598	. . . . 5 ⊢ ({suc 𝐴} ∈ 𝒫 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = ∪ 𝑧)
33	22, 32	syl 18	. . . 4 ⊢ (suc 𝐴 ∈ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = ∪ 𝑧)
34	14, 21, 33	syl56 37	. . 3 ⊢ (𝑦 ∈ 𝒫 suc suc 𝐴 → (suc 𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = ∪ 𝑧))
35	34	rgen 3080	. 2 ⊢ ∀𝑦 ∈ 𝒫 suc suc 𝐴(suc 𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = ∪ 𝑧)
36	2	onunisuci 6483	. . . 4 ⊢ ∪ suc suc 𝐴 = suc 𝐴
37	36	eqcomi 2771	. . 3 ⊢ suc 𝐴 = ∪ suc suc 𝐴
38	37	iscmp 23619	. 2 ⊢ (suc suc 𝐴 ∈ Comp ↔ (suc suc 𝐴 ∈ Top ∧ ∀𝑦 ∈ 𝒫 suc suc 𝐴(suc 𝐴 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)suc 𝐴 = ∪ 𝑧)))
39	4, 35, 38	mpbir2an 724	1 ⊢ suc suc 𝐴 ∈ Comp

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088   ∖ cdif 3899   ∪ cun 3900   ∩ cin 3901   ⊆ wss 3902  𝒫 cpw 4560  {csn 4587  ∪ cuni 4870  Oncon0 6361  suc csuc 6363  Fincfn 8956  Topctop 23124  Compccmp 23617

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-om 7867  df-1o 8459  df-en 8957  df-fin 8960  df-topgen 17534  df-top 23125  df-bases 23177  df-cmp 23618

This theorem is used by:  onsucsuccmp  37071