Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Axiom of regularity
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==The axiom of dependent choice and no infinite descending sequence of sets implies regularity== Let the non-empty set ''S'' be a counter-example to the axiom of regularity; that is, every element of ''S'' has a non-empty intersection with ''S''. We define a binary relation ''R'' on ''S'' by <math display="inline">aRb :\Leftrightarrow b \in S \cap a</math>, which is entire by assumption. Thus, by the axiom of dependent choice, there is some sequence (''a<sub>n</sub>'') in ''S'' satisfying ''a<sub>n</sub>Ra<sub>n+1</sub>'' for all ''n'' in '''N'''. As this is an infinite descending chain, we arrive at a contradiction and so, no such ''S'' exists.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)