2 ms·
If you have some set S and predicate P(x) is true for every x in S, ∀x∈S:P(x), then you can partition the set into pieces S₁ ∪ S₂ ∪ ... u Sₙ. such that ∀x∈S₁:P(
by kazinator 3y ago
If you have some set S and predicate P(x) is true for every x in S, ∀x∈S:P(x), then you can partition the set into pieces S₁ ∪ S₂ ∪ ... u Sₙ. such that ∀x∈S₁:P(x) ∧ ∀x∈S₂:P(x) ∧ ... ∧ ∀x∈Sₙ:P(x).
If the quantified predicate were to be false for an empty set, then the above breaks if any of the partitions are empty. A property can then be true when quantified over a set such that it's not true over subsets, which is inconsistent.
A similar problem occurs with products. We can use Lisp:
(* 2 3 4) -> 24
We would like to be partition that into partial products. Here, we have a partition of length 1:
(* (* 2 3) (* 4)) -> 24
So we want (* N) -> N. And empty partitions:
(* (*) (* 2 3) (*) (* 4)) -> 24
For that to work we need:
(*) -> 1