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 21190

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 21185	. . . . 5 ⊢ (𝑋 ∈ 𝐵 ↔ ∃𝑎((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)))
3	1	elpt 21185	. . . . 5 ⊢ (𝑌 ∈ 𝐵 ↔ ∃𝑏((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦)))
4	2, 3	anbi12i 729	. . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ↔ (∃𝑎((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ∃𝑏((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))))
5		eeanv 2170	. . . 4 ⊢ (∃𝑎∃𝑏(((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))) ↔ (∃𝑎((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ∃𝑏((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))))
6	4, 5	bitr4i 266	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ↔ ∃𝑎∃𝑏(((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))))
7		an4 861	. . . . 5 ⊢ ((((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))) ↔ (((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ (𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))) ∧ (𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))))
8		an6 1400	. . . . . . . . 9 ⊢ (((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ (𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))) ↔ ((𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦)) ∧ (∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))))
9		df-3an 1033	. . . . . . . . 9 ⊢ (((𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦)) ∧ (∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))) ↔ (((𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ (∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))))
10	8, 9	bitri 263	. . . . . . . 8 ⊢ (((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ (𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))) ↔ (((𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ (∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))))
11		reeanv 3086	. . . . . . . . . . 11 ⊢ (∃𝑐 ∈ Fin ∃𝑑 ∈ Fin (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ↔ (∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))
12		fveq2 6103	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑘 → (𝑎‘𝑦) = (𝑎‘𝑘))
13		fveq2 6103	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑘 → (𝑏‘𝑦) = (𝑏‘𝑘))
14	12, 13	ineq12d 3777	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑘 → ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) = ((𝑎‘𝑘) ∩ (𝑏‘𝑘)))
15	14	cbvixpv 7812	. . . . . . . . . . . . . 14 ⊢ X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) = X𝑘 ∈ 𝐴 ((𝑎‘𝑘) ∩ (𝑏‘𝑘))
16		simpl1l 1105	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → 𝐴 ∈ 𝑉)
17		unfi 8112	. . . . . . . . . . . . . . . 16 ⊢ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) → (𝑐 ∪ 𝑑) ∈ Fin)
18	17	ad2antrl 760	. . . . . . . . . . . . . . 15 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → (𝑐 ∪ 𝑑) ∈ Fin)
19		simpl1r 1106	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → 𝐹:𝐴⟶Top)
20	19	ffvelrnda 6267	. . . . . . . . . . . . . . . 16 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ 𝐴) → (𝐹‘𝑘) ∈ Top)
21		simpl3l 1109	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦))
22		fveq2 6103	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑘 → (𝐹‘𝑦) = (𝐹‘𝑘))
23	12, 22	eleq12d 2682	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑘 → ((𝑎‘𝑦) ∈ (𝐹‘𝑦) ↔ (𝑎‘𝑘) ∈ (𝐹‘𝑘)))
24	23	rspccva 3281	. . . . . . . . . . . . . . . . 17 ⊢ ((∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ 𝑘 ∈ 𝐴) → (𝑎‘𝑘) ∈ (𝐹‘𝑘))
25	21, 24	sylan 487	. . . . . . . . . . . . . . . 16 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ 𝐴) → (𝑎‘𝑘) ∈ (𝐹‘𝑘))
26		simpl3r 1110	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))
27	13, 22	eleq12d 2682	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑘 → ((𝑏‘𝑦) ∈ (𝐹‘𝑦) ↔ (𝑏‘𝑘) ∈ (𝐹‘𝑘)))
28	27	rspccva 3281	. . . . . . . . . . . . . . . . 17 ⊢ ((∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ 𝑘 ∈ 𝐴) → (𝑏‘𝑘) ∈ (𝐹‘𝑘))
29	26, 28	sylan 487	. . . . . . . . . . . . . . . 16 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ 𝐴) → (𝑏‘𝑘) ∈ (𝐹‘𝑘))
30		inopn 20529	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹‘𝑘) ∈ Top ∧ (𝑎‘𝑘) ∈ (𝐹‘𝑘) ∧ (𝑏‘𝑘) ∈ (𝐹‘𝑘)) → ((𝑎‘𝑘) ∩ (𝑏‘𝑘)) ∈ (𝐹‘𝑘))
31	20, 25, 29, 30	syl3anc 1318	. . . . . . . . . . . . . . 15 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ 𝐴) → ((𝑎‘𝑘) ∩ (𝑏‘𝑘)) ∈ (𝐹‘𝑘))
32		simprrl 800	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦))
33		ssun1 3738	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝑐 ⊆ (𝑐 ∪ 𝑑)
34		sscon 3706	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑐 ⊆ (𝑐 ∪ 𝑑) → (𝐴 ∖ (𝑐 ∪ 𝑑)) ⊆ (𝐴 ∖ 𝑐))
35	33, 34	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ∖ (𝑐 ∪ 𝑑)) ⊆ (𝐴 ∖ 𝑐)
36	35	sseli 3564	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (𝐴 ∖ (𝑐 ∪ 𝑑)) → 𝑘 ∈ (𝐴 ∖ 𝑐))
37	22	unieqd 4382	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = 𝑘 → ∪ (𝐹‘𝑦) = ∪ (𝐹‘𝑘))
38	12, 37	eqeq12d 2625	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑘 → ((𝑎‘𝑦) = ∪ (𝐹‘𝑦) ↔ (𝑎‘𝑘) = ∪ (𝐹‘𝑘)))
39	38	rspccva 3281	. . . . . . . . . . . . . . . . . 18 ⊢ ((∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ 𝑘 ∈ (𝐴 ∖ 𝑐)) → (𝑎‘𝑘) = ∪ (𝐹‘𝑘))
40	32, 36, 39	syl2an 493	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ (𝐴 ∖ (𝑐 ∪ 𝑑))) → (𝑎‘𝑘) = ∪ (𝐹‘𝑘))
41		simprrr 801	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))
42		ssun2 3739	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝑑 ⊆ (𝑐 ∪ 𝑑)
43		sscon 3706	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑑 ⊆ (𝑐 ∪ 𝑑) → (𝐴 ∖ (𝑐 ∪ 𝑑)) ⊆ (𝐴 ∖ 𝑑))
44	42, 43	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 ∖ (𝑐 ∪ 𝑑)) ⊆ (𝐴 ∖ 𝑑)
45	44	sseli 3564	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (𝐴 ∖ (𝑐 ∪ 𝑑)) → 𝑘 ∈ (𝐴 ∖ 𝑑))
46	13, 37	eqeq12d 2625	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = 𝑘 → ((𝑏‘𝑦) = ∪ (𝐹‘𝑦) ↔ (𝑏‘𝑘) = ∪ (𝐹‘𝑘)))
47	46	rspccva 3281	. . . . . . . . . . . . . . . . . 18 ⊢ ((∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦) ∧ 𝑘 ∈ (𝐴 ∖ 𝑑)) → (𝑏‘𝑘) = ∪ (𝐹‘𝑘))
48	41, 45, 47	syl2an 493	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ (𝐴 ∖ (𝑐 ∪ 𝑑))) → (𝑏‘𝑘) = ∪ (𝐹‘𝑘))
49	40, 48	ineq12d 3777	. . . . . . . . . . . . . . . 16 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ (𝐴 ∖ (𝑐 ∪ 𝑑))) → ((𝑎‘𝑘) ∩ (𝑏‘𝑘)) = (∪ (𝐹‘𝑘) ∩ ∪ (𝐹‘𝑘)))
50		inidm 3784	. . . . . . . . . . . . . . . 16 ⊢ (∪ (𝐹‘𝑘) ∩ ∪ (𝐹‘𝑘)) = ∪ (𝐹‘𝑘)
51	49, 50	syl6eq 2660	. . . . . . . . . . . . . . 15 ⊢ (((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) ∧ 𝑘 ∈ (𝐴 ∖ (𝑐 ∪ 𝑑))) → ((𝑎‘𝑘) ∩ (𝑏‘𝑘)) = ∪ (𝐹‘𝑘))
52	1, 16, 18, 31, 51	elptr2 21187	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → X𝑘 ∈ 𝐴 ((𝑎‘𝑘) ∩ (𝑏‘𝑘)) ∈ 𝐵)
53	15, 52	syl5eqel 2692	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ ((𝑐 ∈ Fin ∧ 𝑑 ∈ Fin) ∧ (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵)
54	53	expr 641	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ (𝑐 ∈ Fin ∧ 𝑑 ∈ Fin)) → ((∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵))
55	54	rexlimdvva 3020	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) → (∃𝑐 ∈ Fin ∃𝑑 ∈ Fin (∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵))
56	11, 55	syl5bir 232	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) → ((∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵))
57	56	3expb 1258	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ ((𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦)))) → ((∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵))
58	57	impr 647	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (((𝑎 Fn 𝐴 ∧ 𝑏 Fn 𝐴) ∧ (∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦))) ∧ (∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵)
59	10, 58	sylan2b 491	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ ((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ (𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵)
60		ineq12 3771	. . . . . . . . 9 ⊢ ((𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦)) → (𝑋 ∩ 𝑌) = (X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∩ X𝑦 ∈ 𝐴 (𝑏‘𝑦)))
61		ixpin 7819	. . . . . . . . 9 ⊢ X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) = (X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∩ X𝑦 ∈ 𝐴 (𝑏‘𝑦))
62	60, 61	syl6eqr 2662	. . . . . . . 8 ⊢ ((𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦)) → (𝑋 ∩ 𝑌) = X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)))
63	62	eleq1d 2672	. . . . . . 7 ⊢ ((𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦)) → ((𝑋 ∩ 𝑌) ∈ 𝐵 ↔ X𝑦 ∈ 𝐴 ((𝑎‘𝑦) ∩ (𝑏‘𝑦)) ∈ 𝐵))
64	59, 63	syl5ibrcom 236	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ ((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ (𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)))) → ((𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦)) → (𝑋 ∩ 𝑌) ∈ 𝐵))
65	64	expimpd 627	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ((((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ (𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦))) ∧ (𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))) → (𝑋 ∩ 𝑌) ∈ 𝐵))
66	7, 65	syl5bi 231	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ((((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))) → (𝑋 ∩ 𝑌) ∈ 𝐵))
67	66	exlimdvv 1849	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (∃𝑎∃𝑏(((𝑎 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑎‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑐 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑐)(𝑎‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑋 = X𝑦 ∈ 𝐴 (𝑎‘𝑦)) ∧ ((𝑏 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑏‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑑 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑑)(𝑏‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑌 = X𝑦 ∈ 𝐴 (𝑏‘𝑦))) → (𝑋 ∩ 𝑌) ∈ 𝐵))
68	6, 67	syl5bi 231	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∩ 𝑌) ∈ 𝐵))
69	68	imp 444	1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 ∩ 𝑌) ∈ 𝐵)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∃wex 1695 ∈ wcel 1977 {cab 2596 ∀wral 2896 ∃wrex 2897 ∖ cdif 3537 ∪ cun 3538 ∩ cin 3539 ⊆ wss 3540 ∪ cuni 4372 Fn wfn 5799 ⟶wf 5800 ‘cfv 5804 Xcixp 7794 Fincfn 7841 Topctop 20517

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-oadd 7451 df-er 7629 df-ixp 7795 df-en 7842 df-fin 7845 df-top 20521

This theorem is referenced by: ptbasin2 21191

W3C validator