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

Theorem inf3 3471
Description: Our Axiom of Infinity ax-inf 1079 implies the standard Axiom of Infinity. The hypothesis is a variant of our Axiom of Infinity provided by inf2 3459, 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 inf4 3473 and zfinf 3474.) The main proof is provided by inf3lema 3460 through inf3lem7 3470, and this final piece eliminates the auxiliary hypothesis of inf3lem7 3470. 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 3461.)
  F_n+1 = {y<X | y^X subset F_n}  (See inf3lemc 3462.)
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 3464.)
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 3465.)
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 3466.)
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 3467.)
Proof:  Lemmas 1 and 3.

Lemma 5.  F_m proper_subset F_n, m < n.  (See inf3lem5 3468.)
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 3469.)
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 3470.)
Q.E.D.
Hypothesis
Ref Expression
inf3.1 xx = ∅ ∧ xx)
Assertion
Ref Expression
inf3 ω ∈ V

Proof of Theorem inf3
StepHypRef Expression
1 inf3.1 . 2 xx = ∅ ∧ xx)
2 cleqid 1102 . . . 4 {⟨y, z⟩∣z = {wx∣(wx) ⊆ y}} = {⟨y, z⟩∣z = {wx∣(wx) ⊆ y}}
3 cleqid 1102 . . . 4 (rec({⟨y, z⟩∣z = {wx∣(wx) ⊆ y}}, ∅) ↾ ω) = (rec({⟨y, z⟩∣z = {wx∣(wx) ⊆ y}}, ∅) ↾ ω)
4 visset 1350 . . . 4 xV
52, 3, 4, 4inf3lem7 3470 . . 3 ((¬ x = ∅ ∧ xx) → ω ∈ V)
6519.23aiv 952 . 2 (∃xx = ∅ ∧ xx) → ω ∈ V)
71, 6ax-mp 6 1 ω ∈ V
Colors of variables: wff set class
Syntax hints:  ¬ wn 1   ∧ wa 196  ∃wex 678   = wceq 1091   ∈ wcel 1092  {crab 1204  Vcvv 1348   ∩ cin 1486   ⊆ wss 1487  ∅c0 1707  cuni 1919  {copab 2055  ωcom 2372   ↾ cres 2412  reccrdg 2969
This theorem is referenced by:  inf4 3473
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077  ax-reg 1078
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ne 1192  df-ral 1205  df-rex 1206  df-rab 1208  df-v 1349  df-sbc 1441  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-pss 1494  df-nul 1708  df-if 1777  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-id 2125  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-lim 2204  df-suc 2205  df-om 2373  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-f1 2435  df-fv 2438  df-rdg 2970
metamath.org