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

Theorem oasuc 6207
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 suceloni 4308 . . . . . 6  |-  ( B  e.  On  ->  suc  B  e.  On )
2 oav2 6206 . . . . . 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 280 . . . . 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 4189 . . . . . . . . . 10  |-  suc  B  =  ( B  u.  { B } )
5 iuneq1 3738 . . . . . . . . . 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 7 . . . . . . . . 9  |-  U_ x  e.  suc  B  suc  ( A  +o  x )  = 
U_ x  e.  ( B  u.  { B } ) suc  ( A  +o  x )
7 iunxun 3804 . . . . . . . . 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 2108 . . . . . . . 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 5642 . . . . . . . . . . 11  |-  ( x  =  B  ->  ( A  +o  x )  =  ( A  +o  B
) )
10 suceq 4220 . . . . . . . . . . 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 3800 . . . . . . . . 9  |-  ( B  e.  On  ->  U_ x  e.  { B } suc  ( A  +o  x
)  =  suc  ( A  +o  B ) )
1312uneq2d 3152 . . . . . . . 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, 13syl5eq 2132 . . . . . . 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 3152 . . . . . 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 271 . . . . 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 2120 . . . 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 3155 . . . 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, 18syl6eqr 2138 . . 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 6206 . . . 4  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  =  ( A  u.  U_ x  e.  B  suc  ( A  +o  x ) ) )
2120uneq1d 3151 . . 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 2123 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  suc  B )  =  ( ( A  +o  B )  u.  suc  ( A  +o  B ) ) )
23 sssucid 4233 . . 3  |-  ( A  +o  B )  C_  suc  ( A  +o  B
)
24 ssequn1 3168 . . 3  |-  ( ( A  +o  B ) 
C_  suc  ( A  +o  B )  <->  ( ( A  +o  B )  u. 
suc  ( A  +o  B ) )  =  suc  ( A  +o  B ) )
2523, 24mpbi 143 . 2  |-  ( ( A  +o  B )  u.  suc  ( A  +o  B ) )  =  suc  ( A  +o  B )
2622, 25syl6eq 2136 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 102    = wceq 1289    e. wcel 1438    u. cun 2995    C_ wss 2997   {csn 3441   U_ciun 3725   Oncon0 4181   suc csuc 4183  (class class class)co 5634    +o coa 6160
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-coll 3946  ax-sep 3949  ax-pow 4001  ax-pr 4027  ax-un 4251  ax-setind 4343
This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-ral 2364  df-rex 2365  df-reu 2366  df-rab 2368  df-v 2621  df-sbc 2839  df-csb 2932  df-dif 2999  df-un 3001  df-in 3003  df-ss 3010  df-nul 3285  df-pw 3427  df-sn 3447  df-pr 3448  df-op 3450  df-uni 3649  df-iun 3727  df-br 3838  df-opab 3892  df-mpt 3893  df-tr 3929  df-id 4111  df-iord 4184  df-on 4186  df-suc 4189  df-xp 4434  df-rel 4435  df-cnv 4436  df-co 4437  df-dm 4438  df-rn 4439  df-res 4440  df-ima 4441  df-iota 4967  df-fun 5004  df-fn 5005  df-f 5006  df-f1 5007  df-fo 5008  df-f1o 5009  df-fv 5010  df-ov 5637  df-oprab 5638  df-mpt2 5639  df-1st 5893  df-2nd 5894  df-recs 6052  df-irdg 6117  df-oadd 6167
This theorem is referenced by:  onasuc  6209  nnaordi  6247
  Copyright terms: Public domain W3C validator