Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  abrexctf Structured version   Visualization version   GIF version

Theorem abrexctf 30454
Description: An image set of a countable set is countable, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Thierry Arnoux, 8-Mar-2017.)
Hypothesis
Ref Expression
mptctf.1 𝑥𝐴
Assertion
Ref Expression
abrexctf (𝐴 ≼ ω → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ≼ ω)
Distinct variable groups:   𝑥,𝑦   𝑦,𝐴   𝑦,𝐵
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem abrexctf
StepHypRef Expression
1 eqid 2821 . . 3 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
21rnmpt 5827 . 2 ran (𝑥𝐴𝐵) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
3 mptctf.1 . . . 4 𝑥𝐴
43mptctf 30453 . . 3 (𝐴 ≼ ω → (𝑥𝐴𝐵) ≼ ω)
5 rnct 9947 . . 3 ((𝑥𝐴𝐵) ≼ ω → ran (𝑥𝐴𝐵) ≼ ω)
64, 5syl 17 . 2 (𝐴 ≼ ω → ran (𝑥𝐴𝐵) ≼ ω)
72, 6eqbrtrrid 5102 1 (𝐴 ≼ ω → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ≼ ω)
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  {cab 2799  wnfc 2961  wrex 3139   class class class wbr 5066  cmpt 5146  ran crn 5556  ωcom 7580  cdom 8507
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-inf2 9104  ax-ac2 9885
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-se 5515  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-isom 6364  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-1st 7689  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-1o 8102  df-oadd 8106  df-er 8289  df-map 8408  df-en 8510  df-dom 8511  df-sdom 8512  df-fin 8513  df-oi 8974  df-card 9368  df-acn 9371  df-ac 9542
This theorem is referenced by:  sigaclcuni  31377  measvunilem  31471
  Copyright terms: Public domain W3C validator