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

Theorem oasuc 6465
Description: Addition with successor. Definition 8.1 of [TakeutiZaring] p. 56. (Contributed by NM, 3-May-1995.) (Revised by Mario Carneiro, 8-Sep-2013.)
Assertion
Ref Expression
oasuc  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  suc  B )  =  suc  ( A  +o  B ) )

Proof of Theorem oasuc
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 onsuc 4501 . . . . . 6  |-  ( B  e.  On  ->  suc  B  e.  On )
2 oav2 6464 . . . . . 6  |-  ( ( A  e.  On  /\  suc  B  e.  On )  ->  ( A  +o  suc  B )  =  ( A  u.  U_ x  e.  suc  B  suc  ( A  +o  x ) ) )
31, 2sylan2 286 . . . . 5  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  suc  B )  =  ( A  u.  U_ x  e. 
suc  B  suc  ( A  +o  x ) ) )
4 df-suc 4372 . . . . . . . . . 10  |-  suc  B  =  ( B  u.  { B } )
5 iuneq1 3900 . . . . . . . . . 10  |-  ( suc 
B  =  ( B  u.  { B }
)  ->  U_ x  e. 
suc  B  suc  ( A  +o  x )  = 
U_ x  e.  ( B  u.  { B } ) suc  ( A  +o  x ) )
64, 5ax-mp 5 . . . . . . . . 9  |-  U_ x  e.  suc  B  suc  ( A  +o  x )  = 
U_ x  e.  ( B  u.  { B } ) suc  ( A  +o  x )
7 iunxun 3967 . . . . . . . . 9  |-  U_ x  e.  ( B  u.  { B } ) suc  ( A  +o  x )  =  ( U_ x  e.  B  suc  ( A  +o  x )  u. 
U_ x  e.  { B } suc  ( A  +o  x ) )
86, 7eqtri 2198 . . . . . . . 8  |-  U_ x  e.  suc  B  suc  ( A  +o  x )  =  ( U_ x  e.  B  suc  ( A  +o  x )  u. 
U_ x  e.  { B } suc  ( A  +o  x ) )
9 oveq2 5883 . . . . . . . . . . 11  |-  ( x  =  B  ->  ( A  +o  x )  =  ( A  +o  B
) )
10 suceq 4403 . . . . . . . . . . 11  |-  ( ( A  +o  x )  =  ( A  +o  B )  ->  suc  ( A  +o  x
)  =  suc  ( A  +o  B ) )
119, 10syl 14 . . . . . . . . . 10  |-  ( x  =  B  ->  suc  ( A  +o  x
)  =  suc  ( A  +o  B ) )
1211iunxsng 3963 . . . . . . . . 9  |-  ( B  e.  On  ->  U_ x  e.  { B } suc  ( A  +o  x
)  =  suc  ( A  +o  B ) )
1312uneq2d 3290 . . . . . . . 8  |-  ( B  e.  On  ->  ( U_ x  e.  B  suc  ( A  +o  x
)  u.  U_ x  e.  { B } suc  ( A  +o  x
) )  =  (
U_ x  e.  B  suc  ( A  +o  x
)  u.  suc  ( A  +o  B ) ) )
148, 13eqtrid 2222 . . . . . . 7  |-  ( B  e.  On  ->  U_ x  e.  suc  B  suc  ( A  +o  x )  =  ( U_ x  e.  B  suc  ( A  +o  x )  u. 
suc  ( A  +o  B ) ) )
1514uneq2d 3290 . . . . . 6  |-  ( B  e.  On  ->  ( A  u.  U_ x  e. 
suc  B  suc  ( A  +o  x ) )  =  ( A  u.  ( U_ x  e.  B  suc  ( A  +o  x
)  u.  suc  ( A  +o  B ) ) ) )
1615adantl 277 . . . . 5  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  u.  U_ x  e.  suc  B  suc  ( A  +o  x
) )  =  ( A  u.  ( U_ x  e.  B  suc  ( A  +o  x
)  u.  suc  ( A  +o  B ) ) ) )
173, 16eqtrd 2210 . . . 4  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  suc  B )  =  ( A  u.  ( U_ x  e.  B  suc  ( A  +o  x )  u. 
suc  ( A  +o  B ) ) ) )
18 unass 3293 . . . 4  |-  ( ( A  u.  U_ x  e.  B  suc  ( A  +o  x ) )  u.  suc  ( A  +o  B ) )  =  ( A  u.  ( U_ x  e.  B  suc  ( A  +o  x
)  u.  suc  ( A  +o  B ) ) )
1917, 18eqtr4di 2228 . . 3  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  suc  B )  =  ( ( A  u.  U_ x  e.  B  suc  ( A  +o  x ) )  u.  suc  ( A  +o  B ) ) )
20 oav2 6464 . . . 4  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  =  ( A  u.  U_ x  e.  B  suc  ( A  +o  x ) ) )
2120uneq1d 3289 . . 3  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( ( A  +o  B )  u.  suc  ( A  +o  B
) )  =  ( ( A  u.  U_ x  e.  B  suc  ( A  +o  x
) )  u.  suc  ( A  +o  B
) ) )
2219, 21eqtr4d 2213 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  suc  B )  =  ( ( A  +o  B )  u.  suc  ( A  +o  B ) ) )
23 sssucid 4416 . . 3  |-  ( A  +o  B )  C_  suc  ( A  +o  B
)
24 ssequn1 3306 . . 3  |-  ( ( A  +o  B ) 
C_  suc  ( A  +o  B )  <->  ( ( A  +o  B )  u. 
suc  ( A  +o  B ) )  =  suc  ( A  +o  B ) )
2523, 24mpbi 145 . 2  |-  ( ( A  +o  B )  u.  suc  ( A  +o  B ) )  =  suc  ( A  +o  B )
2622, 25eqtrdi 2226 1  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  suc  B )  =  suc  ( A  +o  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1353    e. wcel 2148    u. cun 3128    C_ wss 3130   {csn 3593   U_ciun 3887   Oncon0 4364   suc csuc 4366  (class class class)co 5875    +o coa 6414
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4119  ax-sep 4122  ax-pow 4175  ax-pr 4210  ax-un 4434  ax-setind 4537
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2740  df-sbc 2964  df-csb 3059  df-dif 3132  df-un 3134  df-in 3136  df-ss 3143  df-nul 3424  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-uni 3811  df-iun 3889  df-br 4005  df-opab 4066  df-mpt 4067  df-tr 4103  df-id 4294  df-iord 4367  df-on 4369  df-suc 4372  df-xp 4633  df-rel 4634  df-cnv 4635  df-co 4636  df-dm 4637  df-rn 4638  df-res 4639  df-ima 4640  df-iota 5179  df-fun 5219  df-fn 5220  df-f 5221  df-f1 5222  df-fo 5223  df-f1o 5224  df-fv 5225  df-ov 5878  df-oprab 5879  df-mpo 5880  df-1st 6141  df-2nd 6142  df-recs 6306  df-irdg 6371  df-oadd 6421
This theorem is referenced by:  onasuc  6467  nnaordi  6509
  Copyright terms: Public domain W3C validator