ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  smores2 Unicode version

Theorem smores2 6565
Description: A strictly monotone ordinal function restricted to an ordinal is still monotone. (Contributed by Mario Carneiro, 15-Mar-2013.)
Assertion
Ref Expression
smores2  |-  ( ( Smo  F  /\  Ord  A )  ->  Smo  ( F  |`  A ) )

Proof of Theorem smores2
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfsmo2 6558 . . . . . . 7  |-  ( Smo 
F  <->  ( F : dom  F --> On  /\  Ord  dom 
F  /\  A. x  e.  dom  F A. y  e.  x  ( F `  y )  e.  ( F `  x ) ) )
21simp1bi 1043 . . . . . 6  |-  ( Smo 
F  ->  F : dom  F --> On )
3 ffun 5536 . . . . . 6  |-  ( F : dom  F --> On  ->  Fun 
F )
42, 3syl 14 . . . . 5  |-  ( Smo 
F  ->  Fun  F )
5 funres 5418 . . . . . 6  |-  ( Fun 
F  ->  Fun  ( F  |`  A ) )
6 funfn 5407 . . . . . 6  |-  ( Fun  ( F  |`  A )  <-> 
( F  |`  A )  Fn  dom  ( F  |`  A ) )
75, 6sylib 122 . . . . 5  |-  ( Fun 
F  ->  ( F  |`  A )  Fn  dom  ( F  |`  A ) )
84, 7syl 14 . . . 4  |-  ( Smo 
F  ->  ( F  |`  A )  Fn  dom  ( F  |`  A ) )
9 df-ima 4787 . . . . . 6  |-  ( F
" A )  =  ran  ( F  |`  A )
10 imassrn 5137 . . . . . 6  |-  ( F
" A )  C_  ran  F
119, 10eqsstrri 3281 . . . . 5  |-  ran  ( F  |`  A )  C_  ran  F
12 frn 5542 . . . . . 6  |-  ( F : dom  F --> On  ->  ran 
F  C_  On )
132, 12syl 14 . . . . 5  |-  ( Smo 
F  ->  ran  F  C_  On )
1411, 13sstrid 3259 . . . 4  |-  ( Smo 
F  ->  ran  ( F  |`  A )  C_  On )
15 df-f 5381 . . . 4  |-  ( ( F  |`  A ) : dom  ( F  |`  A ) --> On  <->  ( ( F  |`  A )  Fn 
dom  ( F  |`  A )  /\  ran  ( F  |`  A ) 
C_  On ) )
168, 14, 15sylanbrc 421 . . 3  |-  ( Smo 
F  ->  ( F  |`  A ) : dom  ( F  |`  A ) --> On )
1716adantr 276 . 2  |-  ( ( Smo  F  /\  Ord  A )  ->  ( F  |`  A ) : dom  ( F  |`  A ) --> On )
18 smodm 6562 . . 3  |-  ( Smo 
F  ->  Ord  dom  F
)
19 ordin 4530 . . . . 5  |-  ( ( Ord  A  /\  Ord  dom 
F )  ->  Ord  ( A  i^i  dom  F
) )
20 dmres 5084 . . . . . 6  |-  dom  ( F  |`  A )  =  ( A  i^i  dom  F )
21 ordeq 4517 . . . . . 6  |-  ( dom  ( F  |`  A )  =  ( A  i^i  dom 
F )  ->  ( Ord  dom  ( F  |`  A )  <->  Ord  ( A  i^i  dom  F )
) )
2220, 21ax-mp 5 . . . . 5  |-  ( Ord 
dom  ( F  |`  A )  <->  Ord  ( A  i^i  dom  F )
)
2319, 22sylibr 134 . . . 4  |-  ( ( Ord  A  /\  Ord  dom 
F )  ->  Ord  dom  ( F  |`  A ) )
2423ancoms 268 . . 3  |-  ( ( Ord  dom  F  /\  Ord  A )  ->  Ord  dom  ( F  |`  A ) )
2518, 24sylan 283 . 2  |-  ( ( Smo  F  /\  Ord  A )  ->  Ord  dom  ( F  |`  A ) )
26 resss 5087 . . . . . 6  |-  ( F  |`  A )  C_  F
27 dmss 4980 . . . . . 6  |-  ( ( F  |`  A )  C_  F  ->  dom  ( F  |`  A )  C_  dom  F )
2826, 27ax-mp 5 . . . . 5  |-  dom  ( F  |`  A )  C_  dom  F
291simp3bi 1045 . . . . 5  |-  ( Smo 
F  ->  A. x  e.  dom  F A. y  e.  x  ( F `  y )  e.  ( F `  x ) )
30 ssralv 3312 . . . . 5  |-  ( dom  ( F  |`  A ) 
C_  dom  F  ->  ( A. x  e.  dom  F A. y  e.  x  ( F `  y )  e.  ( F `  x )  ->  A. x  e.  dom  ( F  |`  A ) A. y  e.  x  ( F `  y )  e.  ( F `  x ) ) )
3128, 29, 30mpsyl 65 . . . 4  |-  ( Smo 
F  ->  A. x  e.  dom  ( F  |`  A ) A. y  e.  x  ( F `  y )  e.  ( F `  x ) )
3231adantr 276 . . 3  |-  ( ( Smo  F  /\  Ord  A )  ->  A. x  e.  dom  ( F  |`  A ) A. y  e.  x  ( F `  y )  e.  ( F `  x ) )
33 ordtr1 4533 . . . . . . . . . . 11  |-  ( Ord 
dom  ( F  |`  A )  ->  (
( y  e.  x  /\  x  e.  dom  ( F  |`  A ) )  ->  y  e.  dom  ( F  |`  A ) ) )
3425, 33syl 14 . . . . . . . . . 10  |-  ( ( Smo  F  /\  Ord  A )  ->  ( (
y  e.  x  /\  x  e.  dom  ( F  |`  A ) )  -> 
y  e.  dom  ( F  |`  A ) ) )
35 inss1 3451 . . . . . . . . . . . 12  |-  ( A  i^i  dom  F )  C_  A
3620, 35eqsstri 3280 . . . . . . . . . . 11  |-  dom  ( F  |`  A )  C_  A
3736sseli 3244 . . . . . . . . . 10  |-  ( y  e.  dom  ( F  |`  A )  ->  y  e.  A )
3834, 37syl6 33 . . . . . . . . 9  |-  ( ( Smo  F  /\  Ord  A )  ->  ( (
y  e.  x  /\  x  e.  dom  ( F  |`  A ) )  -> 
y  e.  A ) )
3938expcomd 1491 . . . . . . . 8  |-  ( ( Smo  F  /\  Ord  A )  ->  ( x  e.  dom  ( F  |`  A )  ->  (
y  e.  x  -> 
y  e.  A ) ) )
4039imp31 256 . . . . . . 7  |-  ( ( ( ( Smo  F  /\  Ord  A )  /\  x  e.  dom  ( F  |`  A ) )  /\  y  e.  x )  ->  y  e.  A )
41 fvres 5719 . . . . . . 7  |-  ( y  e.  A  ->  (
( F  |`  A ) `
 y )  =  ( F `  y
) )
4240, 41syl 14 . . . . . 6  |-  ( ( ( ( Smo  F  /\  Ord  A )  /\  x  e.  dom  ( F  |`  A ) )  /\  y  e.  x )  ->  ( ( F  |`  A ) `  y
)  =  ( F `
 y ) )
4336sseli 3244 . . . . . . . 8  |-  ( x  e.  dom  ( F  |`  A )  ->  x  e.  A )
44 fvres 5719 . . . . . . . 8  |-  ( x  e.  A  ->  (
( F  |`  A ) `
 x )  =  ( F `  x
) )
4543, 44syl 14 . . . . . . 7  |-  ( x  e.  dom  ( F  |`  A )  ->  (
( F  |`  A ) `
 x )  =  ( F `  x
) )
4645ad2antlr 493 . . . . . 6  |-  ( ( ( ( Smo  F  /\  Ord  A )  /\  x  e.  dom  ( F  |`  A ) )  /\  y  e.  x )  ->  ( ( F  |`  A ) `  x
)  =  ( F `
 x ) )
4742, 46eleq12d 2309 . . . . 5  |-  ( ( ( ( Smo  F  /\  Ord  A )  /\  x  e.  dom  ( F  |`  A ) )  /\  y  e.  x )  ->  ( ( ( F  |`  A ) `  y
)  e.  ( ( F  |`  A ) `  x )  <->  ( F `  y )  e.  ( F `  x ) ) )
4847ralbidva 2546 . . . 4  |-  ( ( ( Smo  F  /\  Ord  A )  /\  x  e.  dom  ( F  |`  A ) )  -> 
( A. y  e.  x  ( ( F  |`  A ) `  y
)  e.  ( ( F  |`  A ) `  x )  <->  A. y  e.  x  ( F `  y )  e.  ( F `  x ) ) )
4948ralbidva 2546 . . 3  |-  ( ( Smo  F  /\  Ord  A )  ->  ( A. x  e.  dom  ( F  |`  A ) A. y  e.  x  ( ( F  |`  A ) `  y )  e.  ( ( F  |`  A ) `
 x )  <->  A. x  e.  dom  ( F  |`  A ) A. y  e.  x  ( F `  y )  e.  ( F `  x ) ) )
5032, 49mpbird 167 . 2  |-  ( ( Smo  F  /\  Ord  A )  ->  A. x  e.  dom  ( F  |`  A ) A. y  e.  x  ( ( F  |`  A ) `  y )  e.  ( ( F  |`  A ) `
 x ) )
51 dfsmo2 6558 . 2  |-  ( Smo  ( F  |`  A )  <-> 
( ( F  |`  A ) : dom  ( F  |`  A ) --> On  /\  Ord  dom  ( F  |`  A )  /\  A. x  e. 
dom  ( F  |`  A ) A. y  e.  x  ( ( F  |`  A ) `  y )  e.  ( ( F  |`  A ) `
 x ) ) )
5217, 25, 50, 51syl3anbrc 1212 1  |-  ( ( Smo  F  /\  Ord  A )  ->  Smo  ( F  |`  A ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528    i^i cin 3219    C_ wss 3220   Ord word 4507   Oncon0 4508   dom cdm 4774   ran crn 4775    |` cres 4776   "cima 4777   Fun wfun 5371    Fn wfn 5372   -->wf 5373   ` cfv 5377   Smo wsmo 6556
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-tr 4230  df-iord 4511  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-smo 6557
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator