| 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 10869 | . . . . . 6 ⊢ (2↑2) = 4 | |
| 2 | 2t2e4 9276 | . . . . . 6 ⊢ (2 · 2) = 4 | |
| 3 | 1, 2 | eqtr4i 2253 | . . . . 5 ⊢ (2↑2) = (2 · 2) |
| 4 | 3 | oveq2i 6018 | . . . 4 ⊢ ((2↑(𝑁 + 1)) / (2↑2)) = ((2↑(𝑁 + 1)) / (2 · 2)) |
| 5 | 2cn 9192 | . . . . . 6 ⊢ 2 ∈ ℂ | |
| 6 | expp1 10780 | . . . . . 6 ⊢ ((2 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2)) | |
| 7 | 5, 6 | mpan 424 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2)) |
| 8 | 7 | oveq1d 6022 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((2↑(𝑁 + 1)) / (2 · 2)) = (((2↑𝑁) · 2) / (2 · 2))) |
| 9 | 4, 8 | eqtrid 2274 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((2↑(𝑁 + 1)) / (2↑2)) = (((2↑𝑁) · 2) / (2 · 2))) |
| 10 | expcl 10791 | . . . . 5 ⊢ ((2 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (2↑𝑁) ∈ ℂ) | |
| 11 | 5, 10 | mpan 424 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (2↑𝑁) ∈ ℂ) |
| 12 | 5 | a1i 9 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℂ) |
| 13 | 2ap0 9214 | . . . . 5 ⊢ 2 # 0 | |
| 14 | 13 | a1i 9 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 2 # 0) |
| 15 | 11, 12, 12, 12, 14, 14 | divmuldivapd 8990 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (((2↑𝑁) / 2) · (2 / 2)) = (((2↑𝑁) · 2) / (2 · 2))) |
| 16 | 2div2e1 9254 | . . . . 5 ⊢ (2 / 2) = 1 | |
| 17 | 16 | oveq2i 6018 | . . . 4 ⊢ (((2↑𝑁) / 2) · (2 / 2)) = (((2↑𝑁) / 2) · 1) |
| 18 | 11 | halfcld 9367 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → ((2↑𝑁) / 2) ∈ ℂ) |
| 19 | 18 | mulridd 8174 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (((2↑𝑁) / 2) · 1) = ((2↑𝑁) / 2)) |
| 20 | 17, 19 | eqtrid 2274 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (((2↑𝑁) / 2) · (2 / 2)) = ((2↑𝑁) / 2)) |
| 21 | 9, 15, 20 | 3eqtr2rd 2269 | . 2 ⊢ (𝑁 ∈ ℕ0 → ((2↑𝑁) / 2) = ((2↑(𝑁 + 1)) / (2↑2))) |
| 22 | 2nn0 9397 | . . . 4 ⊢ 2 ∈ ℕ0 | |
| 23 | faclbnd 10975 | . . . 4 ⊢ ((2 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (2↑(𝑁 + 1)) ≤ ((2↑2) · (!‘𝑁))) | |
| 24 | 22, 23 | mpan 424 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (2↑(𝑁 + 1)) ≤ ((2↑2) · (!‘𝑁))) |
| 25 | 2re 9191 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 26 | peano2nn0 9420 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
| 27 | reexpcl 10790 | . . . . 5 ⊢ ((2 ∈ ℝ ∧ (𝑁 + 1) ∈ ℕ0) → (2↑(𝑁 + 1)) ∈ ℝ) | |
| 28 | 25, 26, 27 | sylancr 414 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (2↑(𝑁 + 1)) ∈ ℝ) |
| 29 | faccl 10969 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) ∈ ℕ) | |
| 30 | 29 | nnred 9134 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) ∈ ℝ) |
| 31 | 4re 9198 | . . . . . . 7 ⊢ 4 ∈ ℝ | |
| 32 | 1, 31 | eqeltri 2302 | . . . . . 6 ⊢ (2↑2) ∈ ℝ |
| 33 | 4pos 9218 | . . . . . . 7 ⊢ 0 < 4 | |
| 34 | 33, 1 | breqtrri 4110 | . . . . . 6 ⊢ 0 < (2↑2) |
| 35 | 32, 34 | pm3.2i 272 | . . . . 5 ⊢ ((2↑2) ∈ ℝ ∧ 0 < (2↑2)) |
| 36 | ledivmul 9035 | . . . . 5 ⊢ (((2↑(𝑁 + 1)) ∈ ℝ ∧ (!‘𝑁) ∈ ℝ ∧ ((2↑2) ∈ ℝ ∧ 0 < (2↑2))) → (((2↑(𝑁 + 1)) / (2↑2)) ≤ (!‘𝑁) ↔ (2↑(𝑁 + 1)) ≤ ((2↑2) · (!‘𝑁)))) | |
| 37 | 35, 36 | mp3an3 1360 | . . . 4 ⊢ (((2↑(𝑁 + 1)) ∈ ℝ ∧ (!‘𝑁) ∈ ℝ) → (((2↑(𝑁 + 1)) / (2↑2)) ≤ (!‘𝑁) ↔ (2↑(𝑁 + 1)) ≤ ((2↑2) · (!‘𝑁)))) |
| 38 | 28, 30, 37 | syl2anc 411 | . . 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 4105 | 1 ⊢ (𝑁 ∈ ℕ0 → ((2↑𝑁) / 2) ≤ (!‘𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1395 ∈ wcel 2200 class class class wbr 4083 ‘cfv 5318 (class class class)co 6007 ℂcc 8008 ℝcr 8009 0cc0 8010 1c1 8011 + caddc 8013 · cmul 8015 < clt 8192 ≤ cle 8193 # cap 8739 / cdiv 8830 2c2 9172 4c4 9174 ℕ0cn0 9380 ↑cexp 10772 !cfa 10959 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-mulrcl 8109 ax-addcom 8110 ax-mulcom 8111 ax-addass 8112 ax-mulass 8113 ax-distr 8114 ax-i2m1 8115 ax-0lt1 8116 ax-1rid 8117 ax-0id 8118 ax-rnegex 8119 ax-precex 8120 ax-cnre 8121 ax-pre-ltirr 8122 ax-pre-ltwlin 8123 ax-pre-lttrn 8124 ax-pre-apti 8125 ax-pre-ltadd 8126 ax-pre-mulgt0 8127 ax-pre-mulext 8128 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-po 4387 df-iso 4388 df-iord 4457 df-on 4459 df-ilim 4460 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-recs 6457 df-frec 6543 df-pnf 8194 df-mnf 8195 df-xr 8196 df-ltxr 8197 df-le 8198 df-sub 8330 df-neg 8331 df-reap 8733 df-ap 8740 df-div 8831 df-inn 9122 df-2 9180 df-3 9181 df-4 9182 df-n0 9381 df-z 9458 df-uz 9734 df-rp 9862 df-seqfrec 10682 df-exp 10773 df-fac 10960 |
| This theorem is referenced by: ege2le3 12197 |
| Copyright terms: Public domain | W3C validator |