| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > faclbnd2 | GIF version | ||
| Description: A lower bound for the factorial function. (Contributed by NM, 17-Dec-2005.) |
| Ref | Expression |
|---|---|
| faclbnd2 | ⊢ (𝑁 ∈ ℕ0 → ((2↑𝑁) / 2) ≤ (!‘𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sq2 11050 | . . . . . 6 ⊢ (2↑2) = 4 | |
| 2 | 2t2e4 9438 | . . . . . 6 ⊢ (2 · 2) = 4 | |
| 3 | 1, 2 | eqtr4i 2262 | . . . . 5 ⊢ (2↑2) = (2 · 2) |
| 4 | 3 | oveq2i 6086 | . . . 4 ⊢ ((2↑(𝑁 + 1)) / (2↑2)) = ((2↑(𝑁 + 1)) / (2 · 2)) |
| 5 | 2cn 9354 | . . . . . 6 ⊢ 2 ∈ ℂ | |
| 6 | expp1 10961 | . . . . . 6 ⊢ ((2 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2)) | |
| 7 | 5, 6 | mpan 428 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2)) |
| 8 | 7 | oveq1d 6090 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((2↑(𝑁 + 1)) / (2 · 2)) = (((2↑𝑁) · 2) / (2 · 2))) |
| 9 | 4, 8 | eqtrid 2283 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((2↑(𝑁 + 1)) / (2↑2)) = (((2↑𝑁) · 2) / (2 · 2))) |
| 10 | expcl 10972 | . . . . 5 ⊢ ((2 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (2↑𝑁) ∈ ℂ) | |
| 11 | 5, 10 | mpan 428 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (2↑𝑁) ∈ ℂ) |
| 12 | 5 | a1i 9 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℂ) |
| 13 | 2ap0 9376 | . . . . 5 ⊢ 2 # 0 | |
| 14 | 13 | a1i 9 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 2 # 0) |
| 15 | 11, 12, 12, 12, 14, 14 | divmuldivapd 9152 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (((2↑𝑁) / 2) · (2 / 2)) = (((2↑𝑁) · 2) / (2 · 2))) |
| 16 | 2div2e1 9416 | . . . . 5 ⊢ (2 / 2) = 1 | |
| 17 | 16 | oveq2i 6086 | . . . 4 ⊢ (((2↑𝑁) / 2) · (2 / 2)) = (((2↑𝑁) / 2) · 1) |
| 18 | 11 | halfcld 9529 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → ((2↑𝑁) / 2) ∈ ℂ) |
| 19 | 18 | mulridd 8333 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (((2↑𝑁) / 2) · 1) = ((2↑𝑁) / 2)) |
| 20 | 17, 19 | eqtrid 2283 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (((2↑𝑁) / 2) · (2 / 2)) = ((2↑𝑁) / 2)) |
| 21 | 9, 15, 20 | 3eqtr2rd 2278 | . 2 ⊢ (𝑁 ∈ ℕ0 → ((2↑𝑁) / 2) = ((2↑(𝑁 + 1)) / (2↑2))) |
| 22 | 2nn0 9559 | . . . 4 ⊢ 2 ∈ ℕ0 | |
| 23 | faclbnd 11157 | . . . 4 ⊢ ((2 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (2↑(𝑁 + 1)) ≤ ((2↑2) · (!‘𝑁))) | |
| 24 | 22, 23 | mpan 428 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (2↑(𝑁 + 1)) ≤ ((2↑2) · (!‘𝑁))) |
| 25 | 2re 9353 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 26 | peano2nn0 9582 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
| 27 | reexpcl 10971 | . . . . 5 ⊢ ((2 ∈ ℝ ∧ (𝑁 + 1) ∈ ℕ0) → (2↑(𝑁 + 1)) ∈ ℝ) | |
| 28 | 25, 26, 27 | sylancr 418 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (2↑(𝑁 + 1)) ∈ ℝ) |
| 29 | faccl 11151 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) ∈ ℕ) | |
| 30 | 29 | nnred 9296 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) ∈ ℝ) |
| 31 | 4re 9360 | . . . . . . 7 ⊢ 4 ∈ ℝ | |
| 32 | 1, 31 | eqeltri 2311 | . . . . . 6 ⊢ (2↑2) ∈ ℝ |
| 33 | 4pos 9380 | . . . . . . 7 ⊢ 0 < 4 | |
| 34 | 33, 1 | breqtrri 4152 | . . . . . 6 ⊢ 0 < (2↑2) |
| 35 | 32, 34 | pm3.2i 272 | . . . . 5 ⊢ ((2↑2) ∈ ℝ ∧ 0 < (2↑2)) |
| 36 | ledivmul 9197 | . . . . 5 ⊢ (((2↑(𝑁 + 1)) ∈ ℝ ∧ (!‘𝑁) ∈ ℝ ∧ ((2↑2) ∈ ℝ ∧ 0 < (2↑2))) → (((2↑(𝑁 + 1)) / (2↑2)) ≤ (!‘𝑁) ↔ (2↑(𝑁 + 1)) ≤ ((2↑2) · (!‘𝑁)))) | |
| 37 | 35, 36 | mp3an3 1367 | . . . 4 ⊢ (((2↑(𝑁 + 1)) ∈ ℝ ∧ (!‘𝑁) ∈ ℝ) → (((2↑(𝑁 + 1)) / (2↑2)) ≤ (!‘𝑁) ↔ (2↑(𝑁 + 1)) ≤ ((2↑2) · (!‘𝑁)))) |
| 38 | 28, 30, 37 | syl2anc 415 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (((2↑(𝑁 + 1)) / (2↑2)) ≤ (!‘𝑁) ↔ (2↑(𝑁 + 1)) ≤ ((2↑2) · (!‘𝑁)))) |
| 39 | 24, 38 | mpbird 167 | . 2 ⊢ (𝑁 ∈ ℕ0 → ((2↑(𝑁 + 1)) / (2↑2)) ≤ (!‘𝑁)) |
| 40 | 21, 39 | eqbrtrd 4147 | 1 ⊢ (𝑁 ∈ ℕ0 → ((2↑𝑁) / 2) ≤ (!‘𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 class class class wbr 4125 ‘cfv 5372 (class class class)co 6075 ℂcc 8167 ℝcr 8168 0cc0 8169 1c1 8170 + caddc 8172 · cmul 8174 < clt 8350 ≤ cle 8351 # cap 8899 / cdiv 8992 2c2 9334 4c4 9336 ℕ0cn0 9542 ↑cexp 10953 !cfa 11141 |
| 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 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 4241 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-iinf 4730 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-mulrcl 8268 ax-addcom 8269 ax-mulcom 8270 ax-addass 8271 ax-mulass 8272 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-1rid 8276 ax-0id 8277 ax-rnegex 8278 ax-precex 8279 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-apti 8284 ax-pre-ltadd 8285 ax-pre-mulgt0 8286 ax-pre-mulext 8287 |
| This theorem 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 3636 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-id 4433 df-po 4436 df-iso 4437 df-iord 4506 df-on 4508 df-ilim 4509 df-suc 4511 df-iom 4733 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-recs 6566 df-frec 6652 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-reap 8893 df-ap 8900 df-div 8993 df-inn 9284 df-2 9342 df-3 9343 df-4 9344 df-n0 9543 df-z 9624 df-uz 9901 df-rp 10034 df-seqfrec 10863 df-exp 10954 df-fac 11142 |
| This theorem is referenced by: ege2le3 12416 |
| Copyright terms: Public domain | W3C validator |