Rewriting for-all and exists within set theory

From Maths
Jump to: navigation, search
Stub grade: A*
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Flesh out, check, link to formal logic

Statement

Let φ(x,a1,,an) be any "predicate" or formula where x is a free variable and the ai are at most finitely many parameters, we will write φ(x) for short but note any parameters are implied to be present. Then:

  1. x[xSφ(x)]xS[φ(x)] and
  2. x[xSφ(x)]xS[φ(x)]

Some authors define the RHS of these as an abbreviation or short hand for the left expression, such as[1].

Proof

  • 1)
      • Suppose there is no xS, by the nature of logical implication we see xSϕ(x) holds, thus xS[φ(x)] holds
      • Let xS be given, by the left hand side and the nature of implication, φ(x) must hold.
      • Let x be given. Note there is always something to be given here
        • if xS then by the nature of logical implication we consider the statement sated whether or not φ(x) holds and we're done
        • if xS then as xS[φ(x)] we see φ(x) holds in this case[Note 1]
  • 2)
      • Choose x posited to exist such that xS and φ(x), then - as stated - xS, so this is a valid choice, and φ(x) holds
      • Choose xS posited to exist by the RHS, then x exists, xS and φ(x) holds for it

Notes

  1. Jump up Note that by having xS we know there is at least one xX, so xS[φ(x)] is not vacuous

References

  1. Jump up Set Theory - Thomas Jech - Third millennium edition, revised and expanded