isfin1-2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > isfin1-2		Structured version Visualization version GIF version

Theorem isfin1-2 10299

Description: A set is finite in the usual sense iff the power set of its power set is Dedekind finite. (Contributed by Stefan O'Rear, 3-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.)

**Assertion**
Ref	Expression
isfin1-2	⊢ (𝐴 ∈ Fin ↔ 𝒫 𝒫 𝐴 ∈ Fin^IV)

**Proof of Theorem isfin1-2**
Step	Hyp	Ref	Expression
1		elex 3462	. 2 ⊢ (𝐴 ∈ Fin → 𝐴 ∈ V)
2		elex 3462	. . 3 ⊢ (𝒫 𝒫 𝐴 ∈ Fin^IV → 𝒫 𝒫 𝐴 ∈ V)
3		pwexb 7713	. . . 4 ⊢ (𝐴 ∈ V ↔ 𝒫 𝐴 ∈ V)
4		pwexb 7713	. . . 4 ⊢ (𝒫 𝐴 ∈ V ↔ 𝒫 𝒫 𝐴 ∈ V)
5	3, 4	bitri 275	. . 3 ⊢ (𝐴 ∈ V ↔ 𝒫 𝒫 𝐴 ∈ V)
6	2, 5	sylibr 234	. 2 ⊢ (𝒫 𝒫 𝐴 ∈ Fin^IV → 𝐴 ∈ V)
7		ominf 9168	. . . . . 6 ⊢ ¬ ω ∈ Fin
8		pwfi 9223	. . . . . . . 8 ⊢ (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Fin)
9		pwfi 9223	. . . . . . . 8 ⊢ (𝒫 𝐴 ∈ Fin ↔ 𝒫 𝒫 𝐴 ∈ Fin)
10	8, 9	bitri 275	. . . . . . 7 ⊢ (𝐴 ∈ Fin ↔ 𝒫 𝒫 𝐴 ∈ Fin)
11		domfi 9117	. . . . . . . 8 ⊢ ((𝒫 𝒫 𝐴 ∈ Fin ∧ ω ≼ 𝒫 𝒫 𝐴) → ω ∈ Fin)
12	11	expcom 413	. . . . . . 7 ⊢ (ω ≼ 𝒫 𝒫 𝐴 → (𝒫 𝒫 𝐴 ∈ Fin → ω ∈ Fin))
13	10, 12	biimtrid 242	. . . . . 6 ⊢ (ω ≼ 𝒫 𝒫 𝐴 → (𝐴 ∈ Fin → ω ∈ Fin))
14	7, 13	mtoi 199	. . . . 5 ⊢ (ω ≼ 𝒫 𝒫 𝐴 → ¬ 𝐴 ∈ Fin)
15		fineqvlem 9170	. . . . . 6 ⊢ ((𝐴 ∈ V ∧ ¬ 𝐴 ∈ Fin) → ω ≼ 𝒫 𝒫 𝐴)
16	15	ex 412	. . . . 5 ⊢ (𝐴 ∈ V → (¬ 𝐴 ∈ Fin → ω ≼ 𝒫 𝒫 𝐴))
17	14, 16	impbid2 226	. . . 4 ⊢ (𝐴 ∈ V → (ω ≼ 𝒫 𝒫 𝐴 ↔ ¬ 𝐴 ∈ Fin))
18	17	con2bid 354	. . 3 ⊢ (𝐴 ∈ V → (𝐴 ∈ Fin ↔ ¬ ω ≼ 𝒫 𝒫 𝐴))
19		isfin4-2 10228	. . . 4 ⊢ (𝒫 𝒫 𝐴 ∈ V → (𝒫 𝒫 𝐴 ∈ Fin^IV ↔ ¬ ω ≼ 𝒫 𝒫 𝐴))
20	5, 19	sylbi 217	. . 3 ⊢ (𝐴 ∈ V → (𝒫 𝒫 𝐴 ∈ Fin^IV ↔ ¬ ω ≼ 𝒫 𝒫 𝐴))
21	18, 20	bitr4d 282	. 2 ⊢ (𝐴 ∈ V → (𝐴 ∈ Fin ↔ 𝒫 𝒫 𝐴 ∈ Fin^IV))
22	1, 6, 21	pm5.21nii 378	1 ⊢ (𝐴 ∈ Fin ↔ 𝒫 𝒫 𝐴 ∈ Fin^IV)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 ↔ wb 206 ∈ wcel 2114 Vcvv 3441 𝒫 cpw 4555 class class class wbr 5099 ωcom 7810 ≼ cdom 8885 Fincfn 8887 Fin^IVcfin4 10194

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7363 df-om 7811 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-fin4 10201

This theorem is referenced by: (None)

W3C validator