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

Theorem smofvon 6825
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 6812 . . 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 1003 . 2  |-  ( Smo 
B  ->  B : dom  B --> On )
32ffvelrnda 5848 1  |-  ( ( Smo  B  /\  A  e.  dom  B )  -> 
( B `  A
)  e.  On )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    e. wcel 1756   A.wral 2720   Ord word 4723   Oncon0 4724   dom cdm 4845   -->wf 5419   ` cfv 5423   Smo wsmo 6811
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-sep 4418  ax-nul 4426  ax-pr 4536
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2573  df-ne 2613  df-ral 2725  df-rex 2726  df-rab 2729  df-v 2979  df-sbc 3192  df-dif 3336  df-un 3338  df-in 3340  df-ss 3347  df-nul 3643  df-if 3797  df-sn 3883  df-pr 3885  df-op 3889  df-uni 4097  df-br 4298  df-opab 4356  df-id 4641  df-xp 4851  df-rel 4852  df-cnv 4853  df-co 4854  df-dm 4855  df-rn 4856  df-iota 5386  df-fun 5425  df-fn 5426  df-f 5427  df-fv 5431  df-smo 6812
This theorem is referenced by:  smoiun  6827
  Copyright terms: Public domain W3C validator