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

Theorem oasuc 6360
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 4417 . . . . . 6  |-  ( B  e.  On  ->  suc  B  e.  On )
2 oav2 6359 . . . . . 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 4293 . . . . . . . . . 10  |-  suc  B  =  ( B  u.  { B } )
5 iuneq1 3826 . . . . . . . . . 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 3892 . . . . . . . . 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 2160 . . . . . . . 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 5782 . . . . . . . . . . 11  |-  ( x  =  B  ->  ( A  +o  x )  =  ( A  +o  B
) )
10 suceq 4324 . . . . . . . . . . 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 3888 . . . . . . . . 9  |-  ( B  e.  On  ->  U_ x  e.  { B } suc  ( A  +o  x
)  =  suc  ( A  +o  B ) )
1312uneq2d 3230 . . . . . . . 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 2184 . . . . . . 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 3230 . . . . . 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 2172 . . . 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 3233 . . . 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 2190 . . 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 6359 . . . 4  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  =  ( A  u.  U_ x  e.  B  suc  ( A  +o  x ) ) )
2120uneq1d 3229 . . 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 2175 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  suc  B )  =  ( ( A  +o  B )  u.  suc  ( A  +o  B ) ) )
23 sssucid 4337 . . 3  |-  ( A  +o  B )  C_  suc  ( A  +o  B
)
24 ssequn1 3246 . . 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, 25syl6eq 2188 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 1331    e. wcel 1480    u. cun 3069    C_ wss 3071   {csn 3527   U_ciun 3813   Oncon0 4285   suc csuc 4287  (class class class)co 5774    +o coa 6310
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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-suc 4293  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-recs 6202  df-irdg 6267  df-oadd 6317
This theorem is referenced by:  onasuc  6362  nnaordi  6404
  Copyright terms: Public domain W3C validator