ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  infpwfidom Unicode version

Theorem infpwfidom 7501
Description: The collection of finite subsets of a set dominates the set. (We use the weaker sethood assumption 
( ~P A  i^i  Fin )  e.  _V because this theorem also implies that  A is a set if  ~P A  i^i  Fin is.) (Contributed by Mario Carneiro, 17-May-2015.)
Assertion
Ref Expression
infpwfidom  |-  ( ( ~P A  i^i  Fin )  e.  _V  ->  A  ~<_  ( ~P A  i^i  Fin ) )

Proof of Theorem infpwfidom
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 snelpwi 4327 . . 3  |-  ( x  e.  A  ->  { x }  e.  ~P A
)
2 snfig 7056 . . 3  |-  ( x  e.  A  ->  { x }  e.  Fin )
31, 2elind 3404 . 2  |-  ( x  e.  A  ->  { x }  e.  ( ~P A  i^i  Fin ) )
4 sneqbg 3867 . . 3  |-  ( x  e.  A  ->  ( { x }  =  { y }  <->  x  =  y ) )
54adantr 276 . 2  |-  ( ( x  e.  A  /\  y  e.  A )  ->  ( { x }  =  { y }  <->  x  =  y ) )
63, 5dom2 7014 1  |-  ( ( ~P A  i^i  Fin )  e.  _V  ->  A  ~<_  ( ~P A  i^i  Fin ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1398    e. wcel 2203   _Vcvv 2813    i^i cin 3210   ~Pcpw 3669   {csn 3689   class class class wbr 4109    ~<_ cdom 6974   Fincfn 6975
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-1o 6647  df-en 6976  df-dom 6977  df-fin 6978
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator