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

Theorem infpwfidom 7054
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 4134 . . 3  |-  ( x  e.  A  ->  { x }  e.  ~P A
)
2 snfig 6708 . . 3  |-  ( x  e.  A  ->  { x }  e.  Fin )
31, 2elind 3261 . 2  |-  ( x  e.  A  ->  { x }  e.  ( ~P A  i^i  Fin ) )
4 sneqbg 3690 . . 3  |-  ( x  e.  A  ->  ( { x }  =  { y }  <->  x  =  y ) )
54adantr 274 . 2  |-  ( ( x  e.  A  /\  y  e.  A )  ->  ( { x }  =  { y }  <->  x  =  y ) )
63, 5dom2 6669 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 104    = wceq 1331    e. wcel 1480   _Vcvv 2686    i^i cin 3070   ~Pcpw 3510   {csn 3527   class class class wbr 3929    ~<_ cdom 6633   Fincfn 6634
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-1o 6313  df-en 6635  df-dom 6636  df-fin 6637
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator