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

Theorem fproddivapf 12157
Description: The quotient of two finite products. A version of fproddivap 12156 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 3157 . . . . 5  |-  F/_ k [_ j  /  k ]_ B
3 nfcv 2372 . . . . 5  |-  F/_ k  /
4 nfcsb1v 3157 . . . . 5  |-  F/_ k [_ j  /  k ]_ C
52, 3, 4nfov 6037 . . . 4  |-  F/_ k
( [_ j  /  k ]_ B  /  [_ j  /  k ]_ C
)
6 csbeq1a 3133 . . . . 5  |-  ( k  =  j  ->  B  =  [_ j  /  k ]_ B )
7 csbeq1a 3133 . . . . 5  |-  ( k  =  j  ->  C  =  [_ j  /  k ]_ C )
86, 7oveq12d 6025 . . . 4  |-  ( k  =  j  ->  ( B  /  C )  =  ( [_ j  / 
k ]_ B  /  [_ j  /  k ]_ C
) )
91, 5, 8cbvprodi 12086 . . 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 4130 . . . . 5  |-  F/ k
[_ j  /  k ]_ C #  0
3214, 31nfim 1618 . . . 4  |-  F/ k ( ( ph  /\  j  e.  A )  ->  [_ j  /  k ]_ C #  0 )
337breq1d 4093 . . . . 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 12156 . 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 12086 . . . . 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 12086 . . . 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 6025 . 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 3124   class class class wbr 4083  (class class class)co 6007   Fincfn 6895   CCcc 8008   0cc0 8010   # cap 8739    / cdiv 8830   prod_cprod 12076
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 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-mulrcl 8109  ax-addcom 8110  ax-mulcom 8111  ax-addass 8112  ax-mulass 8113  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-1rid 8117  ax-0id 8118  ax-rnegex 8119  ax-precex 8120  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126  ax-pre-mulgt0 8127  ax-pre-mulext 8128  ax-arch 8129  ax-caucvg 8130
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 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-isom 5327  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-recs 6457  df-irdg 6522  df-frec 6543  df-1o 6568  df-oadd 6572  df-er 6688  df-en 6896  df-dom 6897  df-fin 6898  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-reap 8733  df-ap 8740  df-div 8831  df-inn 9122  df-2 9180  df-3 9181  df-4 9182  df-n0 9381  df-z 9458  df-uz 9734  df-q 9827  df-rp 9862  df-fz 10217  df-fzo 10351  df-seqfrec 10682  df-exp 10773  df-ihash 11010  df-cj 11368  df-re 11369  df-im 11370  df-rsqrt 11524  df-abs 11525  df-clim 11805  df-proddc 12077
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator