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

Theorem fprodfac 11799
Description: Factorial using product notation. (Contributed by Scott Fenton, 15-Dec-2017.)
Assertion
Ref Expression
fprodfac (𝐴 ∈ ℕ0 → (!‘𝐴) = ∏𝑘 ∈ (1...𝐴)𝑘)
Distinct variable group:   𝐴,𝑘

Proof of Theorem fprodfac
Dummy variables 𝑤 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 5561 . . 3 (𝑤 = 0 → (!‘𝑤) = (!‘0))
2 oveq2 5933 . . . 4 (𝑤 = 0 → (1...𝑤) = (1...0))
32prodeq1d 11748 . . 3 (𝑤 = 0 → ∏𝑘 ∈ (1...𝑤)𝑘 = ∏𝑘 ∈ (1...0)𝑘)
41, 3eqeq12d 2211 . 2 (𝑤 = 0 → ((!‘𝑤) = ∏𝑘 ∈ (1...𝑤)𝑘 ↔ (!‘0) = ∏𝑘 ∈ (1...0)𝑘))
5 fveq2 5561 . . 3 (𝑤 = 𝑥 → (!‘𝑤) = (!‘𝑥))
6 oveq2 5933 . . . 4 (𝑤 = 𝑥 → (1...𝑤) = (1...𝑥))
76prodeq1d 11748 . . 3 (𝑤 = 𝑥 → ∏𝑘 ∈ (1...𝑤)𝑘 = ∏𝑘 ∈ (1...𝑥)𝑘)
85, 7eqeq12d 2211 . 2 (𝑤 = 𝑥 → ((!‘𝑤) = ∏𝑘 ∈ (1...𝑤)𝑘 ↔ (!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘))
9 fveq2 5561 . . 3 (𝑤 = (𝑥 + 1) → (!‘𝑤) = (!‘(𝑥 + 1)))
10 oveq2 5933 . . . 4 (𝑤 = (𝑥 + 1) → (1...𝑤) = (1...(𝑥 + 1)))
1110prodeq1d 11748 . . 3 (𝑤 = (𝑥 + 1) → ∏𝑘 ∈ (1...𝑤)𝑘 = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘)
129, 11eqeq12d 2211 . 2 (𝑤 = (𝑥 + 1) → ((!‘𝑤) = ∏𝑘 ∈ (1...𝑤)𝑘 ↔ (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘))
13 fveq2 5561 . . 3 (𝑤 = 𝐴 → (!‘𝑤) = (!‘𝐴))
14 oveq2 5933 . . . 4 (𝑤 = 𝐴 → (1...𝑤) = (1...𝐴))
1514prodeq1d 11748 . . 3 (𝑤 = 𝐴 → ∏𝑘 ∈ (1...𝑤)𝑘 = ∏𝑘 ∈ (1...𝐴)𝑘)
1613, 15eqeq12d 2211 . 2 (𝑤 = 𝐴 → ((!‘𝑤) = ∏𝑘 ∈ (1...𝑤)𝑘 ↔ (!‘𝐴) = ∏𝑘 ∈ (1...𝐴)𝑘))
17 prod0 11769 . . 3 𝑘 ∈ ∅ 𝑘 = 1
18 fz10 10140 . . . 4 (1...0) = ∅
1918prodeq1i 11745 . . 3 𝑘 ∈ (1...0)𝑘 = ∏𝑘 ∈ ∅ 𝑘
20 fac0 10839 . . 3 (!‘0) = 1
2117, 19, 203eqtr4ri 2228 . 2 (!‘0) = ∏𝑘 ∈ (1...0)𝑘
22 elnn0 9270 . . 3 (𝑥 ∈ ℕ0 ↔ (𝑥 ∈ ℕ ∨ 𝑥 = 0))
23 simpr 110 . . . . . . 7 ((𝑥 ∈ ℕ ∧ (!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘) → (!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘)
2423oveq1d 5940 . . . . . 6 ((𝑥 ∈ ℕ ∧ (!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘) → ((!‘𝑥) · (𝑥 + 1)) = (∏𝑘 ∈ (1...𝑥)𝑘 · (𝑥 + 1)))
25 nnnn0 9275 . . . . . . . . 9 (𝑥 ∈ ℕ → 𝑥 ∈ ℕ0)
26 facp1 10841 . . . . . . . . 9 (𝑥 ∈ ℕ0 → (!‘(𝑥 + 1)) = ((!‘𝑥) · (𝑥 + 1)))
2725, 26syl 14 . . . . . . . 8 (𝑥 ∈ ℕ → (!‘(𝑥 + 1)) = ((!‘𝑥) · (𝑥 + 1)))
28 elnnuz 9657 . . . . . . . . . 10 (𝑥 ∈ ℕ ↔ 𝑥 ∈ (ℤ‘1))
2928biimpi 120 . . . . . . . . 9 (𝑥 ∈ ℕ → 𝑥 ∈ (ℤ‘1))
30 elfzelz 10119 . . . . . . . . . . 11 (𝑘 ∈ (1...(𝑥 + 1)) → 𝑘 ∈ ℤ)
3130zcnd 9468 . . . . . . . . . 10 (𝑘 ∈ (1...(𝑥 + 1)) → 𝑘 ∈ ℂ)
3231adantl 277 . . . . . . . . 9 ((𝑥 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑥 + 1))) → 𝑘 ∈ ℂ)
33 id 19 . . . . . . . . 9 (𝑘 = (𝑥 + 1) → 𝑘 = (𝑥 + 1))
3429, 32, 33fprodp1 11784 . . . . . . . 8 (𝑥 ∈ ℕ → ∏𝑘 ∈ (1...(𝑥 + 1))𝑘 = (∏𝑘 ∈ (1...𝑥)𝑘 · (𝑥 + 1)))
3527, 34eqeq12d 2211 . . . . . . 7 (𝑥 ∈ ℕ → ((!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘 ↔ ((!‘𝑥) · (𝑥 + 1)) = (∏𝑘 ∈ (1...𝑥)𝑘 · (𝑥 + 1))))
3635adantr 276 . . . . . 6 ((𝑥 ∈ ℕ ∧ (!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘) → ((!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘 ↔ ((!‘𝑥) · (𝑥 + 1)) = (∏𝑘 ∈ (1...𝑥)𝑘 · (𝑥 + 1))))
3724, 36mpbird 167 . . . . 5 ((𝑥 ∈ ℕ ∧ (!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘) → (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘)
3837ex 115 . . . 4 (𝑥 ∈ ℕ → ((!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘 → (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘))
39 1zzd 9372 . . . . . . 7 (𝑥 = 0 → 1 ∈ ℤ)
40 1cnd 8061 . . . . . . 7 (𝑥 = 0 → 1 ∈ ℂ)
41 id 19 . . . . . . . 8 (𝑘 = 1 → 𝑘 = 1)
4241fprod1 11778 . . . . . . 7 ((1 ∈ ℤ ∧ 1 ∈ ℂ) → ∏𝑘 ∈ (1...1)𝑘 = 1)
4339, 40, 42syl2anc 411 . . . . . 6 (𝑥 = 0 → ∏𝑘 ∈ (1...1)𝑘 = 1)
44 oveq1 5932 . . . . . . . . 9 (𝑥 = 0 → (𝑥 + 1) = (0 + 1))
45 0p1e1 9123 . . . . . . . . 9 (0 + 1) = 1
4644, 45eqtrdi 2245 . . . . . . . 8 (𝑥 = 0 → (𝑥 + 1) = 1)
4746oveq2d 5941 . . . . . . 7 (𝑥 = 0 → (1...(𝑥 + 1)) = (1...1))
4847prodeq1d 11748 . . . . . 6 (𝑥 = 0 → ∏𝑘 ∈ (1...(𝑥 + 1))𝑘 = ∏𝑘 ∈ (1...1)𝑘)
49 fv0p1e1 9124 . . . . . . 7 (𝑥 = 0 → (!‘(𝑥 + 1)) = (!‘1))
50 fac1 10840 . . . . . . 7 (!‘1) = 1
5149, 50eqtrdi 2245 . . . . . 6 (𝑥 = 0 → (!‘(𝑥 + 1)) = 1)
5243, 48, 513eqtr4rd 2240 . . . . 5 (𝑥 = 0 → (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘)
5352a1d 22 . . . 4 (𝑥 = 0 → ((!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘 → (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘))
5438, 53jaoi 717 . . 3 ((𝑥 ∈ ℕ ∨ 𝑥 = 0) → ((!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘 → (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘))
5522, 54sylbi 121 . 2 (𝑥 ∈ ℕ0 → ((!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘 → (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘))
564, 8, 12, 16, 21, 55nn0ind 9459 1 (𝐴 ∈ ℕ0 → (!‘𝐴) = ∏𝑘 ∈ (1...𝐴)𝑘)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wo 709   = wceq 1364  wcel 2167  c0 3451  cfv 5259  (class class class)co 5925  cc 7896  0cc0 7898  1c1 7899   + caddc 7901   · cmul 7903  cn 9009  0cn0 9268  cz 9345  cuz 9620  ...cfz 10102  !cfa 10836  cprod 11734
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7989  ax-resscn 7990  ax-1cn 7991  ax-1re 7992  ax-icn 7993  ax-addcl 7994  ax-addrcl 7995  ax-mulcl 7996  ax-mulrcl 7997  ax-addcom 7998  ax-mulcom 7999  ax-addass 8000  ax-mulass 8001  ax-distr 8002  ax-i2m1 8003  ax-0lt1 8004  ax-1rid 8005  ax-0id 8006  ax-rnegex 8007  ax-precex 8008  ax-cnre 8009  ax-pre-ltirr 8010  ax-pre-ltwlin 8011  ax-pre-lttrn 8012  ax-pre-apti 8013  ax-pre-ltadd 8014  ax-pre-mulgt0 8015  ax-pre-mulext 8016  ax-arch 8017  ax-caucvg 8018
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-po 4332  df-iso 4333  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-isom 5268  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-irdg 6437  df-frec 6458  df-1o 6483  df-oadd 6487  df-er 6601  df-en 6809  df-dom 6810  df-fin 6811  df-pnf 8082  df-mnf 8083  df-xr 8084  df-ltxr 8085  df-le 8086  df-sub 8218  df-neg 8219  df-reap 8621  df-ap 8628  df-div 8719  df-inn 9010  df-2 9068  df-3 9069  df-4 9070  df-n0 9269  df-z 9346  df-uz 9621  df-q 9713  df-rp 9748  df-fz 10103  df-fzo 10237  df-seqfrec 10559  df-exp 10650  df-fac 10837  df-ihash 10887  df-cj 11026  df-re 11027  df-im 11028  df-rsqrt 11182  df-abs 11183  df-clim 11463  df-proddc 11735
This theorem is referenced by:  gausslemma2dlem1  15410  gausslemma2dlem6  15416
  Copyright terms: Public domain W3C validator