Theorem toprntopon 23276

Description: A topology is the same thing as a topology on a set (variable-free version). (Contributed by BJ, 27-Apr-2021.)

Assertion

Ref	Expression
toprntopon	⊢ Top = ∪ ran TopOn

Proof of Theorem toprntopon

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

Step	Hyp	Ref	Expression
1		toptopon2 23269	. . . . 5 ⊢ (𝑥 ∈ Top ↔ 𝑥 ∈ (TopOn‘∪ 𝑥))
2		fvex 6924	. . . . . 6 ⊢ (TopOn‘∪ 𝑥) ∈ V
3		eleq2 2853	. . . . . . . 8 ⊢ (𝑦 = (TopOn‘∪ 𝑥) → (𝑥 ∈ 𝑦 ↔ 𝑥 ∈ (TopOn‘∪ 𝑥)))
4		eleq1 2852	. . . . . . . 8 ⊢ (𝑦 = (TopOn‘∪ 𝑥) → (𝑦 ∈ ran TopOn ↔ (TopOn‘∪ 𝑥) ∈ ran TopOn))
5	3, 4	anbi12d 644	. . . . . . 7 ⊢ (𝑦 = (TopOn‘∪ 𝑥) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ ran TopOn) ↔ (𝑥 ∈ (TopOn‘∪ 𝑥) ∧ (TopOn‘∪ 𝑥) ∈ ran TopOn)))
6		simpl 488	. . . . . . . 8 ⊢ ((𝑥 ∈ (TopOn‘∪ 𝑥) ∧ (TopOn‘∪ 𝑥) ∈ ran TopOn) → 𝑥 ∈ (TopOn‘∪ 𝑥))
7		fntopon 23275	. . . . . . . . . 10 ⊢ TopOn Fn V
8		vuniex 7783	. . . . . . . . . 10 ⊢ ∪ 𝑥 ∈ V
9		fnfvelrn 7107	. . . . . . . . . 10 ⊢ ((TopOn Fn V ∧ ∪ 𝑥 ∈ V) → (TopOn‘∪ 𝑥) ∈ ran TopOn)
10	7, 8, 9	mp2an 705	. . . . . . . . 9 ⊢ (TopOn‘∪ 𝑥) ∈ ran TopOn
11	10	jctr 534	. . . . . . . 8 ⊢ (𝑥 ∈ (TopOn‘∪ 𝑥) → (𝑥 ∈ (TopOn‘∪ 𝑥) ∧ (TopOn‘∪ 𝑥) ∈ ran TopOn))
12	6, 11	impbii 212	. . . . . . 7 ⊢ ((𝑥 ∈ (TopOn‘∪ 𝑥) ∧ (TopOn‘∪ 𝑥) ∈ ran TopOn) ↔ 𝑥 ∈ (TopOn‘∪ 𝑥))
13	5, 12	bitrdi 290	. . . . . 6 ⊢ (𝑦 = (TopOn‘∪ 𝑥) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ ran TopOn) ↔ 𝑥 ∈ (TopOn‘∪ 𝑥)))
14	2, 13	spcev 3564	. . . . 5 ⊢ (𝑥 ∈ (TopOn‘∪ 𝑥) → ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ ran TopOn))
15	1, 14	sylbi 220	. . . 4 ⊢ (𝑥 ∈ Top → ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ ran TopOn))
16		funtopon 23271	. . . . . . . . 9 ⊢ Fun TopOn
17		elrnrexdm 7116	. . . . . . . . 9 ⊢ (Fun TopOn → (𝑦 ∈ ran TopOn → ∃𝑧 ∈ dom TopOn𝑦 = (TopOn‘𝑧)))
18	16, 17	ax-mp 5	. . . . . . . 8 ⊢ (𝑦 ∈ ran TopOn → ∃𝑧 ∈ dom TopOn𝑦 = (TopOn‘𝑧))
19		rexex 3096	. . . . . . . 8 ⊢ (∃𝑧 ∈ dom TopOn𝑦 = (TopOn‘𝑧) → ∃𝑧 𝑦 = (TopOn‘𝑧))
20	18, 19	syl 18	. . . . . . 7 ⊢ (𝑦 ∈ ran TopOn → ∃𝑧 𝑦 = (TopOn‘𝑧))
21		19.42v 1988	. . . . . . . 8 ⊢ (∃𝑧(𝑥 ∈ 𝑦 ∧ 𝑦 = (TopOn‘𝑧)) ↔ (𝑥 ∈ 𝑦 ∧ ∃𝑧 𝑦 = (TopOn‘𝑧)))
22		eqimss 3971	. . . . . . . . . . 11 ⊢ (𝑦 = (TopOn‘𝑧) → 𝑦 ⊆ (TopOn‘𝑧))
23	22	sseld 3912	. . . . . . . . . 10 ⊢ (𝑦 = (TopOn‘𝑧) → (𝑥 ∈ 𝑦 → 𝑥 ∈ (TopOn‘𝑧)))
24	23	impcom 413	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝑦 = (TopOn‘𝑧)) → 𝑥 ∈ (TopOn‘𝑧))
25	24	eximi 1868	. . . . . . . 8 ⊢ (∃𝑧(𝑥 ∈ 𝑦 ∧ 𝑦 = (TopOn‘𝑧)) → ∃𝑧 𝑥 ∈ (TopOn‘𝑧))
26	21, 25	sylbir 238	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑦 ∧ ∃𝑧 𝑦 = (TopOn‘𝑧)) → ∃𝑧 𝑥 ∈ (TopOn‘𝑧))
27	20, 26	sylan2 605	. . . . . 6 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ ran TopOn) → ∃𝑧 𝑥 ∈ (TopOn‘𝑧))
28		topontop 23264	. . . . . . 7 ⊢ (𝑥 ∈ (TopOn‘𝑧) → 𝑥 ∈ Top)
29	28	exlimiv 1965	. . . . . 6 ⊢ (∃𝑧 𝑥 ∈ (TopOn‘𝑧) → 𝑥 ∈ Top)
30	27, 29	syl 18	. . . . 5 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ ran TopOn) → 𝑥 ∈ Top)
31	30	exlimiv 1965	. . . 4 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ ran TopOn) → 𝑥 ∈ Top)
32	15, 31	impbii 212	. . 3 ⊢ (𝑥 ∈ Top ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ ran TopOn))
33		eluni 4873	. . 3 ⊢ (𝑥 ∈ ∪ ran TopOn ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ ran TopOn))
34	32, 33	bitr4i 281	. 2 ⊢ (𝑥 ∈ Top ↔ 𝑥 ∈ ∪ ran TopOn)
35	34	eqriv 2760	1 ⊢ Top = ∪ ran TopOn

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃wrex 3090  Vcvv 3454  ∪ cuni 4870  dom cdm 5656  ran crn 5657  Fun wfun 6555   Fn wfn 6556  ‘cfv 6561  Topctop 23244  TopOnctopon 23261

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 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-rab 3417  df-v 3456  df-ss 3901  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 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-iota 6515  df-fun 6563  df-fn 6564  df-fv 6569  df-topon 23262

This theorem is used by: (None)