| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > iprodfac | Structured version Visualization version GIF version | ||
| Description: An infinite product expression for factorial. (Contributed by Scott Fenton, 15-Dec-2017.) |
| Ref | Expression |
|---|---|
| iprodfac | ⊢ (𝐴 ∈ ℕ0 → (!‘𝐴) = ∏𝑘 ∈ ℕ (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnuz 12792 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 2 | 1zzd 12524 | . . 3 ⊢ (𝐴 ∈ ℕ0 → 1 ∈ ℤ) | |
| 3 | facne0 14211 | . . 3 ⊢ (𝐴 ∈ ℕ0 → (!‘𝐴) ≠ 0) | |
| 4 | eqid 2736 | . . . 4 ⊢ (𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥)))) = (𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥)))) | |
| 5 | 4 | faclim 35942 | . . 3 ⊢ (𝐴 ∈ ℕ0 → seq1( · , (𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥))))) ⇝ (!‘𝐴)) |
| 6 | oveq2 7366 | . . . . . . . 8 ⊢ (𝑥 = 𝑘 → (1 / 𝑥) = (1 / 𝑘)) | |
| 7 | 6 | oveq2d 7374 | . . . . . . 7 ⊢ (𝑥 = 𝑘 → (1 + (1 / 𝑥)) = (1 + (1 / 𝑘))) |
| 8 | 7 | oveq1d 7373 | . . . . . 6 ⊢ (𝑥 = 𝑘 → ((1 + (1 / 𝑥))↑𝐴) = ((1 + (1 / 𝑘))↑𝐴)) |
| 9 | oveq2 7366 | . . . . . . 7 ⊢ (𝑥 = 𝑘 → (𝐴 / 𝑥) = (𝐴 / 𝑘)) | |
| 10 | 9 | oveq2d 7374 | . . . . . 6 ⊢ (𝑥 = 𝑘 → (1 + (𝐴 / 𝑥)) = (1 + (𝐴 / 𝑘))) |
| 11 | 8, 10 | oveq12d 7376 | . . . . 5 ⊢ (𝑥 = 𝑘 → (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥))) = (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| 12 | ovex 7391 | . . . . 5 ⊢ (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘))) ∈ V | |
| 13 | 11, 4, 12 | fvmpt 6941 | . . . 4 ⊢ (𝑘 ∈ ℕ → ((𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥))))‘𝑘) = (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| 14 | 13 | adantl 481 | . . 3 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → ((𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥))))‘𝑘) = (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| 15 | 1rp 12911 | . . . . . . . 8 ⊢ 1 ∈ ℝ+ | |
| 16 | 15 | a1i 11 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 1 ∈ ℝ+) |
| 17 | simpr 484 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ) | |
| 18 | 17 | nnrpd 12949 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℝ+) |
| 19 | 18 | rpreccld 12961 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (1 / 𝑘) ∈ ℝ+) |
| 20 | 16, 19 | rpaddcld 12966 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (1 + (1 / 𝑘)) ∈ ℝ+) |
| 21 | nn0z 12514 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℤ) | |
| 22 | 21 | adantr 480 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 𝐴 ∈ ℤ) |
| 23 | 20, 22 | rpexpcld 14172 | . . . . 5 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → ((1 + (1 / 𝑘))↑𝐴) ∈ ℝ+) |
| 24 | 1cnd 11129 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 1 ∈ ℂ) | |
| 25 | nn0nndivcl 12475 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (𝐴 / 𝑘) ∈ ℝ) | |
| 26 | 25 | recnd 11162 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (𝐴 / 𝑘) ∈ ℂ) |
| 27 | 24, 26 | addcomd 11337 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (1 + (𝐴 / 𝑘)) = ((𝐴 / 𝑘) + 1)) |
| 28 | nn0ge0div 12563 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 0 ≤ (𝐴 / 𝑘)) | |
| 29 | 25, 28 | ge0p1rpd 12981 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → ((𝐴 / 𝑘) + 1) ∈ ℝ+) |
| 30 | 27, 29 | eqeltrd 2836 | . . . . 5 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (1 + (𝐴 / 𝑘)) ∈ ℝ+) |
| 31 | 23, 30 | rpdivcld 12968 | . . . 4 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘))) ∈ ℝ+) |
| 32 | 31 | rpcnd 12953 | . . 3 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘))) ∈ ℂ) |
| 33 | 1, 2, 3, 5, 14, 32 | iprodn0 15865 | . 2 ⊢ (𝐴 ∈ ℕ0 → ∏𝑘 ∈ ℕ (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘))) = (!‘𝐴)) |
| 34 | 33 | eqcomd 2742 | 1 ⊢ (𝐴 ∈ ℕ0 → (!‘𝐴) = ∏𝑘 ∈ ℕ (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ↦ cmpt 5179 ‘cfv 6492 (class class class)co 7358 1c1 11029 + caddc 11031 / cdiv 11796 ℕcn 12147 ℕ0cn0 12403 ℤcz 12490 ℝ+crp 12907 ↑cexp 13986 !cfa 14198 ∏cprod 15828 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-inf2 9552 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-pm 8768 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-sup 9347 df-inf 9348 df-oi 9417 df-card 9853 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12148 df-2 12210 df-3 12211 df-n0 12404 df-z 12491 df-uz 12754 df-rp 12908 df-fz 13426 df-fzo 13573 df-fl 13714 df-seq 13927 df-exp 13987 df-fac 14199 df-hash 14256 df-shft 14992 df-cj 15024 df-re 15025 df-im 15026 df-sqrt 15160 df-abs 15161 df-clim 15413 df-rlim 15414 df-prod 15829 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |