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

Theorem infpwfidom 7260
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 4242 . . 3  |-  ( x  e.  A  ->  { x }  e.  ~P A
)
2 snfig 6870 . . 3  |-  ( x  e.  A  ->  { x }  e.  Fin )
31, 2elind 3345 . 2  |-  ( x  e.  A  ->  { x }  e.  ( ~P A  i^i  Fin ) )
4 sneqbg 3790 . . 3  |-  ( x  e.  A  ->  ( { x }  =  { y }  <->  x  =  y ) )
54adantr 276 . 2  |-  ( ( x  e.  A  /\  y  e.  A )  ->  ( { x }  =  { y }  <->  x  =  y ) )
63, 5dom2 6831 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 1364    e. wcel 2164   _Vcvv 2760    i^i cin 3153   ~Pcpw 3602   {csn 3619   class class class wbr 4030    ~<_ cdom 6795   Fincfn 6796
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-suc 4403  df-iom 4624  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-1o 6471  df-en 6797  df-dom 6798  df-fin 6799
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator