(adsbygoogle = window.adsbygoogle || []).push({}); "All but finitely many" theorem

Let [itex]S[/itex] be a set with cardinality [itex]|S|=\aleph_0[/itex]. Let [itex]A,B \subseteq S[/itex]. Let [itex]S\backslash A[/itex] and [itex]S\backslash B[/itex] be finite. Then [itex]A \cap B \neq \varnothing[/itex].

How can this be shown? I came across it as an assumption in a proof that a sequence in a metric space can converge to at most one limit.

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

Dismiss Notice

Join Physics Forums Today!

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

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

# All but finitely many theorem

Loading...

Similar Threads for finitely many theorem | Date |
---|---|

A Formal axiom systems and the finite/infinite sets | Mar 1, 2017 |

I Finite promise games, shock of my life | Aug 16, 2016 |

Injection from finite set to equally sized set is surjection | May 28, 2015 |

"Minimal Cover" in Finite Collection of Sets? | May 26, 2015 |

There exists versus for all but finitely many | Apr 22, 2012 |

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