Theorem restutop 24215

Description: Restriction of a topology induced by an uniform structure. (Contributed by Thierry Arnoux, 12-Dec-2017.)

Assertion

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

Proof of Theorem restutop

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

Step	Hyp	Ref	Expression
1		simpl 482	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) → (𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋))
2		fvexd 6850	. . . . . . 7 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (unifTop‘𝑈) ∈ V)
3		elfvex 6870	. . . . . . . . 9 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V)
4	3	adantr 480	. . . . . . . 8 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝑋 ∈ V)
5		simpr 484	. . . . . . . 8 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ 𝑋)
6	4, 5	ssexd 5262	. . . . . . 7 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐴 ∈ V)
7		elrest 17384	. . . . . . 7 ⊢ (((unifTop‘𝑈) ∈ V ∧ 𝐴 ∈ V) → (𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴) ↔ ∃𝑎 ∈ (unifTop‘𝑈)𝑏 = (𝑎 ∩ 𝐴)))
8	2, 6, 7	syl2anc 585	. . . . . 6 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴) ↔ ∃𝑎 ∈ (unifTop‘𝑈)𝑏 = (𝑎 ∩ 𝐴)))
9	8	biimpa 476	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) → ∃𝑎 ∈ (unifTop‘𝑈)𝑏 = (𝑎 ∩ 𝐴))
10		inss2 4179	. . . . . . 7 ⊢ (𝑎 ∩ 𝐴) ⊆ 𝐴
11		sseq1 3948	. . . . . . 7 ⊢ (𝑏 = (𝑎 ∩ 𝐴) → (𝑏 ⊆ 𝐴 ↔ (𝑎 ∩ 𝐴) ⊆ 𝐴))
12	10, 11	mpbiri 258	. . . . . 6 ⊢ (𝑏 = (𝑎 ∩ 𝐴) → 𝑏 ⊆ 𝐴)
13	12	rexlimivw 3135	. . . . 5 ⊢ (∃𝑎 ∈ (unifTop‘𝑈)𝑏 = (𝑎 ∩ 𝐴) → 𝑏 ⊆ 𝐴)
14	9, 13	syl 17	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) → 𝑏 ⊆ 𝐴)
15		simp-5l 785	. . . . . . . . . 10 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) → 𝑈 ∈ (UnifOn‘𝑋))
16	15	ad2antrr 727	. . . . . . . . 9 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 “ {𝑥}) ⊆ 𝑎) → 𝑈 ∈ (UnifOn‘𝑋))
17	6	ad6antr 737	. . . . . . . . . 10 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 “ {𝑥}) ⊆ 𝑎) → 𝐴 ∈ V)
18	17, 17	xpexd 7699	. . . . . . . . 9 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 “ {𝑥}) ⊆ 𝑎) → (𝐴 × 𝐴) ∈ V)
19		simplr 769	. . . . . . . . 9 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 “ {𝑥}) ⊆ 𝑎) → 𝑢 ∈ 𝑈)
20		elrestr 17385	. . . . . . . . 9 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐴 × 𝐴) ∈ V ∧ 𝑢 ∈ 𝑈) → (𝑢 ∩ (𝐴 × 𝐴)) ∈ (𝑈 ↾t (𝐴 × 𝐴)))
21	16, 18, 19, 20	syl3anc 1374	. . . . . . . 8 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 “ {𝑥}) ⊆ 𝑎) → (𝑢 ∩ (𝐴 × 𝐴)) ∈ (𝑈 ↾t (𝐴 × 𝐴)))
22		inss1 4178	. . . . . . . . . . . . 13 ⊢ (𝑢 ∩ (𝐴 × 𝐴)) ⊆ 𝑢
23		imass1 6061	. . . . . . . . . . . . 13 ⊢ ((𝑢 ∩ (𝐴 × 𝐴)) ⊆ 𝑢 → ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ (𝑢 “ {𝑥}))
24	22, 23	ax-mp 5	. . . . . . . . . . . 12 ⊢ ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ (𝑢 “ {𝑥})
25		sstr 3931	. . . . . . . . . . . 12 ⊢ ((((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ (𝑢 “ {𝑥}) ∧ (𝑢 “ {𝑥}) ⊆ 𝑎) → ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ 𝑎)
26	24, 25	mpan 691	. . . . . . . . . . 11 ⊢ ((𝑢 “ {𝑥}) ⊆ 𝑎 → ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ 𝑎)
27		imassrn 6031	. . . . . . . . . . . . . . 15 ⊢ ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ ran (𝑢 ∩ (𝐴 × 𝐴))
28		rnin 6105	. . . . . . . . . . . . . . 15 ⊢ ran (𝑢 ∩ (𝐴 × 𝐴)) ⊆ (ran 𝑢 ∩ ran (𝐴 × 𝐴))
29	27, 28	sstri 3932	. . . . . . . . . . . . . 14 ⊢ ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ (ran 𝑢 ∩ ran (𝐴 × 𝐴))
30		inss2 4179	. . . . . . . . . . . . . 14 ⊢ (ran 𝑢 ∩ ran (𝐴 × 𝐴)) ⊆ ran (𝐴 × 𝐴)
31	29, 30	sstri 3932	. . . . . . . . . . . . 13 ⊢ ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ ran (𝐴 × 𝐴)
32		rnxpid 6132	. . . . . . . . . . . . 13 ⊢ ran (𝐴 × 𝐴) = 𝐴
33	31, 32	sseqtri 3971	. . . . . . . . . . . 12 ⊢ ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ 𝐴
34	33	a1i 11	. . . . . . . . . . 11 ⊢ ((𝑢 “ {𝑥}) ⊆ 𝑎 → ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ 𝐴)
35	26, 34	ssind 4182	. . . . . . . . . 10 ⊢ ((𝑢 “ {𝑥}) ⊆ 𝑎 → ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ (𝑎 ∩ 𝐴))
36	35	adantl 481	. . . . . . . . 9 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 “ {𝑥}) ⊆ 𝑎) → ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ (𝑎 ∩ 𝐴))
37		simpllr 776	. . . . . . . . 9 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 “ {𝑥}) ⊆ 𝑎) → 𝑏 = (𝑎 ∩ 𝐴))
38	36, 37	sseqtrrd 3960	. . . . . . . 8 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 “ {𝑥}) ⊆ 𝑎) → ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ 𝑏)
39		imaeq1 6015	. . . . . . . . . 10 ⊢ (𝑣 = (𝑢 ∩ (𝐴 × 𝐴)) → (𝑣 “ {𝑥}) = ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}))
40	39	sseq1d 3954	. . . . . . . . 9 ⊢ (𝑣 = (𝑢 ∩ (𝐴 × 𝐴)) → ((𝑣 “ {𝑥}) ⊆ 𝑏 ↔ ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ 𝑏))
41	40	rspcev 3565	. . . . . . . 8 ⊢ (((𝑢 ∩ (𝐴 × 𝐴)) ∈ (𝑈 ↾t (𝐴 × 𝐴)) ∧ ((𝑢 ∩ (𝐴 × 𝐴)) “ {𝑥}) ⊆ 𝑏) → ∃𝑣 ∈ (𝑈 ↾t (𝐴 × 𝐴))(𝑣 “ {𝑥}) ⊆ 𝑏)
42	21, 38, 41	syl2anc 585	. . . . . . 7 ⊢ ((((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) ∧ 𝑢 ∈ 𝑈) ∧ (𝑢 “ {𝑥}) ⊆ 𝑎) → ∃𝑣 ∈ (𝑈 ↾t (𝐴 × 𝐴))(𝑣 “ {𝑥}) ⊆ 𝑏)
43		simplr 769	. . . . . . . 8 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) → 𝑎 ∈ (unifTop‘𝑈))
44		simpllr 776	. . . . . . . . . 10 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) → 𝑥 ∈ 𝑏)
45		simpr 484	. . . . . . . . . 10 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) → 𝑏 = (𝑎 ∩ 𝐴))
46	44, 45	eleqtrd 2839	. . . . . . . . 9 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) → 𝑥 ∈ (𝑎 ∩ 𝐴))
47	46	elin1d 4145	. . . . . . . 8 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) → 𝑥 ∈ 𝑎)
48		elutop 24211	. . . . . . . . . 10 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑎 ∈ (unifTop‘𝑈) ↔ (𝑎 ⊆ 𝑋 ∧ ∀𝑥 ∈ 𝑎 ∃𝑢 ∈ 𝑈 (𝑢 “ {𝑥}) ⊆ 𝑎)))
49	48	simplbda 499	. . . . . . . . 9 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑎 ∈ (unifTop‘𝑈)) → ∀𝑥 ∈ 𝑎 ∃𝑢 ∈ 𝑈 (𝑢 “ {𝑥}) ⊆ 𝑎)
50	49	r19.21bi 3230	. . . . . . . 8 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑥 ∈ 𝑎) → ∃𝑢 ∈ 𝑈 (𝑢 “ {𝑥}) ⊆ 𝑎)
51	15, 43, 47, 50	syl21anc 838	. . . . . . 7 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) → ∃𝑢 ∈ 𝑈 (𝑢 “ {𝑥}) ⊆ 𝑎)
52	42, 51	r19.29a 3146	. . . . . 6 ⊢ ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) ∧ 𝑎 ∈ (unifTop‘𝑈)) ∧ 𝑏 = (𝑎 ∩ 𝐴)) → ∃𝑣 ∈ (𝑈 ↾t (𝐴 × 𝐴))(𝑣 “ {𝑥}) ⊆ 𝑏)
53	9	adantr 480	. . . . . 6 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) → ∃𝑎 ∈ (unifTop‘𝑈)𝑏 = (𝑎 ∩ 𝐴))
54	52, 53	r19.29a 3146	. . . . 5 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) ∧ 𝑥 ∈ 𝑏) → ∃𝑣 ∈ (𝑈 ↾t (𝐴 × 𝐴))(𝑣 “ {𝑥}) ⊆ 𝑏)
55	54	ralrimiva 3130	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) → ∀𝑥 ∈ 𝑏 ∃𝑣 ∈ (𝑈 ↾t (𝐴 × 𝐴))(𝑣 “ {𝑥}) ⊆ 𝑏)
56		trust 24207	. . . . . 6 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝑈 ↾t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴))
57		elutop 24211	. . . . . 6 ⊢ ((𝑈 ↾t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴) → (𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴))) ↔ (𝑏 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑏 ∃𝑣 ∈ (𝑈 ↾t (𝐴 × 𝐴))(𝑣 “ {𝑥}) ⊆ 𝑏)))
58	56, 57	syl 17	. . . . 5 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴))) ↔ (𝑏 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑏 ∃𝑣 ∈ (𝑈 ↾t (𝐴 × 𝐴))(𝑣 “ {𝑥}) ⊆ 𝑏)))
59	58	biimpar 477	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ (𝑏 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑏 ∃𝑣 ∈ (𝑈 ↾t (𝐴 × 𝐴))(𝑣 “ {𝑥}) ⊆ 𝑏)) → 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴))))
60	1, 14, 55, 59	syl12anc 837	. . 3 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴)) → 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴))))
61	60	ex 412	. 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝑏 ∈ ((unifTop‘𝑈) ↾t 𝐴) → 𝑏 ∈ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴)))))
62	61	ssrdv 3928	1 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → ((unifTop‘𝑈) ↾t 𝐴) ⊆ (unifTop‘(𝑈 ↾t (𝐴 × 𝐴))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062  Vcvv 3430   ∩ cin 3889   ⊆ wss 3890  {csn 4568   × cxp 5623  ran crn 5626   “ cima 5628  ‘cfv 6493  (class class class)co 7361   ↾_t crest 17377  UnifOncust 24178  unifTopcutop 24208

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-1st 7936  df-2nd 7937  df-rest 17379  df-ust 24179  df-utop 24209

This theorem is referenced by:  restutopopn  24216