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

Theorem inf3 4592
Description: Our Axiom of Infinity ax-inf 4594 implies the standard Axiom of Infinity. The hypothesis is a variant of our Axiom of Infinity provided by inf2 4580, 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 4596 and zfinf 4598.) The main proof is provided by inf3lema 4581 through inf3lem7 4591, and this final piece eliminates the auxiliary hypothesis of inf3lem7 4591. 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-96, 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 4582.)
  F_n+1 = {y<X | y^X subset F_n}  (See inf3lemc 4583.)
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 4585.)
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 4586.)
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 4587.)
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 4588.)
Proof:  Lemmas 1 and 3.

Lemma 5.  F_m proper_subset F_n, m < n.  (See inf3lem5 4589.)
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 4590.)
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 4591.)
Q.E.D.
Hypothesis
Ref Expression
inf3.1 |- E.x(x =/= (/) /\ x (_ U.x)
Assertion
Ref Expression
inf3 |- om e. V

Proof of Theorem inf3
StepHypRef Expression
1 inf3.1 . 2 |- E.x(x =/= (/) /\ x (_ U.x)
2 eqid 1468 . . . 4 |- {<.y, z>. | z = {w e. x | (w i^i x) (_ y}} = {<.y, z>. | z = {w e. x | (w i^i x) (_ y}}
3 eqid 1468 . . . 4 |- (rec({<.y, z>. | z = {w e. x | (w i^i x) (_ y}}, (/)) |` om) = (rec({<.y, z>. | z = {w e. x | (w i^i x) (_ y}}, (/)) |` om)
4 visset 1804 . . . 4 |- x e. V
52, 3, 4, 4inf3lem7 4591 . . 3 |- ((x =/= (/) /\ x (_ U.x) -> om e. V)
6519.23aiv 1290 . 2 |- (E.x(x =/= (/) /\ x (_ U.x) -> om e. V)
71, 6ax-mp 7 1 |- om e. V
Colors of variables: wff set class
Syntax hints:   /\ wa 223   = wceq 953   e. wcel 955  E.wex 977   =/= wne 1577  {crab 1640  Vcvv 1802   i^i cin 2036   (_ wss 2037  (/)c0 2270  U.cuni 2493  {copab 2656  omcom 3121   |` cres 3162  reccrdg 3916
This theorem is referenced by:  axinf2 4596  grothinf 8720
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-9 962  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-rep 2683  ax-sep 2693  ax-nul 2700  ax-pow 2732  ax-pr 2769  ax-un 2857  ax-reg 4565
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 774  df-3an 775  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-ral 1641  df-rex 1642  df-rab 1644  df-v 1803  df-sbc 1932  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-pss 2045  df-nul 2271  df-if 2352  df-pw 2392  df-sn 2402  df-pr 2403  df-tp 2405  df-op 2406  df-uni 2494  df-iun 2558  df-br 2610  df-opab 2657  df-tr 2671  df-eprel 2821  df-id 2824  df-po 2831  df-so 2841  df-fr 2907  df-we 2924  df-ord 2941  df-on 2942  df-lim 2943  df-suc 2944  df-om 3122  df-xp 3174  df-rel 3175  df-cnv 3176  df-co 3177  df-dm 3178  df-rn 3179  df-res 3180  df-ima 3181  df-fun 3182  df-fn 3183  df-f 3184  df-f1 3185  df-fv 3188  df-rdg 3917
Copyright terms: Public domain