utop3cls - Metamath Proof Explorer

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

Theorem utop3cls 23976

Description: Relation between a topological closure and a symmetric entourage in an uniform space. Second part of proposition 2 of [BourbakiTop1] p. II.4. (Contributed by Thierry Arnoux, 17-Jan-2018.)

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

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

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

Step	Hyp	Ref	Expression
1		relxp 5693	. . . . 5 ⊢ Rel (𝑋 × 𝑋)
2		utoptop.1	. . . . . . . . . . 11 ⊢ 𝐽 = (unifTop‘𝑈)
3		utoptop 23959	. . . . . . . . . . 11 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) ∈ Top)
4	2, 3	eqeltrid 2835	. . . . . . . . . 10 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝐽 ∈ Top)
5		txtop 23293	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝐽 ∈ Top) → (𝐽 ×_t 𝐽) ∈ Top)
6	4, 4, 5	syl2anc 582	. . . . . . . . 9 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝐽 ×_t 𝐽) ∈ Top)
7	6	ad3antrrr 726	. . . . . . . 8 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → (𝐽 ×_t 𝐽) ∈ Top)
8		simpllr 772	. . . . . . . . 9 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → 𝑀 ⊆ (𝑋 × 𝑋))
9		utoptopon 23961	. . . . . . . . . . . . . 14 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (unifTop‘𝑈) ∈ (TopOn‘𝑋))
10	2, 9	eqeltrid 2835	. . . . . . . . . . . . 13 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝐽 ∈ (TopOn‘𝑋))
11		toponuni 22636	. . . . . . . . . . . . 13 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
12	10, 11	syl 17	. . . . . . . . . . . 12 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 = ∪ 𝐽)
13	12	sqxpeqd 5707	. . . . . . . . . . 11 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑋 × 𝑋) = (∪ 𝐽 × ∪ 𝐽))
14		eqid 2730	. . . . . . . . . . . . 13 ⊢ ∪ 𝐽 = ∪ 𝐽
15	14, 14	txuni 23316	. . . . . . . . . . . 12 ⊢ ((𝐽 ∈ Top ∧ 𝐽 ∈ Top) → (∪ 𝐽 × ∪ 𝐽) = ∪ (𝐽 ×_t 𝐽))
16	4, 4, 15	syl2anc 582	. . . . . . . . . . 11 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (∪ 𝐽 × ∪ 𝐽) = ∪ (𝐽 ×_t 𝐽))
17	13, 16	eqtrd 2770	. . . . . . . . . 10 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑋 × 𝑋) = ∪ (𝐽 ×_t 𝐽))
18	17	ad3antrrr 726	. . . . . . . . 9 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → (𝑋 × 𝑋) = ∪ (𝐽 ×_t 𝐽))
19	8, 18	sseqtrd 4021	. . . . . . . 8 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → 𝑀 ⊆ ∪ (𝐽 ×_t 𝐽))
20		eqid 2730	. . . . . . . . 9 ⊢ ∪ (𝐽 ×_t 𝐽) = ∪ (𝐽 ×_t 𝐽)
21	20	clsss3 22783	. . . . . . . 8 ⊢ (((𝐽 ×_t 𝐽) ∈ Top ∧ 𝑀 ⊆ ∪ (𝐽 ×_t 𝐽)) → ((cls‘(𝐽 ×_t 𝐽))‘𝑀) ⊆ ∪ (𝐽 ×_t 𝐽))
22	7, 19, 21	syl2anc 582	. . . . . . 7 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → ((cls‘(𝐽 ×_t 𝐽))‘𝑀) ⊆ ∪ (𝐽 ×_t 𝐽))
23	22, 18	sseqtrrd 4022	. . . . . 6 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → ((cls‘(𝐽 ×_t 𝐽))‘𝑀) ⊆ (𝑋 × 𝑋))
24		simpr 483	. . . . . 6 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀))
25	23, 24	sseldd 3982	. . . . 5 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → 𝑧 ∈ (𝑋 × 𝑋))
26		1st2nd 8027	. . . . 5 ⊢ ((Rel (𝑋 × 𝑋) ∧ 𝑧 ∈ (𝑋 × 𝑋)) → 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
27	1, 25, 26	sylancr 585	. . . 4 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
28		simp-4l 779	. . . . . . . . . 10 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → 𝑈 ∈ (UnifOn‘𝑋))
29		simpr1l 1228	. . . . . . . . . . 11 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ ((𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀))) → 𝑉 ∈ 𝑈)
30	29	3anassrs 1358	. . . . . . . . . 10 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → 𝑉 ∈ 𝑈)
31		ustrel 23936	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → Rel 𝑉)
32	28, 30, 31	syl2anc 582	. . . . . . . . 9 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → Rel 𝑉)
33		simpr 483	. . . . . . . . . . . 12 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀))
34		elin 3963	. . . . . . . . . . . 12 ⊢ (𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀) ↔ (𝑟 ∈ ((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∧ 𝑟 ∈ 𝑀))
35	33, 34	sylib 217	. . . . . . . . . . 11 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → (𝑟 ∈ ((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∧ 𝑟 ∈ 𝑀))
36	35	simpld 493	. . . . . . . . . 10 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → 𝑟 ∈ ((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})))
37		xp1st 8009	. . . . . . . . . 10 ⊢ (𝑟 ∈ ((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) → (1^st ‘𝑟) ∈ (𝑉 “ {(1^st ‘𝑧)}))
38	36, 37	syl 17	. . . . . . . . 9 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → (1^st ‘𝑟) ∈ (𝑉 “ {(1^st ‘𝑧)}))
39		elrelimasn 6083	. . . . . . . . . 10 ⊢ (Rel 𝑉 → ((1^st ‘𝑟) ∈ (𝑉 “ {(1^st ‘𝑧)}) ↔ (1^st ‘𝑧)𝑉(1^st ‘𝑟)))
40	39	biimpa 475	. . . . . . . . 9 ⊢ ((Rel 𝑉 ∧ (1^st ‘𝑟) ∈ (𝑉 “ {(1^st ‘𝑧)})) → (1^st ‘𝑧)𝑉(1^st ‘𝑟))
41	32, 38, 40	syl2anc 582	. . . . . . . 8 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → (1^st ‘𝑧)𝑉(1^st ‘𝑟))
42		simp-4r 780	. . . . . . . . . . 11 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → 𝑀 ⊆ (𝑋 × 𝑋))
43		xpss 5691	. . . . . . . . . . 11 ⊢ (𝑋 × 𝑋) ⊆ (V × V)
44	42, 43	sstrdi 3993	. . . . . . . . . 10 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → 𝑀 ⊆ (V × V))
45		df-rel 5682	. . . . . . . . . 10 ⊢ (Rel 𝑀 ↔ 𝑀 ⊆ (V × V))
46	44, 45	sylibr 233	. . . . . . . . 9 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → Rel 𝑀)
47	35	simprd 494	. . . . . . . . 9 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → 𝑟 ∈ 𝑀)
48		1st2ndbr 8030	. . . . . . . . 9 ⊢ ((Rel 𝑀 ∧ 𝑟 ∈ 𝑀) → (1^st ‘𝑟)𝑀(2^nd ‘𝑟))
49	46, 47, 48	syl2anc 582	. . . . . . . 8 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → (1^st ‘𝑟)𝑀(2^nd ‘𝑟))
50		xp2nd 8010	. . . . . . . . . . 11 ⊢ (𝑟 ∈ ((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) → (2^nd ‘𝑟) ∈ (𝑉 “ {(2^nd ‘𝑧)}))
51	36, 50	syl 17	. . . . . . . . . 10 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → (2^nd ‘𝑟) ∈ (𝑉 “ {(2^nd ‘𝑧)}))
52		elrelimasn 6083	. . . . . . . . . . 11 ⊢ (Rel 𝑉 → ((2^nd ‘𝑟) ∈ (𝑉 “ {(2^nd ‘𝑧)}) ↔ (2^nd ‘𝑧)𝑉(2^nd ‘𝑟)))
53	52	biimpa 475	. . . . . . . . . 10 ⊢ ((Rel 𝑉 ∧ (2^nd ‘𝑟) ∈ (𝑉 “ {(2^nd ‘𝑧)})) → (2^nd ‘𝑧)𝑉(2^nd ‘𝑟))
54	32, 51, 53	syl2anc 582	. . . . . . . . 9 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → (2^nd ‘𝑧)𝑉(2^nd ‘𝑟))
55		simpr1r 1229	. . . . . . . . . . 11 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ ((𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀))) → ^◡𝑉 = 𝑉)
56	55	3anassrs 1358	. . . . . . . . . 10 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → ^◡𝑉 = 𝑉)
57		breq 5149	. . . . . . . . . . 11 ⊢ (^◡𝑉 = 𝑉 → ((2^nd ‘𝑟)^◡𝑉(2^nd ‘𝑧) ↔ (2^nd ‘𝑟)𝑉(2^nd ‘𝑧)))
58		fvex 6903	. . . . . . . . . . . 12 ⊢ (2^nd ‘𝑟) ∈ V
59		fvex 6903	. . . . . . . . . . . 12 ⊢ (2^nd ‘𝑧) ∈ V
60	58, 59	brcnv 5881	. . . . . . . . . . 11 ⊢ ((2^nd ‘𝑟)^◡𝑉(2^nd ‘𝑧) ↔ (2^nd ‘𝑧)𝑉(2^nd ‘𝑟))
61	57, 60	bitr3di 285	. . . . . . . . . 10 ⊢ (^◡𝑉 = 𝑉 → ((2^nd ‘𝑟)𝑉(2^nd ‘𝑧) ↔ (2^nd ‘𝑧)𝑉(2^nd ‘𝑟)))
62	56, 61	syl 17	. . . . . . . . 9 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → ((2^nd ‘𝑟)𝑉(2^nd ‘𝑧) ↔ (2^nd ‘𝑧)𝑉(2^nd ‘𝑟)))
63	54, 62	mpbird 256	. . . . . . . 8 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → (2^nd ‘𝑟)𝑉(2^nd ‘𝑧))
64		fvex 6903	. . . . . . . . . 10 ⊢ (1^st ‘𝑧) ∈ V
65		fvex 6903	. . . . . . . . . 10 ⊢ (1^st ‘𝑟) ∈ V
66		brcogw 5867	. . . . . . . . . . 11 ⊢ ((((1^st ‘𝑧) ∈ V ∧ (2^nd ‘𝑟) ∈ V ∧ (1^st ‘𝑟) ∈ V) ∧ ((1^st ‘𝑧)𝑉(1^st ‘𝑟) ∧ (1^st ‘𝑟)𝑀(2^nd ‘𝑟))) → (1^st ‘𝑧)(𝑀 ∘ 𝑉)(2^nd ‘𝑟))
67	66	ex 411	. . . . . . . . . 10 ⊢ (((1^st ‘𝑧) ∈ V ∧ (2^nd ‘𝑟) ∈ V ∧ (1^st ‘𝑟) ∈ V) → (((1^st ‘𝑧)𝑉(1^st ‘𝑟) ∧ (1^st ‘𝑟)𝑀(2^nd ‘𝑟)) → (1^st ‘𝑧)(𝑀 ∘ 𝑉)(2^nd ‘𝑟)))
68	64, 58, 65, 67	mp3an 1459	. . . . . . . . 9 ⊢ (((1^st ‘𝑧)𝑉(1^st ‘𝑟) ∧ (1^st ‘𝑟)𝑀(2^nd ‘𝑟)) → (1^st ‘𝑧)(𝑀 ∘ 𝑉)(2^nd ‘𝑟))
69		brcogw 5867	. . . . . . . . . . 11 ⊢ ((((1^st ‘𝑧) ∈ V ∧ (2^nd ‘𝑧) ∈ V ∧ (2^nd ‘𝑟) ∈ V) ∧ ((1^st ‘𝑧)(𝑀 ∘ 𝑉)(2^nd ‘𝑟) ∧ (2^nd ‘𝑟)𝑉(2^nd ‘𝑧))) → (1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧))
70	69	ex 411	. . . . . . . . . 10 ⊢ (((1^st ‘𝑧) ∈ V ∧ (2^nd ‘𝑧) ∈ V ∧ (2^nd ‘𝑟) ∈ V) → (((1^st ‘𝑧)(𝑀 ∘ 𝑉)(2^nd ‘𝑟) ∧ (2^nd ‘𝑟)𝑉(2^nd ‘𝑧)) → (1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧)))
71	64, 59, 58, 70	mp3an 1459	. . . . . . . . 9 ⊢ (((1^st ‘𝑧)(𝑀 ∘ 𝑉)(2^nd ‘𝑟) ∧ (2^nd ‘𝑟)𝑉(2^nd ‘𝑧)) → (1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧))
72	68, 71	sylan 578	. . . . . . . 8 ⊢ ((((1^st ‘𝑧)𝑉(1^st ‘𝑟) ∧ (1^st ‘𝑟)𝑀(2^nd ‘𝑟)) ∧ (2^nd ‘𝑟)𝑉(2^nd ‘𝑧)) → (1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧))
73	41, 49, 63, 72	syl21anc 834	. . . . . . 7 ⊢ (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) ∧ 𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)) → (1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧))
74	73	ralrimiva 3144	. . . . . 6 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → ∀𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)(1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧))
75		simplll 771	. . . . . . . . 9 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → 𝑈 ∈ (UnifOn‘𝑋))
76		simplrl 773	. . . . . . . . 9 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → 𝑉 ∈ 𝑈)
77	4	3ad2ant1 1131	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝑧 ∈ (𝑋 × 𝑋)) → 𝐽 ∈ Top)
78		xp1st 8009	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (𝑋 × 𝑋) → (1^st ‘𝑧) ∈ 𝑋)
79	2	utopsnnei 23974	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ (1^st ‘𝑧) ∈ 𝑋) → (𝑉 “ {(1^st ‘𝑧)}) ∈ ((nei‘𝐽)‘{(1^st ‘𝑧)}))
80	78, 79	syl3an3 1163	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝑧 ∈ (𝑋 × 𝑋)) → (𝑉 “ {(1^st ‘𝑧)}) ∈ ((nei‘𝐽)‘{(1^st ‘𝑧)}))
81		xp2nd 8010	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (𝑋 × 𝑋) → (2^nd ‘𝑧) ∈ 𝑋)
82	2	utopsnnei 23974	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ (2^nd ‘𝑧) ∈ 𝑋) → (𝑉 “ {(2^nd ‘𝑧)}) ∈ ((nei‘𝐽)‘{(2^nd ‘𝑧)}))
83	81, 82	syl3an3 1163	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝑧 ∈ (𝑋 × 𝑋)) → (𝑉 “ {(2^nd ‘𝑧)}) ∈ ((nei‘𝐽)‘{(2^nd ‘𝑧)}))
84	14, 14	neitx 23331	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝐽 ∈ Top) ∧ ((𝑉 “ {(1^st ‘𝑧)}) ∈ ((nei‘𝐽)‘{(1^st ‘𝑧)}) ∧ (𝑉 “ {(2^nd ‘𝑧)}) ∈ ((nei‘𝐽)‘{(2^nd ‘𝑧)}))) → ((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∈ ((nei‘(𝐽 ×_t 𝐽))‘({(1^st ‘𝑧)} × {(2^nd ‘𝑧)})))
85	77, 77, 80, 83, 84	syl22anc 835	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝑧 ∈ (𝑋 × 𝑋)) → ((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∈ ((nei‘(𝐽 ×_t 𝐽))‘({(1^st ‘𝑧)} × {(2^nd ‘𝑧)})))
86		1st2nd2 8016	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ (𝑋 × 𝑋) → 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
87	86	sneqd 4639	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ (𝑋 × 𝑋) → {𝑧} = {⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩})
88	64, 59	xpsn 7140	. . . . . . . . . . . . 13 ⊢ ({(1^st ‘𝑧)} × {(2^nd ‘𝑧)}) = {⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩}
89	87, 88	eqtr4di 2788	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ (𝑋 × 𝑋) → {𝑧} = ({(1^st ‘𝑧)} × {(2^nd ‘𝑧)}))
90	89	fveq2d 6894	. . . . . . . . . . 11 ⊢ (𝑧 ∈ (𝑋 × 𝑋) → ((nei‘(𝐽 ×_t 𝐽))‘{𝑧}) = ((nei‘(𝐽 ×_t 𝐽))‘({(1^st ‘𝑧)} × {(2^nd ‘𝑧)})))
91	90	3ad2ant3 1133	. . . . . . . . . 10 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝑧 ∈ (𝑋 × 𝑋)) → ((nei‘(𝐽 ×_t 𝐽))‘{𝑧}) = ((nei‘(𝐽 ×_t 𝐽))‘({(1^st ‘𝑧)} × {(2^nd ‘𝑧)})))
92	85, 91	eleqtrrd 2834	. . . . . . . . 9 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈 ∧ 𝑧 ∈ (𝑋 × 𝑋)) → ((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∈ ((nei‘(𝐽 ×_t 𝐽))‘{𝑧}))
93	75, 76, 25, 92	syl3anc 1369	. . . . . . . 8 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → ((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∈ ((nei‘(𝐽 ×_t 𝐽))‘{𝑧}))
94	20	neindisj 22841	. . . . . . . 8 ⊢ ((((𝐽 ×_t 𝐽) ∈ Top ∧ 𝑀 ⊆ ∪ (𝐽 ×_t 𝐽)) ∧ (𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀) ∧ ((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∈ ((nei‘(𝐽 ×_t 𝐽))‘{𝑧}))) → (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀) ≠ ∅)
95	7, 19, 24, 93, 94	syl22anc 835	. . . . . . 7 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀) ≠ ∅)
96		r19.3rzv 4497	. . . . . . 7 ⊢ ((((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀) ≠ ∅ → ((1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧) ↔ ∀𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)(1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧)))
97	95, 96	syl 17	. . . . . 6 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → ((1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧) ↔ ∀𝑟 ∈ (((𝑉 “ {(1^st ‘𝑧)}) × (𝑉 “ {(2^nd ‘𝑧)})) ∩ 𝑀)(1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧)))
98	74, 97	mpbird 256	. . . . 5 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → (1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧))
99		df-br 5148	. . . . 5 ⊢ ((1^st ‘𝑧)(𝑉 ∘ (𝑀 ∘ 𝑉))(2^nd ‘𝑧) ↔ ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ ∈ (𝑉 ∘ (𝑀 ∘ 𝑉)))
100	98, 99	sylib 217	. . . 4 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ ∈ (𝑉 ∘ (𝑀 ∘ 𝑉)))
101	27, 100	eqeltrd 2831	. . 3 ⊢ ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) ∧ 𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀)) → 𝑧 ∈ (𝑉 ∘ (𝑀 ∘ 𝑉)))
102	101	ex 411	. 2 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) → (𝑧 ∈ ((cls‘(𝐽 ×_t 𝐽))‘𝑀) → 𝑧 ∈ (𝑉 ∘ (𝑀 ∘ 𝑉))))
103	102	ssrdv 3987	1 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑀 ⊆ (𝑋 × 𝑋)) ∧ (𝑉 ∈ 𝑈 ∧ ^◡𝑉 = 𝑉)) → ((cls‘(𝐽 ×_t 𝐽))‘𝑀) ⊆ (𝑉 ∘ (𝑀 ∘ 𝑉)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1085 = wceq 1539 ∈ wcel 2104 ≠ wne 2938 ∀wral 3059 Vcvv 3472 ∩ cin 3946 ⊆ wss 3947 ∅c0 4321 {csn 4627 ⟨cop 4633 ∪ cuni 4907 class class class wbr 5147 × cxp 5673 ^◡ccnv 5674 “ cima 5678 ∘ ccom 5679 Rel wrel 5680 ‘cfv 6542 (class class class)co 7411 1^st c1st 7975 2^nd c2nd 7976 Topctop 22615 TopOnctopon 22632 clsccl 22742 neicnei 22821 ×_t ctx 23284 UnifOncust 23924 unifTopcutop 23955

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-ral 3060 df-rex 3069 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 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-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-1o 8468 df-er 8705 df-en 8942 df-fin 8945 df-fi 9408 df-topgen 17393 df-top 22616 df-topon 22633 df-bases 22669 df-cld 22743 df-ntr 22744 df-cls 22745 df-nei 22822 df-tx 23286 df-ust 23925 df-utop 23956

This theorem is referenced by: utopreg 23977

W3C validator