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

Theorem smofvon 6570
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 6557 . . 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 1043 . 2  |-  ( Smo 
B  ->  B : dom  B --> On )
32ffvelcdmda 5843 1  |-  ( ( Smo  B  /\  A  e.  dom  B )  -> 
( B `  A
)  e.  On )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    e. wcel 2209   A.wral 2528   Ord word 4507   Oncon0 4508   dom cdm 4774   -->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-sbc 3052  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-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-smo 6557
This theorem is used by:  smoiun  6572
  Copyright terms: Public domain W3C validator