MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tfrlem14 Unicode version

Theorem tfrlem14 6293
Description: Lemma for transfinite recursion. Assuming ax-rep 4028,  dom recs  e.  _V  <-> recs  e. 
_V, so since  dom recs is an ordinal, it must be equal to  On. (Contributed by NM, 14-Aug-1994.) (Revised by Mario Carneiro, 9-May-2015.)
Hypothesis
Ref Expression
tfrlem.1  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
Assertion
Ref Expression
tfrlem14  |-  dom recs ( F )  =  On
Distinct variable group:    x, f, y, F
Allowed substitution hints:    A( x, y, f)

Proof of Theorem tfrlem14
StepHypRef Expression
1 tfrlem.1 . . . 4  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
21tfrlem13 6292 . . 3  |-  -. recs ( F )  e.  _V
31tfrlem7 6285 . . . 4  |-  Fun recs ( F )
4 funex 5595 . . . 4  |-  ( ( Fun recs ( F )  /\  dom recs ( F
)  e.  On )  -> recs ( F )  e.  _V )
53, 4mpan 654 . . 3  |-  ( dom recs
( F )  e.  On  -> recs ( F
)  e.  _V )
62, 5mto 169 . 2  |-  -.  dom recs ( F )  e.  On
71tfrlem8 6286 . . . 4  |-  Ord  dom recs ( F )
8 ordeleqon 4471 . . . 4  |-  ( Ord 
dom recs ( F )  <->  ( dom recs ( F )  e.  On  \/  dom recs ( F )  =  On ) )
97, 8mpbi 201 . . 3  |-  ( dom recs
( F )  e.  On  \/  dom recs ( F )  =  On )
109ori 366 . 2  |-  ( -. 
dom recs ( F )  e.  On  ->  dom recs ( F )  =  On )
116, 10ax-mp 10 1  |-  dom recs ( F )  =  On
Colors of variables: wff set class
Syntax hints:   -. wn 5    \/ wo 359    /\ wa 360    = wceq 1619    e. wcel 1621   {cab 2239   A.wral 2509   E.wrex 2510   _Vcvv 2727   Ord word 4284   Oncon0 4285   dom cdm 4580    |` cres 4582   Fun wfun 4586    Fn wfn 4587   ` cfv 4592  recscrecs 6273
This theorem is referenced by:  tfr1  6299
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-13 1625  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1926  ax-ext 2234  ax-rep 4028  ax-sep 4038  ax-nul 4046  ax-pr 4108  ax-un 4403
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 940  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1883  df-eu 2118  df-mo 2119  df-clab 2240  df-cleq 2246  df-clel 2249  df-nfc 2374  df-ne 2414  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2516  df-v 2729  df-sbc 2922  df-csb 3010  df-dif 3081  df-un 3083  df-in 3085  df-ss 3089  df-pss 3091  df-nul 3363  df-if 3471  df-sn 3550  df-pr 3551  df-tp 3552  df-op 3553  df-uni 3728  df-iun 3805  df-br 3921  df-opab 3975  df-mpt 3976  df-tr 4011  df-eprel 4198  df-id 4202  df-po 4207  df-so 4208  df-fr 4245  df-we 4247  df-ord 4288  df-on 4289  df-suc 4291  df-xp 4594  df-rel 4595  df-cnv 4596  df-co 4597  df-dm 4598  df-rn 4599  df-res 4600  df-ima 4601  df-fun 4602  df-fn 4603  df-f 4604  df-f1 4605  df-fo 4606  df-f1o 4607  df-fv 4608  df-recs 6274
  Copyright terms: Public domain W3C validator