log in sign up
logo

Lemma: Equivalence of Set Inclusion and Element Inclusion of Ordinals

deleteeditadd to favorites[id:730]   
vote:
last edited 0 min ago by bookofproofs

Let \(\alpha\) and \(\beta\) be ordinals. Then
\[\alpha\subseteq\beta\Leftrightarrow \alpha\in\beta \vee\alpha = \beta.\]

Contribute to BoP:

add a new Proof  add

add a new Axiom  add

add a new Definition  add

add a new Motivation  add

add a new Example  add

add a new Application  add

add a new Explanation  add

add a new Interpretation  add

add a new Corollary  add

add a new Algorithm  add

add a new Open Problem  add

add a new Bibliography (Branch)  add

add a new Comment (Branch)  add


Terms of Use | Privacy Policy | Imprint | This site is a private offer. All rights reserved.
The contents of book of proofs are licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License.