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

Theorem oav2 6726
Description: Value of ordinal addition. (Contributed by Mario Carneiro and Jim Kingdon, 12-Aug-2019.)
Assertion
Ref Expression
oav2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  =  ( A  u.  U_ x  e.  B  suc  ( A  +o  x ) ) )
Distinct variable groups:    x, A    x, B

Proof of Theorem oav2
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 oafnex 6707 . . 3  |-  ( y  e.  _V  |->  suc  y
)  Fn  _V
2 rdgival 6643 . . 3  |-  ( ( ( y  e.  _V  |->  suc  y )  Fn  _V  /\  A  e.  On  /\  B  e.  On )  ->  ( rec ( ( y  e.  _V  |->  suc  y ) ,  A
) `  B )  =  ( A  u.  U_ x  e.  B  ( ( y  e.  _V  |->  suc  y ) `  ( rec ( ( y  e. 
_V  |->  suc  y ) ,  A ) `  x
) ) ) )
31, 2mp3an1 1365 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( rec ( ( y  e.  _V  |->  suc  y ) ,  A
) `  B )  =  ( A  u.  U_ x  e.  B  ( ( y  e.  _V  |->  suc  y ) `  ( rec ( ( y  e. 
_V  |->  suc  y ) ,  A ) `  x
) ) ) )
4 oav 6717 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  =  ( rec ( ( y  e. 
_V  |->  suc  y ) ,  A ) `  B
) )
5 onelon 4524 . . . . . 6  |-  ( ( B  e.  On  /\  x  e.  B )  ->  x  e.  On )
6 vex 2824 . . . . . . . . . 10  |-  x  e. 
_V
7 oaexg 6711 . . . . . . . . . 10  |-  ( ( A  e.  On  /\  x  e.  _V )  ->  ( A  +o  x
)  e.  _V )
86, 7mpan2 429 . . . . . . . . 9  |-  ( A  e.  On  ->  ( A  +o  x )  e. 
_V )
9 sucexg 4640 . . . . . . . . . 10  |-  ( ( A  +o  x )  e.  _V  ->  suc  ( A  +o  x
)  e.  _V )
108, 9syl 14 . . . . . . . . 9  |-  ( A  e.  On  ->  suc  ( A  +o  x
)  e.  _V )
11 suceq 4542 . . . . . . . . . 10  |-  ( y  =  ( A  +o  x )  ->  suc  y  =  suc  ( A  +o  x ) )
12 eqid 2238 . . . . . . . . . 10  |-  ( y  e.  _V  |->  suc  y
)  =  ( y  e.  _V  |->  suc  y
)
1311, 12fvmptg 5775 . . . . . . . . 9  |-  ( ( ( A  +o  x
)  e.  _V  /\  suc  ( A  +o  x
)  e.  _V )  ->  ( ( y  e. 
_V  |->  suc  y ) `  ( A  +o  x
) )  =  suc  ( A  +o  x
) )
148, 10, 13syl2anc 415 . . . . . . . 8  |-  ( A  e.  On  ->  (
( y  e.  _V  |->  suc  y ) `  ( A  +o  x ) )  =  suc  ( A  +o  x ) )
1514adantr 276 . . . . . . 7  |-  ( ( A  e.  On  /\  x  e.  On )  ->  ( ( y  e. 
_V  |->  suc  y ) `  ( A  +o  x
) )  =  suc  ( A  +o  x
) )
16 oav 6717 . . . . . . . 8  |-  ( ( A  e.  On  /\  x  e.  On )  ->  ( A  +o  x
)  =  ( rec ( ( y  e. 
_V  |->  suc  y ) ,  A ) `  x
) )
1716fveq2d 5694 . . . . . . 7  |-  ( ( A  e.  On  /\  x  e.  On )  ->  ( ( y  e. 
_V  |->  suc  y ) `  ( A  +o  x
) )  =  ( ( y  e.  _V  |->  suc  y ) `  ( rec ( ( y  e. 
_V  |->  suc  y ) ,  A ) `  x
) ) )
1815, 17eqtr3d 2273 . . . . . 6  |-  ( ( A  e.  On  /\  x  e.  On )  ->  suc  ( A  +o  x )  =  ( ( y  e.  _V  |->  suc  y ) `  ( rec ( ( y  e. 
_V  |->  suc  y ) ,  A ) `  x
) ) )
195, 18sylan2 286 . . . . 5  |-  ( ( A  e.  On  /\  ( B  e.  On  /\  x  e.  B ) )  ->  suc  ( A  +o  x )  =  ( ( y  e. 
_V  |->  suc  y ) `  ( rec ( ( y  e.  _V  |->  suc  y ) ,  A
) `  x )
) )
2019anassrs 404 . . . 4  |-  ( ( ( A  e.  On  /\  B  e.  On )  /\  x  e.  B
)  ->  suc  ( A  +o  x )  =  ( ( y  e. 
_V  |->  suc  y ) `  ( rec ( ( y  e.  _V  |->  suc  y ) ,  A
) `  x )
) )
2120iuneq2dv 4028 . . 3  |-  ( ( A  e.  On  /\  B  e.  On )  ->  U_ x  e.  B  suc  ( A  +o  x
)  =  U_ x  e.  B  ( (
y  e.  _V  |->  suc  y ) `  ( rec ( ( y  e. 
_V  |->  suc  y ) ,  A ) `  x
) ) )
2221uneq2d 3383 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  u.  U_ x  e.  B  suc  ( A  +o  x
) )  =  ( A  u.  U_ x  e.  B  ( (
y  e.  _V  |->  suc  y ) `  ( rec ( ( y  e. 
_V  |->  suc  y ) ,  A ) `  x
) ) ) )
233, 4, 223eqtr4d 2281 1  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  =  ( A  u.  U_ x  e.  B  suc  ( A  +o  x ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821    u. cun 3218   U_ciun 4007    |-> cmpt 4187   Oncon0 4503   suc csuc 4505    Fn wfn 5367   ` cfv 5372  (class class class)co 6075   reccrdg 6630    +o coa 6674
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-in1 623  ax-in2 624  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-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-irdg 6631  df-oadd 6681
This theorem is referenced by:  oasuc  6727
  Copyright terms: Public domain W3C validator