Theorem restutopopn 23734

Description: The restriction of the topology induced by an uniform structure to an open set. (Contributed by Thierry Arnoux, 16-Dec-2017.)

Assertion

Ref	Expression
restutopopn	⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) → ((unifTop‘𝑈) ↾t 𝐴) = (unifTop‘(𝑈 ↾t (𝐴 × 𝐴))))

Proof of Theorem restutopopn

Dummy variables 𝑎 𝑏 𝑡 𝑢 𝑤 𝑥 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elutop 23729	. . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐴 ∈ (unifTop‘𝑈) ↔ (𝐴 ⊆ 𝑋 ∧ ∀𝑥 ∈ 𝐴 ∃𝑡 ∈ 𝑈 (𝑡 “ {𝑥}) ⊆ 𝐴)))
2	1	simprbda 499	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) → 𝐴 ⊆ 𝑋)
3		restutop 23733	. . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → ((unifTop‘𝑈) ↾t 𝐴) ⊆ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴))))
4	2, 3	syldan 591	. 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) → ((unifTop‘𝑈) ↾t 𝐴) ⊆ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴))))
5		trust 23725	. . . . . . . . 9 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝑈 ↾t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴))
6	2, 5	syldan 591	. . . . . . . 8 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) → (𝑈 ↾t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴))
7		elutop 23729	. . . . . . . 8 ⊢ ((𝑈 ↾t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴) → (𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴))) ↔ (𝑏 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑏 ∃𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))(𝑢 “ {𝑥}) ⊆ 𝑏)))
8	6, 7	syl 17	. . . . . . 7 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) → (𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴))) ↔ (𝑏 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑏 ∃𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))(𝑢 “ {𝑥}) ⊆ 𝑏)))
9	8	simprbda 499	. . . . . 6 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) → 𝑏 ⊆ 𝐴)
10	2	adantr 481	. . . . . 6 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) → 𝐴 ⊆ 𝑋)
11	9, 10	sstrd 3991	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) → 𝑏 ⊆ 𝑋)
12		simp-9l 791	. . . . . . . . . . 11 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → 𝑈 ∈ (UnifOn‘𝑋))
13		simplr 767	. . . . . . . . . . 11 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → 𝑡 ∈ 𝑈)
14		simp-4r 782	. . . . . . . . . . 11 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → 𝑤 ∈ 𝑈)
15		ustincl 23703	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑡 ∈ 𝑈 ∧ 𝑤 ∈ 𝑈) → (𝑡 ∩ 𝑤) ∈ 𝑈)
16	12, 13, 14, 15	syl3anc 1371	. . . . . . . . . 10 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → (𝑡 ∩ 𝑤) ∈ 𝑈)
17		inimass 6151	. . . . . . . . . . 11 ⊢ ((𝑡 ∩ 𝑤) “ {𝑥}) ⊆ ((𝑡 “ {𝑥}) ∩ (𝑤 “ {𝑥}))
18		ssrin 4232	. . . . . . . . . . . . . 14 ⊢ ((𝑡 “ {𝑥}) ⊆ 𝐴 → ((𝑡 “ {𝑥}) ∩ (𝑤 “ {𝑥})) ⊆ (𝐴 ∩ (𝑤 “ {𝑥})))
19	18	adantl 482	. . . . . . . . . . . . 13 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → ((𝑡 “ {𝑥}) ∩ (𝑤 “ {𝑥})) ⊆ (𝐴 ∩ (𝑤 “ {𝑥})))
20		simpllr 774	. . . . . . . . . . . . . . 15 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → 𝑢 = (𝑤 ∩ (𝐴 × 𝐴)))
21	20	imaeq1d 6056	. . . . . . . . . . . . . 14 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → (𝑢 “ {𝑥}) = ((𝑤 ∩ (𝐴 × 𝐴)) “ {𝑥}))
22	9	ad5antr 732	. . . . . . . . . . . . . . . . 17 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) → 𝑏 ⊆ 𝐴)
23		simp-5r 784	. . . . . . . . . . . . . . . . 17 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) → 𝑥 ∈ 𝑏)
24	22, 23	sseldd 3982	. . . . . . . . . . . . . . . 16 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) → 𝑥 ∈ 𝐴)
25	24	ad2antrr 724	. . . . . . . . . . . . . . 15 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → 𝑥 ∈ 𝐴)
26		inimasn 6152	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ V → ((𝑤 ∩ (𝐴 × 𝐴)) “ {𝑥}) = ((𝑤 “ {𝑥}) ∩ ((𝐴 × 𝐴) “ {𝑥})))
27	26	elv 3480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑤 ∩ (𝐴 × 𝐴)) “ {𝑥}) = ((𝑤 “ {𝑥}) ∩ ((𝐴 × 𝐴) “ {𝑥}))
28		xpimasn 6181	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ 𝐴 → ((𝐴 × 𝐴) “ {𝑥}) = 𝐴)
29	28	ineq2d 4211	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ 𝐴 → ((𝑤 “ {𝑥}) ∩ ((𝐴 × 𝐴) “ {𝑥})) = ((𝑤 “ {𝑥}) ∩ 𝐴))
30	27, 29	eqtrid 2784	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ 𝐴 → ((𝑤 ∩ (𝐴 × 𝐴)) “ {𝑥}) = ((𝑤 “ {𝑥}) ∩ 𝐴))
31		incom 4200	. . . . . . . . . . . . . . . 16 ⊢ ((𝑤 “ {𝑥}) ∩ 𝐴) = (𝐴 ∩ (𝑤 “ {𝑥}))
32	30, 31	eqtrdi 2788	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝐴 → ((𝑤 ∩ (𝐴 × 𝐴)) “ {𝑥}) = (𝐴 ∩ (𝑤 “ {𝑥})))
33	25, 32	syl 17	. . . . . . . . . . . . . 14 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → ((𝑤 ∩ (𝐴 × 𝐴)) “ {𝑥}) = (𝐴 ∩ (𝑤 “ {𝑥})))
34	21, 33	eqtrd 2772	. . . . . . . . . . . . 13 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → (𝑢 “ {𝑥}) = (𝐴 ∩ (𝑤 “ {𝑥})))
35	19, 34	sseqtrrd 4022	. . . . . . . . . . . 12 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → ((𝑡 “ {𝑥}) ∩ (𝑤 “ {𝑥})) ⊆ (𝑢 “ {𝑥}))
36		simp-5r 784	. . . . . . . . . . . 12 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → (𝑢 “ {𝑥}) ⊆ 𝑏)
37	35, 36	sstrd 3991	. . . . . . . . . . 11 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → ((𝑡 “ {𝑥}) ∩ (𝑤 “ {𝑥})) ⊆ 𝑏)
38	17, 37	sstrid 3992	. . . . . . . . . 10 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → ((𝑡 ∩ 𝑤) “ {𝑥}) ⊆ 𝑏)
39		imaeq1 6052	. . . . . . . . . . . 12 ⊢ (𝑣 = (𝑡 ∩ 𝑤) → (𝑣 “ {𝑥}) = ((𝑡 ∩ 𝑤) “ {𝑥}))
40	39	sseq1d 4012	. . . . . . . . . . 11 ⊢ (𝑣 = (𝑡 ∩ 𝑤) → ((𝑣 “ {𝑥}) ⊆ 𝑏 ↔ ((𝑡 ∩ 𝑤) “ {𝑥}) ⊆ 𝑏))
41	40	rspcev 3612	. . . . . . . . . 10 ⊢ (((𝑡 ∩ 𝑤) ∈ 𝑈 ∧ ((𝑡 ∩ 𝑤) “ {𝑥}) ⊆ 𝑏) → ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑏)
42	16, 38, 41	syl2anc 584	. . . . . . . . 9 ⊢ ((((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) ∧ 𝑡 ∈ 𝑈) ∧ (𝑡 “ {𝑥}) ⊆ 𝐴) → ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑏)
43		simp-4l 781	. . . . . . . . . . 11 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) → (𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)))
44	43	ad2antrr 724	. . . . . . . . . 10 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) → (𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)))
45	1	simplbda 500	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) → ∀𝑥 ∈ 𝐴 ∃𝑡 ∈ 𝑈 (𝑡 “ {𝑥}) ⊆ 𝐴)
46	45	r19.21bi 3248	. . . . . . . . . 10 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑥 ∈ 𝐴) → ∃𝑡 ∈ 𝑈 (𝑡 “ {𝑥}) ⊆ 𝐴)
47	44, 24, 46	syl2anc 584	. . . . . . . . 9 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) → ∃𝑡 ∈ 𝑈 (𝑡 “ {𝑥}) ⊆ 𝐴)
48	42, 47	r19.29a 3162	. . . . . . . 8 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) ∧ 𝑤 ∈ 𝑈) ∧ 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))) → ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑏)
49		simplr 767	. . . . . . . . 9 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) → 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴)))
50		sqxpexg 7738	. . . . . . . . . . 11 ⊢ (𝐴 ∈ (unifTop‘𝑈) → (𝐴 × 𝐴) ∈ V)
51		elrest 17369	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐴 × 𝐴) ∈ V) → (𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴)) ↔ ∃𝑤 ∈ 𝑈 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))))
52	50, 51	sylan2 593	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) → (𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴)) ↔ ∃𝑤 ∈ 𝑈 𝑢 = (𝑤 ∩ (𝐴 × 𝐴))))
53	52	biimpa 477	. . . . . . . . 9 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) → ∃𝑤 ∈ 𝑈 𝑢 = (𝑤 ∩ (𝐴 × 𝐴)))
54	43, 49, 53	syl2anc 584	. . . . . . . 8 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) → ∃𝑤 ∈ 𝑈 𝑢 = (𝑤 ∩ (𝐴 × 𝐴)))
55	48, 54	r19.29a 3162	. . . . . . 7 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) ∧ 𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))) ∧ (𝑢 “ {𝑥}) ⊆ 𝑏) → ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑏)
56	8	simplbda 500	. . . . . . . 8 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) → ∀𝑥 ∈ 𝑏 ∃𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))(𝑢 “ {𝑥}) ⊆ 𝑏)
57	56	r19.21bi 3248	. . . . . . 7 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) → ∃𝑢 ∈ (𝑈 ↾t (𝐴 × 𝐴))(𝑢 “ {𝑥}) ⊆ 𝑏)
58	55, 57	r19.29a 3162	. . . . . 6 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) ∧ 𝑥 ∈ 𝑏) → ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑏)
59	58	ralrimiva 3146	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) → ∀𝑥 ∈ 𝑏 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑏)
60		elutop 23729	. . . . . 6 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑏 ∈ (unifTop‘𝑈) ↔ (𝑏 ⊆ 𝑋 ∧ ∀𝑥 ∈ 𝑏 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑏)))
61	60	ad2antrr 724	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) → (𝑏 ∈ (unifTop‘𝑈) ↔ (𝑏 ⊆ 𝑋 ∧ ∀𝑥 ∈ 𝑏 ∃𝑣 ∈ 𝑈 (𝑣 “ {𝑥}) ⊆ 𝑏)))
62	11, 59, 61	mpbir2and 711	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) → 𝑏 ∈ (unifTop‘𝑈))
63		df-ss 3964	. . . . . 6 ⊢ (𝑏 ⊆ 𝐴 ↔ (𝑏 ∩ 𝐴) = 𝑏)
64	9, 63	sylib 217	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) → (𝑏 ∩ 𝐴) = 𝑏)
65	64	eqcomd 2738	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) → 𝑏 = (𝑏 ∩ 𝐴))
66		ineq1 4204	. . . . 5 ⊢ (𝑎 = 𝑏 → (𝑎 ∩ 𝐴) = (𝑏 ∩ 𝐴))
67	66	rspceeqv 3632	. . . 4 ⊢ ((𝑏 ∈ (unifTop‘𝑈) ∧ 𝑏 = (𝑏 ∩ 𝐴)) → ∃𝑎 ∈ (unifTop‘𝑈)𝑏 = (𝑎 ∩ 𝐴))
68	62, 65, 67	syl2anc 584	. . 3 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) → ∃𝑎 ∈ (unifTop‘𝑈)𝑏 = (𝑎 ∩ 𝐴))
69		fvex 6901	. . . . 5 ⊢ (unifTop‘𝑈) ∈ V
70		elrest 17369	. . . . 5 ⊢ (((unifTop‘𝑈) ∈ V ∧ 𝐴 ∈ (unifTop‘𝑈)) → (𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴) ↔ ∃𝑎 ∈ (unifTop‘𝑈)𝑏 = (𝑎 ∩ 𝐴)))
71	69, 70	mpan 688	. . . 4 ⊢ (𝐴 ∈ (unifTop‘𝑈) → (𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴) ↔ ∃𝑎 ∈ (unifTop‘𝑈)𝑏 = (𝑎 ∩ 𝐴)))
72	71	ad2antlr 725	. . 3 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) → (𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴) ↔ ∃𝑎 ∈ (unifTop‘𝑈)𝑏 = (𝑎 ∩ 𝐴)))
73	68, 72	mpbird 256	. 2 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) ∧ 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))) → 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴))
74	4, 73	eqelssd 4002	1 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ∈ (unifTop‘𝑈)) → ((unifTop‘𝑈) ↾t 𝐴) = (unifTop‘(𝑈 ↾t (𝐴 × 𝐴))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3061  ∃wrex 3070  Vcvv 3474   ∩ cin 3946   ⊆ wss 3947  {csn 4627   × cxp 5673   “ cima 5678  ‘cfv 6540  (class class class)co 7405   ↾_t crest 17362  UnifOncust 23695  unifTopcutop 23726

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  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 2703  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7971  df-2nd 7972  df-rest 17364  df-ust 23696  df-utop 23727

This theorem is referenced by:  ressusp  23760