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

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

Proof of Theorem ssct
StepHypRef Expression
1 domssl 9012 1 ((𝐴𝐵𝐵 ≼ ω) → 𝐴 ≼ ω)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wss 3945   class class class wbr 5142  ωcom 7864  cdom 8955
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2699  ax-sep 5293  ax-nul 5300  ax-pr 5423
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2061  df-clab 2706  df-cleq 2720  df-clel 2806  df-ral 3058  df-rex 3067  df-rab 3429  df-v 3472  df-dif 3948  df-un 3950  df-in 3952  df-ss 3962  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-br 5143  df-opab 5205  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-dom 8959
This theorem is referenced by:  measvuni  33827  measiuns  33830  sxbrsigalem1  33899  ssnct  44437  fzct  44755  fzoct  44760  salexct  45716  opnvonmbllem2  46015
  Copyright terms: Public domain W3C validator