You keep repeating that, but you never actually show how it (whatever "it" actually is) is based on those inequalities.
All you have to do is to deduce a given mathematical framework in terms of cardinality, in order to provide a given solution.
For example:
Finite or infinite cardinality:
A given solution that is satisfied by
at least some cardinality > |1|, is not satisfied by some cardinality ≤ |1|.
Infinite cardinality:
A given solution that is satisfied by
at least some cardinality > |
N|, is not satisfied by some cardinality ≤ |
N|.
A given solution that is satisfied by
at least some cardinality > |P(
N)|, is not satisfied by some cardinality ≤ |P(
N)|.
A given solution that is satisfied by
at least some cardinality > |P(P(
N))|, is not satisfied by some cardinality ≤ |P(P(
N))|.
A given solution that is satisfied by
at least some cardinality > |P(P(P(
N)))|, is not satisfied by some cardinality ≤ |P(P(P(
N)))|.
etc. ... at infinitum.
How do you connect Cantor's Theorem to the definition for limits in such a way that 0.999... and 1 are not identical?
A given solution that is satisfied by
at least some cardinality > |
N|, is not satisfied by some cardinality ≤ |
N|.