| 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 12822 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 2 | 1zzd 12553 | . . 3 ⊢ (𝐴 ∈ ℕ0 → 1 ∈ ℤ) | |
| 3 | facne0 14243 | . . 3 ⊢ (𝐴 ∈ ℕ0 → (!‘𝐴) ≠ 0) | |
| 4 | eqid 2737 | . . . 4 ⊢ (𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥)))) = (𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥)))) | |
| 5 | 4 | faclim 35948 | . . 3 ⊢ (𝐴 ∈ ℕ0 → seq1( · , (𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥))))) ⇝ (!‘𝐴)) |
| 6 | oveq2 7370 | . . . . . . . 8 ⊢ (𝑥 = 𝑘 → (1 / 𝑥) = (1 / 𝑘)) | |
| 7 | 6 | oveq2d 7378 | . . . . . . 7 ⊢ (𝑥 = 𝑘 → (1 + (1 / 𝑥)) = (1 + (1 / 𝑘))) |
| 8 | 7 | oveq1d 7377 | . . . . . 6 ⊢ (𝑥 = 𝑘 → ((1 + (1 / 𝑥))↑𝐴) = ((1 + (1 / 𝑘))↑𝐴)) |
| 9 | oveq2 7370 | . . . . . . 7 ⊢ (𝑥 = 𝑘 → (𝐴 / 𝑥) = (𝐴 / 𝑘)) | |
| 10 | 9 | oveq2d 7378 | . . . . . 6 ⊢ (𝑥 = 𝑘 → (1 + (𝐴 / 𝑥)) = (1 + (𝐴 / 𝑘))) |
| 11 | 8, 10 | oveq12d 7380 | . . . . 5 ⊢ (𝑥 = 𝑘 → (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥))) = (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| 12 | ovex 7395 | . . . . 5 ⊢ (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘))) ∈ V | |
| 13 | 11, 4, 12 | fvmpt 6943 | . . . 4 ⊢ (𝑘 ∈ ℕ → ((𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥))))‘𝑘) = (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| 14 | 13 | adantl 481 | . . 3 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → ((𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥))))‘𝑘) = (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| 15 | 1rp 12941 | . . . . . . . 8 ⊢ 1 ∈ ℝ+ | |
| 16 | 15 | a1i 11 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 1 ∈ ℝ+) |
| 17 | simpr 484 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ) | |
| 18 | 17 | nnrpd 12979 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℝ+) |
| 19 | 18 | rpreccld 12991 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (1 / 𝑘) ∈ ℝ+) |
| 20 | 16, 19 | rpaddcld 12996 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (1 + (1 / 𝑘)) ∈ ℝ+) |
| 21 | nn0z 12543 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℤ) | |
| 22 | 21 | adantr 480 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 𝐴 ∈ ℤ) |
| 23 | 20, 22 | rpexpcld 14204 | . . . . 5 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → ((1 + (1 / 𝑘))↑𝐴) ∈ ℝ+) |
| 24 | 1cnd 11134 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 1 ∈ ℂ) | |
| 25 | nn0nndivcl 12504 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (𝐴 / 𝑘) ∈ ℝ) | |
| 26 | 25 | recnd 11168 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (𝐴 / 𝑘) ∈ ℂ) |
| 27 | 24, 26 | addcomd 11343 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (1 + (𝐴 / 𝑘)) = ((𝐴 / 𝑘) + 1)) |
| 28 | nn0ge0div 12593 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 0 ≤ (𝐴 / 𝑘)) | |
| 29 | 25, 28 | ge0p1rpd 13011 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → ((𝐴 / 𝑘) + 1) ∈ ℝ+) |
| 30 | 27, 29 | eqeltrd 2837 | . . . . 5 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (1 + (𝐴 / 𝑘)) ∈ ℝ+) |
| 31 | 23, 30 | rpdivcld 12998 | . . . 4 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘))) ∈ ℝ+) |
| 32 | 31 | rpcnd 12983 | . . 3 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘))) ∈ ℂ) |
| 33 | 1, 2, 3, 5, 14, 32 | iprodn0 15900 | . 2 ⊢ (𝐴 ∈ ℕ0 → ∏𝑘 ∈ ℕ (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘))) = (!‘𝐴)) |
| 34 | 33 | eqcomd 2743 | 1 ⊢ (𝐴 ∈ ℕ0 → (!‘𝐴) = ∏𝑘 ∈ ℕ (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ↦ cmpt 5167 ‘cfv 6494 (class class class)co 7362 1c1 11034 + caddc 11036 / cdiv 11802 ℕcn 12169 ℕ0cn0 12432 ℤcz 12519 ℝ+crp 12937 ↑cexp 14018 !cfa 14230 ∏cprod 15863 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 ax-inf2 9557 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 ax-pre-sup 11111 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5521 df-eprel 5526 df-po 5534 df-so 5535 df-fr 5579 df-se 5580 df-we 5581 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-pred 6261 df-ord 6322 df-on 6323 df-lim 6324 df-suc 6325 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-isom 6503 df-riota 7319 df-ov 7365 df-oprab 7366 df-mpo 7367 df-om 7813 df-1st 7937 df-2nd 7938 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-1o 8400 df-er 8638 df-pm 8771 df-en 8889 df-dom 8890 df-sdom 8891 df-fin 8892 df-sup 9350 df-inf 9351 df-oi 9420 df-card 9858 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-div 11803 df-nn 12170 df-2 12239 df-3 12240 df-n0 12433 df-z 12520 df-uz 12784 df-rp 12938 df-fz 13457 df-fzo 13604 df-fl 13746 df-seq 13959 df-exp 14019 df-fac 14231 df-hash 14288 df-shft 15024 df-cj 15056 df-re 15057 df-im 15058 df-sqrt 15192 df-abs 15193 df-clim 15445 df-rlim 15446 df-prod 15864 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |