Theorem ordcmp 34563

Description: An ordinal topology is compact iff the underlying set is its supremum (union) only when the ordinal is 1_o. (Contributed by Chen-Pang He, 1-Nov-2015.)

Assertion

Ref	Expression
ordcmp	⊢ (Ord 𝐴 → (𝐴 ∈ Comp ↔ (∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 = 1o)))

Proof of Theorem ordcmp

Step	Hyp	Ref	Expression
1		orduni 7616	. . . 4 ⊢ (Ord 𝐴 → Ord ∪ 𝐴)
2		unizlim 6368	. . . . . 6 ⊢ (Ord ∪ 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 ↔ (∪ 𝐴 = ∅ ∨ Lim ∪ 𝐴)))
3		uni0b 4864	. . . . . . 7 ⊢ (∪ 𝐴 = ∅ ↔ 𝐴 ⊆ {∅})
4	3	orbi1i 910	. . . . . 6 ⊢ ((∪ 𝐴 = ∅ ∨ Lim ∪ 𝐴) ↔ (𝐴 ⊆ {∅} ∨ Lim ∪ 𝐴))
5	2, 4	bitrdi 286	. . . . 5 ⊢ (Ord ∪ 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 ↔ (𝐴 ⊆ {∅} ∨ Lim ∪ 𝐴)))
6	5	biimpd 228	. . . 4 ⊢ (Ord ∪ 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 → (𝐴 ⊆ {∅} ∨ Lim ∪ 𝐴)))
7	1, 6	syl 17	. . 3 ⊢ (Ord 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 → (𝐴 ⊆ {∅} ∨ Lim ∪ 𝐴)))
8		sssn 4756	. . . . . . 7 ⊢ (𝐴 ⊆ {∅} ↔ (𝐴 = ∅ ∨ 𝐴 = {∅}))
9		0ntop 21962	. . . . . . . . . . 11 ⊢ ¬ ∅ ∈ Top
10		cmptop 22454	. . . . . . . . . . 11 ⊢ (∅ ∈ Comp → ∅ ∈ Top)
11	9, 10	mto 196	. . . . . . . . . 10 ⊢ ¬ ∅ ∈ Comp
12		eleq1 2826	. . . . . . . . . 10 ⊢ (𝐴 = ∅ → (𝐴 ∈ Comp ↔ ∅ ∈ Comp))
13	11, 12	mtbiri 326	. . . . . . . . 9 ⊢ (𝐴 = ∅ → ¬ 𝐴 ∈ Comp)
14	13	pm2.21d 121	. . . . . . . 8 ⊢ (𝐴 = ∅ → (𝐴 ∈ Comp → 𝐴 = 1o))
15		id 22	. . . . . . . . . 10 ⊢ (𝐴 = {∅} → 𝐴 = {∅})
16		df1o2 8279	. . . . . . . . . 10 ⊢ 1o = {∅}
17	15, 16	eqtr4di 2797	. . . . . . . . 9 ⊢ (𝐴 = {∅} → 𝐴 = 1o)
18	17	a1d 25	. . . . . . . 8 ⊢ (𝐴 = {∅} → (𝐴 ∈ Comp → 𝐴 = 1o))
19	14, 18	jaoi 853	. . . . . . 7 ⊢ ((𝐴 = ∅ ∨ 𝐴 = {∅}) → (𝐴 ∈ Comp → 𝐴 = 1o))
20	8, 19	sylbi 216	. . . . . 6 ⊢ (𝐴 ⊆ {∅} → (𝐴 ∈ Comp → 𝐴 = 1o))
21	20	a1i 11	. . . . 5 ⊢ (Ord 𝐴 → (𝐴 ⊆ {∅} → (𝐴 ∈ Comp → 𝐴 = 1o)))
22		ordtop 34552	. . . . . . . . . . 11 ⊢ (Ord 𝐴 → (𝐴 ∈ Top ↔ 𝐴 ≠ ∪ 𝐴))
23	22	biimpd 228	. . . . . . . . . 10 ⊢ (Ord 𝐴 → (𝐴 ∈ Top → 𝐴 ≠ ∪ 𝐴))
24	23	necon2bd 2958	. . . . . . . . 9 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 → ¬ 𝐴 ∈ Top))
25		cmptop 22454	. . . . . . . . . 10 ⊢ (𝐴 ∈ Comp → 𝐴 ∈ Top)
26	25	con3i 154	. . . . . . . . 9 ⊢ (¬ 𝐴 ∈ Top → ¬ 𝐴 ∈ Comp)
27	24, 26	syl6 35	. . . . . . . 8 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 → ¬ 𝐴 ∈ Comp))
28	27	a1dd 50	. . . . . . 7 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 → (Lim ∪ 𝐴 → ¬ 𝐴 ∈ Comp)))
29		limsucncmp 34562	. . . . . . . . 9 ⊢ (Lim ∪ 𝐴 → ¬ suc ∪ 𝐴 ∈ Comp)
30		eleq1 2826	. . . . . . . . . 10 ⊢ (𝐴 = suc ∪ 𝐴 → (𝐴 ∈ Comp ↔ suc ∪ 𝐴 ∈ Comp))
31	30	notbid 317	. . . . . . . . 9 ⊢ (𝐴 = suc ∪ 𝐴 → (¬ 𝐴 ∈ Comp ↔ ¬ suc ∪ 𝐴 ∈ Comp))
32	29, 31	syl5ibr 245	. . . . . . . 8 ⊢ (𝐴 = suc ∪ 𝐴 → (Lim ∪ 𝐴 → ¬ 𝐴 ∈ Comp))
33	32	a1i 11	. . . . . . 7 ⊢ (Ord 𝐴 → (𝐴 = suc ∪ 𝐴 → (Lim ∪ 𝐴 → ¬ 𝐴 ∈ Comp)))
34		orduniorsuc 7652	. . . . . . 7 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ∨ 𝐴 = suc ∪ 𝐴))
35	28, 33, 34	mpjaod 856	. . . . . 6 ⊢ (Ord 𝐴 → (Lim ∪ 𝐴 → ¬ 𝐴 ∈ Comp))
36		pm2.21 123	. . . . . 6 ⊢ (¬ 𝐴 ∈ Comp → (𝐴 ∈ Comp → 𝐴 = 1o))
37	35, 36	syl6 35	. . . . 5 ⊢ (Ord 𝐴 → (Lim ∪ 𝐴 → (𝐴 ∈ Comp → 𝐴 = 1o)))
38	21, 37	jaod 855	. . . 4 ⊢ (Ord 𝐴 → ((𝐴 ⊆ {∅} ∨ Lim ∪ 𝐴) → (𝐴 ∈ Comp → 𝐴 = 1o)))
39	38	com23 86	. . 3 ⊢ (Ord 𝐴 → (𝐴 ∈ Comp → ((𝐴 ⊆ {∅} ∨ Lim ∪ 𝐴) → 𝐴 = 1o)))
40	7, 39	syl5d 73	. 2 ⊢ (Ord 𝐴 → (𝐴 ∈ Comp → (∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 = 1o)))
41		ordeleqon 7609	. . . . . . 7 ⊢ (Ord 𝐴 ↔ (𝐴 ∈ On ∨ 𝐴 = On))
42		unon 7653	. . . . . . . . . . 11 ⊢ ∪ On = On
43	42	eqcomi 2747	. . . . . . . . . 10 ⊢ On = ∪ On
44	43	unieqi 4849	. . . . . . . . 9 ⊢ ∪ On = ∪ ∪ On
45		unieq 4847	. . . . . . . . 9 ⊢ (𝐴 = On → ∪ 𝐴 = ∪ On)
46	45	unieqd 4850	. . . . . . . . 9 ⊢ (𝐴 = On → ∪ ∪ 𝐴 = ∪ ∪ On)
47	44, 45, 46	3eqtr4a 2805	. . . . . . . 8 ⊢ (𝐴 = On → ∪ 𝐴 = ∪ ∪ 𝐴)
48	47	orim2i 907	. . . . . . 7 ⊢ ((𝐴 ∈ On ∨ 𝐴 = On) → (𝐴 ∈ On ∨ ∪ 𝐴 = ∪ ∪ 𝐴))
49	41, 48	sylbi 216	. . . . . 6 ⊢ (Ord 𝐴 → (𝐴 ∈ On ∨ ∪ 𝐴 = ∪ ∪ 𝐴))
50	49	orcomd 867	. . . . 5 ⊢ (Ord 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 ∨ 𝐴 ∈ On))
51	50	ord 860	. . . 4 ⊢ (Ord 𝐴 → (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 ∈ On))
52		unieq 4847	. . . . . . 7 ⊢ (𝐴 = ∪ 𝐴 → ∪ 𝐴 = ∪ ∪ 𝐴)
53	52	con3i 154	. . . . . 6 ⊢ (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → ¬ 𝐴 = ∪ 𝐴)
54	34	ord 860	. . . . . 6 ⊢ (Ord 𝐴 → (¬ 𝐴 = ∪ 𝐴 → 𝐴 = suc ∪ 𝐴))
55	53, 54	syl5 34	. . . . 5 ⊢ (Ord 𝐴 → (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 = suc ∪ 𝐴))
56		orduniorsuc 7652	. . . . . . . 8 ⊢ (Ord ∪ 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 ∨ ∪ 𝐴 = suc ∪ ∪ 𝐴))
57	1, 56	syl 17	. . . . . . 7 ⊢ (Ord 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 ∨ ∪ 𝐴 = suc ∪ ∪ 𝐴))
58	57	ord 860	. . . . . 6 ⊢ (Ord 𝐴 → (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → ∪ 𝐴 = suc ∪ ∪ 𝐴))
59		suceq 6316	. . . . . 6 ⊢ (∪ 𝐴 = suc ∪ ∪ 𝐴 → suc ∪ 𝐴 = suc suc ∪ ∪ 𝐴)
60	58, 59	syl6 35	. . . . 5 ⊢ (Ord 𝐴 → (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → suc ∪ 𝐴 = suc suc ∪ ∪ 𝐴))
61		eqtr 2761	. . . . . 6 ⊢ ((𝐴 = suc ∪ 𝐴 ∧ suc ∪ 𝐴 = suc suc ∪ ∪ 𝐴) → 𝐴 = suc suc ∪ ∪ 𝐴)
62	61	ex 412	. . . . 5 ⊢ (𝐴 = suc ∪ 𝐴 → (suc ∪ 𝐴 = suc suc ∪ ∪ 𝐴 → 𝐴 = suc suc ∪ ∪ 𝐴))
63	55, 60, 62	syl6c 70	. . . 4 ⊢ (Ord 𝐴 → (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 = suc suc ∪ ∪ 𝐴))
64		onuni 7615	. . . . 5 ⊢ (𝐴 ∈ On → ∪ 𝐴 ∈ On)
65		onuni 7615	. . . . 5 ⊢ (∪ 𝐴 ∈ On → ∪ ∪ 𝐴 ∈ On)
66		onsucsuccmp 34560	. . . . 5 ⊢ (∪ ∪ 𝐴 ∈ On → suc suc ∪ ∪ 𝐴 ∈ Comp)
67		eleq1a 2834	. . . . 5 ⊢ (suc suc ∪ ∪ 𝐴 ∈ Comp → (𝐴 = suc suc ∪ ∪ 𝐴 → 𝐴 ∈ Comp))
68	64, 65, 66, 67	4syl 19	. . . 4 ⊢ (𝐴 ∈ On → (𝐴 = suc suc ∪ ∪ 𝐴 → 𝐴 ∈ Comp))
69	51, 63, 68	syl6c 70	. . 3 ⊢ (Ord 𝐴 → (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 ∈ Comp))
70		id 22	. . . . . 6 ⊢ (𝐴 = 1o → 𝐴 = 1o)
71	70, 16	eqtrdi 2795	. . . . 5 ⊢ (𝐴 = 1o → 𝐴 = {∅})
72		0cmp 22453	. . . . 5 ⊢ {∅} ∈ Comp
73	71, 72	eqeltrdi 2847	. . . 4 ⊢ (𝐴 = 1o → 𝐴 ∈ Comp)
74	73	a1i 11	. . 3 ⊢ (Ord 𝐴 → (𝐴 = 1o → 𝐴 ∈ Comp))
75	69, 74	jad 187	. 2 ⊢ (Ord 𝐴 → ((∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 = 1o) → 𝐴 ∈ Comp))
76	40, 75	impbid 211	1 ⊢ (Ord 𝐴 → (𝐴 ∈ Comp ↔ (∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 = 1o)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∨ wo 843   = wceq 1539   ∈ wcel 2108   ≠ wne 2942   ⊆ wss 3883  ∅c0 4253  {csn 4558  ∪ cuni 4836  Ord word 6250  Oncon0 6251  Lim wlim 6252  suc csuc 6253  1_oc1o 8260  Topctop 21950  Compccmp 22445

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-om 7688  df-1o 8267  df-en 8692  df-fin 8695  df-topgen 17071  df-top 21951  df-topon 21968  df-bases 22004  df-cmp 22446

This theorem is referenced by: (None)