Theorem fprodfac 12382

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.

Step	Hyp	Ref	Expression
1		fveq2 5695	. . 3 ⊢ (𝑤 = 0 → (!‘𝑤) = (!‘0))
2		oveq2 6093	. . . 4 ⊢ (𝑤 = 0 → (1...𝑤) = (1...0))
3	2	prodeq1d 12331	. . 3 ⊢ (𝑤 = 0 → ∏𝑘 ∈ (1...𝑤)𝑘 = ∏𝑘 ∈ (1...0)𝑘)
4	1, 3	eqeq12d 2253	. 2 ⊢ (𝑤 = 0 → ((!‘𝑤) = ∏𝑘 ∈ (1...𝑤)𝑘 ↔ (!‘0) = ∏𝑘 ∈ (1...0)𝑘))
5		fveq2 5695	. . 3 ⊢ (𝑤 = 𝑥 → (!‘𝑤) = (!‘𝑥))
6		oveq2 6093	. . . 4 ⊢ (𝑤 = 𝑥 → (1...𝑤) = (1...𝑥))
7	6	prodeq1d 12331	. . 3 ⊢ (𝑤 = 𝑥 → ∏𝑘 ∈ (1...𝑤)𝑘 = ∏𝑘 ∈ (1...𝑥)𝑘)
8	5, 7	eqeq12d 2253	. 2 ⊢ (𝑤 = 𝑥 → ((!‘𝑤) = ∏𝑘 ∈ (1...𝑤)𝑘 ↔ (!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘))
9		fveq2 5695	. . 3 ⊢ (𝑤 = (𝑥 + 1) → (!‘𝑤) = (!‘(𝑥 + 1)))
10		oveq2 6093	. . . 4 ⊢ (𝑤 = (𝑥 + 1) → (1...𝑤) = (1...(𝑥 + 1)))
11	10	prodeq1d 12331	. . 3 ⊢ (𝑤 = (𝑥 + 1) → ∏𝑘 ∈ (1...𝑤)𝑘 = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘)
12	9, 11	eqeq12d 2253	. 2 ⊢ (𝑤 = (𝑥 + 1) → ((!‘𝑤) = ∏𝑘 ∈ (1...𝑤)𝑘 ↔ (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘))
13		fveq2 5695	. . 3 ⊢ (𝑤 = 𝐴 → (!‘𝑤) = (!‘𝐴))
14		oveq2 6093	. . . 4 ⊢ (𝑤 = 𝐴 → (1...𝑤) = (1...𝐴))
15	14	prodeq1d 12331	. . 3 ⊢ (𝑤 = 𝐴 → ∏𝑘 ∈ (1...𝑤)𝑘 = ∏𝑘 ∈ (1...𝐴)𝑘)
16	13, 15	eqeq12d 2253	. 2 ⊢ (𝑤 = 𝐴 → ((!‘𝑤) = ∏𝑘 ∈ (1...𝑤)𝑘 ↔ (!‘𝐴) = ∏𝑘 ∈ (1...𝐴)𝑘))
17		prod0 12352	. . 3 ⊢ ∏𝑘 ∈ ∅ 𝑘 = 1
18		fz10 10450	. . . 4 ⊢ (1...0) = ∅
19	18	prodeq1i 12328	. . 3 ⊢ ∏𝑘 ∈ (1...0)𝑘 = ∏𝑘 ∈ ∅ 𝑘
20		fac0 11166	. . 3 ⊢ (!‘0) = 1
21	17, 19, 20	3eqtr4ri 2270	. 2 ⊢ (!‘0) = ∏𝑘 ∈ (1...0)𝑘
22		elnn0 9565	. . 3 ⊢ (𝑥 ∈ ℕ0 ↔ (𝑥 ∈ ℕ ∨ 𝑥 = 0))
23		simpr 110	. . . . . . 7 ⊢ ((𝑥 ∈ ℕ ∧ (!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘) → (!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘)
24	23	oveq1d 6100	. . . . . 6 ⊢ ((𝑥 ∈ ℕ ∧ (!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘) → ((!‘𝑥) · (𝑥 + 1)) = (∏𝑘 ∈ (1...𝑥)𝑘 · (𝑥 + 1)))
25		nnnn0 9570	. . . . . . . . 9 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ ℕ0)
26		facp1 11168	. . . . . . . . 9 ⊢ (𝑥 ∈ ℕ0 → (!‘(𝑥 + 1)) = ((!‘𝑥) · (𝑥 + 1)))
27	25, 26	syl 14	. . . . . . . 8 ⊢ (𝑥 ∈ ℕ → (!‘(𝑥 + 1)) = ((!‘𝑥) · (𝑥 + 1)))
28		elnnuz 9959	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℕ ↔ 𝑥 ∈ (ℤ≥‘1))
29	28	biimpi 120	. . . . . . . . 9 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ (ℤ≥‘1))
30		elfzelz 10428	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (1...(𝑥 + 1)) → 𝑘 ∈ ℤ)
31	30	zcnd 9769	. . . . . . . . . 10 ⊢ (𝑘 ∈ (1...(𝑥 + 1)) → 𝑘 ∈ ℂ)
32	31	adantl 277	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℕ ∧ 𝑘 ∈ (1...(𝑥 + 1))) → 𝑘 ∈ ℂ)
33		id 19	. . . . . . . . 9 ⊢ (𝑘 = (𝑥 + 1) → 𝑘 = (𝑥 + 1))
34	29, 32, 33	fprodp1 12367	. . . . . . . 8 ⊢ (𝑥 ∈ ℕ → ∏𝑘 ∈ (1...(𝑥 + 1))𝑘 = (∏𝑘 ∈ (1...𝑥)𝑘 · (𝑥 + 1)))
35	27, 34	eqeq12d 2253	. . . . . . 7 ⊢ (𝑥 ∈ ℕ → ((!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘 ↔ ((!‘𝑥) · (𝑥 + 1)) = (∏𝑘 ∈ (1...𝑥)𝑘 · (𝑥 + 1))))
36	35	adantr 276	. . . . . 6 ⊢ ((𝑥 ∈ ℕ ∧ (!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘) → ((!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘 ↔ ((!‘𝑥) · (𝑥 + 1)) = (∏𝑘 ∈ (1...𝑥)𝑘 · (𝑥 + 1))))
37	24, 36	mpbird 167	. . . . 5 ⊢ ((𝑥 ∈ ℕ ∧ (!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘) → (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘)
38	37	ex 115	. . . 4 ⊢ (𝑥 ∈ ℕ → ((!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘 → (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘))
39		1zzd 9671	. . . . . . 7 ⊢ (𝑥 = 0 → 1 ∈ ℤ)
40		1cnd 8342	. . . . . . 7 ⊢ (𝑥 = 0 → 1 ∈ ℂ)
41		id 19	. . . . . . . 8 ⊢ (𝑘 = 1 → 𝑘 = 1)
42	41	fprod1 12361	. . . . . . 7 ⊢ ((1 ∈ ℤ ∧ 1 ∈ ℂ) → ∏𝑘 ∈ (1...1)𝑘 = 1)
43	39, 40, 42	syl2anc 415	. . . . . 6 ⊢ (𝑥 = 0 → ∏𝑘 ∈ (1...1)𝑘 = 1)
44		oveq1 6092	. . . . . . . . 9 ⊢ (𝑥 = 0 → (𝑥 + 1) = (0 + 1))
45		0p1e1 9418	. . . . . . . . 9 ⊢ (0 + 1) = 1
46	44, 45	eqtrdi 2287	. . . . . . . 8 ⊢ (𝑥 = 0 → (𝑥 + 1) = 1)
47	46	oveq2d 6101	. . . . . . 7 ⊢ (𝑥 = 0 → (1...(𝑥 + 1)) = (1...1))
48	47	prodeq1d 12331	. . . . . 6 ⊢ (𝑥 = 0 → ∏𝑘 ∈ (1...(𝑥 + 1))𝑘 = ∏𝑘 ∈ (1...1)𝑘)
49		fv0p1e1 9419	. . . . . . 7 ⊢ (𝑥 = 0 → (!‘(𝑥 + 1)) = (!‘1))
50		fac1 11167	. . . . . . 7 ⊢ (!‘1) = 1
51	49, 50	eqtrdi 2287	. . . . . 6 ⊢ (𝑥 = 0 → (!‘(𝑥 + 1)) = 1)
52	43, 48, 51	3eqtr4rd 2282	. . . . 5 ⊢ (𝑥 = 0 → (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘)
53	52	a1d 22	. . . 4 ⊢ (𝑥 = 0 → ((!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘 → (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘))
54	38, 53	jaoi 728	. . 3 ⊢ ((𝑥 ∈ ℕ ∨ 𝑥 = 0) → ((!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘 → (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘))
55	22, 54	sylbi 121	. 2 ⊢ (𝑥 ∈ ℕ0 → ((!‘𝑥) = ∏𝑘 ∈ (1...𝑥)𝑘 → (!‘(𝑥 + 1)) = ∏𝑘 ∈ (1...(𝑥 + 1))𝑘))
56	4, 8, 12, 16, 21, 55	nn0ind 9760	1 ⊢ (𝐴 ∈ ℕ0 → (!‘𝐴) = ∏𝑘 ∈ (1...𝐴)𝑘)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720   = wceq 1402   ∈ wcel 2209  ∅c0 3520  ‘cfv 5377  (class class class)co 6085  ℂcc 8177  0cc0 8179  1c1 8180   + caddc 8182   · cmul 8184  ℕcn 9304  ℕ₀cn0 9563  ℤcz 9644  ℤ_≥cuz 9921  ...cfz 10411  !cfa 11163  ∏cprod 12317

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-frec 6662  df-1o 6687  df-oadd 6691  df-er 6807  df-en 7023  df-dom 7024  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-n0 9564  df-z 9645  df-uz 9922  df-q 10020  df-rp 10055  df-fz 10412  df-fzo 10550  df-seqfrec 10885  df-exp 10976  df-fac 11164  df-ihash 11215  df-cj 11607  df-re 11608  df-im 11609  df-rsqrt 11764  df-abs 11765  df-clim 12045  df-proddc 12318

This theorem is used by:  gausslemma2dlem1  16180  gausslemma2dlem6  16186