Theorem infpwfidom 7550

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.

Step	Hyp	Ref	Expression
1		snelpwi 4351	. . 3 |- ( x e. A -> { x } e. ~P A )
2		snfig 7103	. . 3 |- ( x e. A -> { x } e. Fin )
3	1, 2	elind 3414	. 2 |- ( x e. A -> { x } e. ( ~P A i^i Fin ) )
4		sneqbg 3888	. . 3 |- ( x e. A -> ( { x } = { y } <-> x = y ) )
5	4	adantr 276	. 2 |- ( ( x e. A /\ y e. A ) -> ( { x } = { y } <-> x = y ) )
6	3, 5	dom2 7061	1 |- ( ( ~P A i^i Fin ) e. _V -> A ~<_ ( ~P A i^i Fin ) )

This proof depends on syntax axioms:   -> wi 4   <-> wb 105   = wceq 1402   e. wcel 2209   _Vcvv 2821   i^i cin 3219   ~Pcpw 3688   {csn 3709   class class class wbr 4130   ~<_ cdom 7021   Fincfn 7022

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1o 6687  df-en 7023  df-dom 7024  df-fin 7025

This theorem is used by: (None)