Theorem txtube 23776

Description: The "tube lemma". If 𝑋 is compact and there is an open set 𝑈 containing the line 𝑋 × {𝐴}, then there is a "tube" 𝑋 × 𝑢 for some neighborhood 𝑢 of 𝐴 which is entirely contained within 𝑈. (Contributed by Mario Carneiro, 21-Mar-2015.)

Hypotheses

Ref	Expression
txtube.x	⊢ 𝑋 = ∪ 𝑅
txtube.y	⊢ 𝑌 = ∪ 𝑆
txtube.r	⊢ (𝜑 → 𝑅 ∈ Comp)
txtube.s	⊢ (𝜑 → 𝑆 ∈ Top)
txtube.w	⊢ (𝜑 → 𝑈 ∈ (𝑅 ×t 𝑆))
txtube.u	⊢ (𝜑 → (𝑋 × {𝐴}) ⊆ 𝑈)
txtube.a	⊢ (𝜑 → 𝐴 ∈ 𝑌)

Assertion

Ref	Expression
txtube	⊢ (𝜑 → ∃𝑢 ∈ 𝑆 (𝐴 ∈ 𝑢 ∧ (𝑋 × 𝑢) ⊆ 𝑈))

Distinct variable groups:   𝑢,𝐴   𝑢,𝑅   𝑢,𝑆   𝑢,𝑌   𝜑,𝑢   𝑢,𝑈   𝑢,𝑋

Proof of Theorem txtube

