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

Theorem smofvon 5937
Description: If  B is a strictly monotone ordinal function, and  A is in the domain of  B, then the value of the function at 
A is an ordinal. (Contributed by Andrew Salmon, 20-Nov-2011.)
Assertion
Ref Expression
smofvon  |-  ( ( Smo  B  /\  A  e.  dom  B )  -> 
( B `  A
)  e.  On )

Proof of Theorem smofvon
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-smo 5924 . . 3  |-  ( Smo 
B  <->  ( B : dom  B --> On  /\  Ord  dom 
B  /\  A. x  e.  dom  B A. y  e.  dom  B ( x  e.  y  ->  ( B `  x )  e.  ( B `  y
) ) ) )
21simp1bi 953 . 2  |-  ( Smo 
B  ->  B : dom  B --> On )
32ffvelrnda 5323 1  |-  ( ( Smo  B  /\  A  e.  dom  B )  -> 
( B `  A
)  e.  On )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    e. wcel 1433   A.wral 2348   Ord word 4117   Oncon0 4118   dom cdm 4363   -->wf 4918   ` cfv 4922   Smo wsmo 5923
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-sbc 2816  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-fv 4930  df-smo 5924
This theorem is referenced by:  smoiun  5939
  Copyright terms: Public domain W3C validator