ptbasin - Metamath Proof Explorer

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

Theorem ptbasin 22182

Description: The basis for a product topology is closed under intersections. (Contributed by Mario Carneiro, 3-Feb-2015.)

**Hypothesis**
Ref	Expression
ptbas.1	⊢ 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}

**Assertion**
Ref	Expression
ptbasin	⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 ∩ 𝑌) ∈ 𝐵)

Distinct variable groups: 𝑥,𝑔,𝑦,𝑧,𝐴 𝑔,𝑌,𝑥 𝑔,𝐹,𝑥,𝑦,𝑧 𝑔,𝑋,𝑥,𝑧 𝑔,𝑉,𝑥,𝑦,𝑧 Allowed substitution hints: 𝐵(𝑥,𝑦,𝑧,𝑔) 𝑋(𝑦) 𝑌(𝑦,𝑧)

Proof of Theorem ptbasin Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ptbas.1	. . . . . 6 ⊢ 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
2	1	elpt 22177	. . . . 5 ⊢ (𝑋 ∈ 𝐵 ↔ ∃𝑎((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)))
3	1	elpt 22177	. . . . 5 ⊢ (𝑌 ∈ 𝐵 ↔ ∃𝑏((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦)))
4	2, 3	anbi12i 629	. . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ↔ (∃𝑎((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ∃𝑏((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))))
5		exdistrv 1956	. . . 4 ⊢ (∃𝑎∃𝑏(((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))) ↔ (∃𝑎((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ∃𝑏((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))))
6	4, 5	bitr4i 281	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ↔ ∃𝑎∃𝑏(((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))))
7		an4 655	. . . . 5 ⊢ ((((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))) ↔ (((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ (𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))) ∧ (𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))))
8		an6 1442	. . . . . . . . 9 ⊢ (((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ (𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))) ↔ ((𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦)) ∧ (∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))))
9		df-3an 1086	. . . . . . . . 9 ⊢ (((𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦)) ∧ (∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))) ↔ (((𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ (∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))))
10	8, 9	bitri 278	. . . . . . . 8 ⊢ (((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ (𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))) ↔ (((𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ (∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))))
11		reeanv 3320	. . . . . . . . . . 11 ⊢ (∃𝑐 ∈ Fin ∃𝑑 ∈ Fin (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ↔ (∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))
12		fveq2 6645	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑘 → (𝑎‘𝑦) = (𝑎‘𝑘))
13		fveq2 6645	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑘 → (𝑏‘𝑦) = (𝑏‘𝑘))
14	12, 13	ineq12d 4140	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑘 → ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) = ((𝑎‘𝑘) ∩ (𝑏‘𝑘)))
15	14	cbvixpv 8462	. . . . . . . . . . . . . 14 ⊢ X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) = X𝑘 ∈ 𝐴 ((𝑎‘𝑘) ∩ (𝑏‘𝑘))
16		simpl1l 1221	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → 𝐴 ∈ 𝑉)
17		unfi 8769	. . . . . . . . . . . . . . . 16 ⊢ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) → (𝑐 ∪ 𝑑) ∈ Fin)
18	17	ad2antrl 727	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → (𝑐 ∪ 𝑑) ∈ Fin)
19		simpl1r 1222	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → 𝐹:𝐴⟶Top)
20	19	ffvelrnda 6828	. . . . . . . . . . . . . . . 16 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) ∈ Top)
21		simpl3l 1225	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦))
22		fveq2 6645	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑘 → (𝐹‘𝑦) = (𝐹‘𝑘))
23	12, 22	eleq12d 2884	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑘 → ((𝑎‘𝑦) ∈ (𝐹‘𝑦) ↔ (𝑎‘𝑘) ∈ (𝐹‘𝑘)))
24	23	rspccva 3570	. . . . . . . . . . . . . . . . 17 ⊢ ((∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ 𝑘 ∈ 𝐴) → (𝑎‘𝑘) ∈ (𝐹‘𝑘))
25	21, 24	sylan 583	. . . . . . . . . . . . . . . 16 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ 𝐴) → (𝑎‘𝑘) ∈ (𝐹‘𝑘))
26		simpl3r 1226	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))
27	13, 22	eleq12d 2884	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑘 → ((𝑏‘𝑦) ∈ (𝐹‘𝑦) ↔ (𝑏‘𝑘) ∈ (𝐹‘𝑘)))
28	27	rspccva 3570	. . . . . . . . . . . . . . . . 17 ⊢ ((∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ 𝑘 ∈ 𝐴) → (𝑏‘𝑘) ∈ (𝐹‘𝑘))
29	26, 28	sylan 583	. . . . . . . . . . . . . . . 16 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ 𝐴) → (𝑏‘𝑘) ∈ (𝐹‘𝑘))
30		inopn 21504	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹‘𝑘) ∈ Top ∧ (𝑎‘𝑘) ∈ (𝐹‘𝑘) ∧ (𝑏‘𝑘) ∈ (𝐹‘𝑘)) → ((𝑎‘𝑘) ∩ (𝑏‘𝑘)) ∈ (𝐹‘𝑘))
31	20, 25, 29, 30	syl3anc 1368	. . . . . . . . . . . . . . 15 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ 𝐴) → ((𝑎‘𝑘) ∩ (𝑏‘𝑘)) ∈ (𝐹‘𝑘))
32		simprrl 780	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦))
33		ssun1 4099	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝑐 ⊆ (𝑐 ∪ 𝑑)
34		sscon 4066	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑐 ⊆ (𝑐 ∪ 𝑑) → (𝐴 ∖ (𝑐 ∪ 𝑑)) ⊆ (𝐴 ∖ 𝑐))
35	33, 34	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ∖ (𝑐 ∪ 𝑑)) ⊆ (𝐴 ∖ 𝑐)
36	35	sseli 3911	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (𝐴 ∖ (𝑐 ∪ 𝑑)) → 𝑘 ∈ (𝐴 ∖ 𝑐))
37	22	unieqd 4814	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝑘 → ∪ (𝐹‘𝑦) = ∪ (𝐹‘𝑘))
38	12, 37	eqeq12d 2814	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑘 → ((𝑎‘𝑦) = ∪ (𝐹‘𝑦) ↔ (𝑎‘𝑘) = ∪ (𝐹‘𝑘)))
39	38	rspccva 3570	. . . . . . . . . . . . . . . . . 18 ⊢ ((∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ 𝑘 ∈ (𝐴 ∖ 𝑐)) → (𝑎‘𝑘) = ∪ (𝐹‘𝑘))
40	32, 36, 39	syl2an 598	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ (𝐴 ∖ (𝑐 ∪ 𝑑))) → (𝑎‘𝑘) = ∪ (𝐹‘𝑘))
41		simprrr 781	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))
42		ssun2 4100	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝑑 ⊆ (𝑐 ∪ 𝑑)
43		sscon 4066	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑑 ⊆ (𝑐 ∪ 𝑑) → (𝐴 ∖ (𝑐 ∪ 𝑑)) ⊆ (𝐴 ∖ 𝑑))
44	42, 43	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ∖ (𝑐 ∪ 𝑑)) ⊆ (𝐴 ∖ 𝑑)
45	44	sseli 3911	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (𝐴 ∖ (𝑐 ∪ 𝑑)) → 𝑘 ∈ (𝐴 ∖ 𝑑))
46	13, 37	eqeq12d 2814	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑘 → ((𝑏‘𝑦) = ∪ (𝐹‘𝑦) ↔ (𝑏‘𝑘) = ∪ (𝐹‘𝑘)))
47	46	rspccva 3570	. . . . . . . . . . . . . . . . . 18 ⊢ ((∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦) ∧ 𝑘 ∈ (𝐴 ∖ 𝑑)) → (𝑏‘𝑘) = ∪ (𝐹‘𝑘))
48	41, 45, 47	syl2an 598	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ (𝐴 ∖ (𝑐 ∪ 𝑑))) → (𝑏‘𝑘) = ∪ (𝐹‘𝑘))
49	40, 48	ineq12d 4140	. . . . . . . . . . . . . . . 16 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ (𝐴 ∖ (𝑐 ∪ 𝑑))) → ((𝑎‘𝑘) ∩ (𝑏‘𝑘)) = (∪ (𝐹‘𝑘) ∩ ∪ (𝐹‘𝑘)))
50		inidm 4145	. . . . . . . . . . . . . . . 16 ⊢ (∪ (𝐹‘𝑘) ∩ ∪ (𝐹‘𝑘)) = ∪ (𝐹‘𝑘)
51	49, 50	eqtrdi 2849	. . . . . . . . . . . . . . 15 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ (𝐴 ∖ (𝑐 ∪ 𝑑))) → ((𝑎‘𝑘) ∩ (𝑏‘𝑘)) = ∪ (𝐹‘𝑘))
52	1, 16, 18, 31, 51	elptr2 22179	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → X𝑘 ∈ 𝐴 ((𝑎‘𝑘) ∩ (𝑏‘𝑘)) ∈ 𝐵)
53	15, 52	eqeltrid 2894	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵)
54	53	expr 460	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ (𝑐 ∈ Fin ∧ 𝑑 ∈ Fin)) → ((∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵))
55	54	rexlimdvva 3253	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) → (∃𝑐 ∈ Fin ∃𝑑 ∈ Fin (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵))
56	11, 55	syl5bir 246	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) → ((∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵))
57	56	3expb 1117	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ ((𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦)))) → ((∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵))
58	57	impr 458	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (((𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ (∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵)
59	10, 58	sylan2b 596	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ ((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ (𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵)
60		ineq12 4134	. . . . . . . . 9 ⊢ ((𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦)) → (𝑋 ∩ 𝑌) = (X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∩ X𝑦 ∈ 𝐴 (𝑏‘𝑦)))
61		ixpin 8470	. . . . . . . . 9 ⊢ X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) = (X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∩ X𝑦 ∈ 𝐴 (𝑏‘𝑦))
62	60, 61	eqtr4di 2851	. . . . . . . 8 ⊢ ((𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦)) → (𝑋 ∩ 𝑌) = X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)))
63	62	eleq1d 2874	. . . . . . 7 ⊢ ((𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦)) → ((𝑋 ∩ 𝑌) ∈ 𝐵 ↔ X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵))
64	59, 63	syl5ibrcom 250	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ ((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ (𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → ((𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦)) → (𝑋 ∩ 𝑌) ∈ 𝐵))
65	64	expimpd 457	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ((((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ (𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))) ∧ (𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))) → (𝑋 ∩ 𝑌) ∈ 𝐵))
66	7, 65	syl5bi 245	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ((((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))) → (𝑋 ∩ 𝑌) ∈ 𝐵))
67	66	exlimdvv 1935	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (∃𝑎∃𝑏(((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))) → (𝑋 ∩ 𝑌) ∈ 𝐵))
68	6, 67	syl5bi 245	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∩ 𝑌) ∈ 𝐵))
69	68	imp 410	1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 ∩ 𝑌) ∈ 𝐵)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∃wex 1781 ∈ wcel 2111 {cab 2776 ∀wral 3106 ∃wrex 3107 ∖ cdif 3878 ∪ cun 3879 ∩ cin 3880 ⊆ wss 3881 ∪ cuni 4800 Fn wfn 6319 ⟶wf 6320 ‘cfv 6324 Xcixp 8444 Fincfn 8492 Topctop 21498

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-oadd 8089 df-er 8272 df-ixp 8445 df-en 8493 df-fin 8496 df-top 21499

This theorem is referenced by: ptbasin2 22183

W3C validator