Dummy variables 𝑡 𝑓 𝑣 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		txtube.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ Comp)
2		eleq1 2849	. . . . . . . 8 ⊢ (𝑦 = ⟨𝑥, 𝐴⟩ → (𝑦 ∈ (𝑢 × 𝑣) ↔ ⟨𝑥, 𝐴⟩ ∈ (𝑢 × 𝑣)))
3	2	anbi1d 642	. . . . . . 7 ⊢ (𝑦 = ⟨𝑥, 𝐴⟩ → ((𝑦 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈) ↔ (⟨𝑥, 𝐴⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈)))
4	3	2rexbidv 3228	. . . . . 6 ⊢ (𝑦 = ⟨𝑥, 𝐴⟩ → (∃𝑢 ∈ 𝑅 ∃𝑣 ∈ 𝑆 (𝑦 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈) ↔ ∃𝑢 ∈ 𝑅 ∃𝑣 ∈ 𝑆 (⟨𝑥, 𝐴⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈)))
5		txtube.w	. . . . . . . 8 ⊢ (𝜑 → 𝑈 ∈ (𝑅 ×t 𝑆))
6		txtube.s	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ∈ Top)
7		eltx 23704	. . . . . . . . 9 ⊢ ((𝑅 ∈ Comp ∧ 𝑆 ∈ Top) → (𝑈 ∈ (𝑅 ×t 𝑆) ↔ ∀𝑦 ∈ 𝑈 ∃𝑢 ∈ 𝑅 ∃𝑣 ∈ 𝑆 (𝑦 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈)))
8	1, 6, 7	syl2anc 595	. . . . . . . 8 ⊢ (𝜑 → (𝑈 ∈ (𝑅 ×t 𝑆) ↔ ∀𝑦 ∈ 𝑈 ∃𝑢 ∈ 𝑅 ∃𝑣 ∈ 𝑆 (𝑦 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈)))
9	5, 8	mpbid 235	. . . . . . 7 ⊢ (𝜑 → ∀𝑦 ∈ 𝑈 ∃𝑢 ∈ 𝑅 ∃𝑣 ∈ 𝑆 (𝑦 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈))
10	9	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑦 ∈ 𝑈 ∃𝑢 ∈ 𝑅 ∃𝑣 ∈ 𝑆 (𝑦 ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈))
11		txtube.u	. . . . . . . 8 ⊢ (𝜑 → (𝑋 × {𝐴}) ⊆ 𝑈)
12	11	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑋 × {𝐴}) ⊆ 𝑈)
13		id 23	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → 𝑥 ∈ 𝑋)
14		txtube.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ 𝑌)
15		snidg 4625	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑌 → 𝐴 ∈ {𝐴})
16	14, 15	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ {𝐴})
17		opelxpi 5698	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝐴 ∈ {𝐴}) → ⟨𝑥, 𝐴⟩ ∈ (𝑋 × {𝐴}))
18	13, 16, 17	syl2anr 608	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ⟨𝑥, 𝐴⟩ ∈ (𝑋 × {𝐴}))
19	12, 18	sseldd 3937	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ⟨𝑥, 𝐴⟩ ∈ 𝑈)
20	4, 10, 19	rspcdva 3581	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∃𝑢 ∈ 𝑅 ∃𝑣 ∈ 𝑆 (⟨𝑥, 𝐴⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈))
21		opelxp 5697	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝐴⟩ ∈ (𝑢 × 𝑣) ↔ (𝑥 ∈ 𝑢 ∧ 𝐴 ∈ 𝑣))
22	21	anbi1i 635	. . . . . . . . 9 ⊢ ((⟨𝑥, 𝐴⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈) ↔ ((𝑥 ∈ 𝑢 ∧ 𝐴 ∈ 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈))
23		anass 473	. . . . . . . . 9 ⊢ (((𝑥 ∈ 𝑢 ∧ 𝐴 ∈ 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈) ↔ (𝑥 ∈ 𝑢 ∧ (𝐴 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ 𝑈)))
24	22, 23	bitri 278	. . . . . . . 8 ⊢ ((⟨𝑥, 𝐴⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈) ↔ (𝑥 ∈ 𝑢 ∧ (𝐴 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ 𝑈)))
25	24	rexbii 3110	. . . . . . 7 ⊢ (∃𝑣 ∈ 𝑆 (⟨𝑥, 𝐴⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈) ↔ ∃𝑣 ∈ 𝑆 (𝑥 ∈ 𝑢 ∧ (𝐴 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ 𝑈)))
26		r19.42v 3195	. . . . . . 7 ⊢ (∃𝑣 ∈ 𝑆 (𝑥 ∈ 𝑢 ∧ (𝐴 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ 𝑈)) ↔ (𝑥 ∈ 𝑢 ∧ ∃𝑣 ∈ 𝑆 (𝐴 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ 𝑈)))
27	25, 26	bitri 278	. . . . . 6 ⊢ (∃𝑣 ∈ 𝑆 (⟨𝑥, 𝐴⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈) ↔ (𝑥 ∈ 𝑢 ∧ ∃𝑣 ∈ 𝑆 (𝐴 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ 𝑈)))
28	27	rexbii 3110	. . . . 5 ⊢ (∃𝑢 ∈ 𝑅 ∃𝑣 ∈ 𝑆 (⟨𝑥, 𝐴⟩ ∈ (𝑢 × 𝑣) ∧ (𝑢 × 𝑣) ⊆ 𝑈) ↔ ∃𝑢 ∈ 𝑅 (𝑥 ∈ 𝑢 ∧ ∃𝑣 ∈ 𝑆 (𝐴 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ 𝑈)))
29	20, 28	sylib 221	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∃𝑢 ∈ 𝑅 (𝑥 ∈ 𝑢 ∧ ∃𝑣 ∈ 𝑆 (𝐴 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ 𝑈)))
30	29	ralrimiva 3155	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑅 (𝑥 ∈ 𝑢 ∧ ∃𝑣 ∈ 𝑆 (𝐴 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ 𝑈)))
31		txtube.x	. . . 4 ⊢ 𝑋 = ∪ 𝑅
32		eleq2 2850	. . . . 5 ⊢ (𝑣 = (𝑓‘𝑢) → (𝐴 ∈ 𝑣 ↔ 𝐴 ∈ (𝑓‘𝑢)))
33		xpeq2 5682	. . . . . 6 ⊢ (𝑣 = (𝑓‘𝑢) → (𝑢 × 𝑣) = (𝑢 × (𝑓‘𝑢)))
34	33	sseq1d 3967	. . . . 5 ⊢ (𝑣 = (𝑓‘𝑢) → ((𝑢 × 𝑣) ⊆ 𝑈 ↔ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈))
35	32, 34	anbi12d 643	. . . 4 ⊢ (𝑣 = (𝑓‘𝑢) → ((𝐴 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ 𝑈) ↔ (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))
36	31, 35	cmpcovf 23527	. . 3 ⊢ ((𝑅 ∈ Comp ∧ ∀𝑥 ∈ 𝑋 ∃𝑢 ∈ 𝑅 (𝑥 ∈ 𝑢 ∧ ∃𝑣 ∈ 𝑆 (𝐴 ∈ 𝑣 ∧ (𝑢 × 𝑣) ⊆ 𝑈))) → ∃𝑡 ∈ (𝒫 𝑅 ∩ Fin)(𝑋 = ∪ 𝑡 ∧ ∃𝑓(𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈))))
37	1, 30, 36	syl2anc 595	. 2 ⊢ (𝜑 → ∃𝑡 ∈ (𝒫 𝑅 ∩ Fin)(𝑋 = ∪ 𝑡 ∧ ∃𝑓(𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈))))
38		rint0 4952	. . . . . . . . . 10 ⊢ (ran 𝑓 = ∅ → (𝑌 ∩ ∩ ran 𝑓) = 𝑌)
39	38	adantl 486	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) ∧ ran 𝑓 = ∅) → (𝑌 ∩ ∩ ran 𝑓) = 𝑌)
40		txtube.y	. . . . . . . . . . . 12 ⊢ 𝑌 = ∪ 𝑆
41	40	topopn 23042	. . . . . . . . . . 11 ⊢ (𝑆 ∈ Top → 𝑌 ∈ 𝑆)
42	6, 41	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ∈ 𝑆)
43	42	ad3antrrr 742	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) ∧ ran 𝑓 = ∅) → 𝑌 ∈ 𝑆)
44	39, 43	eqeltrd 2861	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) ∧ ran 𝑓 = ∅) → (𝑌 ∩ ∩ ran 𝑓) ∈ 𝑆)
45	6	ad3antrrr 742	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) ∧ ran 𝑓 ≠ ∅) → 𝑆 ∈ Top)
46		simprrl 792	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → 𝑓:𝑡⟶𝑆)
47	46	frnd 6714	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → ran 𝑓 ⊆ 𝑆)
48	47	adantr 485	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) ∧ ran 𝑓 ≠ ∅) → ran 𝑓 ⊆ 𝑆)
49		simpr 489	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) ∧ ran 𝑓 ≠ ∅) → ran 𝑓 ≠ ∅)
50		simplr 780	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → 𝑡 ∈ (𝒫 𝑅 ∩ Fin))
51	50	elin2d 4157	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → 𝑡 ∈ Fin)
52	46	ffnd 6706	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → 𝑓 Fn 𝑡)
53		dffn4 6798	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 Fn 𝑡 ↔ 𝑓:𝑡–onto→ran 𝑓)
54	52, 53	sylib 221	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → 𝑓:𝑡–onto→ran 𝑓)
55		fofi 9272	. . . . . . . . . . . . . . 15 ⊢ ((𝑡 ∈ Fin ∧ 𝑓:𝑡–onto→ran 𝑓) → ran 𝑓 ∈ Fin)
56	51, 54, 55	syl2anc 595	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → ran 𝑓 ∈ Fin)
57	56	adantr 485	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) ∧ ran 𝑓 ≠ ∅) → ran 𝑓 ∈ Fin)
58		fiinopn 23037	. . . . . . . . . . . . . 14 ⊢ (𝑆 ∈ Top → ((ran 𝑓 ⊆ 𝑆 ∧ ran 𝑓 ≠ ∅ ∧ ran 𝑓 ∈ Fin) → ∩ ran 𝑓 ∈ 𝑆))
59	58	imp 411	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ Top ∧ (ran 𝑓 ⊆ 𝑆 ∧ ran 𝑓 ≠ ∅ ∧ ran 𝑓 ∈ Fin)) → ∩ ran 𝑓 ∈ 𝑆)
60	45, 48, 49, 57, 59	syl13anc 1397	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) ∧ ran 𝑓 ≠ ∅) → ∩ ran 𝑓 ∈ 𝑆)
61		elssuni 4903	. . . . . . . . . . . 12 ⊢ (∩ ran 𝑓 ∈ 𝑆 → ∩ ran 𝑓 ⊆ ∪ 𝑆)
62	60, 61	syl 18	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) ∧ ran 𝑓 ≠ ∅) → ∩ ran 𝑓 ⊆ ∪ 𝑆)
63	62, 40	sseqtrrdi 3977	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) ∧ ran 𝑓 ≠ ∅) → ∩ ran 𝑓 ⊆ 𝑌)
64		sseqin2 4175	. . . . . . . . . 10 ⊢ (∩ ran 𝑓 ⊆ 𝑌 ↔ (𝑌 ∩ ∩ ran 𝑓) = ∩ ran 𝑓)
65	63, 64	sylib 221	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) ∧ ran 𝑓 ≠ ∅) → (𝑌 ∩ ∩ ran 𝑓) = ∩ ran 𝑓)
66	65, 60	eqeltrd 2861	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) ∧ ran 𝑓 ≠ ∅) → (𝑌 ∩ ∩ ran 𝑓) ∈ 𝑆)
67	44, 66	pm2.61dane 3043	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → (𝑌 ∩ ∩ ran 𝑓) ∈ 𝑆)
68	14	ad2antrr 738	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → 𝐴 ∈ 𝑌)
69		simprrr 793	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈))
70		simpl 487	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈) → 𝐴 ∈ (𝑓‘𝑢))
71	70	ralimi 3100	. . . . . . . . . . 11 ⊢ (∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈) → ∀𝑢 ∈ 𝑡 𝐴 ∈ (𝑓‘𝑢))
72	69, 71	syl 18	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → ∀𝑢 ∈ 𝑡 𝐴 ∈ (𝑓‘𝑢))
73		eliin 4960	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑌 → (𝐴 ∈ ∩ 𝑢 ∈ 𝑡 (𝑓‘𝑢) ↔ ∀𝑢 ∈ 𝑡 𝐴 ∈ (𝑓‘𝑢)))
74	68, 73	syl 18	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → (𝐴 ∈ ∩ 𝑢 ∈ 𝑡 (𝑓‘𝑢) ↔ ∀𝑢 ∈ 𝑡 𝐴 ∈ (𝑓‘𝑢)))
75	72, 74	mpbird 260	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → 𝐴 ∈ ∩ 𝑢 ∈ 𝑡 (𝑓‘𝑢))
76		fniinfv 6959	. . . . . . . . . 10 ⊢ (𝑓 Fn 𝑡 → ∩ 𝑢 ∈ 𝑡 (𝑓‘𝑢) = ∩ ran 𝑓)
77	52, 76	syl 18	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → ∩ 𝑢 ∈ 𝑡 (𝑓‘𝑢) = ∩ ran 𝑓)
78	75, 77	eleqtrd 2863	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → 𝐴 ∈ ∩ ran 𝑓)
79	68, 78	elind 4152	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → 𝐴 ∈ (𝑌 ∩ ∩ ran 𝑓))
80		simprl 782	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → 𝑋 = ∪ 𝑡)
81		uniiun 5022	. . . . . . . . . . 11 ⊢ ∪ 𝑡 = ∪ 𝑢 ∈ 𝑡 𝑢
82	80, 81	eqtrdi 2812	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → 𝑋 = ∪ 𝑢 ∈ 𝑡 𝑢)
83	82	xpeq1d 5690	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → (𝑋 × (𝑌 ∩ ∩ ran 𝑓)) = (∪ 𝑢 ∈ 𝑡 𝑢 × (𝑌 ∩ ∩ ran 𝑓)))
84		xpiundir 5733	. . . . . . . . 9 ⊢ (∪ 𝑢 ∈ 𝑡 𝑢 × (𝑌 ∩ ∩ ran 𝑓)) = ∪ 𝑢 ∈ 𝑡 (𝑢 × (𝑌 ∩ ∩ ran 𝑓))
85	83, 84	eqtrdi 2812	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → (𝑋 × (𝑌 ∩ ∩ ran 𝑓)) = ∪ 𝑢 ∈ 𝑡 (𝑢 × (𝑌 ∩ ∩ ran 𝑓)))
86		simpr 489	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈) → (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)
87	86	ralimi 3100	. . . . . . . . . . 11 ⊢ (∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈) → ∀𝑢 ∈ 𝑡 (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)
88	69, 87	syl 18	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → ∀𝑢 ∈ 𝑡 (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)
89		inss2 4189	. . . . . . . . . . . . 13 ⊢ (𝑌 ∩ ∩ ran 𝑓) ⊆ ∩ ran 𝑓
90	76	adantr 485	. . . . . . . . . . . . . 14 ⊢ ((𝑓 Fn 𝑡 ∧ 𝑢 ∈ 𝑡) → ∩ 𝑢 ∈ 𝑡 (𝑓‘𝑢) = ∩ ran 𝑓)
91		iinss2 5021	. . . . . . . . . . . . . . 15 ⊢ (𝑢 ∈ 𝑡 → ∩ 𝑢 ∈ 𝑡 (𝑓‘𝑢) ⊆ (𝑓‘𝑢))
92	91	adantl 486	. . . . . . . . . . . . . 14 ⊢ ((𝑓 Fn 𝑡 ∧ 𝑢 ∈ 𝑡) → ∩ 𝑢 ∈ 𝑡 (𝑓‘𝑢) ⊆ (𝑓‘𝑢))
93	90, 92	eqsstrrd 3971	. . . . . . . . . . . . 13 ⊢ ((𝑓 Fn 𝑡 ∧ 𝑢 ∈ 𝑡) → ∩ ran 𝑓 ⊆ (𝑓‘𝑢))
94	89, 93	sstrid 3947	. . . . . . . . . . . 12 ⊢ ((𝑓 Fn 𝑡 ∧ 𝑢 ∈ 𝑡) → (𝑌 ∩ ∩ ran 𝑓) ⊆ (𝑓‘𝑢))
95		xpss2 5681	. . . . . . . . . . . 12 ⊢ ((𝑌 ∩ ∩ ran 𝑓) ⊆ (𝑓‘𝑢) → (𝑢 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ (𝑢 × (𝑓‘𝑢)))
96		sstr2 3943	. . . . . . . . . . . 12 ⊢ ((𝑢 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ (𝑢 × (𝑓‘𝑢)) → ((𝑢 × (𝑓‘𝑢)) ⊆ 𝑈 → (𝑢 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ 𝑈))
97	94, 95, 96	3syl 19	. . . . . . . . . . 11 ⊢ ((𝑓 Fn 𝑡 ∧ 𝑢 ∈ 𝑡) → ((𝑢 × (𝑓‘𝑢)) ⊆ 𝑈 → (𝑢 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ 𝑈))
98	97	ralimdva 3175	. . . . . . . . . 10 ⊢ (𝑓 Fn 𝑡 → (∀𝑢 ∈ 𝑡 (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈 → ∀𝑢 ∈ 𝑡 (𝑢 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ 𝑈))
99	52, 88, 98	sylc 66	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → ∀𝑢 ∈ 𝑡 (𝑢 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ 𝑈)
100		iunss 5008	. . . . . . . . 9 ⊢ (∪ 𝑢 ∈ 𝑡 (𝑢 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ 𝑈 ↔ ∀𝑢 ∈ 𝑡 (𝑢 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ 𝑈)
101	99, 100	sylibr 237	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → ∪ 𝑢 ∈ 𝑡 (𝑢 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ 𝑈)
102	85, 101	eqsstrd 3970	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → (𝑋 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ 𝑈)
103		eleq2 2850	. . . . . . . . 9 ⊢ (𝑢 = (𝑌 ∩ ∩ ran 𝑓) → (𝐴 ∈ 𝑢 ↔ 𝐴 ∈ (𝑌 ∩ ∩ ran 𝑓)))
104		xpeq2 5682	. . . . . . . . . 10 ⊢ (𝑢 = (𝑌 ∩ ∩ ran 𝑓) → (𝑋 × 𝑢) = (𝑋 × (𝑌 ∩ ∩ ran 𝑓)))
105	104	sseq1d 3967	. . . . . . . . 9 ⊢ (𝑢 = (𝑌 ∩ ∩ ran 𝑓) → ((𝑋 × 𝑢) ⊆ 𝑈 ↔ (𝑋 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ 𝑈))
106	103, 105	anbi12d 643	. . . . . . . 8 ⊢ (𝑢 = (𝑌 ∩ ∩ ran 𝑓) → ((𝐴 ∈ 𝑢 ∧ (𝑋 × 𝑢) ⊆ 𝑈) ↔ (𝐴 ∈ (𝑌 ∩ ∩ ran 𝑓) ∧ (𝑋 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ 𝑈)))
107	106	rspcev 3580	. . . . . . 7 ⊢ (((𝑌 ∩ ∩ ran 𝑓) ∈ 𝑆 ∧ (𝐴 ∈ (𝑌 ∩ ∩ ran 𝑓) ∧ (𝑋 × (𝑌 ∩ ∩ ran 𝑓)) ⊆ 𝑈)) → ∃𝑢 ∈ 𝑆 (𝐴 ∈ 𝑢 ∧ (𝑋 × 𝑢) ⊆ 𝑈))
108	67, 79, 102, 107	syl12anc 849	. . . . . 6 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ (𝑋 = ∪ 𝑡 ∧ (𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)))) → ∃𝑢 ∈ 𝑆 (𝐴 ∈ 𝑢 ∧ (𝑋 × 𝑢) ⊆ 𝑈))
109	108	expr 461	. . . . 5 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ 𝑋 = ∪ 𝑡) → ((𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)) → ∃𝑢 ∈ 𝑆 (𝐴 ∈ 𝑢 ∧ (𝑋 × 𝑢) ⊆ 𝑈)))
110	109	exlimdv 1961	. . . 4 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) ∧ 𝑋 = ∪ 𝑡) → (∃𝑓(𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈)) → ∃𝑢 ∈ 𝑆 (𝐴 ∈ 𝑢 ∧ (𝑋 × 𝑢) ⊆ 𝑈)))
111	110	expimpd 458	. . 3 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝒫 𝑅 ∩ Fin)) → ((𝑋 = ∪ 𝑡 ∧ ∃𝑓(𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈))) → ∃𝑢 ∈ 𝑆 (𝐴 ∈ 𝑢 ∧ (𝑋 × 𝑢) ⊆ 𝑈)))
112	111	rexlimdva 3164	. 2 ⊢ (𝜑 → (∃𝑡 ∈ (𝒫 𝑅 ∩ Fin)(𝑋 = ∪ 𝑡 ∧ ∃𝑓(𝑓:𝑡⟶𝑆 ∧ ∀𝑢 ∈ 𝑡 (𝐴 ∈ (𝑓‘𝑢) ∧ (𝑢 × (𝑓‘𝑢)) ⊆ 𝑈))) → ∃𝑢 ∈ 𝑆 (𝐴 ∈ 𝑢 ∧ (𝑋 × 𝑢) ⊆ 𝑈)))
113	37, 112	mpd 16	1 ⊢ (𝜑 → ∃𝑢 ∈ 𝑆 (𝐴 ∈ 𝑢 ∧ (𝑋 × 𝑢) ⊆ 𝑈))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1568  ∃wex 1807   ∈ wcel 2141   ≠ wne 2956  ∀wral 3077  ∃wrex 3087   ∩ cin 3903   ⊆ wss 3904  ∅c0 4285  𝒫 cpw 4561  {csn 4588  ⟨cop 4594  ∪ cuni 4871  ∩ cint 4911  ∪ ciun 4955  ∩ ciin 4956   × cxp 5659  ran crn 5662   Fn wfn 6531  ⟶wf 6532  –onto→wfo 6534  ‘cfv 6536  (class class class)co 7410  Fincfn 8942  Topctop 23029  Compccmp 23522   ×_t ctx 23696

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5256  ax-nul 5268  ax-pow 5336  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-iin 4958  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7862  df-1st 7985  df-2nd 7986  df-1o 8452  df-2o 8453  df-en 8943  df-dom 8944  df-fin 8946  df-topgen 17495  df-top 23030  df-cmp 23523  df-tx 23698

This theorem is referenced by:  txcmplem1  23777  xkoinjcn  23823  cvmlift2lem12  35760