Axiom schema of replacement
From Maths
Revision as of 23:17, 8 March 2017 by Alec (Talk | contribs) (A lot of work is required but its a start)
Provisional page grade: A*
This page is provisional
This page is provisional and the information it contains may change before this notice is removed (in a backwards incompatible way). This usually means the content is from one source and that source isn't the most formal, or there are many other forms floating around. It is on a to-do list for being expanded.The message provided is:
Needs:
- Infobox
- Apart of what set theories?
- Anything it requires as a precursor?
- Corollaries / use
Contents
[hide]Definition
Let φ(a,b,p) be a formula where a and b are free variables but p is a parameter (or a parameter pack) and describes a function between classes.
The axiom schema of replacement posits that if F is some class function then for all sets X, F(X) - the image of X under F - denoted F(X) is also a set[1].
We state it formally as follows:
- (∀x∀y∀z[(φ(x,y,p)∧φ(x,z,p))→y=z]⏟if (a,b)∈f⟺φ(a,b,p) then f acts like a function relation) → (∀X∃Y∀y[y∈Y↔∃x[x∈X∧φ(x,y,p)]]⏟y∈Y⟺the 'image' of x under the 'function' is y)
- By rewriting for-all and exists within set theory we can make a small change to the ∃x part:
- (∀x∀y∀z[(φ(x,y,p)∧φ(x,z,p))→y=z]) → (∀X∃Y∀y[y∈Y↔∃x∈X[φ(x,y,p)]])
- By rewriting for-all and exists within set theory we can make a small change to the ∃x part: