Theorem indistopon 22945

Description: The indiscrete topology on a set 𝐴. Part of Example 2 in [Munkres] p. 77. (Contributed by Mario Carneiro, 13-Aug-2015.)

Assertion

Ref	Expression
indistopon	⊢ (𝐴 ∈ 𝑉 → {∅, 𝐴} ∈ (TopOn‘𝐴))

Proof of Theorem indistopon

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

Step	Hyp	Ref	Expression
1		sspr 4791	. . . . 5 ⊢ (𝑥 ⊆ {∅, 𝐴} ↔ ((𝑥 = ∅ ∨ 𝑥 = {∅}) ∨ (𝑥 = {𝐴} ∨ 𝑥 = {∅, 𝐴})))
2		unieq 4874	. . . . . . . . 9 ⊢ (𝑥 = ∅ → ∪ 𝑥 = ∪ ∅)
3		uni0 4891	. . . . . . . . . 10 ⊢ ∪ ∅ = ∅
4		0ex 5252	. . . . . . . . . . 11 ⊢ ∅ ∈ V
5	4	prid1 4719	. . . . . . . . . 10 ⊢ ∅ ∈ {∅, 𝐴}
6	3, 5	eqeltri 2832	. . . . . . . . 9 ⊢ ∪ ∅ ∈ {∅, 𝐴}
7	2, 6	eqeltrdi 2844	. . . . . . . 8 ⊢ (𝑥 = ∅ → ∪ 𝑥 ∈ {∅, 𝐴})
8	7	a1i 11	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (𝑥 = ∅ → ∪ 𝑥 ∈ {∅, 𝐴}))
9		unieq 4874	. . . . . . . . 9 ⊢ (𝑥 = {∅} → ∪ 𝑥 = ∪ {∅})
10	4	unisn 4882	. . . . . . . . . 10 ⊢ ∪ {∅} = ∅
11	10, 5	eqeltri 2832	. . . . . . . . 9 ⊢ ∪ {∅} ∈ {∅, 𝐴}
12	9, 11	eqeltrdi 2844	. . . . . . . 8 ⊢ (𝑥 = {∅} → ∪ 𝑥 ∈ {∅, 𝐴})
13	12	a1i 11	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (𝑥 = {∅} → ∪ 𝑥 ∈ {∅, 𝐴}))
14	8, 13	jaod 859	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ((𝑥 = ∅ ∨ 𝑥 = {∅}) → ∪ 𝑥 ∈ {∅, 𝐴}))
15		unieq 4874	. . . . . . . . . 10 ⊢ (𝑥 = {𝐴} → ∪ 𝑥 = ∪ {𝐴})
16		unisng 4881	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ∪ {𝐴} = 𝐴)
17	15, 16	sylan9eqr 2793	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 = {𝐴}) → ∪ 𝑥 = 𝐴)
18		prid2g 4718	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {∅, 𝐴})
19	18	adantr 480	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 = {𝐴}) → 𝐴 ∈ {∅, 𝐴})
20	17, 19	eqeltrd 2836	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 = {𝐴}) → ∪ 𝑥 ∈ {∅, 𝐴})
21	20	ex 412	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (𝑥 = {𝐴} → ∪ 𝑥 ∈ {∅, 𝐴}))
22		unieq 4874	. . . . . . . . . 10 ⊢ (𝑥 = {∅, 𝐴} → ∪ 𝑥 = ∪ {∅, 𝐴})
23		uniprg 4879	. . . . . . . . . . . 12 ⊢ ((∅ ∈ V ∧ 𝐴 ∈ 𝑉) → ∪ {∅, 𝐴} = (∅ ∪ 𝐴))
24	4, 23	mpan 690	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → ∪ {∅, 𝐴} = (∅ ∪ 𝐴))
25		uncom 4110	. . . . . . . . . . . 12 ⊢ (∅ ∪ 𝐴) = (𝐴 ∪ ∅)
26		un0 4346	. . . . . . . . . . . 12 ⊢ (𝐴 ∪ ∅) = 𝐴
27	25, 26	eqtri 2759	. . . . . . . . . . 11 ⊢ (∅ ∪ 𝐴) = 𝐴
28	24, 27	eqtrdi 2787	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ∪ {∅, 𝐴} = 𝐴)
29	22, 28	sylan9eqr 2793	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 = {∅, 𝐴}) → ∪ 𝑥 = 𝐴)
30	18	adantr 480	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 = {∅, 𝐴}) → 𝐴 ∈ {∅, 𝐴})
31	29, 30	eqeltrd 2836	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 = {∅, 𝐴}) → ∪ 𝑥 ∈ {∅, 𝐴})
32	31	ex 412	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (𝑥 = {∅, 𝐴} → ∪ 𝑥 ∈ {∅, 𝐴}))
33	21, 32	jaod 859	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ((𝑥 = {𝐴} ∨ 𝑥 = {∅, 𝐴}) → ∪ 𝑥 ∈ {∅, 𝐴}))
34	14, 33	jaod 859	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (((𝑥 = ∅ ∨ 𝑥 = {∅}) ∨ (𝑥 = {𝐴} ∨ 𝑥 = {∅, 𝐴})) → ∪ 𝑥 ∈ {∅, 𝐴}))
35	1, 34	biimtrid 242	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ⊆ {∅, 𝐴} → ∪ 𝑥 ∈ {∅, 𝐴}))
36	35	alrimiv 1928	. . 3 ⊢ (𝐴 ∈ 𝑉 → ∀𝑥(𝑥 ⊆ {∅, 𝐴} → ∪ 𝑥 ∈ {∅, 𝐴}))
37		vex 3444	. . . . . 6 ⊢ 𝑥 ∈ V
38	37	elpr 4605	. . . . 5 ⊢ (𝑥 ∈ {∅, 𝐴} ↔ (𝑥 = ∅ ∨ 𝑥 = 𝐴))
39		vex 3444	. . . . . . . . 9 ⊢ 𝑦 ∈ V
40	39	elpr 4605	. . . . . . . 8 ⊢ (𝑦 ∈ {∅, 𝐴} ↔ (𝑦 = ∅ ∨ 𝑦 = 𝐴))
41		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝑥 = ∅ ∧ 𝑦 = ∅) → 𝑦 = ∅)
42	41	ineq2d 4172	. . . . . . . . . . . . 13 ⊢ ((𝑥 = ∅ ∧ 𝑦 = ∅) → (𝑥 ∩ 𝑦) = (𝑥 ∩ ∅))
43		in0 4347	. . . . . . . . . . . . 13 ⊢ (𝑥 ∩ ∅) = ∅
44	42, 43	eqtrdi 2787	. . . . . . . . . . . 12 ⊢ ((𝑥 = ∅ ∧ 𝑦 = ∅) → (𝑥 ∩ 𝑦) = ∅)
45	44, 5	eqeltrdi 2844	. . . . . . . . . . 11 ⊢ ((𝑥 = ∅ ∧ 𝑦 = ∅) → (𝑥 ∩ 𝑦) ∈ {∅, 𝐴})
46	45	a1i 11	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ((𝑥 = ∅ ∧ 𝑦 = ∅) → (𝑥 ∩ 𝑦) ∈ {∅, 𝐴}))
47		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = ∅) → 𝑦 = ∅)
48	47	ineq2d 4172	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = ∅) → (𝑥 ∩ 𝑦) = (𝑥 ∩ ∅))
49	48, 43	eqtrdi 2787	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = ∅) → (𝑥 ∩ 𝑦) = ∅)
50	49, 5	eqeltrdi 2844	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = ∅) → (𝑥 ∩ 𝑦) ∈ {∅, 𝐴})
51	50	a1i 11	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ((𝑥 = 𝐴 ∧ 𝑦 = ∅) → (𝑥 ∩ 𝑦) ∈ {∅, 𝐴}))
52		simpl 482	. . . . . . . . . . . . . 14 ⊢ ((𝑥 = ∅ ∧ 𝑦 = 𝐴) → 𝑥 = ∅)
53	52	ineq1d 4171	. . . . . . . . . . . . 13 ⊢ ((𝑥 = ∅ ∧ 𝑦 = 𝐴) → (𝑥 ∩ 𝑦) = (∅ ∩ 𝑦))
54		0in 4349	. . . . . . . . . . . . 13 ⊢ (∅ ∩ 𝑦) = ∅
55	53, 54	eqtrdi 2787	. . . . . . . . . . . 12 ⊢ ((𝑥 = ∅ ∧ 𝑦 = 𝐴) → (𝑥 ∩ 𝑦) = ∅)
56	55, 5	eqeltrdi 2844	. . . . . . . . . . 11 ⊢ ((𝑥 = ∅ ∧ 𝑦 = 𝐴) → (𝑥 ∩ 𝑦) ∈ {∅, 𝐴})
57	56	a1i 11	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ((𝑥 = ∅ ∧ 𝑦 = 𝐴) → (𝑥 ∩ 𝑦) ∈ {∅, 𝐴}))
58		ineq12 4167	. . . . . . . . . . . . . 14 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐴) → (𝑥 ∩ 𝑦) = (𝐴 ∩ 𝐴))
59	58	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)) → (𝑥 ∩ 𝑦) = (𝐴 ∩ 𝐴))
60		inidm 4179	. . . . . . . . . . . . 13 ⊢ (𝐴 ∩ 𝐴) = 𝐴
61	59, 60	eqtrdi 2787	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)) → (𝑥 ∩ 𝑦) = 𝐴)
62	18	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)) → 𝐴 ∈ {∅, 𝐴})
63	61, 62	eqeltrd 2836	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)) → (𝑥 ∩ 𝑦) ∈ {∅, 𝐴})
64	63	ex 412	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐴) → (𝑥 ∩ 𝑦) ∈ {∅, 𝐴}))
65	46, 51, 57, 64	ccased 1038	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑉 → (((𝑥 = ∅ ∨ 𝑥 = 𝐴) ∧ (𝑦 = ∅ ∨ 𝑦 = 𝐴)) → (𝑥 ∩ 𝑦) ∈ {∅, 𝐴}))
66	65	expdimp 452	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑥 = ∅ ∨ 𝑥 = 𝐴)) → ((𝑦 = ∅ ∨ 𝑦 = 𝐴) → (𝑥 ∩ 𝑦) ∈ {∅, 𝐴}))
67	40, 66	biimtrid 242	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑥 = ∅ ∨ 𝑥 = 𝐴)) → (𝑦 ∈ {∅, 𝐴} → (𝑥 ∩ 𝑦) ∈ {∅, 𝐴}))
68	67	ralrimiv 3127	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑥 = ∅ ∨ 𝑥 = 𝐴)) → ∀𝑦 ∈ {∅, 𝐴} (𝑥 ∩ 𝑦) ∈ {∅, 𝐴})
69	68	ex 412	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ((𝑥 = ∅ ∨ 𝑥 = 𝐴) → ∀𝑦 ∈ {∅, 𝐴} (𝑥 ∩ 𝑦) ∈ {∅, 𝐴}))
70	38, 69	biimtrid 242	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ {∅, 𝐴} → ∀𝑦 ∈ {∅, 𝐴} (𝑥 ∩ 𝑦) ∈ {∅, 𝐴}))
71	70	ralrimiv 3127	. . 3 ⊢ (𝐴 ∈ 𝑉 → ∀𝑥 ∈ {∅, 𝐴}∀𝑦 ∈ {∅, 𝐴} (𝑥 ∩ 𝑦) ∈ {∅, 𝐴})
72		prex 5382	. . . 4 ⊢ {∅, 𝐴} ∈ V
73		istopg 22839	. . . 4 ⊢ ({∅, 𝐴} ∈ V → ({∅, 𝐴} ∈ Top ↔ (∀𝑥(𝑥 ⊆ {∅, 𝐴} → ∪ 𝑥 ∈ {∅, 𝐴}) ∧ ∀𝑥 ∈ {∅, 𝐴}∀𝑦 ∈ {∅, 𝐴} (𝑥 ∩ 𝑦) ∈ {∅, 𝐴})))
74	72, 73	mp1i 13	. . 3 ⊢ (𝐴 ∈ 𝑉 → ({∅, 𝐴} ∈ Top ↔ (∀𝑥(𝑥 ⊆ {∅, 𝐴} → ∪ 𝑥 ∈ {∅, 𝐴}) ∧ ∀𝑥 ∈ {∅, 𝐴}∀𝑦 ∈ {∅, 𝐴} (𝑥 ∩ 𝑦) ∈ {∅, 𝐴})))
75	36, 71, 74	mpbir2and 713	. 2 ⊢ (𝐴 ∈ 𝑉 → {∅, 𝐴} ∈ Top)
76	28	eqcomd 2742	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 = ∪ {∅, 𝐴})
77		istopon 22856	. 2 ⊢ ({∅, 𝐴} ∈ (TopOn‘𝐴) ↔ ({∅, 𝐴} ∈ Top ∧ 𝐴 = ∪ {∅, 𝐴}))
78	75, 76, 77	sylanbrc 583	1 ⊢ (𝐴 ∈ 𝑉 → {∅, 𝐴} ∈ (TopOn‘𝐴))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847  ∀wal 1539   = wceq 1541   ∈ wcel 2113  ∀wral 3051  Vcvv 3440   ∪ cun 3899   ∩ cin 3900   ⊆ wss 3901  ∅c0 4285  {csn 4580  {cpr 4582  ∪ cuni 4863  ‘cfv 6492  Topctop 22837  TopOnctopon 22854

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-iota 6448  df-fun 6494  df-fv 6500  df-top 22838  df-topon 22855

This theorem is referenced by:  indistop  22946  indisuni  22947  indistpsx  22954  indistpsALT  22957  indistps2ALT  22958  cnindis  23236  indishmph  23742  indistgp  24044  topdifinf  37554