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

Theorem inf3lemd 4595
Description: Lemma for our Axiom of Infinity => standard Axiom of Infinity. See inf3 4603 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 2298 . . . 4 |- (/) (_ x
2 fveq2 3719 . . . . . 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 4593 . . . . . 6 |- (F` (/)) = (/)
82, 7syl6eq 1521 . . . . 5 |- (A = (/) -> (F` A) = (/))
98sseq1d 2085 . . . 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 3144 . . . 4 |- ((A e. om /\ A =/= (/)) -> E.v e. om A = suc v)
13 fveq2 3719 . . . . . . 7 |- (A = suc v -> (F` A) = (F` suc v))
1413sseq1d 2085 . . . . . 6 |- (A = suc v -> ((F` A) (_ x <-> (F` suc v) (_ x))
15 visset 1810 . . . . . . . . . 10 |- v e. V
163, 4, 15, 6inf3lemc 4594 . . . . . . . . 9 |- (v e. om -> (F` suc v) = (G` (F` v)))
1716eleq2d 1539 . . . . . . . 8 |- (v e. om -> (u e. (F` suc v) <-> u e. (G` (F` v))))
18 visset 1810 . . . . . . . . . 10 |- u e. V
19 fvex 3727 . . . . . . . . . 10 |- (F` v) e. V
203, 4, 18, 19inf3lema 4592 . . . . . . . . 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 2067 . . . . . 6 |- (v e. om -> (F` suc v) (_ x)
2414, 23syl5cbir 211 . . . . 5 |- (v e. om -> (A = suc v -> (F` A) (_ x))
2524r19.23aiv 1741 . . . 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 1632 1 |- (A e. om -> (F` A) (_ x)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223   = wceq 955   e. wcel 957   =/= wne 1583  E.wrex 1644  {crab 1646  Vcvv 1808   i^i cin 2043   (_ wss 2044  (/)c0 2277  {copab 2662  suc csuc 2946  omcom 3127   |` cres 3168  ` cfv 3178  reccrdg 3926
This theorem is referenced by:  inf3lem2 4597  inf3lem3 4598  inf3lem6 4601
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-9 964  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1209  ax-11o 1217  ax-ext 1458  ax-rep 2689  ax-sep 2699  ax-nul 2706  ax-pow 2738  ax-pr 2775  ax-un 2862
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 775  df-3an 776  df-ex 980  df-sb 1171  df-eu 1381  df-mo 1382  df-clab 1463  df-cleq 1468  df-clel 1471  df-ne 1585  df-ral 1647  df-rex 1648  df-rab 1650  df-v 1809  df-sbc 1939  df-dif 2046  df-un 2047  df-in 2048  df-ss 2050  df-nul 2278  df-if 2359  df-pw 2399  df-sn 2409  df-pr 2410  df-tp 2412  df-op 2413  df-uni 2500  df-iun 2564  df-br 2616  df-opab 2663  df-tr 2677  df-eprel 2828  df-id 2831  df-po 2836  df-so 2846  df-fr 2913  df-we 2930  df-ord 2947  df-on 2948  df-lim 2949  df-suc 2950  df-om 3128  df-xp 3180  df-rel 3181  df-cnv 3182  df-co 3183  df-dm 3184  df-rn 3185  df-res 3186  df-ima 3187  df-fun 3188  df-fn 3189  df-fv 3194  df-rdg 3927
Copyright terms: Public domain