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

Theorem ssct 9028
Description: Any subset of a countable set is countable. (Contributed by Thierry Arnoux, 31-Jan-2017.) Avoid ax-pow 5328, ax-un 7718. (Revised by BTernaryTau, 7-Dec-2024.)
Assertion
Ref Expression
ssct ((𝐴𝐵𝐵 ≼ ω) → 𝐴 ≼ ω)

Proof of Theorem ssct
StepHypRef Expression
1 domssl 8975 1 ((𝐴𝐵𝐵 ≼ ω) → 𝐴 ≼ ω)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wss 3922   class class class wbr 5115  ωcom 7850  cdom 8920
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702  ax-sep 5259  ax-nul 5269  ax-pr 5395
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3047  df-rex 3056  df-rab 3412  df-v 3457  df-dif 3925  df-un 3927  df-in 3929  df-ss 3939  df-nul 4305  df-if 4497  df-sn 4598  df-pr 4600  df-op 4604  df-br 5116  df-opab 5178  df-xp 5652  df-rel 5653  df-cnv 5654  df-co 5655  df-dm 5656  df-rn 5657  df-res 5658  df-fun 6521  df-fn 6522  df-f 6523  df-f1 6524  df-dom 8924
This theorem is referenced by:  measvuni  34212  measiuns  34215  sxbrsigalem1  34284  ssnct  45043  fzct  45348  fzoct  45353  salexct  46305  opnvonmbllem2  46604
  Copyright terms: Public domain W3C validator