HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem inf3 4629
Description: Our Axiom of Infinity ax-inf 4631 implies the standard Axiom of Infinity. The hypothesis is a variant of our Axiom of Infinity provided by inf2 4617, and the conclusion is the version of the Axiom of Infinity shown as Axiom 7 in [TakeutiZaring] p. 43. (Other standard versions are proved later as axinf2 4633 and zfinf 4635.) The main proof is provided by inf3lema 4618 through inf3lem7 4628, and this final piece eliminates the auxiliary hypothesis of inf3lem7 4628. This proof is due to Ian Sutherland, Richard Heck, and Norman Megill and was posted on Usenet as shown below. Although the result is not new, the authors were unable to find a published proof.

(As posted to sci.logic on 30-Oct-1996, with annotations added.)

Theorem:  The statement "There exists a non-empty set that is a subset
of its union" implies the Axiom of Infinity.

Proof:  Let X be a nonempty set which is a subset of its union; the latter
property is equivalent to saying that for any y in X, there exists a z in X
such that y is in z.

Define by finite recursion a function F:omega-->(power X) such that
  F_0 = 0  (See inf3lemb 4619.)
  F_n+1 = {y<X | y^X subset F_n}  (See inf3lemc 4620.)
Note: ^ means intersect, < means \in ("element of").
(Finite recursion as typically done requires the existence of omega;
to avoid this we can just use transfinite recursion restricted to omega.
F is a class-term that is not necessarily a set at this point.)

Lemma 1.  F_n subset F_n+1.  (See inf3lem1 4622.)
Proof:  By induction:  F_0 subset F_1.  If y < F_n+1, then y^X subset F_n,
so if F_n subset F_n+1, then y^X subset F_n+1, so y < F_n+2.

Lemma 2.  F_n =/= X.  (See inf3lem2 4623.)
Proof:  By induction:  F_0 =/= X because X is not empty.  Assume F_n =/= X.
Then there is a y in X that is not in F_n.  By definition of X, there is a
z in X that contains y.  Suppose F_n+1 = X.  Then z is in F_n+1, and z^X
contains y, so z^X is not a subset of F_n, contrary to the definition of
F_n+1.

Lemma 3.  F_n =/= F_n+1.  (See inf3lem3 4624.)
Proof:  Using the identity y^X subset F_n <-> y^(X-F_n) = 0, we have
F_n+1 = {y<X | y^(X-F_n) = 0}.  Let q = {y<X-F_n | y^(X-F_n) = 0}.
Then q subset F_n+1.  Since X-F_n is not empty by Lemma 2 and q is the
set of \in-minimal elements of X-F_n, by Foundation q is not empty, so q
and therefore F_n+1 have an element not in F_n.

Lemma 4.  F_n proper_subset F_n+1.  (See inf3lem4 4625.)
Proof:  Lemmas 1 and 3.

Lemma 5.  F_m proper_subset F_n, m < n.  (See inf3lem5 4626.)
Proof:  Fix m and use induction on n > m.  Basis: F_m proper_subset F_m+1
by Lemma 4.  Induction:  Assume F_m proper_subset F_n.  Then since F_n
proper_subset F_n+1, F_m proper_subset F_n+1 by transitivity of proper
subset.

By Lemma 5, F_m =/= F_n for m =/= n, so F is 1-1.  (See inf3lem6 4627.)
Thus the inverse of F is a function with range omega and domain a subset
of power X, so omega exists by Replacement.  (See inf3lem7 4628.)
Q.E.D.
Hypothesis
Ref Expression
inf3.1 x(x x x)
Assertion
Ref Expression
inf3 ω V

Proof of Theorem inf3
StepHypRef Expression
1 inf3.1 . 2 x(x x x)
2 eqid 1478 . . . 4 {y, zz = {w x(wx) y}} = {y, zz = {w x(wx) y}}
3 eqid 1478 . . . 4 (rec({y, zz = {w x(wx) y}}, ) ω) = (rec({y, zz = {w x(wx) y}}, ) ω)
4 visset 1816 . . . 4 x V
52, 3, 4, 4inf3lem7 4628 . . 3 ((x x x) → ω V)
6519.23aiv 1297 . 2 (x(x x x) → ω V)
71, 6ax-mp 7 1 ω V
Colors of variables: wff set class
Syntax hints:   wa 223   = wceq 958   wcel 960  wex 982   ≠ wne 1588  {crab 1651  Vcvv 1814   ∩ cin 2049   wss 2050  c0 2283  cuni 2507  {copab 2671  ωcom 3137   cres 3178  reccrdg 3937
This theorem is referenced by:  axinf2 4633  grothinf 8776
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-9 967  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-rep 2698  ax-sep 2708  ax-nul 2715  ax-pow 2748  ax-pr 2785  ax-un 2872  ax-reg 4602
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 778  df-3an 779  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-rab 1655  df-v 1815  df-sbc 1945  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-pss 2058  df-nul 2284  df-if 2366  df-pw 2406  df-sn 2416  df-pr 2417  df-tp 2419  df-op 2420  df-uni 2508  df-iun 2572  df-br 2625  df-opab 2672  df-tr 2686  df-eprel 2838  df-id 2841  df-po 2846  df-so 2856  df-fr 2923  df-we 2940  df-ord 2957  df-on 2958  df-lim 2959  df-suc 2960  df-om 3138  df-xp 3190  df-rel 3191  df-cnv 3192  df-co 3193  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-fun 3198  df-fn 3199  df-f 3200  df-f1 3201  df-fv 3204  df-rdg 3938
Copyright terms: Public domain