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

Theorem prodrbdc 12125
Description: Rebase the starting point of a product. (Contributed by Scott Fenton, 4-Dec-2017.)
Hypotheses
Ref Expression
prodmo.1  |-  F  =  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  1 ) )
prodmo.2  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  CC )
prodrb.4  |-  ( ph  ->  M  e.  ZZ )
prodrb.5  |-  ( ph  ->  N  e.  ZZ )
prodrb.6  |-  ( ph  ->  A  C_  ( ZZ>= `  M ) )
prodrb.7  |-  ( ph  ->  A  C_  ( ZZ>= `  N ) )
prodrbdc.mdc  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  -> DECID  k  e.  A
)
prodrbdc.ndc  |-  ( (
ph  /\  k  e.  ( ZZ>= `  N )
)  -> DECID  k  e.  A
)
Assertion
Ref Expression
prodrbdc  |-  ( ph  ->  (  seq M (  x.  ,  F )  ~~>  C  <->  seq N (  x.  ,  F )  ~~>  C ) )
Distinct variable groups:    A, k    k, F    k, M    k, N    ph, k
Allowed substitution hints:    B( k)    C( k)

Proof of Theorem prodrbdc
StepHypRef Expression
1 prodmo.1 . . 3  |-  F  =  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  1 ) )
2 prodmo.2 . . 3  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  CC )
3 prodrb.4 . . 3  |-  ( ph  ->  M  e.  ZZ )
4 prodrb.5 . . 3  |-  ( ph  ->  N  e.  ZZ )
5 prodrb.6 . . 3  |-  ( ph  ->  A  C_  ( ZZ>= `  M ) )
6 prodrb.7 . . 3  |-  ( ph  ->  A  C_  ( ZZ>= `  N ) )
7 prodrbdc.mdc . . 3  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  -> DECID  k  e.  A
)
8 prodrbdc.ndc . . 3  |-  ( (
ph  /\  k  e.  ( ZZ>= `  N )
)  -> DECID  k  e.  A
)
91, 2, 3, 4, 5, 6, 7, 8prodrbdclem2 12124 . 2  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  (  seq M (  x.  ,  F )  ~~>  C  <->  seq N (  x.  ,  F )  ~~>  C ) )
101, 2, 4, 3, 6, 5, 8, 7prodrbdclem2 12124 . . 3  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  (  seq N (  x.  ,  F )  ~~>  C  <->  seq M (  x.  ,  F )  ~~>  C ) )
1110bicomd 141 . 2  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  (  seq M (  x.  ,  F )  ~~>  C  <->  seq N (  x.  ,  F )  ~~>  C ) )
12 uztric 9768 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  e.  (
ZZ>= `  M )  \/  M  e.  ( ZZ>= `  N ) ) )
133, 4, 12syl2anc 411 . 2  |-  ( ph  ->  ( N  e.  (
ZZ>= `  M )  \/  M  e.  ( ZZ>= `  N ) ) )
149, 11, 13mpjaodan 803 1  |-  ( ph  ->  (  seq M (  x.  ,  F )  ~~>  C  <->  seq N (  x.  ,  F )  ~~>  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 713  DECID wdc 839    = wceq 1395    e. wcel 2200    C_ wss 3198   ifcif 3603   class class class wbr 4086    |-> cmpt 4148   ` cfv 5324   CCcc 8020   1c1 8023    x. cmul 8027   ZZcz 9469   ZZ>=cuz 9745    seqcseq 10699    ~~> cli 11829
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-ilim 4464  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-frec 6552  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-inn 9134  df-n0 9393  df-z 9470  df-uz 9746  df-fz 10234  df-fzo 10368  df-seqfrec 10700  df-clim 11830
This theorem is referenced by:  prodmodc  12129  zproddc  12130
  Copyright terms: Public domain W3C validator