Theorem onsuct0 36837

Description: A successor ordinal number is a T₀ space. (Contributed by Chen-Pang He, 8-Nov-2015.)

Assertion

Ref	Expression
onsuct0	⊢ (𝐴 ∈ On → suc 𝐴 ∈ Kol2)

Proof of Theorem onsuct0

Dummy variables 𝑜 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eloni 6368	. . 3 ⊢ (𝐴 ∈ On → Ord 𝐴)
2		df-ral 3086	. . . . . 6 ⊢ (∀𝑜 ∈ suc 𝐴(𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ ∀𝑜(𝑜 ∈ suc 𝐴 → (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)))
3		ordelon 6382	. . . . . . . . . . 11 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ On)
4		ordelon 6382	. . . . . . . . . . 11 ⊢ ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On)
5	3, 4	anim12dan 630	. . . . . . . . . 10 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ∈ On ∧ 𝑦 ∈ On))
6		ordsuc 7806	. . . . . . . . . . . 12 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴)
7		ordelon 6382	. . . . . . . . . . . . 13 ⊢ ((Ord suc 𝐴 ∧ 𝑜 ∈ suc 𝐴) → 𝑜 ∈ On)
8	7	ex 417	. . . . . . . . . . . 12 ⊢ (Ord suc 𝐴 → (𝑜 ∈ suc 𝐴 → 𝑜 ∈ On))
9	6, 8	sylbi 220	. . . . . . . . . . 11 ⊢ (Ord 𝐴 → (𝑜 ∈ suc 𝐴 → 𝑜 ∈ On))
10	9	adantr 485	. . . . . . . . . 10 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑜 ∈ suc 𝐴 → 𝑜 ∈ On))
11		notbi 322	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ (¬ 𝑥 ∈ 𝑜 ↔ ¬ 𝑦 ∈ 𝑜))
12		ontri1 6393	. . . . . . . . . . . . . . . 16 ⊢ ((𝑜 ∈ On ∧ 𝑥 ∈ On) → (𝑜 ⊆ 𝑥 ↔ ¬ 𝑥 ∈ 𝑜))
13		onsssuc 6451	. . . . . . . . . . . . . . . 16 ⊢ ((𝑜 ∈ On ∧ 𝑥 ∈ On) → (𝑜 ⊆ 𝑥 ↔ 𝑜 ∈ suc 𝑥))
14	12, 13	bitr3d 284	. . . . . . . . . . . . . . 15 ⊢ ((𝑜 ∈ On ∧ 𝑥 ∈ On) → (¬ 𝑥 ∈ 𝑜 ↔ 𝑜 ∈ suc 𝑥))
15	14	adantrr 729	. . . . . . . . . . . . . 14 ⊢ ((𝑜 ∈ On ∧ (𝑥 ∈ On ∧ 𝑦 ∈ On)) → (¬ 𝑥 ∈ 𝑜 ↔ 𝑜 ∈ suc 𝑥))
16		ontri1 6393	. . . . . . . . . . . . . . . 16 ⊢ ((𝑜 ∈ On ∧ 𝑦 ∈ On) → (𝑜 ⊆ 𝑦 ↔ ¬ 𝑦 ∈ 𝑜))
17		onsssuc 6451	. . . . . . . . . . . . . . . 16 ⊢ ((𝑜 ∈ On ∧ 𝑦 ∈ On) → (𝑜 ⊆ 𝑦 ↔ 𝑜 ∈ suc 𝑦))
18	16, 17	bitr3d 284	. . . . . . . . . . . . . . 15 ⊢ ((𝑜 ∈ On ∧ 𝑦 ∈ On) → (¬ 𝑦 ∈ 𝑜 ↔ 𝑜 ∈ suc 𝑦))
19	18	adantrl 728	. . . . . . . . . . . . . 14 ⊢ ((𝑜 ∈ On ∧ (𝑥 ∈ On ∧ 𝑦 ∈ On)) → (¬ 𝑦 ∈ 𝑜 ↔ 𝑜 ∈ suc 𝑦))
20	15, 19	bibi12d 348	. . . . . . . . . . . . 13 ⊢ ((𝑜 ∈ On ∧ (𝑥 ∈ On ∧ 𝑦 ∈ On)) → ((¬ 𝑥 ∈ 𝑜 ↔ ¬ 𝑦 ∈ 𝑜) ↔ (𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦)))
21	20	ancoms 463	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ 𝑜 ∈ On) → ((¬ 𝑥 ∈ 𝑜 ↔ ¬ 𝑦 ∈ 𝑜) ↔ (𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦)))
22	11, 21	bitrid 286	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ 𝑜 ∈ On) → ((𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) ↔ (𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦)))
23	22	biimpd 232	. . . . . . . . . 10 ⊢ (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ 𝑜 ∈ On) → ((𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → (𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦)))
24	5, 10, 23	syl6an 696	. . . . . . . . 9 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑜 ∈ suc 𝐴 → ((𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → (𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦))))
25	24	a2d 30	. . . . . . . 8 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑜 ∈ suc 𝐴 → (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)) → (𝑜 ∈ suc 𝐴 → (𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦))))
26		ordelss 6374	. . . . . . . . . . . . . 14 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → 𝑥 ⊆ 𝐴)
27		ordelord 6380	. . . . . . . . . . . . . . 15 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → Ord 𝑥)
28		ordsucsssuc 7815	. . . . . . . . . . . . . . . 16 ⊢ ((Ord 𝑥 ∧ Ord 𝐴) → (𝑥 ⊆ 𝐴 ↔ suc 𝑥 ⊆ suc 𝐴))
29	28	ancoms 463	. . . . . . . . . . . . . . 15 ⊢ ((Ord 𝐴 ∧ Ord 𝑥) → (𝑥 ⊆ 𝐴 ↔ suc 𝑥 ⊆ suc 𝐴))
30	27, 29	syldan 602	. . . . . . . . . . . . . 14 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑥 ⊆ 𝐴 ↔ suc 𝑥 ⊆ suc 𝐴))
31	26, 30	mpbid 235	. . . . . . . . . . . . 13 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → suc 𝑥 ⊆ suc 𝐴)
32	31	ssneld 3947	. . . . . . . . . . . 12 ⊢ ((Ord 𝐴 ∧ 𝑥 ∈ 𝐴) → (¬ 𝑜 ∈ suc 𝐴 → ¬ 𝑜 ∈ suc 𝑥))
33	32	adantrr 729	. . . . . . . . . . 11 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (¬ 𝑜 ∈ suc 𝐴 → ¬ 𝑜 ∈ suc 𝑥))
34		ordelss 6374	. . . . . . . . . . . . . 14 ⊢ ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑦 ⊆ 𝐴)
35		ordelord 6380	. . . . . . . . . . . . . . 15 ⊢ ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → Ord 𝑦)
36		ordsucsssuc 7815	. . . . . . . . . . . . . . . 16 ⊢ ((Ord 𝑦 ∧ Ord 𝐴) → (𝑦 ⊆ 𝐴 ↔ suc 𝑦 ⊆ suc 𝐴))
37	36	ancoms 463	. . . . . . . . . . . . . . 15 ⊢ ((Ord 𝐴 ∧ Ord 𝑦) → (𝑦 ⊆ 𝐴 ↔ suc 𝑦 ⊆ suc 𝐴))
38	35, 37	syldan 602	. . . . . . . . . . . . . 14 ⊢ ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑦 ⊆ 𝐴 ↔ suc 𝑦 ⊆ suc 𝐴))
39	34, 38	mpbid 235	. . . . . . . . . . . . 13 ⊢ ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → suc 𝑦 ⊆ suc 𝐴)
40	39	ssneld 3947	. . . . . . . . . . . 12 ⊢ ((Ord 𝐴 ∧ 𝑦 ∈ 𝐴) → (¬ 𝑜 ∈ suc 𝐴 → ¬ 𝑜 ∈ suc 𝑦))
41	40	adantrl 728	. . . . . . . . . . 11 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (¬ 𝑜 ∈ suc 𝐴 → ¬ 𝑜 ∈ suc 𝑦))
42	33, 41	jcad 521	. . . . . . . . . 10 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (¬ 𝑜 ∈ suc 𝐴 → (¬ 𝑜 ∈ suc 𝑥 ∧ ¬ 𝑜 ∈ suc 𝑦)))
43		pm5.21 836	. . . . . . . . . 10 ⊢ ((¬ 𝑜 ∈ suc 𝑥 ∧ ¬ 𝑜 ∈ suc 𝑦) → (𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦))
44	42, 43	syl6 36	. . . . . . . . 9 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (¬ 𝑜 ∈ suc 𝐴 → (𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦)))
45		idd 25	. . . . . . . . 9 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦) → (𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦)))
46	44, 45	jad 189	. . . . . . . 8 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑜 ∈ suc 𝐴 → (𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦)) → (𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦)))
47	25, 46	syld 48	. . . . . . 7 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑜 ∈ suc 𝐴 → (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)) → (𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦)))
48	47	alimdv 1943	. . . . . 6 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (∀𝑜(𝑜 ∈ suc 𝐴 → (𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜)) → ∀𝑜(𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦)))
49	2, 48	biimtrid 245	. . . . 5 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (∀𝑜 ∈ suc 𝐴(𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → ∀𝑜(𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦)))
50		dfcleq 2762	. . . . . . 7 ⊢ (suc 𝑥 = suc 𝑦 ↔ ∀𝑜(𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦))
51		suc11 6468	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (suc 𝑥 = suc 𝑦 ↔ 𝑥 = 𝑦))
52	50, 51	bitr3id 288	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (∀𝑜(𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦) ↔ 𝑥 = 𝑦))
53	5, 52	syl 18	. . . . 5 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (∀𝑜(𝑜 ∈ suc 𝑥 ↔ 𝑜 ∈ suc 𝑦) ↔ 𝑥 = 𝑦))
54	49, 53	sylibd 242	. . . 4 ⊢ ((Ord 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (∀𝑜 ∈ suc 𝐴(𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦))
55	54	ralrimivva 3214	. . 3 ⊢ (Ord 𝐴 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (∀𝑜 ∈ suc 𝐴(𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦))
56	1, 55	syl 18	. 2 ⊢ (𝐴 ∈ On → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (∀𝑜 ∈ suc 𝐴(𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦))
57		onsuctopon 36830	. . 3 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ (TopOn‘𝐴))
58		ist0-2 23466	. . 3 ⊢ (suc 𝐴 ∈ (TopOn‘𝐴) → (suc 𝐴 ∈ Kol2 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (∀𝑜 ∈ suc 𝐴(𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦)))
59	57, 58	syl 18	. 2 ⊢ (𝐴 ∈ On → (suc 𝐴 ∈ Kol2 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (∀𝑜 ∈ suc 𝐴(𝑥 ∈ 𝑜 ↔ 𝑦 ∈ 𝑜) → 𝑥 = 𝑦)))
60	56, 59	mpbird 260	1 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ Kol2)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400  ∀wal 1565   = wceq 1567   ∈ wcel 2149  ∀wral 3085   ⊆ wss 3913  Ord word 6357  Oncon0 6358  suc csuc 6360  ‘cfv 6534  TopOnctopon 23032  Kol2ct0 23428

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  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-ord 6361  df-on 6362  df-suc 6364  df-iota 6490  df-fun 6536  df-fv 6542  df-topgen 17492  df-top 23016  df-topon 23033  df-bases 23068  df-t0 23435

This theorem is referenced by:  ordtopt0  36838