We define by recursion the set of sets {An:n∈ℕ} this way:(adsbygoogle = window.adsbygoogle || []).push({});

A_0=∅

A_n+1=A_n ∪ {A_n}.

I want to prove by induction that for all n∈ℕ, the set A_n has n elements and that A_n is transitive (i.e. if x∈y∈A_n, then x∈A_n).

My thoughts:

for n=0, A_1 = ∅∪ {∅} = {∅}

then, for n+1: A_n+2 =A_n+1 ∪ {A_n+1}

I'm confused on how to proceed.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Show that the set of sets {An} has n elements

Loading...

Similar Threads - Show sets {An} | Date |
---|---|

B To show of 5[SUP]√2 [SUP] >7, logically. | Jun 21, 2016 |

Show a functions inverse is injective iff f is surjective | Aug 29, 2015 |

"The Chase" Quiz Show -- probability of being caught by the Chaser | Nov 4, 2014 |

Set Theory to Show Transcendental Numbers Exists | May 9, 2007 |

Show that the set of points on a line is equinumerous | Jan 31, 2005 |

**Physics Forums - The Fusion of Science and Community**