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

Theorem omsuc 6475
Description: Multiplication with successor. Definition 8.15 of [TakeutiZaring] p. 62. (Contributed by NM, 17-Sep-1995.) (Revised by Mario Carneiro, 8-Sep-2013.)
Assertion
Ref Expression
omsuc  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  .o  suc  B )  =  ( ( A  .o  B )  +o  A ) )

Proof of Theorem omsuc
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 df-suc 4373 . . . . . . 7  |-  suc  B  =  ( B  u.  { B } )
2 iuneq1 3901 . . . . . . 7  |-  ( suc 
B  =  ( B  u.  { B }
)  ->  U_ x  e. 
suc  B ( ( A  .o  x )  +o  A )  = 
U_ x  e.  ( B  u.  { B } ) ( ( A  .o  x )  +o  A ) )
31, 2ax-mp 5 . . . . . 6  |-  U_ x  e.  suc  B ( ( A  .o  x )  +o  A )  = 
U_ x  e.  ( B  u.  { B } ) ( ( A  .o  x )  +o  A )
4 iunxun 3968 . . . . . 6  |-  U_ x  e.  ( B  u.  { B } ) ( ( A  .o  x )  +o  A )  =  ( U_ x  e.  B  ( ( A  .o  x )  +o  A )  u.  U_ x  e.  { B }  ( ( A  .o  x )  +o  A ) )
53, 4eqtri 2198 . . . . 5  |-  U_ x  e.  suc  B ( ( A  .o  x )  +o  A )  =  ( U_ x  e.  B  ( ( A  .o  x )  +o  A )  u.  U_ x  e.  { B }  ( ( A  .o  x )  +o  A ) )
6 oveq2 5885 . . . . . . . 8  |-  ( x  =  B  ->  ( A  .o  x )  =  ( A  .o  B
) )
76oveq1d 5892 . . . . . . 7  |-  ( x  =  B  ->  (
( A  .o  x
)  +o  A )  =  ( ( A  .o  B )  +o  A ) )
87iunxsng 3964 . . . . . 6  |-  ( B  e.  On  ->  U_ x  e.  { B }  (
( A  .o  x
)  +o  A )  =  ( ( A  .o  B )  +o  A ) )
98uneq2d 3291 . . . . 5  |-  ( B  e.  On  ->  ( U_ x  e.  B  ( ( A  .o  x )  +o  A
)  u.  U_ x  e.  { B }  (
( A  .o  x
)  +o  A ) )  =  ( U_ x  e.  B  (
( A  .o  x
)  +o  A )  u.  ( ( A  .o  B )  +o  A ) ) )
105, 9eqtrid 2222 . . . 4  |-  ( B  e.  On  ->  U_ x  e.  suc  B ( ( A  .o  x )  +o  A )  =  ( U_ x  e.  B  ( ( A  .o  x )  +o  A )  u.  (
( A  .o  B
)  +o  A ) ) )
1110adantl 277 . . 3  |-  ( ( A  e.  On  /\  B  e.  On )  ->  U_ x  e.  suc  B ( ( A  .o  x )  +o  A
)  =  ( U_ x  e.  B  (
( A  .o  x
)  +o  A )  u.  ( ( A  .o  B )  +o  A ) ) )
12 onsuc 4502 . . . 4  |-  ( B  e.  On  ->  suc  B  e.  On )
13 omv2 6468 . . . 4  |-  ( ( A  e.  On  /\  suc  B  e.  On )  ->  ( A  .o  suc  B )  =  U_ x  e.  suc  B ( ( A  .o  x
)  +o  A ) )
1412, 13sylan2 286 . . 3  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  .o  suc  B )  =  U_ x  e.  suc  B ( ( A  .o  x )  +o  A ) )
15 omv2 6468 . . . 4  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  .o  B
)  =  U_ x  e.  B  ( ( A  .o  x )  +o  A ) )
1615uneq1d 3290 . . 3  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( ( A  .o  B )  u.  (
( A  .o  B
)  +o  A ) )  =  ( U_ x  e.  B  (
( A  .o  x
)  +o  A )  u.  ( ( A  .o  B )  +o  A ) ) )
1711, 14, 163eqtr4d 2220 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  .o  suc  B )  =  ( ( A  .o  B )  u.  ( ( A  .o  B )  +o  A ) ) )
18 omcl 6464 . . 3  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  .o  B
)  e.  On )
19 simpl 109 . . 3  |-  ( ( A  e.  On  /\  B  e.  On )  ->  A  e.  On )
20 oaword1 6474 . . . 4  |-  ( ( ( A  .o  B
)  e.  On  /\  A  e.  On )  ->  ( A  .o  B
)  C_  ( ( A  .o  B )  +o  A ) )
21 ssequn1 3307 . . . 4  |-  ( ( A  .o  B ) 
C_  ( ( A  .o  B )  +o  A )  <->  ( ( A  .o  B )  u.  ( ( A  .o  B )  +o  A
) )  =  ( ( A  .o  B
)  +o  A ) )
2220, 21sylib 122 . . 3  |-  ( ( ( A  .o  B
)  e.  On  /\  A  e.  On )  ->  ( ( A  .o  B )  u.  (
( A  .o  B
)  +o  A ) )  =  ( ( A  .o  B )  +o  A ) )
2318, 19, 22syl2anc 411 . 2  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( ( A  .o  B )  u.  (
( A  .o  B
)  +o  A ) )  =  ( ( A  .o  B )  +o  A ) )
2417, 23eqtrd 2210 1  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  .o  suc  B )  =  ( ( A  .o  B )  +o  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1353    e. wcel 2148    u. cun 3129    C_ wss 3131   {csn 3594   U_ciun 3888   Oncon0 4365   suc csuc 4367  (class class class)co 5877    +o coa 6416    .o comu 6417
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 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538
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 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-id 4295  df-iord 4368  df-on 4370  df-suc 4373  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-recs 6308  df-irdg 6373  df-oadd 6423  df-omul 6424
This theorem is referenced by:  onmsuc  6476
  Copyright terms: Public domain W3C validator