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

Theorem oasuc 6710
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 4628 . . . . . 6  |-  ( B  e.  On  ->  suc  B  e.  On )
2 oav2 6709 . . . . . 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 4497 . . . . . . . . . 10  |-  suc  B  =  ( B  u.  { B } )
5 iuneq1 4009 . . . . . . . . . 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 4076 . . . . . . . . 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 2255 . . . . . . . 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 6066 . . . . . . . . . . 11  |-  ( x  =  B  ->  ( A  +o  x )  =  ( A  +o  B
) )
10 suceq 4528 . . . . . . . . . . 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 4072 . . . . . . . . 9  |-  ( B  e.  On  ->  U_ x  e.  { B } suc  ( A  +o  x
)  =  suc  ( A  +o  B ) )
1312uneq2d 3377 . . . . . . . 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 2279 . . . . . . 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 3377 . . . . . 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 2267 . . . 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 3380 . . . 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 2285 . . 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 6709 . . . 4  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  B
)  =  ( A  u.  U_ x  e.  B  suc  ( A  +o  x ) ) )
2120uneq1d 3376 . . 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 2270 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  +o  suc  B )  =  ( ( A  +o  B )  u.  suc  ( A  +o  B ) ) )
23 sssucid 4541 . . 3  |-  ( A  +o  B )  C_  suc  ( A  +o  B
)
24 ssequn1 3393 . . 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 2283 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 1398    e. wcel 2205    u. cun 3212    C_ wss 3214   {csn 3694   U_ciun 3996   Oncon0 4489   suc csuc 4491  (class class class)co 6058    +o coa 6657
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-oadd 6664
This theorem is referenced by:  onasuc  6712  nnaordi  6754
  Copyright terms: Public domain W3C validator