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

Theorem smoiun 6386
Description: The value of a strictly monotone ordinal function contains its indexed union. (Contributed by Andrew Salmon, 22-Nov-2011.)
Assertion
Ref Expression
smoiun  |-  ( ( Smo  B  /\  A  e.  dom  B )  ->  U_ x  e.  A  ( B `  x ) 
C_  ( B `  A ) )
Distinct variable groups:    x, A    x, B

Proof of Theorem smoiun
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 eliun 3930 . . 3  |-  ( y  e.  U_ x  e.  A  ( B `  x )  <->  E. x  e.  A  y  e.  ( B `  x ) )
2 smofvon 6384 . . . . 5  |-  ( ( Smo  B  /\  A  e.  dom  B )  -> 
( B `  A
)  e.  On )
3 smoel 6385 . . . . . 6  |-  ( ( Smo  B  /\  A  e.  dom  B  /\  x  e.  A )  ->  ( B `  x )  e.  ( B `  A
) )
433expia 1207 . . . . 5  |-  ( ( Smo  B  /\  A  e.  dom  B )  -> 
( x  e.  A  ->  ( B `  x
)  e.  ( B `
 A ) ) )
5 ontr1 4435 . . . . . 6  |-  ( ( B `  A )  e.  On  ->  (
( y  e.  ( B `  x )  /\  ( B `  x )  e.  ( B `  A ) )  ->  y  e.  ( B `  A ) ) )
65expcomd 1460 . . . . 5  |-  ( ( B `  A )  e.  On  ->  (
( B `  x
)  e.  ( B `
 A )  -> 
( y  e.  ( B `  x )  ->  y  e.  ( B `  A ) ) ) )
72, 4, 6sylsyld 58 . . . 4  |-  ( ( Smo  B  /\  A  e.  dom  B )  -> 
( x  e.  A  ->  ( y  e.  ( B `  x )  ->  y  e.  ( B `  A ) ) ) )
87rexlimdv 2621 . . 3  |-  ( ( Smo  B  /\  A  e.  dom  B )  -> 
( E. x  e.  A  y  e.  ( B `  x )  ->  y  e.  ( B `  A ) ) )
91, 8biimtrid 152 . 2  |-  ( ( Smo  B  /\  A  e.  dom  B )  -> 
( y  e.  U_ x  e.  A  ( B `  x )  ->  y  e.  ( B `
 A ) ) )
109ssrdv 3198 1  |-  ( ( Smo  B  /\  A  e.  dom  B )  ->  U_ x  e.  A  ( B `  x ) 
C_  ( B `  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2175   E.wrex 2484    C_ wss 3165   U_ciun 3926   Oncon0 4409   dom cdm 4674   ` cfv 5270   Smo wsmo 6370
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-sbc 2998  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-iun 3928  df-br 4044  df-opab 4105  df-tr 4142  df-id 4339  df-iord 4412  df-on 4414  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-fv 5278  df-smo 6371
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator