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

Theorem inf3lem7 3470
Description: Lemma for our Axiom of Infinity => standard Axiom of Infinity. See inf3 3471 for detailed description. In the proof, we invoke the Axiom of Replacement in the form of funrnex 2743.
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
inf3lem7 |- ((-. x = (/) /\ x (_ U.x) -> om e. V)
Distinct variable group(s):   x,y,z,w

Proof of Theorem inf3lem7
StepHypRef Expression
1 inf3lem.1 . . 3 |- G = {<.y, z>. | z = {w e. x | (w i^i x) (_ y}}
2 inf3lem.2 . . 3 |- F = (rec(G, (/)) |` om)
3 inf3lem.3 . . 3 |- A e. V
4 inf3lem.4 . . 3 |- B e. V
51, 2, 3, 4inf3lem6 3469 . 2 |- ((-. x = (/) /\ x (_ U.x) -> F:om-1-1->P~x)
6 f1f 2781 . . . . 5 |- (F:om-1-1->P~x -> F:om-->P~x)
7 fdm 2756 . . . . 5 |- (F:om-->P~x -> dom F = om)
86, 7syl 12 . . . 4 |- (F:om-1-1->P~x -> dom F = om)
9 dfdm4 2525 . . . 4 |- dom F = ran `'F
108, 9syl5eqr 1138 . . 3 |- (F:om-1-1->P~x -> ran `'F = om)
11 funrnex 2743 . . . 4 |- (dom `'F e. V -> (Fun `'F -> ran `'F e. V))
12 frn 2757 . . . . . 6 |- (F:om-->P~x -> ran F (_ P~x)
13 visset 1350 . . . . . . . 8 |- x e. V
1413pwex 1806 . . . . . . 7 |- P~x e. V
1514ssex 1700 . . . . . 6 |- (ran F (_ P~x -> ran F e. V)
166, 12, 153syl 21 . . . . 5 |- (F:om-1-1->P~x -> ran F e. V)
17 df-rn 2429 . . . . . 6 |- ran F = dom `'F
1817eleq1i 1152 . . . . 5 |- (ran F e. V <-> dom `'F e. V)
1916, 18sylib 173 . . . 4 |- (F:om-1-1->P~x -> dom `'F e. V)
20 df-f1 2435 . . . . 5 |- (F:om-1-1->P~x <-> (F:om-->P~x /\ Fun `'F))
2120pm3.27bd 263 . . . 4 |- (F:om-1-1->P~x -> Fun `'F)
2211, 19, 21sylc 62 . . 3 |- (F:om-1-1->P~x -> ran `'F e. V)
2310, 22eqeltrrd 1164 . 2 |- (F:om-1-1->P~x -> om e. V)
245, 23syl 12 1 |- ((-. x = (/) /\ x (_ U.x) -> om e. V)
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   /\ wa 196   = wceq 1091   e. wcel 1092  {crab 1204  Vcvv 1348   i^i cin 1486   (_ wss 1487  (/)c0 1707  P~cpw 1798  U.cuni 1919  {copab 2055  omcom 2372  `'ccnv 2409  dom cdm 2410  ran crn 2411   |` cres 2412  Fun wfun 2416  -->wf 2418  -1-1->wf1 2419  reccrdg 2969
This theorem is referenced by:  inf3 3471  inf5 3472
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