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

Theorem utoptop 23386
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 485 . . . . . . 7 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → 𝑥 ⊆ (unifTop‘𝑈))
2 utopval 23384 . . . . . . . . 9 (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝𝑎𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑎})
3 ssrab2 4013 . . . . . . . . 9 {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝𝑎𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑎} ⊆ 𝒫 𝑋
42, 3eqsstrdi 3975 . . . . . . . 8 (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) ⊆ 𝒫 𝑋)
54adantr 481 . . . . . . 7 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → (unifTop‘𝑈) ⊆ 𝒫 𝑋)
61, 5sstrd 3931 . . . . . 6 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → 𝑥 ⊆ 𝒫 𝑋)
7 sspwuni 5029 . . . . . 6 (𝑥 ⊆ 𝒫 𝑋 𝑥𝑋)
86, 7sylib 217 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → 𝑥𝑋)
9 simp-4l 780 . . . . . . . . 9 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → 𝑈 ∈ (UnifOn‘𝑋))
10 simp-4r 781 . . . . . . . . . 10 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → 𝑥 ⊆ (unifTop‘𝑈))
11 simplr 766 . . . . . . . . . 10 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → 𝑦𝑥)
1210, 11sseldd 3922 . . . . . . . . 9 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → 𝑦 ∈ (unifTop‘𝑈))
13 simpr 485 . . . . . . . . 9 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → 𝑝𝑦)
14 elutop 23385 . . . . . . . . . . . 12 (𝑈 ∈ (UnifOn‘𝑋) → (𝑦 ∈ (unifTop‘𝑈) ↔ (𝑦𝑋 ∧ ∀𝑝𝑦𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦)))
1514biimpa 477 . . . . . . . . . . 11 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑦 ∈ (unifTop‘𝑈)) → (𝑦𝑋 ∧ ∀𝑝𝑦𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦))
1615simprd 496 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑦 ∈ (unifTop‘𝑈)) → ∀𝑝𝑦𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦)
1716r19.21bi 3134 . . . . . . . . 9 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝𝑦) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦)
189, 12, 13, 17syl21anc 835 . . . . . . . 8 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦)
19 r19.41v 3276 . . . . . . . . 9 (∃𝑣𝑈 ((𝑣 “ {𝑝}) ⊆ 𝑦𝑦𝑥) ↔ (∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦𝑦𝑥))
20 ssuni 4866 . . . . . . . . . 10 (((𝑣 “ {𝑝}) ⊆ 𝑦𝑦𝑥) → (𝑣 “ {𝑝}) ⊆ 𝑥)
2120reximi 3178 . . . . . . . . 9 (∃𝑣𝑈 ((𝑣 “ {𝑝}) ⊆ 𝑦𝑦𝑥) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)
2219, 21sylbir 234 . . . . . . . 8 ((∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦𝑦𝑥) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)
2318, 11, 22syl2anc 584 . . . . . . 7 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) ∧ 𝑦𝑥) ∧ 𝑝𝑦) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)
24 eluni2 4843 . . . . . . . . 9 (𝑝 𝑥 ↔ ∃𝑦𝑥 𝑝𝑦)
2524biimpi 215 . . . . . . . 8 (𝑝 𝑥 → ∃𝑦𝑥 𝑝𝑦)
2625adantl 482 . . . . . . 7 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) → ∃𝑦𝑥 𝑝𝑦)
2723, 26r19.29a 3218 . . . . . 6 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) ∧ 𝑝 𝑥) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)
2827ralrimiva 3103 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → ∀𝑝 𝑥𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)
29 elutop 23385 . . . . . 6 (𝑈 ∈ (UnifOn‘𝑋) → ( 𝑥 ∈ (unifTop‘𝑈) ↔ ( 𝑥𝑋 ∧ ∀𝑝 𝑥𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)))
3029adantr 481 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → ( 𝑥 ∈ (unifTop‘𝑈) ↔ ( 𝑥𝑋 ∧ ∀𝑝 𝑥𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑥)))
318, 28, 30mpbir2and 710 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ⊆ (unifTop‘𝑈)) → 𝑥 ∈ (unifTop‘𝑈))
3231ex 413 . . 3 (𝑈 ∈ (UnifOn‘𝑋) → (𝑥 ⊆ (unifTop‘𝑈) → 𝑥 ∈ (unifTop‘𝑈)))
3332alrimiv 1930 . 2 (𝑈 ∈ (UnifOn‘𝑋) → ∀𝑥(𝑥 ⊆ (unifTop‘𝑈) → 𝑥 ∈ (unifTop‘𝑈)))
34 elutop 23385 . . . . . . . 8 (𝑈 ∈ (UnifOn‘𝑋) → (𝑥 ∈ (unifTop‘𝑈) ↔ (𝑥𝑋 ∧ ∀𝑝𝑥𝑢𝑈 (𝑢 “ {𝑝}) ⊆ 𝑥)))
3534biimpa 477 . . . . . . 7 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ∈ (unifTop‘𝑈)) → (𝑥𝑋 ∧ ∀𝑝𝑥𝑢𝑈 (𝑢 “ {𝑝}) ⊆ 𝑥))
3635simpld 495 . . . . . 6 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ∈ (unifTop‘𝑈)) → 𝑥𝑋)
3736adantrr 714 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) → 𝑥𝑋)
38 ssinss1 4171 . . . . 5 (𝑥𝑋 → (𝑥𝑦) ⊆ 𝑋)
3937, 38syl 17 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) → (𝑥𝑦) ⊆ 𝑋)
40 simpl 483 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → 𝑈 ∈ (UnifOn‘𝑋))
41 simpr31 1262 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → 𝑢𝑈)
42 simpr32 1263 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → 𝑣𝑈)
43 ustincl 23359 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑢𝑈𝑣𝑈) → (𝑢𝑣) ∈ 𝑈)
4440, 41, 42, 43syl3anc 1370 . . . . . . . . 9 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → (𝑢𝑣) ∈ 𝑈)
45 inss1 4162 . . . . . . . . . . . 12 (𝑢𝑣) ⊆ 𝑢
46 imass1 6009 . . . . . . . . . . . 12 ((𝑢𝑣) ⊆ 𝑢 → ((𝑢𝑣) “ {𝑝}) ⊆ (𝑢 “ {𝑝}))
4745, 46ax-mp 5 . . . . . . . . . . 11 ((𝑢𝑣) “ {𝑝}) ⊆ (𝑢 “ {𝑝})
48 simpr33 1264 . . . . . . . . . . . 12 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦))
4948simpld 495 . . . . . . . . . . 11 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → (𝑢 “ {𝑝}) ⊆ 𝑥)
5047, 49sstrid 3932 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → ((𝑢𝑣) “ {𝑝}) ⊆ 𝑥)
51 inss2 4163 . . . . . . . . . . . 12 (𝑢𝑣) ⊆ 𝑣
52 imass1 6009 . . . . . . . . . . . 12 ((𝑢𝑣) ⊆ 𝑣 → ((𝑢𝑣) “ {𝑝}) ⊆ (𝑣 “ {𝑝}))
5351, 52ax-mp 5 . . . . . . . . . . 11 ((𝑢𝑣) “ {𝑝}) ⊆ (𝑣 “ {𝑝})
5448simprd 496 . . . . . . . . . . 11 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → (𝑣 “ {𝑝}) ⊆ 𝑦)
5553, 54sstrid 3932 . . . . . . . . . 10 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → ((𝑢𝑣) “ {𝑝}) ⊆ 𝑦)
5650, 55ssind 4166 . . . . . . . . 9 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → ((𝑢𝑣) “ {𝑝}) ⊆ (𝑥𝑦))
57 imaeq1 5964 . . . . . . . . . . 11 (𝑤 = (𝑢𝑣) → (𝑤 “ {𝑝}) = ((𝑢𝑣) “ {𝑝}))
5857sseq1d 3952 . . . . . . . . . 10 (𝑤 = (𝑢𝑣) → ((𝑤 “ {𝑝}) ⊆ (𝑥𝑦) ↔ ((𝑢𝑣) “ {𝑝}) ⊆ (𝑥𝑦)))
5958rspcev 3561 . . . . . . . . 9 (((𝑢𝑣) ∈ 𝑈 ∧ ((𝑢𝑣) “ {𝑝}) ⊆ (𝑥𝑦)) → ∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))
6044, 56, 59syl2anc 584 . . . . . . . 8 ((𝑈 ∈ (UnifOn‘𝑋) ∧ ((𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈)) ∧ 𝑝 ∈ (𝑥𝑦) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)))) → ∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))
61603anassrs 1359 . . . . . . 7 ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) ∧ (𝑢𝑈𝑣𝑈 ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦))) → ∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))
62613anassrs 1359 . . . . . 6 ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) ∧ 𝑢𝑈) ∧ 𝑣𝑈) ∧ ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦)) → ∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))
63 simpll 764 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → 𝑈 ∈ (UnifOn‘𝑋))
64 simplrl 774 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → 𝑥 ∈ (unifTop‘𝑈))
65 simpr 485 . . . . . . . . . 10 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → 𝑝 ∈ (𝑥𝑦))
66 elin 3903 . . . . . . . . . 10 (𝑝 ∈ (𝑥𝑦) ↔ (𝑝𝑥𝑝𝑦))
6765, 66sylib 217 . . . . . . . . 9 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → (𝑝𝑥𝑝𝑦))
6867simpld 495 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → 𝑝𝑥)
6935simprd 496 . . . . . . . . 9 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ∈ (unifTop‘𝑈)) → ∀𝑝𝑥𝑢𝑈 (𝑢 “ {𝑝}) ⊆ 𝑥)
7069r19.21bi 3134 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑥 ∈ (unifTop‘𝑈)) ∧ 𝑝𝑥) → ∃𝑢𝑈 (𝑢 “ {𝑝}) ⊆ 𝑥)
7163, 64, 68, 70syl21anc 835 . . . . . . 7 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → ∃𝑢𝑈 (𝑢 “ {𝑝}) ⊆ 𝑥)
72 simplrr 775 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → 𝑦 ∈ (unifTop‘𝑈))
7367simprd 496 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → 𝑝𝑦)
7463, 72, 73, 17syl21anc 835 . . . . . . 7 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦)
75 reeanv 3294 . . . . . . 7 (∃𝑢𝑈𝑣𝑈 ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦) ↔ (∃𝑢𝑈 (𝑢 “ {𝑝}) ⊆ 𝑥 ∧ ∃𝑣𝑈 (𝑣 “ {𝑝}) ⊆ 𝑦))
7671, 74, 75sylanbrc 583 . . . . . 6 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → ∃𝑢𝑈𝑣𝑈 ((𝑢 “ {𝑝}) ⊆ 𝑥 ∧ (𝑣 “ {𝑝}) ⊆ 𝑦))
7762, 76r19.29vva 3266 . . . . 5 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) ∧ 𝑝 ∈ (𝑥𝑦)) → ∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))
7877ralrimiva 3103 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) → ∀𝑝 ∈ (𝑥𝑦)∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))
79 elutop 23385 . . . . 5 (𝑈 ∈ (UnifOn‘𝑋) → ((𝑥𝑦) ∈ (unifTop‘𝑈) ↔ ((𝑥𝑦) ⊆ 𝑋 ∧ ∀𝑝 ∈ (𝑥𝑦)∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))))
8079adantr 481 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) → ((𝑥𝑦) ∈ (unifTop‘𝑈) ↔ ((𝑥𝑦) ⊆ 𝑋 ∧ ∀𝑝 ∈ (𝑥𝑦)∃𝑤𝑈 (𝑤 “ {𝑝}) ⊆ (𝑥𝑦))))
8139, 78, 80mpbir2and 710 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑥 ∈ (unifTop‘𝑈) ∧ 𝑦 ∈ (unifTop‘𝑈))) → (𝑥𝑦) ∈ (unifTop‘𝑈))
8281ralrimivva 3123 . 2 (𝑈 ∈ (UnifOn‘𝑋) → ∀𝑥 ∈ (unifTop‘𝑈)∀𝑦 ∈ (unifTop‘𝑈)(𝑥𝑦) ∈ (unifTop‘𝑈))
83 fvex 6787 . . 3 (unifTop‘𝑈) ∈ V
84 istopg 22044 . . 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 583 1 (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) ∈ Top)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1086  wal 1537   = wceq 1539  wcel 2106  wral 3064  wrex 3065  {crab 3068  Vcvv 3432  cin 3886  wss 3887  𝒫 cpw 4533  {csn 4561   cuni 4839  cima 5592  cfv 6433  Topctop 22042  UnifOncust 23351  unifTopcutop 23382
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-fv 6441  df-top 22043  df-ust 23352  df-utop 23383
This theorem is referenced by:  utoptopon  23388  utop2nei  23402  utop3cls  23403  utopreg  23404
  Copyright terms: Public domain W3C validator