| http://www.w3.org/ns/prov#value | - If it is the case that (a) P(m) holds, where m is the smallest element in some set S, and (b) P(x') for all x < x' implies P(x); then P(x) holds for all x in S. The proof is that if P(x) does not hold, there is a least element y in S for which it does not hold.
|
