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

Theorem fin23 10429
Description: Every II-finite set (every chain of subsets has a maximal element) is III-finite (has no denumerable collection of subsets). The proof here is the only one I could find, from http://matwbn.icm.edu.pl/ksiazki/fm/fm6/fm619.pdf p.94 (writeup by Tarski, credited to Kuratowski). Translated into English and modern notation, the proof proceeds as follows (variables renamed for uniqueness):

Suppose for a contradiction that 𝐴 is a set which is II-finite but not III-finite.

For any countable sequence of distinct subsets 𝑇 of 𝐴, we can form a decreasing sequence of nonempty subsets (𝑈𝑇) by taking finite intersections of initial segments of 𝑇 while skipping over any element of 𝑇 which would cause the intersection to be empty.

By II-finiteness (as fin2i2 10358) this sequence contains its intersection, call it 𝑌; since by induction every subset in the sequence 𝑈 is nonempty, the intersection must be nonempty.

Suppose that an element 𝑋 of 𝑇 has nonempty intersection with 𝑌. Thus, said element has a nonempty intersection with the corresponding element of 𝑈, therefore it was used in the construction of 𝑈 and all further elements of 𝑈 are subsets of 𝑋, thus 𝑋 contains the 𝑌. That is, all elements of 𝑋 either contain 𝑌 or are disjoint from it.

Since there are only two cases, there must exist an infinite subset of 𝑇 which uniformly either contain 𝑌 or are disjoint from it. In the former case we can create an infinite set by subtracting 𝑌 from each element. In either case, call the result 𝑍; this is an infinite set of subsets of 𝐴, each of which is disjoint from 𝑌 and contained in the union of 𝑇; the union of 𝑍 is strictly contained in the union of 𝑇, because only the latter is a superset of the nonempty set 𝑌.

The preceding four steps may be iterated a countable number of times starting from the assumed denumerable set of subsets to produce a denumerable sequence 𝐵 of the 𝑇 sets from each stage. Great caution is required to avoid ax-dc 10486 here; in particular an effective version of the pigeonhole principle (for aleph-null pigeons and 2 holes) is required. Since a denumerable set of subsets is assumed to exist, we can conclude ω ∈ V without the axiom.

This 𝐵 sequence is strictly decreasing, thus it has no minimum, contradicting the first assumption. (Contributed by Stefan O'Rear, 2-Nov-2014.) (Proof shortened by Mario Carneiro, 17-May-2015.)

Assertion
Ref Expression
fin23 (𝐴 ∈ FinII𝐴 ∈ FinIII)

Proof of Theorem fin23
Dummy variables 𝑎 𝑔 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isf33lem 10406 . 2 FinIII = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎𝑥) → ran 𝑎 ∈ ran 𝑎)}
21fin23lem40 10391 1 (𝐴 ∈ FinII𝐴 ∈ FinIII)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2108  FinIIcfin2 10319  FinIIIcfin3 10321
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-pow 5365  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-rmo 3380  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-int 4947  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-se 5638  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-pred 6321  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-isom 6570  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-rpss 7743  df-om 7888  df-1st 8014  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-seqom 8488  df-1o 8506  df-er 8745  df-map 8868  df-en 8986  df-dom 8987  df-sdom 8988  df-fin 8989  df-wdom 9605  df-card 9979  df-fin2 10326  df-fin4 10327  df-fin3 10328
This theorem is referenced by:  fin1a2s  10454  finngch  10695  fin2so  37614
  Copyright terms: Public domain W3C validator