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

Theorem fproddivapf 12255
Description: The quotient of two finite products. A version of fproddivap 12254 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 2375 . . . 4  |-  F/_ j
( B  /  C
)
2 nfcsb1v 3161 . . . . 5  |-  F/_ k [_ j  /  k ]_ B
3 nfcv 2375 . . . . 5  |-  F/_ k  /
4 nfcsb1v 3161 . . . . 5  |-  F/_ k [_ j  /  k ]_ C
52, 3, 4nfov 6058 . . . 4  |-  F/_ k
( [_ j  /  k ]_ B  /  [_ j  /  k ]_ C
)
6 csbeq1a 3137 . . . . 5  |-  ( k  =  j  ->  B  =  [_ j  /  k ]_ B )
7 csbeq1a 3137 . . . . 5  |-  ( k  =  j  ->  C  =  [_ j  /  k ]_ C )
86, 7oveq12d 6046 . . . 4  |-  ( k  =  j  ->  ( B  /  C )  =  ( [_ j  / 
k ]_ B  /  [_ j  /  k ]_ C
) )
91, 5, 8cbvprodi 12184 . . 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 1578 . . . . . 6  |-  ( ph  ->  F/ k  j  e.  A )
1412, 13nfan1 1613 . . . . 5  |-  F/ k ( ph  /\  j  e.  A )
152nfel1 2386 . . . . 5  |-  F/ k
[_ j  /  k ]_ B  e.  CC
1614, 15nfim 1621 . . . 4  |-  F/ k ( ( ph  /\  j  e.  A )  ->  [_ j  /  k ]_ B  e.  CC )
17 eleq1w 2292 . . . . . 6  |-  ( k  =  j  ->  (
k  e.  A  <->  j  e.  A ) )
1817anbi2d 464 . . . . 5  |-  ( k  =  j  ->  (
( ph  /\  k  e.  A )  <->  ( ph  /\  j  e.  A ) ) )
196eleq1d 2300 . . . . 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 1748 . . 3  |-  ( (
ph  /\  j  e.  A )  ->  [_ j  /  k ]_ B  e.  CC )
234nfel1 2386 . . . . 5  |-  F/ k
[_ j  /  k ]_ C  e.  CC
2414, 23nfim 1621 . . . 4  |-  F/ k ( ( ph  /\  j  e.  A )  ->  [_ j  /  k ]_ C  e.  CC )
257eleq1d 2300 . . . . 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 1748 . . 3  |-  ( (
ph  /\  j  e.  A )  ->  [_ j  /  k ]_ C  e.  CC )
29 nfcv 2375 . . . . . 6  |-  F/_ k #
30 nfcv 2375 . . . . . 6  |-  F/_ k
0
314, 29, 30nfbr 4140 . . . . 5  |-  F/ k
[_ j  /  k ]_ C #  0
3214, 31nfim 1621 . . . 4  |-  F/ k ( ( ph  /\  j  e.  A )  ->  [_ j  /  k ]_ C #  0 )
337breq1d 4103 . . . . 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 1748 . . 3  |-  ( (
ph  /\  j  e.  A )  ->  [_ j  /  k ]_ C #  0 )
3711, 22, 28, 36fproddivap 12254 . 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 2375 . . . . . 6  |-  F/_ j B
3938, 2, 6cbvprodi 12184 . . . . 5  |-  prod_ k  e.  A  B  =  prod_ j  e.  A  [_ j  /  k ]_ B
4039eqcomi 2235 . . . 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 2375 . . . . 5  |-  F/_ j C
437equcoms 1756 . . . . . 6  |-  ( j  =  k  ->  C  =  [_ j  /  k ]_ C )
4443eqcomd 2237 . . . . 5  |-  ( j  =  k  ->  [_ j  /  k ]_ C  =  C )
454, 42, 44cbvprodi 12184 . . . 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 6046 . 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 2268 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 1398   F/wnf 1509    e. wcel 2202   [_csb 3128   class class class wbr 4093  (class class class)co 6028   Fincfn 6952   CCcc 8073   0cc0 8075   # cap 8803    / cdiv 8894   prod_cprod 12174
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-mulrcl 8174  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-0lt1 8181  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-precex 8185  ax-cnre 8186  ax-pre-ltirr 8187  ax-pre-ltwlin 8188  ax-pre-lttrn 8189  ax-pre-apti 8190  ax-pre-ltadd 8191  ax-pre-mulgt0 8192  ax-pre-mulext 8193  ax-arch 8194  ax-caucvg 8195
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rmo 2519  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-po 4399  df-iso 4400  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-isom 5342  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-irdg 6579  df-frec 6600  df-1o 6625  df-oadd 6629  df-er 6745  df-en 6953  df-dom 6954  df-fin 6955  df-pnf 8258  df-mnf 8259  df-xr 8260  df-ltxr 8261  df-le 8262  df-sub 8394  df-neg 8395  df-reap 8797  df-ap 8804  df-div 8895  df-inn 9186  df-2 9244  df-3 9245  df-4 9246  df-n0 9445  df-z 9524  df-uz 9800  df-q 9898  df-rp 9933  df-fz 10289  df-fzo 10423  df-seqfrec 10756  df-exp 10847  df-ihash 11084  df-cj 11465  df-re 11466  df-im 11467  df-rsqrt 11621  df-abs 11622  df-clim 11902  df-proddc 12175
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator