Next, I prove P=NP.

Proposition: For every computational problem, there exists an algorithm that matches the class of computational complexity of that problem.
Proof:
First, we demonstrate the following theorem.

Theorem2: The proof of every proposition that can be judged as true or false will inevitably materialize.
Proof:
First, we present three lemmas.

Lemma 2.1: The condition that defines an outline is when the inclusion relation ⊇ is commutative.
Proof:
If there is an A with a known shape and an A with an unknown shape, then the shape of B can be determined by showing A⊇B and B⊇A.

Corollary 2.1.1: The concept of existence and the inclusion relation are equivalent.
Proof:
The concept of existence and space are equivalent. Clearly, the inclusion relation is derived from space, and from the inclusion relation, existence=space is derived.

Lemma 2.2: The inclusion relation ⊇ and the correspondence relation → are equivalent.
Proof:
If the inclusion relation A⊇B holds, then the correspondence relation A→B holds. Conversely, assume the correspondence relation A→B holds. In this case, the premise that if something exists, then all elements are in space, and from Corollary 1.1, that the existence of elements in space implies an inclusion relation, demonstrates the proposition.

Lemma 2.3: The inclusion relation ⊇ and the causal relation → are equivalent.
Proof:
Clearly, if a causal relation exists, then, as per Corollary 1.1, since there are elements in space, an inclusion relation is derived. Next, we demonstrate that a causal relation can be derived from an inclusion relation. When A⊇B holds, a causal relation that if B then A belongs, holds. Thus, the proposition is demonstrated.