MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  utoptop Structured version   Visualization version   GIF version

Theorem utoptop 22259
Description: The topology induced by a uniform structure 𝑈 is a topology. (Contributed by Thierry Arnoux, 30-Nov-2017.)
Assertion
Ref Expression
utoptop (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) ∈ Top)

Proof of Theorem utoptop
Dummy variables 𝑝 𝑎 𝑢 𝑣 𝑤 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 471 . . . . . . 7 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → 𝑥 ⊆ (unifTop‘𝑈))
2 utopval 22257 . . . . . . . . 9 (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝𝑎𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑎})
3 ssrab2 3837 . . . . . . . . 9 {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝𝑎𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑎} ⊆ 𝒫 𝑋
42, 3syl6eqss 3805 . . . . . . . 8 (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) ⊆ 𝒫 𝑋)
54adantr 466 . . . . . . 7 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → (unifTop‘𝑈) ⊆ 𝒫 𝑋)
61, 5sstrd 3763 . . . . . 6 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → 𝑥 ⊆ 𝒫 𝑋)
7 sspwuni 4746 . . . . . 6 (𝑥 ⊆ 𝒫 𝑋 𝑥𝑋)
86, 7sylib 208 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → 𝑥𝑋)
9 simp-4l 762 . . . . . . . . 9 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → 𝑈 ∈ (UnifOn‘𝑋))
10 simp-4r 764 . . . . . . . . . 10 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → 𝑥 ⊆ (unifTop‘𝑈))
11 simplr 746 . . . . . . . . . 10 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → 𝑦𝑥)
1210, 11sseldd 3754 . . . . . . . . 9 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → 𝑦 ∈ (unifTop‘𝑈))
13 simpr 471 . . . . . . . . 9 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → 𝑝𝑦)
14 elutop 22258 . . . . . . . . . . . 12 (𝑈 ∈ (UnifOn‘𝑋) → (𝑦 ∈ (unifTop‘𝑈) ↔ (𝑦𝑋 ∧ ∀𝑝𝑦𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦)))
1514biimpa 462 . . . . . . . . . . 11 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑦 ∈ (unifTop‘𝑈)) → (𝑦𝑋 ∧ ∀𝑝𝑦𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦))
1615simprd 479 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑦 ∈ (unifTop‘𝑈)) → ∀𝑝𝑦𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦)
1716r19.21bi 3081 . . . . . . . . 9 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝𝑦) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦)
189, 12, 13, 17syl21anc 1475 . . . . . . . 8 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦)
19 r19.41v 3237 . . . . . . . . 9 (∃𝑣𝑈 ((𝑣 “ {𝑝}) ⊆ 𝑦𝑦𝑥) ↔ (∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦𝑦𝑥))
20 ssuni 4597 . . . . . . . . . 10 (((𝑣 “ {𝑝}) ⊆ 𝑦𝑦𝑥) → (𝑣 “ {𝑝}) ⊆ 𝑥)
2120reximi 3159 . . . . . . . . 9 (∃𝑣𝑈 ((𝑣 “ {𝑝}) ⊆ 𝑦𝑦𝑥) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)
2219, 21sylbir 225 . . . . . . . 8 ((∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦𝑦𝑥) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)
2318, 11, 22syl2anc 567 . . . . . . 7 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)
24 eluni2 4579 . . . . . . . . 9 (𝑝 𝑥 ↔ ∃𝑦𝑥 𝑝𝑦)
2524biimpi 206 . . . . . . . 8 (𝑝 𝑥 → ∃𝑦𝑥 𝑝𝑦)
2625adantl 467 . . . . . . 7 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) → ∃𝑦𝑥 𝑝𝑦)
2723, 26r19.29a 3226 . . . . . 6 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)
2827ralrimiva 3115 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → ∀𝑝 𝑥𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)
29 elutop 22258 . . . . . 6 (𝑈 ∈ (UnifOn‘𝑋) → ( 𝑥 ∈ (unifTop‘𝑈) ↔ ( 𝑥𝑋 ∧ ∀𝑝 𝑥𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)))
3029adantr 466 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → ( 𝑥 ∈ (unifTop‘𝑈) ↔ ( 𝑥𝑋 ∧ ∀𝑝 𝑥𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)))
318, 28, 30mpbir2and 686 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → 𝑥 ∈ (unifTop‘𝑈))
3231ex 397 . . 3 (𝑈 ∈ (UnifOn‘𝑋) → (𝑥 ⊆ (unifTop‘𝑈) → 𝑥 ∈ (unifTop‘𝑈)))
3332alrimiv 2007 . 2 (𝑈 ∈ (UnifOn‘𝑋) → ∀𝑥(𝑥 ⊆ (unifTop‘𝑈) → 𝑥 ∈ (unifTop‘𝑈)))
34 elutop 22258 . . . . . . . 8 (𝑈 ∈ (UnifOn‘𝑋) → (𝑥 ∈ (unifTop‘𝑈) ↔ (𝑥𝑋 ∧ ∀𝑝𝑥𝑢𝑈 (𝑢 “ {𝑝}) ⊆ 𝑥)))
3534biimpa 462 . . . . . . 7 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ∈ (unifTop‘𝑈)) → (𝑥𝑋 ∧ ∀𝑝𝑥𝑢𝑈 (𝑢 “ {𝑝}) ⊆ 𝑥))
3635simpld 478 . . . . . 6 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ∈ (unifTop‘𝑈)) → 𝑥𝑋)
3736adantrr 690 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) → 𝑥𝑋)
38 ssinss1 3991 . . . . 5 (𝑥𝑋 → (𝑥𝑦) ⊆ 𝑋)
3937, 38syl 17 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) → (𝑥𝑦) ⊆ 𝑋)
40 simpl 468 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → 𝑈 ∈ (UnifOn‘𝑋))
41 simpr31 1344 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → 𝑢𝑈)
42 simpr32 1346 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → 𝑣𝑈)
43 ustincl 22232 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢𝑈𝑣𝑈) → (𝑢𝑣) ∈ 𝑈)
4440, 41, 42, 43syl3anc 1476 . . . . . . . . 9 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → (𝑢𝑣) ∈ 𝑈)
45 inss1 3982 . . . . . . . . . . . 12 (𝑢𝑣) ⊆ 𝑢
46 imass1 5642 . . . . . . . . . . . 12 ((𝑢𝑣) ⊆ 𝑢 → ((𝑢𝑣) “ {𝑝}) ⊆ (𝑢 “ {𝑝}))
4745, 46ax-mp 5 . . . . . . . . . . 11 ((𝑢𝑣) “ {𝑝}) ⊆ (𝑢 “ {𝑝})
48 simpr33 1348 . . . . . . . . . . . 12 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦))
4948simpld 478 . . . . . . . . . . 11 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → (𝑢 “ {𝑝}) ⊆ 𝑥)
5047, 49syl5ss 3764 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → ((𝑢𝑣) “ {𝑝}) ⊆ 𝑥)
51 inss2 3983 . . . . . . . . . . . 12 (𝑢𝑣) ⊆ 𝑣
52 imass1 5642 . . . . . . . . . . . 12 ((𝑢𝑣) ⊆ 𝑣 → ((𝑢𝑣) “ {𝑝}) ⊆ (𝑣 “ {𝑝}))
5351, 52ax-mp 5 . . . . . . . . . . 11 ((𝑢𝑣) “ {𝑝}) ⊆ (𝑣 “ {𝑝})
5448simprd 479 . . . . . . . . . . 11 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → (𝑣 “ {𝑝}) ⊆ 𝑦)
5553, 54syl5ss 3764 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → ((𝑢𝑣) “ {𝑝}) ⊆ 𝑦)
5650, 55ssind 3986 . . . . . . . . 9 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → ((𝑢𝑣) “ {𝑝}) ⊆ (𝑥𝑦))
57 imaeq1 5603 . . . . . . . . . . 11 (𝑤 = (𝑢𝑣) → (𝑤 “ {𝑝}) = ((𝑢𝑣) “ {𝑝}))
5857sseq1d 3782 . . . . . . . . . 10 (𝑤 = (𝑢𝑣) → ((𝑤 “ {𝑝}) ⊆ (𝑥𝑦) ↔ ((𝑢𝑣) “ {𝑝}) ⊆ (𝑥𝑦)))
5958rspcev 3461 . . . . . . . . 9 (((𝑢𝑣) ∈ 𝑈 ∧ ((𝑢𝑣) “ {𝑝}) ⊆ (𝑥𝑦)) → ∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))
6044, 56, 59syl2anc 567 . . . . . . . 8 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → ∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))
61603anassrs 1453 . . . . . . 7 ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦))) → ∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))
62613anassrs 1453 . . . . . 6 ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) ∧ 𝑢𝑈) ∧ 𝑣𝑈) ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)) → ∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))
63 simpll 744 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → 𝑈 ∈ (UnifOn‘𝑋))
64 simplrl 756 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → 𝑥 ∈ (unifTop‘𝑈))
65 simpr 471 . . . . . . . . . 10 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → 𝑝 ∈ (𝑥𝑦))
66 elin 3948 . . . . . . . . . 10 (𝑝 ∈ (𝑥𝑦) ↔ (𝑝𝑥𝑝𝑦))
6765, 66sylib 208 . . . . . . . . 9 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → (𝑝𝑥𝑝𝑦))
6867simpld 478 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → 𝑝𝑥)
6935simprd 479 . . . . . . . . 9 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ∈ (unifTop‘𝑈)) → ∀𝑝𝑥𝑢𝑈 (𝑢 “ {𝑝}) ⊆ 𝑥)
7069r19.21bi 3081 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ∈ (unifTop‘𝑈)) ∧ 𝑝𝑥) → ∃𝑢𝑈 (𝑢 “ {𝑝}) ⊆ 𝑥)
7163, 64, 68, 70syl21anc 1475 . . . . . . 7 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → ∃𝑢𝑈 (𝑢 “ {𝑝}) ⊆ 𝑥)
72 simplrr 757 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → 𝑦 ∈ (unifTop‘𝑈))
7367simprd 479 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → 𝑝𝑦)
7463, 72, 73, 17syl21anc 1475 . . . . . . 7 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦)
75 reeanv 3255 . . . . . . 7 (∃𝑢𝑈𝑣𝑈 ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦) ↔ (∃𝑢𝑈 (𝑢 “ {𝑝}) ⊆ 𝑥 ∧ ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦))
7671, 74, 75sylanbrc 566 . . . . . 6 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → ∃𝑢𝑈𝑣𝑈 ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦))
7762, 76r19.29vva 3229 . . . . 5 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → ∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))
7877ralrimiva 3115 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) → ∀𝑝 ∈ (𝑥𝑦)∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))
79 elutop 22258 . . . . 5 (𝑈 ∈ (UnifOn‘𝑋) → ((𝑥𝑦) ∈ (unifTop‘𝑈) ↔ ((𝑥𝑦) ⊆ 𝑋 ∧ ∀𝑝 ∈ (𝑥𝑦)∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))))
8079adantr 466 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) → ((𝑥𝑦) ∈ (unifTop‘𝑈) ↔ ((𝑥𝑦) ⊆ 𝑋 ∧ ∀𝑝 ∈ (𝑥𝑦)∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))))
8139, 78, 80mpbir2and 686 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) → (𝑥𝑦) ∈ (unifTop‘𝑈))
8281ralrimivva 3120 . 2 (𝑈 ∈ (UnifOn‘𝑋) → ∀𝑥 ∈ (unifTop‘𝑈)∀𝑦 ∈ (unifTop‘𝑈)(𝑥𝑦) ∈ (unifTop‘𝑈))
83 fvex 6343 . . 3 (unifTop‘𝑈) ∈ V
84 istopg 20921 . . 3 ((unifTop‘𝑈) ∈ V → ((unifTop‘𝑈) ∈ Top ↔ (∀𝑥(𝑥 ⊆ (unifTop‘𝑈) → 𝑥 ∈ (unifTop‘𝑈)) ∧ ∀𝑥 ∈ (unifTop‘𝑈)∀𝑦 ∈ (unifTop‘𝑈)(𝑥𝑦) ∈ (unifTop‘𝑈))))
8583, 84ax-mp 5 . 2 ((unifTop‘𝑈) ∈ Top ↔ (∀𝑥(𝑥 ⊆ (unifTop‘𝑈) → 𝑥 ∈ (unifTop‘𝑈)) ∧ ∀𝑥 ∈ (unifTop‘𝑈)∀𝑦 ∈ (unifTop‘𝑈)(𝑥𝑦) ∈ (unifTop‘𝑈)))
8633, 82, 85sylanbrc 566 1 (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) ∈ Top)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 382  w3a 1071  wal 1629   = wceq 1631  wcel 2145  wral 3061  wrex 3062  {crab 3065  Vcvv 3351  cin 3723  wss 3724  𝒫 cpw 4298  {csn 4317   cuni 4575  cima 5253  cfv 6032  Topctop 20919  UnifOncust 22224  unifTopcutop 22255
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4916  ax-nul 4924  ax-pow 4975  ax-pr 5035  ax-un 7097
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 829  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3353  df-sbc 3589  df-csb 3684  df-dif 3727  df-un 3729  df-in 3731  df-ss 3738  df-nul 4065  df-if 4227  df-pw 4300  df-sn 4318  df-pr 4320  df-op 4324  df-uni 4576  df-br 4788  df-opab 4848  df-mpt 4865  df-id 5158  df-xp 5256  df-rel 5257  df-cnv 5258  df-co 5259  df-dm 5260  df-rn 5261  df-res 5262  df-ima 5263  df-iota 5995  df-fun 6034  df-fn 6035  df-fv 6040  df-top 20920  df-ust 22225  df-utop 22256
This theorem is referenced by:  utoptopon  22261  utop2nei  22275  utop3cls  22276  utopreg  22277
  Copyright terms: Public domain W3C validator