| 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 12778 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
| 2 | 1zzd 12506 | . . 3 ⊢ (𝐴 ∈ ℕ0 → 1 ∈ ℤ) | |
| 3 | facne0 14193 | . . 3 ⊢ (𝐴 ∈ ℕ0 → (!‘𝐴) ≠ 0) | |
| 4 | eqid 2729 | . . . 4 ⊢ (𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥)))) = (𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥)))) | |
| 5 | 4 | faclim 35729 | . . 3 ⊢ (𝐴 ∈ ℕ0 → seq1( · , (𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥))))) ⇝ (!‘𝐴)) |
| 6 | oveq2 7357 | . . . . . . . 8 ⊢ (𝑥 = 𝑘 → (1 / 𝑥) = (1 / 𝑘)) | |
| 7 | 6 | oveq2d 7365 | . . . . . . 7 ⊢ (𝑥 = 𝑘 → (1 + (1 / 𝑥)) = (1 + (1 / 𝑘))) |
| 8 | 7 | oveq1d 7364 | . . . . . 6 ⊢ (𝑥 = 𝑘 → ((1 + (1 / 𝑥))↑𝐴) = ((1 + (1 / 𝑘))↑𝐴)) |
| 9 | oveq2 7357 | . . . . . . 7 ⊢ (𝑥 = 𝑘 → (𝐴 / 𝑥) = (𝐴 / 𝑘)) | |
| 10 | 9 | oveq2d 7365 | . . . . . 6 ⊢ (𝑥 = 𝑘 → (1 + (𝐴 / 𝑥)) = (1 + (𝐴 / 𝑘))) |
| 11 | 8, 10 | oveq12d 7367 | . . . . 5 ⊢ (𝑥 = 𝑘 → (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥))) = (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| 12 | ovex 7382 | . . . . 5 ⊢ (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘))) ∈ V | |
| 13 | 11, 4, 12 | fvmpt 6930 | . . . 4 ⊢ (𝑘 ∈ ℕ → ((𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥))))‘𝑘) = (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| 14 | 13 | adantl 481 | . . 3 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → ((𝑥 ∈ ℕ ↦ (((1 + (1 / 𝑥))↑𝐴) / (1 + (𝐴 / 𝑥))))‘𝑘) = (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| 15 | 1rp 12897 | . . . . . . . 8 ⊢ 1 ∈ ℝ+ | |
| 16 | 15 | a1i 11 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 1 ∈ ℝ+) |
| 17 | simpr 484 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ) | |
| 18 | 17 | nnrpd 12935 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℝ+) |
| 19 | 18 | rpreccld 12947 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (1 / 𝑘) ∈ ℝ+) |
| 20 | 16, 19 | rpaddcld 12952 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (1 + (1 / 𝑘)) ∈ ℝ+) |
| 21 | nn0z 12496 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℤ) | |
| 22 | 21 | adantr 480 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 𝐴 ∈ ℤ) |
| 23 | 20, 22 | rpexpcld 14154 | . . . . 5 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → ((1 + (1 / 𝑘))↑𝐴) ∈ ℝ+) |
| 24 | 1cnd 11110 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 1 ∈ ℂ) | |
| 25 | nn0nndivcl 12456 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (𝐴 / 𝑘) ∈ ℝ) | |
| 26 | 25 | recnd 11143 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (𝐴 / 𝑘) ∈ ℂ) |
| 27 | 24, 26 | addcomd 11318 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (1 + (𝐴 / 𝑘)) = ((𝐴 / 𝑘) + 1)) |
| 28 | nn0ge0div 12545 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → 0 ≤ (𝐴 / 𝑘)) | |
| 29 | 25, 28 | ge0p1rpd 12967 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → ((𝐴 / 𝑘) + 1) ∈ ℝ+) |
| 30 | 27, 29 | eqeltrd 2828 | . . . . 5 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (1 + (𝐴 / 𝑘)) ∈ ℝ+) |
| 31 | 23, 30 | rpdivcld 12954 | . . . 4 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘))) ∈ ℝ+) |
| 32 | 31 | rpcnd 12939 | . . 3 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑘 ∈ ℕ) → (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘))) ∈ ℂ) |
| 33 | 1, 2, 3, 5, 14, 32 | iprodn0 15847 | . 2 ⊢ (𝐴 ∈ ℕ0 → ∏𝑘 ∈ ℕ (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘))) = (!‘𝐴)) |
| 34 | 33 | eqcomd 2735 | 1 ⊢ (𝐴 ∈ ℕ0 → (!‘𝐴) = ∏𝑘 ∈ ℕ (((1 + (1 / 𝑘))↑𝐴) / (1 + (𝐴 / 𝑘)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ↦ cmpt 5173 ‘cfv 6482 (class class class)co 7349 1c1 11010 + caddc 11012 / cdiv 11777 ℕcn 12128 ℕ0cn0 12384 ℤcz 12471 ℝ+crp 12893 ↑cexp 13968 !cfa 14180 ∏cprod 15810 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-inf2 9537 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 ax-pre-sup 11087 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-int 4897 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-se 5573 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-isom 6491 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-1st 7924 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-1o 8388 df-er 8625 df-pm 8756 df-en 8873 df-dom 8874 df-sdom 8875 df-fin 8876 df-sup 9332 df-inf 9333 df-oi 9402 df-card 9835 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-div 11778 df-nn 12129 df-2 12191 df-3 12192 df-n0 12385 df-z 12472 df-uz 12736 df-rp 12894 df-fz 13411 df-fzo 13558 df-fl 13696 df-seq 13909 df-exp 13969 df-fac 14181 df-hash 14238 df-shft 14974 df-cj 15006 df-re 15007 df-im 15008 df-sqrt 15142 df-abs 15143 df-clim 15395 df-rlim 15396 df-prod 15811 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |