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

Theorem prodrbdc 12260
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 12259 . 2  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  (  seq M (  x.  ,  F )  ~~>  C  <->  seq N (  x.  ,  F )  ~~>  C ) )
101, 2, 4, 3, 6, 5, 8, 7prodrbdclem2 12259 . . 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 9876 . . 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 806 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 716  DECID wdc 842    = wceq 1398    e. wcel 2203    C_ wss 3211   ifcif 3620   class class class wbr 4109    |-> cmpt 4171   ` cfv 5352   CCcc 8125   1c1 8128    x. cmul 8132   ZZcz 9577   ZZ>=cuz 9853    seqcseq 10809    ~~> cli 11963
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-ilim 4490  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-frec 6622  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-inn 9238  df-n0 9497  df-z 9578  df-uz 9854  df-fz 10343  df-fzo 10477  df-seqfrec 10810  df-clim 11964
This theorem is referenced by:  prodmodc  12264  zproddc  12265
  Copyright terms: Public domain W3C validator