Rewriting for-all and exists within set theory
From Maths
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
Contents
[hide]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:
- ∀x[x∈S→φ(x)]⟺∀x∈S[φ(x)] and
- ∃x[x∈S∧φ(x)]⟺∃x∈S[φ(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 x∈S, by the nature of logical implication we see x∈S→ϕ(x) holds, thus ∀x∈S[φ(x)] holds
- Let x∈S 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 x∉S then by the nature of logical implication we consider the statement sated whether or not φ(x) holds and we're done
- if x∈S then as ∀x∈S[φ(x)] we see φ(x) holds in this case[Note 1]
- Let x be given. Note there is always something to be given here
- ⟹
- 2)
- ⟹
- Choose x posited to exist such that x∈S and φ(x), then - as stated - x∈S, so this is a valid choice, and φ(x) holds
- ⟸
- Choose x∈S posited to exist by the RHS, then x exists, x∈S and φ(x) holds for it
- ⟹
Notes
References