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

Theorem inf3lemd 4612
Description: Lemma for our Axiom of Infinity => standard Axiom of Infinity. See inf3 4620 for detailed description.
Hypotheses
Ref Expression
inf3lem.1 |- G = {<.y, z>. | z = {w e. x | (w i^i x) (_ y}}
inf3lem.2 |- F = (rec(G, (/)) |` om)
inf3lem.3 |- A e. V
inf3lem.4 |- B e. V
Assertion
Ref Expression
inf3lemd |- (A e. om -> (F` A) (_ x)
Distinct variable group:   x,y,z,w

Proof of Theorem inf3lemd
StepHypRef Expression
1 0ss 2301 . . . 4 |- (/) (_ x
2 fveq2 3724 . . . . . 6 |- (A = (/) -> (F` A) = (F` (/)))
3 inf3lem.1 . . . . . . 7 |- G = {<.y, z>. | z = {w e. x | (w i^i x) (_ y}}
4 inf3lem.2 . . . . . . 7 |- F = (rec(G, (/)) |` om)
5 inf3lem.3 . . . . . . 7 |- A e. V
6 inf3lem.4 . . . . . . 7 |- B e. V
73, 4, 5, 6inf3lemb 4610 . . . . . 6 |- (F` (/)) = (/)
82, 7syl6eq 1523 . . . . 5 |- (A = (/) -> (F` A) = (/))
98sseq1d 2088 . . . 4 |- (A = (/) -> ((F` A) (_ x <-> (/) (_ x))
101, 9mpbiri 194 . . 3 |- (A = (/) -> (F` A) (_ x)
1110a1d 12 . 2 |- (A = (/) -> (A e. om -> (F` A) (_ x))
12 nnsuc 3148 . . . 4 |- ((A e. om /\ A =/= (/)) -> E.v e. om A = suc v)
13 fveq2 3724 . . . . . . 7 |- (A = suc v -> (F` A) = (F` suc v))
1413sseq1d 2088 . . . . . 6 |- (A = suc v -> ((F` A) (_ x <-> (F` suc v) (_ x))
15 visset 1813 . . . . . . . . . 10 |- v e. V
163, 4, 15, 6inf3lemc 4611 . . . . . . . . 9 |- (v e. om -> (F` suc v) = (G` (F` v)))
1716eleq2d 1541 . . . . . . . 8 |- (v e. om -> (u e. (F` suc v) <-> u e. (G` (F` v))))
18 visset 1813 . . . . . . . . . 10 |- u e. V
19 fvex 3732 . . . . . . . . . 10 |- (F` v) e. V
203, 4, 18, 19inf3lema 4609 . . . . . . . . 9 |- (u e. (G` (F` v)) <-> (u e. x /\ (u i^i x) (_ (F` v)))
2120pm3.26bi 322 . . . . . . . 8 |- (u e. (G` (F` v)) -> u e. x)
2217, 21syl6bi 214 . . . . . . 7 |- (v e. om -> (u e. (F` suc v) -> u e. x))
2322ssrdv 2070 . . . . . 6 |- (v e. om -> (F` suc v) (_ x)
2414, 23syl5cbir 211 . . . . 5 |- (v e. om -> (A = suc v -> (F` A) (_ x))
2524r19.23aiv 1743 . . . 4 |- (E.v e. om A = suc v -> (F` A) (_ x)
2612, 25syl 10 . . 3 |- ((A e. om /\ A =/= (/)) -> (F` A) (_ x)
2726expcom 374 . 2 |- (A =/= (/) -> (A e. om -> (F` A) (_ x))
2811, 27pm2.61ine 1634 1 |- (A e. om -> (F` A) (_ x)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223   = wceq 956   e. wcel 958   =/= wne 1585  E.wrex 1646  {crab 1648  Vcvv 1811   i^i cin 2046   (_ wss 2047  (/)c0 2280  {copab 2666  suc csuc 2950  omcom 3131   |` cres 3172  ` cfv 3182  reccrdg 3931
This theorem is referenced by:  inf3lem2 4614  inf3lem3 4615  inf3lem6 4618
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-9 965  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-rep 2693  ax-sep 2703  ax-nul 2710  ax-pow 2742  ax-pr 2779  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 776  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-rab 1652  df-v 1812  df-sbc 1942  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-if 2362  df-pw 2402  df-sn 2412  df-pr 2413  df-tp 2415  df-op 2416  df-uni 2504  df-iun 2568  df-br 2620  df-opab 2667  df-tr 2681  df-eprel 2832  df-id 2835  df-po 2840  df-so 2850  df-fr 2917  df-we 2934  df-ord 2951  df-on 2952  df-lim 2953  df-suc 2954  df-om 3132  df-xp 3184  df-rel 3185  df-cnv 3186  df-co 3187  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fun 3192  df-fn 3193  df-fv 3198  df-rdg 3932
Copyright terms: Public domain