EL Equation to Proof P<=NP

The following is an attempt on assembling a logical proof showing why P<=NP must be correct. The time of obtaining a suggested solution must always short or equal to the time to decide whether there exist a solution at all.

methods used - EL framework (cal. of variations), Functors and set theory