Theorem ordcmp 37413

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 7827	. . . 4 ⊢ (Ord 𝐴 → Ord ∪ 𝐴)
2		unizlim 6505	. . . . . 6 ⊢ (Ord ∪ 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 ↔ (∪ 𝐴 = ∅ ∨ Lim ∪ 𝐴)))
3		uni0b 4897	. . . . . . 7 ⊢ (∪ 𝐴 = ∅ ↔ 𝐴 ⊆ {∅})
4	3	orbi1i 927	. . . . . 6 ⊢ ((∪ 𝐴 = ∅ ∨ Lim ∪ 𝐴) ↔ (𝐴 ⊆ {∅} ∨ Lim ∪ 𝐴))
5	2, 4	bitrdi 290	. . . . 5 ⊢ (Ord ∪ 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 ↔ (𝐴 ⊆ {∅} ∨ Lim ∪ 𝐴)))
6	5	biimpd 232	. . . 4 ⊢ (Ord ∪ 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 → (𝐴 ⊆ {∅} ∨ Lim ∪ 𝐴)))
7	1, 6	syl 18	. . 3 ⊢ (Ord 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 → (𝐴 ⊆ {∅} ∨ Lim ∪ 𝐴)))
8		sssn 4785	. . . . . . 7 ⊢ (𝐴 ⊆ {∅} ↔ (𝐴 = ∅ ∨ 𝐴 = {∅}))
9		0ntop 23253	. . . . . . . . . . 11 ⊢ ¬ ∅ ∈ Top
10		cmptop 23743	. . . . . . . . . . 11 ⊢ (∅ ∈ Comp → ∅ ∈ Top)
11	9, 10	mto 200	. . . . . . . . . 10 ⊢ ¬ ∅ ∈ Comp
12		eleq1 2852	. . . . . . . . . 10 ⊢ (𝐴 = ∅ → (𝐴 ∈ Comp ↔ ∅ ∈ Comp))
13	11, 12	mtbiri 330	. . . . . . . . 9 ⊢ (𝐴 = ∅ → ¬ 𝐴 ∈ Comp)
14	13	pm2.21d 122	. . . . . . . 8 ⊢ (𝐴 = ∅ → (𝐴 ∈ Comp → 𝐴 = 1o))
15		id 23	. . . . . . . . . 10 ⊢ (𝐴 = {∅} → 𝐴 = {∅})
16		df1o2 8511	. . . . . . . . . 10 ⊢ 1o = {∅}
17	15, 16	eqtr4di 2816	. . . . . . . . 9 ⊢ (𝐴 = {∅} → 𝐴 = 1o)
18	17	a1d 26	. . . . . . . 8 ⊢ (𝐴 = {∅} → (𝐴 ∈ Comp → 𝐴 = 1o))
19	14, 18	jaoi 871	. . . . . . 7 ⊢ ((𝐴 = ∅ ∨ 𝐴 = {∅}) → (𝐴 ∈ Comp → 𝐴 = 1o))
20	8, 19	sylbi 220	. . . . . 6 ⊢ (𝐴 ⊆ {∅} → (𝐴 ∈ Comp → 𝐴 = 1o))
21	20	a1i 11	. . . . 5 ⊢ (Ord 𝐴 → (𝐴 ⊆ {∅} → (𝐴 ∈ Comp → 𝐴 = 1o)))
22		ordtop 37402	. . . . . . . . . . 11 ⊢ (Ord 𝐴 → (𝐴 ∈ Top ↔ 𝐴 ≠ ∪ 𝐴))
23	22	biimpd 232	. . . . . . . . . 10 ⊢ (Ord 𝐴 → (𝐴 ∈ Top → 𝐴 ≠ ∪ 𝐴))
24	23	necon2bd 2975	. . . . . . . . 9 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 → ¬ 𝐴 ∈ Top))
25		cmptop 23743	. . . . . . . . . 10 ⊢ (𝐴 ∈ Comp → 𝐴 ∈ Top)
26	25	con3i 155	. . . . . . . . 9 ⊢ (¬ 𝐴 ∈ Top → ¬ 𝐴 ∈ Comp)
27	24, 26	syl6 36	. . . . . . . 8 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 → ¬ 𝐴 ∈ Comp))
28	27	a1dd 51	. . . . . . 7 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 → (Lim ∪ 𝐴 → ¬ 𝐴 ∈ Comp)))
29		limsucncmp 37412	. . . . . . . . 9 ⊢ (Lim ∪ 𝐴 → ¬ suc ∪ 𝐴 ∈ Comp)
30		eleq1 2852	. . . . . . . . . 10 ⊢ (𝐴 = suc ∪ 𝐴 → (𝐴 ∈ Comp ↔ suc ∪ 𝐴 ∈ Comp))
31	30	notbid 321	. . . . . . . . 9 ⊢ (𝐴 = suc ∪ 𝐴 → (¬ 𝐴 ∈ Comp ↔ ¬ suc ∪ 𝐴 ∈ Comp))
32	29, 31	imbitrrid 249	. . . . . . . 8 ⊢ (𝐴 = suc ∪ 𝐴 → (Lim ∪ 𝐴 → ¬ 𝐴 ∈ Comp))
33	32	a1i 11	. . . . . . 7 ⊢ (Ord 𝐴 → (𝐴 = suc ∪ 𝐴 → (Lim ∪ 𝐴 → ¬ 𝐴 ∈ Comp)))
34		orduniorsuc 7865	. . . . . . 7 ⊢ (Ord 𝐴 → (𝐴 = ∪ 𝐴 ∨ 𝐴 = suc ∪ 𝐴))
35	28, 33, 34	mpjaod 874	. . . . . 6 ⊢ (Ord 𝐴 → (Lim ∪ 𝐴 → ¬ 𝐴 ∈ Comp))
36		pm2.21 124	. . . . . 6 ⊢ (¬ 𝐴 ∈ Comp → (𝐴 ∈ Comp → 𝐴 = 1o))
37	35, 36	syl6 36	. . . . 5 ⊢ (Ord 𝐴 → (Lim ∪ 𝐴 → (𝐴 ∈ Comp → 𝐴 = 1o)))
38	21, 37	jaod 873	. . . 4 ⊢ (Ord 𝐴 → ((𝐴 ⊆ {∅} ∨ Lim ∪ 𝐴) → (𝐴 ∈ Comp → 𝐴 = 1o)))
39	38	com23 87	. . 3 ⊢ (Ord 𝐴 → (𝐴 ∈ Comp → ((𝐴 ⊆ {∅} ∨ Lim ∪ 𝐴) → 𝐴 = 1o)))
40	7, 39	syl5d 74	. 2 ⊢ (Ord 𝐴 → (𝐴 ∈ Comp → (∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 = 1o)))
41		ordeleqon 7820	. . . . . . 7 ⊢ (Ord 𝐴 ↔ (𝐴 ∈ On ∨ 𝐴 = On))
42		unon 7866	. . . . . . . . . . 11 ⊢ ∪ On = On
43	42	eqcomi 2772	. . . . . . . . . 10 ⊢ On = ∪ On
44	43	unieqi 4882	. . . . . . . . 9 ⊢ ∪ On = ∪ ∪ On
45		unieq 4881	. . . . . . . . 9 ⊢ (𝐴 = On → ∪ 𝐴 = ∪ On)
46	45	unieqd 4883	. . . . . . . . 9 ⊢ (𝐴 = On → ∪ ∪ 𝐴 = ∪ ∪ On)
47	44, 45, 46	3eqtr4a 2824	. . . . . . . 8 ⊢ (𝐴 = On → ∪ 𝐴 = ∪ ∪ 𝐴)
48	47	orim2i 924	. . . . . . 7 ⊢ ((𝐴 ∈ On ∨ 𝐴 = On) → (𝐴 ∈ On ∨ ∪ 𝐴 = ∪ ∪ 𝐴))
49	41, 48	sylbi 220	. . . . . 6 ⊢ (Ord 𝐴 → (𝐴 ∈ On ∨ ∪ 𝐴 = ∪ ∪ 𝐴))
50	49	orcomd 885	. . . . 5 ⊢ (Ord 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 ∨ 𝐴 ∈ On))
51	50	ord 878	. . . 4 ⊢ (Ord 𝐴 → (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 ∈ On))
52		unieq 4881	. . . . . . 7 ⊢ (𝐴 = ∪ 𝐴 → ∪ 𝐴 = ∪ ∪ 𝐴)
53	52	con3i 155	. . . . . 6 ⊢ (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → ¬ 𝐴 = ∪ 𝐴)
54	34	ord 878	. . . . . 6 ⊢ (Ord 𝐴 → (¬ 𝐴 = ∪ 𝐴 → 𝐴 = suc ∪ 𝐴))
55	53, 54	syl5 35	. . . . 5 ⊢ (Ord 𝐴 → (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 = suc ∪ 𝐴))
56		orduniorsuc 7865	. . . . . . . 8 ⊢ (Ord ∪ 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 ∨ ∪ 𝐴 = suc ∪ ∪ 𝐴))
57	1, 56	syl 18	. . . . . . 7 ⊢ (Ord 𝐴 → (∪ 𝐴 = ∪ ∪ 𝐴 ∨ ∪ 𝐴 = suc ∪ ∪ 𝐴))
58	57	ord 878	. . . . . 6 ⊢ (Ord 𝐴 → (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → ∪ 𝐴 = suc ∪ ∪ 𝐴))
59		suceq 6449	. . . . . 6 ⊢ (∪ 𝐴 = suc ∪ ∪ 𝐴 → suc ∪ 𝐴 = suc suc ∪ ∪ 𝐴)
60	58, 59	syl6 36	. . . . 5 ⊢ (Ord 𝐴 → (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → suc ∪ 𝐴 = suc suc ∪ ∪ 𝐴))
61		eqtr 2783	. . . . . 6 ⊢ ((𝐴 = suc ∪ 𝐴 ∧ suc ∪ 𝐴 = suc suc ∪ ∪ 𝐴) → 𝐴 = suc suc ∪ ∪ 𝐴)
62	61	ex 418	. . . . 5 ⊢ (𝐴 = suc ∪ 𝐴 → (suc ∪ 𝐴 = suc suc ∪ ∪ 𝐴 → 𝐴 = suc suc ∪ ∪ 𝐴))
63	55, 60, 62	syl6c 71	. . . 4 ⊢ (Ord 𝐴 → (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 = suc suc ∪ ∪ 𝐴))
64		onuni 7826	. . . . 5 ⊢ (𝐴 ∈ On → ∪ 𝐴 ∈ On)
65		onuni 7826	. . . . 5 ⊢ (∪ 𝐴 ∈ On → ∪ ∪ 𝐴 ∈ On)
66		onsucsuccmp 37410	. . . . 5 ⊢ (∪ ∪ 𝐴 ∈ On → suc suc ∪ ∪ 𝐴 ∈ Comp)
67		eleq1a 2859	. . . . 5 ⊢ (suc suc ∪ ∪ 𝐴 ∈ Comp → (𝐴 = suc suc ∪ ∪ 𝐴 → 𝐴 ∈ Comp))
68	64, 65, 66, 67	4syl 20	. . . 4 ⊢ (𝐴 ∈ On → (𝐴 = suc suc ∪ ∪ 𝐴 → 𝐴 ∈ Comp))
69	51, 63, 68	syl6c 71	. . 3 ⊢ (Ord 𝐴 → (¬ ∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 ∈ Comp))
70		id 23	. . . . . 6 ⊢ (𝐴 = 1o → 𝐴 = 1o)
71	70, 16	eqtrdi 2814	. . . . 5 ⊢ (𝐴 = 1o → 𝐴 = {∅})
72		0cmp 23742	. . . . 5 ⊢ {∅} ∈ Comp
73	71, 72	eqeltrdi 2872	. . . 4 ⊢ (𝐴 = 1o → 𝐴 ∈ Comp)
74	73	a1i 11	. . 3 ⊢ (Ord 𝐴 → (𝐴 = 1o → 𝐴 ∈ Comp))
75	69, 74	jad 189	. 2 ⊢ (Ord 𝐴 → ((∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 = 1o) → 𝐴 ∈ Comp))
76	40, 75	impbid 215	1 ⊢ (Ord 𝐴 → (𝐴 ∈ Comp ↔ (∪ 𝐴 = ∪ ∪ 𝐴 → 𝐴 = 1o)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∨ wo 861   = wceq 1570   ∈ wcel 2147   ≠ wne 2959   ⊆ wss 3900  ∅c0 4281  {csn 4588  ∪ cuni 4870  Ord word 6379  Oncon0 6380  Lim wlim 6381  suc csuc 6382  1_oc1o 8497  Topctop 23241  Compccmp 23734

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-om 7902  df-1o 8504  df-en 9002  df-fin 9005  df-topgen 17643  df-top 23242  df-topon 23259  df-bases 23294  df-cmp 23735

This theorem is used by: (None)