utop2nei - Metamath Proof Explorer

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

Theorem utop2nei 24165

Description: For any symmetrical entourage 𝑉 and any relation 𝑀, build a neighborhood of 𝑀. First part of proposition 2 of [BourbakiTop1] p. II.4. (Contributed by Thierry Arnoux, 14-Jan-2018.)

**Hypothesis**
Ref	Expression
utoptop.1	⊢ 𝐽 = (unifTop‘𝑈)

**Assertion**
Ref	Expression
utop2nei	⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → (𝑉 ∘ (𝑀 ∘ 𝑉)) ∈ ((nei‘(𝐽 ×_t 𝐽))‘𝑀))

Proof of Theorem utop2nei Dummy variables 𝑟 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		utoptop.1	. . . . . . . 8 ⊢ 𝐽 = (unifTop‘𝑈)
2		utoptop 24149	. . . . . . . 8 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) ∈ Top)
3	1, 2	eqeltrid 2835	. . . . . . 7 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝐽 ∈ Top)
4		txtop 23484	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝐽 ∈ Top) → (𝐽 ×_t 𝐽) ∈ Top)
5	3, 3, 4	syl2anc 584	. . . . . 6 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐽 ×_t 𝐽) ∈ Top)
6	5	3ad2ant1 1133	. . . . 5 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → (𝐽 ×_t 𝐽) ∈ Top)
7	6	adantr 480	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑀 = ∅) → (𝐽 ×_t 𝐽) ∈ Top)
8		0nei 23043	. . . 4 ⊢ ((𝐽 ×_t 𝐽) ∈ Top → ∅ ∈ ((nei‘(𝐽 ×_t 𝐽))‘∅))
9	7, 8	syl 17	. . 3 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑀 = ∅) → ∅ ∈ ((nei‘(𝐽 ×_t 𝐽))‘∅))
10		coeq1 5796	. . . . . . 7 ⊢ (𝑀 = ∅ → (𝑀 ∘ 𝑉) = (∅ ∘ 𝑉))
11		co01 6209	. . . . . . 7 ⊢ (∅ ∘ 𝑉) = ∅
12	10, 11	eqtrdi 2782	. . . . . 6 ⊢ (𝑀 = ∅ → (𝑀 ∘ 𝑉) = ∅)
13	12	coeq2d 5801	. . . . 5 ⊢ (𝑀 = ∅ → (𝑉 ∘ (𝑀 ∘ 𝑉)) = (𝑉 ∘ ∅))
14		co02 6208	. . . . 5 ⊢ (𝑉 ∘ ∅) = ∅
15	13, 14	eqtrdi 2782	. . . 4 ⊢ (𝑀 = ∅ → (𝑉 ∘ (𝑀 ∘ 𝑉)) = ∅)
16	15	adantl 481	. . 3 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑀 = ∅) → (𝑉 ∘ (𝑀 ∘ 𝑉)) = ∅)
17		simpr 484	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑀 = ∅) → 𝑀 = ∅)
18	17	fveq2d 6826	. . 3 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑀 = ∅) → ((nei‘(𝐽 ×_t 𝐽))‘𝑀) = ((nei‘(𝐽 ×_t 𝐽))‘∅))
19	9, 16, 18	3eltr4d 2846	. 2 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑀 = ∅) → (𝑉 ∘ (𝑀 ∘ 𝑉)) ∈ ((nei‘(𝐽 ×_t 𝐽))‘𝑀))
20	6	adantr 480	. . . . . 6 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → (𝐽 ×_t 𝐽) ∈ Top)
21		simpl1 1192	. . . . . . . . . 10 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → 𝑈 ∈ (UnifOn‘𝑋))
22	21, 3	syl 17	. . . . . . . . 9 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → 𝐽 ∈ Top)
23		simpl2l 1227	. . . . . . . . . 10 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → 𝑉 ∈ 𝑈)
24		simp3 1138	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → 𝑀 ⊆ (𝑋 × 𝑋))
25	24	sselda 3929	. . . . . . . . . . 11 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → 𝑟 ∈ (𝑋 × 𝑋))
26		xp1st 7953	. . . . . . . . . . 11 ⊢ (𝑟 ∈ (𝑋 × 𝑋) → (1^st ‘𝑟) ∈ 𝑋)
27	25, 26	syl 17	. . . . . . . . . 10 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → (1^st ‘𝑟) ∈ 𝑋)
28	1	utopsnnei 24164	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ (1^st ‘𝑟) ∈ 𝑋) → (𝑉 “ {(1^st ‘𝑟)}) ∈ ((nei‘𝐽)‘{(1^st ‘𝑟)}))
29	21, 23, 27, 28	syl3anc 1373	. . . . . . . . 9 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → (𝑉 “ {(1^st ‘𝑟)}) ∈ ((nei‘𝐽)‘{(1^st ‘𝑟)}))
30		xp2nd 7954	. . . . . . . . . . 11 ⊢ (𝑟 ∈ (𝑋 × 𝑋) → (2^nd ‘𝑟) ∈ 𝑋)
31	25, 30	syl 17	. . . . . . . . . 10 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → (2^nd ‘𝑟) ∈ 𝑋)
32	1	utopsnnei 24164	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ (2^nd ‘𝑟) ∈ 𝑋) → (𝑉 “ {(2^nd ‘𝑟)}) ∈ ((nei‘𝐽)‘{(2^nd ‘𝑟)}))
33	21, 23, 31, 32	syl3anc 1373	. . . . . . . . 9 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → (𝑉 “ {(2^nd ‘𝑟)}) ∈ ((nei‘𝐽)‘{(2^nd ‘𝑟)}))
34		eqid 2731	. . . . . . . . . 10 ⊢ ∪ 𝐽 = ∪ 𝐽
35	34, 34	neitx 23522	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐽 ∈ Top) ∧ ((𝑉 “ {(1^st ‘𝑟)}) ∈ ((nei‘𝐽)‘{(1^st ‘𝑟)}) ∧ (𝑉 “ {(2^nd ‘𝑟)}) ∈ ((nei‘𝐽)‘{(2^nd ‘𝑟)}))) → ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)})) ∈ ((nei‘(𝐽 ×_t 𝐽))‘({(1^st ‘𝑟)} × {(2^nd ‘𝑟)})))
36	22, 22, 29, 33, 35	syl22anc 838	. . . . . . . 8 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)})) ∈ ((nei‘(𝐽 ×_t 𝐽))‘({(1^st ‘𝑟)} × {(2^nd ‘𝑟)})))
37		fvex 6835	. . . . . . . . . 10 ⊢ (1^st ‘𝑟) ∈ V
38		fvex 6835	. . . . . . . . . 10 ⊢ (2^nd ‘𝑟) ∈ V
39	37, 38	xpsn 7074	. . . . . . . . 9 ⊢ ({(1^st ‘𝑟)} × {(2^nd ‘𝑟)}) = {⟨(1^st ‘𝑟), (2^nd ‘𝑟)⟩}
40	39	fveq2i 6825	. . . . . . . 8 ⊢ ((nei‘(𝐽 ×_t 𝐽))‘({(1^st ‘𝑟)} × {(2^nd ‘𝑟)})) = ((nei‘(𝐽 ×_t 𝐽))‘{⟨(1^st ‘𝑟), (2^nd ‘𝑟)⟩})
41	36, 40	eleqtrdi 2841	. . . . . . 7 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)})) ∈ ((nei‘(𝐽 ×_t 𝐽))‘{⟨(1^st ‘𝑟), (2^nd ‘𝑟)⟩}))
42	24	adantr 480	. . . . . . . . . . 11 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → 𝑀 ⊆ (𝑋 × 𝑋))
43		xpss 5630	. . . . . . . . . . . . 13 ⊢ (𝑋 × 𝑋) ⊆ (V × V)
44		sstr 3938	. . . . . . . . . . . . 13 ⊢ ((𝑀 ⊆ (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ⊆ (V × V)) → 𝑀 ⊆ (V × V))
45	43, 44	mpan2 691	. . . . . . . . . . . 12 ⊢ (𝑀 ⊆ (𝑋 × 𝑋) → 𝑀 ⊆ (V × V))
46		df-rel 5621	. . . . . . . . . . . 12 ⊢ (Rel 𝑀 ↔ 𝑀 ⊆ (V × V))
47	45, 46	sylibr 234	. . . . . . . . . . 11 ⊢ (𝑀 ⊆ (𝑋 × 𝑋) → Rel 𝑀)
48	42, 47	syl 17	. . . . . . . . . 10 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → Rel 𝑀)
49		1st2nd 7971	. . . . . . . . . 10 ⊢ ((Rel 𝑀 ∧ 𝑟 ∈ 𝑀) → 𝑟 = ⟨(1^st ‘𝑟), (2^nd ‘𝑟)⟩)
50	48, 49	sylancom 588	. . . . . . . . 9 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → 𝑟 = ⟨(1^st ‘𝑟), (2^nd ‘𝑟)⟩)
51	50	sneqd 4585	. . . . . . . 8 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → {𝑟} = {⟨(1^st ‘𝑟), (2^nd ‘𝑟)⟩})
52	51	fveq2d 6826	. . . . . . 7 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → ((nei‘(𝐽 ×_t 𝐽))‘{𝑟}) = ((nei‘(𝐽 ×_t 𝐽))‘{⟨(1^st ‘𝑟), (2^nd ‘𝑟)⟩}))
53	41, 52	eleqtrrd 2834	. . . . . 6 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)})) ∈ ((nei‘(𝐽 ×_t 𝐽))‘{𝑟}))
54		relxp 5632	. . . . . . . . . . 11 ⊢ Rel ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))
55	54	a1i 11	. . . . . . . . . 10 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → Rel ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)})))
56		1st2nd 7971	. . . . . . . . . 10 ⊢ ((Rel ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)})) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
57	55, 56	sylancom 588	. . . . . . . . 9 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
58		simpll2 1214	. . . . . . . . . . . . 13 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉))
59	58	simprd 495	. . . . . . . . . . . 12 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → ^◡𝑉 = 𝑉)
60		simpll1 1213	. . . . . . . . . . . . . 14 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → 𝑈 ∈ (UnifOn‘𝑋))
61	58	simpld 494	. . . . . . . . . . . . . 14 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → 𝑉 ∈ 𝑈)
62		ustrel 24127	. . . . . . . . . . . . . 14 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → Rel 𝑉)
63	60, 61, 62	syl2anc 584	. . . . . . . . . . . . 13 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → Rel 𝑉)
64		xp1st 7953	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)})) → (1^st ‘𝑧) ∈ (𝑉 “ {(1^st ‘𝑟)}))
65	64	adantl 481	. . . . . . . . . . . . 13 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → (1^st ‘𝑧) ∈ (𝑉 “ {(1^st ‘𝑟)}))
66		elrelimasn 6034	. . . . . . . . . . . . . 14 ⊢ (Rel 𝑉 → ((1^st ‘𝑧) ∈ (𝑉 “ {(1^st ‘𝑟)}) ↔ (1^st ‘𝑟)𝑉(1^st ‘𝑧)))
67	66	biimpa 476	. . . . . . . . . . . . 13 ⊢ ((Rel 𝑉 ∧ (1^st ‘𝑧) ∈ (𝑉 “ {(1^st ‘𝑟)})) → (1^st ‘𝑟)𝑉(1^st ‘𝑧))
68	63, 65, 67	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → (1^st ‘𝑟)𝑉(1^st ‘𝑧))
69		fvex 6835	. . . . . . . . . . . . . . 15 ⊢ (1^st ‘𝑧) ∈ V
70	37, 69	brcnv 5821	. . . . . . . . . . . . . 14 ⊢ ((1^st ‘𝑟)^◡𝑉(1^st ‘𝑧) ↔ (1^st ‘𝑧)𝑉(1^st ‘𝑟))
71		breq 5091	. . . . . . . . . . . . . 14 ⊢ (^◡𝑉 = 𝑉 → ((1^st ‘𝑟)^◡𝑉(1^st ‘𝑧) ↔ (1^st ‘𝑟)𝑉(1^st ‘𝑧)))
72	70, 71	bitr3id 285	. . . . . . . . . . . . 13 ⊢ (^◡𝑉 = 𝑉 → ((1^st ‘𝑧)𝑉(1^st ‘𝑟) ↔ (1^st ‘𝑟)𝑉(1^st ‘𝑧)))
73	72	biimpar 477	. . . . . . . . . . . 12 ⊢ ((^◡𝑉 = 𝑉 ∧ (1^st ‘𝑟)𝑉(1^st ‘𝑧)) → (1^st ‘𝑧)𝑉(1^st ‘𝑟))
74	59, 68, 73	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → (1^st ‘𝑧)𝑉(1^st ‘𝑟))
75		simpll3 1215	. . . . . . . . . . . 12 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → 𝑀 ⊆ (𝑋 × 𝑋))
76		simplr 768	. . . . . . . . . . . 12 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → 𝑟 ∈ 𝑀)
77		1st2ndbr 7974	. . . . . . . . . . . . 13 ⊢ ((Rel 𝑀 ∧ 𝑟 ∈ 𝑀) → (1^st ‘𝑟)𝑀(2^nd ‘𝑟))
78	47, 77	sylan 580	. . . . . . . . . . . 12 ⊢ ((𝑀 ⊆ (𝑋 × 𝑋) ∧ 𝑟 ∈ 𝑀) → (1^st ‘𝑟)𝑀(2^nd ‘𝑟))
79	75, 76, 78	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → (1^st ‘𝑟)𝑀(2^nd ‘𝑟))
80		xp2nd 7954	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)})) → (2^nd ‘𝑧) ∈ (𝑉 “ {(2^nd ‘𝑟)}))
81	80	adantl 481	. . . . . . . . . . . 12 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → (2^nd ‘𝑧) ∈ (𝑉 “ {(2^nd ‘𝑟)}))
82		elrelimasn 6034	. . . . . . . . . . . . 13 ⊢ (Rel 𝑉 → ((2^nd ‘𝑧) ∈ (𝑉 “ {(2^nd ‘𝑟)}) ↔ (2^nd ‘𝑟)𝑉(2^nd ‘𝑧)))
83	82	biimpa 476	. . . . . . . . . . . 12 ⊢ ((Rel 𝑉 ∧ (2^nd ‘𝑧) ∈ (𝑉 “ {(2^nd ‘𝑟)})) → (2^nd ‘𝑟)𝑉(2^nd ‘𝑧))
84	63, 81, 83	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → (2^nd ‘𝑟)𝑉(2^nd ‘𝑧))
85	69, 38, 37	3pm3.2i 1340	. . . . . . . . . . . . 13 ⊢ ((1^st ‘𝑧) ∈ V ∧ (2^nd ‘𝑟) ∈ V ∧ (1^st ‘𝑟) ∈ V)
86		brcogw 5807	. . . . . . . . . . . . 13 ⊢ ((((1^st ‘𝑧) ∈ V ∧ (2^nd ‘𝑟) ∈ V ∧ (1^st ‘𝑟) ∈ V) ∧ ((1^st ‘𝑧)𝑉(1^st ‘𝑟) ∧ (1^st ‘𝑟)𝑀(2^nd ‘𝑟))) → (1^st ‘𝑧)(𝑀 ∘ 𝑉)(2^nd ‘𝑟))
87	85, 86	mpan 690	. . . . . . . . . . . 12 ⊢ (((1^st ‘𝑧)𝑉(1^st ‘𝑟) ∧ (1^st ‘𝑟)𝑀(2^nd ‘𝑟)) → (1^st ‘𝑧)(𝑀 ∘ 𝑉)(2^nd ‘𝑟))
88		fvex 6835	. . . . . . . . . . . . . 14 ⊢ (2^nd ‘𝑧) ∈ V
89	69, 88, 38	3pm3.2i 1340	. . . . . . . . . . . . 13 ⊢ ((1^st ‘𝑧) ∈ V ∧ (2^nd ‘𝑧) ∈ V ∧ (2^nd ‘𝑟) ∈ V)
90		brcogw 5807	. . . . . . . . . . . . 13 ⊢ ((((1^st ‘𝑧) ∈ V ∧ (2^nd ‘𝑧) ∈ V ∧ (2^nd ‘𝑟) ∈ V) ∧ ((1^st ‘𝑧)(𝑀 ∘ 𝑉)(2^nd ‘𝑟) ∧ (2^nd ‘𝑟)𝑉(2^nd ‘𝑧))) → (1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧))
91	89, 90	mpan 690	. . . . . . . . . . . 12 ⊢ (((1^st ‘𝑧)(𝑀 ∘ 𝑉)(2^nd ‘𝑟) ∧ (2^nd ‘𝑟)𝑉(2^nd ‘𝑧)) → (1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧))
92	87, 91	sylan 580	. . . . . . . . . . 11 ⊢ ((((1^st ‘𝑧)𝑉(1^st ‘𝑟) ∧ (1^st ‘𝑟)𝑀(2^nd ‘𝑟)) ∧ (2^nd ‘𝑟)𝑉(2^nd ‘𝑧)) → (1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧))
93	74, 79, 84, 92	syl21anc 837	. . . . . . . . . 10 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → (1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧))
94		df-br 5090	. . . . . . . . . 10 ⊢ ((1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧) ↔ ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ ∈ (𝑉 ∘ (𝑀 ∘ 𝑉)))
95	93, 94	sylib 218	. . . . . . . . 9 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ ∈ (𝑉 ∘ (𝑀 ∘ 𝑉)))
96	57, 95	eqeltrd 2831	. . . . . . . 8 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) ∧ 𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)}))) → 𝑧 ∈ (𝑉 ∘ (𝑀 ∘ 𝑉)))
97	96	ex 412	. . . . . . 7 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → (𝑧 ∈ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)})) → 𝑧 ∈ (𝑉 ∘ (𝑀 ∘ 𝑉))))
98	97	ssrdv 3935	. . . . . 6 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)})) ⊆ (𝑉 ∘ (𝑀 ∘ 𝑉)))
99		simp1 1136	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → 𝑈 ∈ (UnifOn‘𝑋))
100		simp2l 1200	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → 𝑉 ∈ 𝑈)
101		ustssxp 24120	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → 𝑉 ⊆ (𝑋 × 𝑋))
102	99, 100, 101	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → 𝑉 ⊆ (𝑋 × 𝑋))
103		coss1 5794	. . . . . . . . . 10 ⊢ (𝑉 ⊆ (𝑋 × 𝑋) → (𝑉 ∘ (𝑀 ∘ 𝑉)) ⊆ ((𝑋 × 𝑋) ∘ (𝑀 ∘ 𝑉)))
104	102, 103	syl 17	. . . . . . . . 9 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → (𝑉 ∘ (𝑀 ∘ 𝑉)) ⊆ ((𝑋 × 𝑋) ∘ (𝑀 ∘ 𝑉)))
105		coss1 5794	. . . . . . . . . . . 12 ⊢ (𝑀 ⊆ (𝑋 × 𝑋) → (𝑀 ∘ 𝑉) ⊆ ((𝑋 × 𝑋) ∘ 𝑉))
106	24, 105	syl 17	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → (𝑀 ∘ 𝑉) ⊆ ((𝑋 × 𝑋) ∘ 𝑉))
107		coss2 5795	. . . . . . . . . . . . 13 ⊢ (𝑉 ⊆ (𝑋 × 𝑋) → ((𝑋 × 𝑋) ∘ 𝑉) ⊆ ((𝑋 × 𝑋) ∘ (𝑋 × 𝑋)))
108		xpcoid 6237	. . . . . . . . . . . . 13 ⊢ ((𝑋 × 𝑋) ∘ (𝑋 × 𝑋)) = (𝑋 × 𝑋)
109	107, 108	sseqtrdi 3970	. . . . . . . . . . . 12 ⊢ (𝑉 ⊆ (𝑋 × 𝑋) → ((𝑋 × 𝑋) ∘ 𝑉) ⊆ (𝑋 × 𝑋))
110	102, 109	syl 17	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → ((𝑋 × 𝑋) ∘ 𝑉) ⊆ (𝑋 × 𝑋))
111	106, 110	sstrd 3940	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → (𝑀 ∘ 𝑉) ⊆ (𝑋 × 𝑋))
112		coss2 5795	. . . . . . . . . . 11 ⊢ ((𝑀 ∘ 𝑉) ⊆ (𝑋 × 𝑋) → ((𝑋 × 𝑋) ∘ (𝑀 ∘ 𝑉)) ⊆ ((𝑋 × 𝑋) ∘ (𝑋 × 𝑋)))
113	112, 108	sseqtrdi 3970	. . . . . . . . . 10 ⊢ ((𝑀 ∘ 𝑉) ⊆ (𝑋 × 𝑋) → ((𝑋 × 𝑋) ∘ (𝑀 ∘ 𝑉)) ⊆ (𝑋 × 𝑋))
114	111, 113	syl 17	. . . . . . . . 9 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → ((𝑋 × 𝑋) ∘ (𝑀 ∘ 𝑉)) ⊆ (𝑋 × 𝑋))
115	104, 114	sstrd 3940	. . . . . . . 8 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → (𝑉 ∘ (𝑀 ∘ 𝑉)) ⊆ (𝑋 × 𝑋))
116		utopbas 24150	. . . . . . . . . . . 12 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 = ∪ (unifTop‘𝑈))
117	1	unieqi 4868	. . . . . . . . . . . 12 ⊢ ∪ 𝐽 = ∪ (unifTop‘𝑈)
118	116, 117	eqtr4di 2784	. . . . . . . . . . 11 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 = ∪ 𝐽)
119	118	sqxpeqd 5646	. . . . . . . . . 10 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑋 × 𝑋) = (∪ 𝐽 × ∪ 𝐽))
120	34, 34	txuni 23507	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝐽 ∈ Top) → (∪ 𝐽 × ∪ 𝐽) = ∪ (𝐽 ×_t 𝐽))
121	3, 3, 120	syl2anc 584	. . . . . . . . . 10 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (∪ 𝐽 × ∪ 𝐽) = ∪ (𝐽 ×_t 𝐽))
122	119, 121	eqtrd 2766	. . . . . . . . 9 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑋 × 𝑋) = ∪ (𝐽 ×_t 𝐽))
123	122	3ad2ant1 1133	. . . . . . . 8 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → (𝑋 × 𝑋) = ∪ (𝐽 ×_t 𝐽))
124	115, 123	sseqtrd 3966	. . . . . . 7 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → (𝑉 ∘ (𝑀 ∘ 𝑉)) ⊆ ∪ (𝐽 ×_t 𝐽))
125	124	adantr 480	. . . . . 6 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → (𝑉 ∘ (𝑀 ∘ 𝑉)) ⊆ ∪ (𝐽 ×_t 𝐽))
126		eqid 2731	. . . . . . 7 ⊢ ∪ (𝐽 ×_t 𝐽) = ∪ (𝐽 ×_t 𝐽)
127	126	ssnei2 23031	. . . . . 6 ⊢ ((((𝐽 ×_t 𝐽) ∈ Top ∧ ((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)})) ∈ ((nei‘(𝐽 ×_t 𝐽))‘{𝑟})) ∧ (((𝑉 “ {(1^st ‘𝑟)}) × (𝑉 “ {(2^nd ‘𝑟)})) ⊆ (𝑉 ∘ (𝑀 ∘ 𝑉)) ∧ (𝑉 ∘ (𝑀 ∘ 𝑉)) ⊆ ∪ (𝐽 ×_t 𝐽))) → (𝑉 ∘ (𝑀 ∘ 𝑉)) ∈ ((nei‘(𝐽 ×_t 𝐽))‘{𝑟}))
128	20, 53, 98, 125, 127	syl22anc 838	. . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑟 ∈ 𝑀) → (𝑉 ∘ (𝑀 ∘ 𝑉)) ∈ ((nei‘(𝐽 ×_t 𝐽))‘{𝑟}))
129	128	ralrimiva 3124	. . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → ∀𝑟 ∈ 𝑀 (𝑉 ∘ (𝑀 ∘ 𝑉)) ∈ ((nei‘(𝐽 ×_t 𝐽))‘{𝑟}))
130	129	adantr 480	. . 3 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑀 ≠ ∅) → ∀𝑟 ∈ 𝑀 (𝑉 ∘ (𝑀 ∘ 𝑉)) ∈ ((nei‘(𝐽 ×_t 𝐽))‘{𝑟}))
131	6	adantr 480	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑀 ≠ ∅) → (𝐽 ×_t 𝐽) ∈ Top)
132	24, 123	sseqtrd 3966	. . . . 5 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → 𝑀 ⊆ ∪ (𝐽 ×_t 𝐽))
133	132	adantr 480	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑀 ≠ ∅) → 𝑀 ⊆ ∪ (𝐽 ×_t 𝐽))
134		simpr 484	. . . 4 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑀 ≠ ∅) → 𝑀 ≠ ∅)
135	126	neips 23028	. . . 4 ⊢ (((𝐽 ×_t 𝐽) ∈ Top ∧ 𝑀 ⊆ ∪ (𝐽 ×_t 𝐽) ∧ 𝑀 ≠ ∅) → ((𝑉 ∘ (𝑀 ∘ 𝑉)) ∈ ((nei‘(𝐽 ×_t 𝐽))‘𝑀) ↔ ∀𝑟 ∈ 𝑀 (𝑉 ∘ (𝑀 ∘ 𝑉)) ∈ ((nei‘(𝐽 ×_t 𝐽))‘{𝑟})))
136	131, 133, 134, 135	syl3anc 1373	. . 3 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑀 ≠ ∅) → ((𝑉 ∘ (𝑀 ∘ 𝑉)) ∈ ((nei‘(𝐽 ×_t 𝐽))‘𝑀) ↔ ∀𝑟 ∈ 𝑀 (𝑉 ∘ (𝑀 ∘ 𝑉)) ∈ ((nei‘(𝐽 ×_t 𝐽))‘{𝑟})))
137	130, 136	mpbird 257	. 2 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ 𝑀 ≠ ∅) → (𝑉 ∘ (𝑀 ∘ 𝑉)) ∈ ((nei‘(𝐽 ×_t 𝐽))‘𝑀))
138	19, 137	pm2.61dane 3015	1 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) → (𝑉 ∘ (𝑀 ∘ 𝑉)) ∈ ((nei‘(𝐽 ×_t 𝐽))‘𝑀))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ≠ wne 2928 ∀wral 3047 Vcvv 3436 ⊆ wss 3897 ∅c0 4280 {csn 4573 ⟨cop 4579 ∪ cuni 4856 class class class wbr 5089 × cxp 5612 ^◡ccnv 5613 “ cima 5617 ∘ ccom 5618 Rel wrel 5619 ‘cfv 6481 (class class class)co 7346 1^st c1st 7919 2^nd c2nd 7920 Topctop 22808 neicnei 23012 ×_t ctx 23475 UnifOncust 24115 unifTopcutop 24145

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-int 4896 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-1st 7921 df-2nd 7922 df-1o 8385 df-2o 8386 df-en 8870 df-fin 8873 df-fi 9295 df-topgen 17347 df-top 22809 df-topon 22826 df-bases 22861 df-nei 23013 df-tx 23477 df-ust 24116 df-utop 24146

This theorem is referenced by: (None)

W3C validator