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

Theorem tfrlem15 7058
Description: Lemma for transfinite recursion. Without assuming ax-rep 4558, we can show that all proper initial subsets of recs are sets, while nothing larger is a set. (Contributed by Mario Carneiro, 14-Nov-2014.)
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
tfrlem15  |-  ( B  e.  On  ->  ( B  e.  dom recs ( F )  <->  (recs ( F )  |`  B )  e.  _V ) )
Distinct variable groups:    x, f,
y, B    f, F, x, y
Allowed substitution hints:    A( x, y, f)

Proof of Theorem tfrlem15
StepHypRef Expression
1 tfrlem.1 . . . 4  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
21tfrlem9a 7052 . . 3  |-  ( B  e.  dom recs ( F
)  ->  (recs ( F )  |`  B )  e.  _V )
32adantl 466 . 2  |-  ( ( B  e.  On  /\  B  e.  dom recs ( F ) )  ->  (recs ( F )  |`  B )  e.  _V )
41tfrlem13 7056 . . . 4  |-  -. recs ( F )  e.  _V
5 simpr 461 . . . . 5  |-  ( ( B  e.  On  /\  (recs ( F )  |`  B )  e.  _V )  ->  (recs ( F )  |`  B )  e.  _V )
6 resss 5295 . . . . . . . 8  |-  (recs ( F )  |`  B ) 
C_ recs ( F )
76a1i 11 . . . . . . 7  |-  ( dom recs
( F )  C_  B  ->  (recs ( F )  |`  B )  C_ recs
( F ) )
81tfrlem6 7048 . . . . . . . . 9  |-  Rel recs ( F )
9 resdm 5313 . . . . . . . . 9  |-  ( Rel recs
( F )  -> 
(recs ( F )  |`  dom recs ( F ) )  = recs ( F ) )
108, 9ax-mp 5 . . . . . . . 8  |-  (recs ( F )  |`  dom recs ( F ) )  = recs ( F )
11 ssres2 5298 . . . . . . . 8  |-  ( dom recs
( F )  C_  B  ->  (recs ( F )  |`  dom recs ( F ) )  C_  (recs ( F )  |`  B ) )
1210, 11syl5eqssr 3549 . . . . . . 7  |-  ( dom recs
( F )  C_  B  -> recs ( F ) 
C_  (recs ( F )  |`  B )
)
137, 12eqssd 3521 . . . . . 6  |-  ( dom recs
( F )  C_  B  ->  (recs ( F )  |`  B )  = recs ( F ) )
1413eleq1d 2536 . . . . 5  |-  ( dom recs
( F )  C_  B  ->  ( (recs ( F )  |`  B )  e.  _V  <-> recs ( F
)  e.  _V )
)
155, 14syl5ibcom 220 . . . 4  |-  ( ( B  e.  On  /\  (recs ( F )  |`  B )  e.  _V )  ->  ( dom recs ( F )  C_  B  -> recs ( F )  e. 
_V ) )
164, 15mtoi 178 . . 3  |-  ( ( B  e.  On  /\  (recs ( F )  |`  B )  e.  _V )  ->  -.  dom recs ( F )  C_  B )
171tfrlem8 7050 . . . 4  |-  Ord  dom recs ( F )
18 eloni 4888 . . . . 5  |-  ( B  e.  On  ->  Ord  B )
1918adantr 465 . . . 4  |-  ( ( B  e.  On  /\  (recs ( F )  |`  B )  e.  _V )  ->  Ord  B )
20 ordtri1 4911 . . . . 5  |-  ( ( Ord  dom recs ( F
)  /\  Ord  B )  ->  ( dom recs ( F )  C_  B  <->  -.  B  e.  dom recs ( F ) ) )
2120con2bid 329 . . . 4  |-  ( ( Ord  dom recs ( F
)  /\  Ord  B )  ->  ( B  e. 
dom recs ( F )  <->  -.  dom recs ( F )  C_  B
) )
2217, 19, 21sylancr 663 . . 3  |-  ( ( B  e.  On  /\  (recs ( F )  |`  B )  e.  _V )  ->  ( B  e. 
dom recs ( F )  <->  -.  dom recs ( F )  C_  B
) )
2316, 22mpbird 232 . 2  |-  ( ( B  e.  On  /\  (recs ( F )  |`  B )  e.  _V )  ->  B  e.  dom recs ( F ) )
243, 23impbida 830 1  |-  ( B  e.  On  ->  ( B  e.  dom recs ( F )  <->  (recs ( F )  |`  B )  e.  _V ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1379    e. wcel 1767   {cab 2452   A.wral 2814   E.wrex 2815   _Vcvv 3113    C_ wss 3476   Ord word 4877   Oncon0 4878   dom cdm 4999    |` cres 5001   Rel wrel 5004    Fn wfn 5581   ` cfv 5586  recscrecs 7038
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4568  ax-nul 4576  ax-pow 4625  ax-pr 4686  ax-un 6574
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-sbc 3332  df-csb 3436  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-pss 3492  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-tp 4032  df-op 4034  df-uni 4246  df-iun 4327  df-br 4448  df-opab 4506  df-mpt 4507  df-tr 4541  df-eprel 4791  df-id 4795  df-po 4800  df-so 4801  df-fr 4838  df-we 4840  df-ord 4881  df-on 4882  df-suc 4884  df-xp 5005  df-rel 5006  df-cnv 5007  df-co 5008  df-dm 5009  df-rn 5010  df-res 5011  df-ima 5012  df-iota 5549  df-fun 5588  df-fn 5589  df-fv 5594  df-recs 7039
This theorem is referenced by:  tfrlem16  7059  tfr2b  7062
  Copyright terms: Public domain W3C validator