Theorem infpwfidom 10068

Description: The collection of finite subsets of a set dominates the set. (We use the weaker sethood assumption (𝒫 𝐴 ∩ Fin) ∈ V because this theorem also implies that 𝐴 is a set if 𝒫 𝐴 ∩ Fin is.) (Contributed by Mario Carneiro, 17-May-2015.)

Assertion

Ref	Expression
infpwfidom	⊢ ((𝒫 𝐴 ∩ Fin) ∈ V → 𝐴 ≼ (𝒫 𝐴 ∩ Fin))

Proof of Theorem infpwfidom

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		snelpwi 5448	. . 3 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ∈ 𝒫 𝐴)
2		snfi 9083	. . . 4 ⊢ {𝑥} ∈ Fin
3	2	a1i 11	. . 3 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ∈ Fin)
4	1, 3	elind 4200	. 2 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ∈ (𝒫 𝐴 ∩ Fin))
5		sneqbg 4843	. . 3 ⊢ (𝑥 ∈ 𝐴 → ({𝑥} = {𝑦} ↔ 𝑥 = 𝑦))
6	5	adantr 480	. 2 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ({𝑥} = {𝑦} ↔ 𝑥 = 𝑦))
7	4, 6	dom2 9035	1 ⊢ ((𝒫 𝐴 ∩ Fin) ∈ V → 𝐴 ≼ (𝒫 𝐴 ∩ Fin))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1540   ∈ wcel 2108  Vcvv 3480   ∩ cin 3950  𝒫 cpw 4600  {csn 4626   class class class wbr 5143   ≼ cdom 8983  Fincfn 8985

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-om 7888  df-1o 8506  df-en 8986  df-dom 8987  df-fin 8989

This theorem is referenced by:  infpwfien  10102  ttukeylem1  10549  canthnum  10689