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

Theorem fproddivapf 12182
Description: The quotient of two finite products. A version of fproddivap 12181 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
Hypotheses
Ref Expression
fproddivf.kph  |-  F/ k
ph
fproddivf.a  |-  ( ph  ->  A  e.  Fin )
fproddivf.b  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  CC )
fproddivf.c  |-  ( (
ph  /\  k  e.  A )  ->  C  e.  CC )
fproddivf.ap0  |-  ( (
ph  /\  k  e.  A )  ->  C #  0 )
Assertion
Ref Expression
fproddivapf  |-  ( ph  ->  prod_ k  e.  A  ( B  /  C
)  =  ( prod_
k  e.  A  B  /  prod_ k  e.  A  C ) )
Distinct variable group:    A, k
Allowed substitution hints:    ph( k)    B( k)    C( k)

Proof of Theorem fproddivapf
Dummy variable  j is distinct from all other variables.
StepHypRef Expression
1 nfcv 2372 . . . 4  |-  F/_ j
( B  /  C
)
2 nfcsb1v 3158 . . . . 5  |-  F/_ k [_ j  /  k ]_ B
3 nfcv 2372 . . . . 5  |-  F/_ k  /
4 nfcsb1v 3158 . . . . 5  |-  F/_ k [_ j  /  k ]_ C
52, 3, 4nfov 6043 . . . 4  |-  F/_ k
( [_ j  /  k ]_ B  /  [_ j  /  k ]_ C
)
6 csbeq1a 3134 . . . . 5  |-  ( k  =  j  ->  B  =  [_ j  /  k ]_ B )
7 csbeq1a 3134 . . . . 5  |-  ( k  =  j  ->  C  =  [_ j  /  k ]_ C )
86, 7oveq12d 6031 . . . 4  |-  ( k  =  j  ->  ( B  /  C )  =  ( [_ j  / 
k ]_ B  /  [_ j  /  k ]_ C
) )
91, 5, 8cbvprodi 12111 . . 3  |-  prod_ k  e.  A  ( B  /  C )  =  prod_ j  e.  A  ( [_ j  /  k ]_ B  /  [_ j  /  k ]_ C )
109a1i 9 . 2  |-  ( ph  ->  prod_ k  e.  A  ( B  /  C
)  =  prod_ j  e.  A  ( [_ j  /  k ]_ B  /  [_ j  /  k ]_ C ) )
11 fproddivf.a . . 3  |-  ( ph  ->  A  e.  Fin )
12 fproddivf.kph . . . . . 6  |-  F/ k
ph
13 nfvd 1575 . . . . . 6  |-  ( ph  ->  F/ k  j  e.  A )
1412, 13nfan1 1610 . . . . 5  |-  F/ k ( ph  /\  j  e.  A )
152nfel1 2383 . . . . 5  |-  F/ k
[_ j  /  k ]_ B  e.  CC
1614, 15nfim 1618 . . . 4  |-  F/ k ( ( ph  /\  j  e.  A )  ->  [_ j  /  k ]_ B  e.  CC )
17 eleq1w 2290 . . . . . 6  |-  ( k  =  j  ->  (
k  e.  A  <->  j  e.  A ) )
1817anbi2d 464 . . . . 5  |-  ( k  =  j  ->  (
( ph  /\  k  e.  A )  <->  ( ph  /\  j  e.  A ) ) )
196eleq1d 2298 . . . . 5  |-  ( k  =  j  ->  ( B  e.  CC  <->  [_ j  / 
k ]_ B  e.  CC ) )
2018, 19imbi12d 234 . . . 4  |-  ( k  =  j  ->  (
( ( ph  /\  k  e.  A )  ->  B  e.  CC )  <-> 
( ( ph  /\  j  e.  A )  ->  [_ j  /  k ]_ B  e.  CC ) ) )
21 fproddivf.b . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  CC )
2216, 20, 21chvarfv 1746 . . 3  |-  ( (
ph  /\  j  e.  A )  ->  [_ j  /  k ]_ B  e.  CC )
234nfel1 2383 . . . . 5  |-  F/ k
[_ j  /  k ]_ C  e.  CC
2414, 23nfim 1618 . . . 4  |-  F/ k ( ( ph  /\  j  e.  A )  ->  [_ j  /  k ]_ C  e.  CC )
257eleq1d 2298 . . . . 5  |-  ( k  =  j  ->  ( C  e.  CC  <->  [_ j  / 
k ]_ C  e.  CC ) )
2618, 25imbi12d 234 . . . 4  |-  ( k  =  j  ->  (
( ( ph  /\  k  e.  A )  ->  C  e.  CC )  <-> 
( ( ph  /\  j  e.  A )  ->  [_ j  /  k ]_ C  e.  CC ) ) )
27 fproddivf.c . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  C  e.  CC )
2824, 26, 27chvarfv 1746 . . 3  |-  ( (
ph  /\  j  e.  A )  ->  [_ j  /  k ]_ C  e.  CC )
29 nfcv 2372 . . . . . 6  |-  F/_ k #
30 nfcv 2372 . . . . . 6  |-  F/_ k
0
314, 29, 30nfbr 4133 . . . . 5  |-  F/ k
[_ j  /  k ]_ C #  0
3214, 31nfim 1618 . . . 4  |-  F/ k ( ( ph  /\  j  e.  A )  ->  [_ j  /  k ]_ C #  0 )
337breq1d 4096 . . . . 5  |-  ( k  =  j  ->  ( C #  0  <->  [_ j  /  k ]_ C #  0 )
)
3418, 33imbi12d 234 . . . 4  |-  ( k  =  j  ->  (
( ( ph  /\  k  e.  A )  ->  C #  0 )  <->  ( ( ph  /\  j  e.  A
)  ->  [_ j  / 
k ]_ C #  0 ) ) )
35 fproddivf.ap0 . . . 4  |-  ( (
ph  /\  k  e.  A )  ->  C #  0 )
3632, 34, 35chvarfv 1746 . . 3  |-  ( (
ph  /\  j  e.  A )  ->  [_ j  /  k ]_ C #  0 )
3711, 22, 28, 36fproddivap 12181 . 2  |-  ( ph  ->  prod_ j  e.  A  ( [_ j  /  k ]_ B  /  [_ j  /  k ]_ C
)  =  ( prod_
j  e.  A  [_ j  /  k ]_ B  /  prod_ j  e.  A  [_ j  /  k ]_ C ) )
38 nfcv 2372 . . . . . 6  |-  F/_ j B
3938, 2, 6cbvprodi 12111 . . . . 5  |-  prod_ k  e.  A  B  =  prod_ j  e.  A  [_ j  /  k ]_ B
4039eqcomi 2233 . . . 4  |-  prod_ j  e.  A  [_ j  / 
k ]_ B  =  prod_ k  e.  A  B
4140a1i 9 . . 3  |-  ( ph  ->  prod_ j  e.  A  [_ j  /  k ]_ B  =  prod_ k  e.  A  B )
42 nfcv 2372 . . . . 5  |-  F/_ j C
437equcoms 1754 . . . . . 6  |-  ( j  =  k  ->  C  =  [_ j  /  k ]_ C )
4443eqcomd 2235 . . . . 5  |-  ( j  =  k  ->  [_ j  /  k ]_ C  =  C )
454, 42, 44cbvprodi 12111 . . . 4  |-  prod_ j  e.  A  [_ j  / 
k ]_ C  =  prod_ k  e.  A  C
4645a1i 9 . . 3  |-  ( ph  ->  prod_ j  e.  A  [_ j  /  k ]_ C  =  prod_ k  e.  A  C )
4741, 46oveq12d 6031 . 2  |-  ( ph  ->  ( prod_ j  e.  A  [_ j  /  k ]_ B  /  prod_ j  e.  A  [_ j  /  k ]_ C )  =  (
prod_ k  e.  A  B  /  prod_ k  e.  A  C ) )
4810, 37, 473eqtrd 2266 1  |-  ( ph  ->  prod_ k  e.  A  ( B  /  C
)  =  ( prod_
k  e.  A  B  /  prod_ k  e.  A  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395   F/wnf 1506    e. wcel 2200   [_csb 3125   class class class wbr 4086  (class class class)co 6013   Fincfn 6904   CCcc 8020   0cc0 8022   # cap 8751    / cdiv 8842   prod_cprod 12101
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-mulrcl 8121  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-precex 8132  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138  ax-pre-mulgt0 8139  ax-pre-mulext 8140  ax-arch 8141  ax-caucvg 8142
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-rmo 2516  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-po 4391  df-iso 4392  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-isom 5333  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-irdg 6531  df-frec 6552  df-1o 6577  df-oadd 6581  df-er 6697  df-en 6905  df-dom 6906  df-fin 6907  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-reap 8745  df-ap 8752  df-div 8843  df-inn 9134  df-2 9192  df-3 9193  df-4 9194  df-n0 9393  df-z 9470  df-uz 9746  df-q 9844  df-rp 9879  df-fz 10234  df-fzo 10368  df-seqfrec 10700  df-exp 10791  df-ihash 11028  df-cj 11393  df-re 11394  df-im 11395  df-rsqrt 11549  df-abs 11550  df-clim 11830  df-proddc 12102
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator