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

Theorem infpwfidom 7372
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 4296 . . 3  |-  ( x  e.  A  ->  { x }  e.  ~P A
)
2 snfig 6965 . . 3  |-  ( x  e.  A  ->  { x }  e.  Fin )
31, 2elind 3389 . 2  |-  ( x  e.  A  ->  { x }  e.  ( ~P A  i^i  Fin ) )
4 sneqbg 3840 . . 3  |-  ( x  e.  A  ->  ( { x }  =  { y }  <->  x  =  y ) )
54adantr 276 . 2  |-  ( ( x  e.  A  /\  y  e.  A )  ->  ( { x }  =  { y }  <->  x  =  y ) )
63, 5dom2 6924 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 1395    e. wcel 2200   _Vcvv 2799    i^i cin 3196   ~Pcpw 3649   {csn 3666   class class class wbr 4082    ~<_ cdom 6884   Fincfn 6885
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4198  ax-sep 4201  ax-nul 4209  ax-pow 4257  ax-pr 4292  ax-un 4523
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-int 3923  df-iun 3966  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-suc 4461  df-iom 4682  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-f 5321  df-f1 5322  df-fo 5323  df-f1o 5324  df-fv 5325  df-1o 6560  df-en 6886  df-dom 6887  df-fin 6888
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator