MHB Why does the implication hold?

  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    implication
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hi! (Smile)

I am looking at the proof of the following sentence:

For each natural number $n$ it holds that $n \notin n$.

Proof :

We define the set $X=\{ n \in \omega: n \notin n\}$.
It suffices to show that $X$ is an inductive set, because then $X=\omega$.
Obviously $\varnothing \in X$.
We suppose that $n \in X$ and we will show that $n'=n \cup \{n\} \in X$.

We suppose that $n' \in n'$. Then $n \cup \{ n \} \in n \cup \{ n \}$.
We have two cases:
  • $n \cup \{ n \} \in n$
  • $n \cup \{ n \} \in \{ n \} \rightarrow n \cup \{ n \}=n$

If $n \cup \{ n \} \in n$ then $n \cup \{ n \} \subset n \rightarrow \{ n \} \subset n \rightarrow n \in n$, contradiction since $n \in X$.

If $n \cup \{ n \}=n \rightarrow n \cup \{ n \} \subset n$ and from the proof of the previous sentence we conclude again to a contradiction.

So, $n' \notin n'$ and so $X$ is inductive, i.e. $X=\omega$.Could you explain me why $n \cup \{ n \} \subset n \rightarrow \{ n \} \subset n \rightarrow n \in n$ ? (Thinking)
 
Physics news on Phys.org
evinda said:
Could you explain me why $n \cup \{ n \} \subset n \rightarrow \{ n \} \subset n \rightarrow n \in n$ ?
For all sets $A$, $B$ and $C$ and for all $x$ it is the case that $A\cup B\subseteq C\implies B\subseteq C$ and $\{x\}\subseteq A\iff x\in A$.
 
Evgeny.Makarov said:
For all sets $A$, $B$ and $C$ and for all $x$ it is the case that $A\cup B\subseteq C\implies B\subseteq C$ and $\{x\}\subseteq A\iff x\in A$.

I understand... Thanks a lot! (Cool)
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top