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

Theorem tfrlem14 6681
Description: Lemma for transfinite recursion. Assuming ax-rep 4345,  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 6680 . . 3  |-  -. recs ( F )  e.  _V
31tfrlem7 6673 . . . 4  |-  Fun recs ( F )
4 funex 5992 . . . 4  |-  ( ( Fun recs ( F )  /\  dom recs ( F
)  e.  On )  -> recs ( F )  e.  _V )
53, 4mpan 653 . . 3  |-  ( dom recs
( F )  e.  On  -> recs ( F
)  e.  _V )
62, 5mto 170 . 2  |-  -.  dom recs ( F )  e.  On
71tfrlem8 6674 . . 3  |-  Ord  dom recs ( F )
8 ordeleqon 4798 . . 3  |-  ( Ord 
dom recs ( F )  <->  ( dom recs ( F )  e.  On  \/  dom recs ( F )  =  On ) )
97, 8mpbi 201 . 2  |-  ( dom recs
( F )  e.  On  \/  dom recs ( F )  =  On )
106, 9mtp-or 1548 1  |-  dom recs ( F )  =  On
Colors of variables: wff set class
Syntax hints:    \/ wo 359    /\ wa 360    = wceq 1653    e. wcel 1727   {cab 2428   A.wral 2711   E.wrex 2712   _Vcvv 2962   Ord word 4609   Oncon0 4610   dom cdm 4907    |` cres 4909   Fun wfun 5477    Fn wfn 5478   ` cfv 5483  recscrecs 6661
This theorem is referenced by:  tfr1  6687
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1668  ax-8 1689  ax-13 1729  ax-14 1731  ax-6 1746  ax-7 1751  ax-11 1763  ax-12 1953  ax-ext 2423  ax-rep 4345  ax-sep 4355  ax-nul 4363  ax-pow 4406  ax-pr 4432  ax-un 4730
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 938  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2291  df-mo 2292  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2567  df-ne 2607  df-ral 2716  df-rex 2717  df-reu 2718  df-rab 2720  df-v 2964  df-sbc 3168  df-csb 3268  df-dif 3309  df-un 3311  df-in 3313  df-ss 3320  df-pss 3322  df-nul 3614  df-if 3764  df-sn 3844  df-pr 3845  df-tp 3846  df-op 3847  df-uni 4040  df-iun 4119  df-br 4238  df-opab 4292  df-mpt 4293  df-tr 4328  df-eprel 4523  df-id 4527  df-po 4532  df-so 4533  df-fr 4570  df-we 4572  df-ord 4613  df-on 4614  df-suc 4616  df-xp 4913  df-rel 4914  df-cnv 4915  df-co 4916  df-dm 4917  df-rn 4918  df-res 4919  df-ima 4920  df-iota 5447  df-fun 5485  df-fn 5486  df-f 5487  df-f1 5488  df-fo 5489  df-f1o 5490  df-fv 5491  df-recs 6662
  Copyright terms: Public domain W3C validator