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

Theorem oav2 6518
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 6499 . . 3  |-  ( y  e.  _V  |->  suc  y
)  Fn  _V
2 rdgival 6437 . . 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 1335 . 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 6509 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  =  ( rec ( ( y  e. 
_V  |->  suc  y ) ,  A ) `  B
) )
5 onelon 4416 . . . . . 6  |-  ( ( B  e.  On  /\  x  e.  B )  ->  x  e.  On )
6 vex 2763 . . . . . . . . . 10  |-  x  e. 
_V
7 oaexg 6503 . . . . . . . . . 10  |-  ( ( A  e.  On  /\  x  e.  _V )  ->  ( A  +o  x
)  e.  _V )
86, 7mpan2 425 . . . . . . . . 9  |-  ( A  e.  On  ->  ( A  +o  x )  e. 
_V )
9 sucexg 4531 . . . . . . . . . 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 4434 . . . . . . . . . 10  |-  ( y  =  ( A  +o  x )  ->  suc  y  =  suc  ( A  +o  x ) )
12 eqid 2193 . . . . . . . . . 10  |-  ( y  e.  _V  |->  suc  y
)  =  ( y  e.  _V  |->  suc  y
)
1311, 12fvmptg 5634 . . . . . . . . 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 411 . . . . . . . 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 6509 . . . . . . . 8  |-  ( ( A  e.  On  /\  x  e.  On )  ->  ( A  +o  x
)  =  ( rec ( ( y  e. 
_V  |->  suc  y ) ,  A ) `  x
) )
1716fveq2d 5559 . . . . . . 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 2228 . . . . . 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 400 . . . 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 3934 . . 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 3314 . 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 2236 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 1364    e. wcel 2164   _Vcvv 2760    u. cun 3152   U_ciun 3913    |-> cmpt 4091   Oncon0 4395   suc csuc 4397    Fn wfn 5250   ` cfv 5255  (class class class)co 5919   reccrdg 6424    +o coa 6468
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-id 4325  df-iord 4398  df-on 4400  df-suc 4403  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-recs 6360  df-irdg 6425  df-oadd 6475
This theorem is referenced by:  oasuc  6519
  Copyright terms: Public domain W3C validator