MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  infcntss Structured version   Visualization version   GIF version

Theorem infcntss 9355
Description: Every infinite set has a denumerable subset. Similar to Exercise 8 of [TakeutiZaring] p. 91. (However, we need neither AC nor the Axiom of Infinity because of the way we express "infinite" in the antecedent.) (Contributed by NM, 23-Oct-2004.)
Hypothesis
Ref Expression
infcntss.1 𝐴 ∈ V
Assertion
Ref Expression
infcntss (ω ≼ 𝐴 → ∃𝑥(𝑥𝐴𝑥 ≈ ω))
Distinct variable group:   𝑥,𝐴

Proof of Theorem infcntss
StepHypRef Expression
1 infcntss.1 . . 3 𝐴 ∈ V
21domen 8990 . 2 (ω ≼ 𝐴 ↔ ∃𝑥(ω ≈ 𝑥𝑥𝐴))
3 ensym 9032 . . . 4 (ω ≈ 𝑥𝑥 ≈ ω)
43anim1ci 614 . . 3 ((ω ≈ 𝑥𝑥𝐴) → (𝑥𝐴𝑥 ≈ ω))
54eximi 1829 . 2 (∃𝑥(ω ≈ 𝑥𝑥𝐴) → ∃𝑥(𝑥𝐴𝑥 ≈ ω))
62, 5sylbi 216 1 (ω ≼ 𝐴 → ∃𝑥(𝑥𝐴𝑥 ≈ ω))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 394  wex 1773  wcel 2098  Vcvv 3473  wss 3949   class class class wbr 5152  ωcom 7878  cen 8969  cdom 8970
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699  ax-sep 5303  ax-nul 5310  ax-pow 5369  ax-pr 5433  ax-un 7748
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ral 3059  df-rex 3068  df-rab 3431  df-v 3475  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-pw 4608  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4913  df-br 5153  df-opab 5215  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-fun 6555  df-fn 6556  df-f 6557  df-f1 6558  df-fo 6559  df-f1o 6560  df-er 8733  df-en 8973  df-dom 8974
This theorem is referenced by:  pibt2  36937
  Copyright terms: Public domain W3C validator