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

Theorem oasuc 6432
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 4478 . . . . . 6  |-  ( B  e.  On  ->  suc  B  e.  On )
2 oav2 6431 . . . . . 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 284 . . . . 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 4349 . . . . . . . . . 10  |-  suc  B  =  ( B  u.  { B } )
5 iuneq1 3879 . . . . . . . . . 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 3945 . . . . . . . . 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 2186 . . . . . . . 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 5850 . . . . . . . . . . 11  |-  ( x  =  B  ->  ( A  +o  x )  =  ( A  +o  B
) )
10 suceq 4380 . . . . . . . . . . 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 3941 . . . . . . . . 9  |-  ( B  e.  On  ->  U_ x  e.  { B } suc  ( A  +o  x
)  =  suc  ( A  +o  B ) )
1312uneq2d 3276 . . . . . . . 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 2211 . . . . . . 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 3276 . . . . . 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 275 . . . . 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 2198 . . . 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 3279 . . . 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 2217 . . 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 6431 . . . 4  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  =  ( A  u.  U_ x  e.  B  suc  ( A  +o  x ) ) )
2120uneq1d 3275 . . 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 2201 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  suc  B )  =  ( ( A  +o  B )  u.  suc  ( A  +o  B ) ) )
23 sssucid 4393 . . 3  |-  ( A  +o  B )  C_  suc  ( A  +o  B
)
24 ssequn1 3292 . . 3  |-  ( ( A  +o  B ) 
C_  suc  ( A  +o  B )  <->  ( ( A  +o  B )  u. 
suc  ( A  +o  B ) )  =  suc  ( A  +o  B ) )
2523, 24mpbi 144 . 2  |-  ( ( A  +o  B )  u.  suc  ( A  +o  B ) )  =  suc  ( A  +o  B )
2622, 25eqtrdi 2215 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 103    = wceq 1343    e. wcel 2136    u. cun 3114    C_ wss 3116   {csn 3576   U_ciun 3866   Oncon0 4341   suc csuc 4343  (class class class)co 5842    +o coa 6381
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-id 4271  df-iord 4344  df-on 4346  df-suc 4349  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-irdg 6338  df-oadd 6388
This theorem is referenced by:  onasuc  6434  nnaordi  6476
  Copyright terms: Public domain W3C validator