I’ve proved the following lemma:

**Lemma** Let for every and there is a such that .

Then for every and there is a such that .

I spent much time (probably a few hours) to prove it, but the found proof is really simple, almost trivial.

The proof is currently located in this PDF file.

After prayer in tongues and going down anointment of Holy Spirit I proved this conjecture about funcoids. The proof is currently located in this PDF file. Well, the proof is for special cases of distributive lattices, but more general case seems not necessary (at least now).

It seems easy to generalize it for more general lattices than the lattice of funcoids, what I hope to do a little later.

New conjecture:

**Conjecture** for all funcoids , (with corresponding sources and destinations).

Looks trivial? But how to (dis)prove it?

In this draft I present some definitions and conjectures on how to generalize filter bases for more general filtrators (such as the filtrator of funcoids). This is a work-in-progress.

This seems an interesting research by itself, but I started to develop it as a way to prove this conjecture.

I claimed that I have proved the following conjecture:

**Conjecture** for every composable funcoids and .

The proof was with an error. So it remains a conjecture.

I have proved the following theorem:

**Theorem** for every composable funcoids and .

This theorem (being a conjecture at that time) was used in my alternative proof of Urysohn’s lemma. Now the proof is complete.

See my site for details.

0