![]() |
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 10706 | . . . . . 6 ⊢ (2↑2) = 4 | |
2 | 2t2e4 9136 | . . . . . 6 ⊢ (2 · 2) = 4 | |
3 | 1, 2 | eqtr4i 2217 | . . . . 5 ⊢ (2↑2) = (2 · 2) |
4 | 3 | oveq2i 5929 | . . . 4 ⊢ ((2↑(𝑁 + 1)) / (2↑2)) = ((2↑(𝑁 + 1)) / (2 · 2)) |
5 | 2cn 9053 | . . . . . 6 ⊢ 2 ∈ ℂ | |
6 | expp1 10617 | . . . . . 6 ⊢ ((2 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2)) | |
7 | 5, 6 | mpan 424 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (2↑(𝑁 + 1)) = ((2↑𝑁) · 2)) |
8 | 7 | oveq1d 5933 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((2↑(𝑁 + 1)) / (2 · 2)) = (((2↑𝑁) · 2) / (2 · 2))) |
9 | 4, 8 | eqtrid 2238 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((2↑(𝑁 + 1)) / (2↑2)) = (((2↑𝑁) · 2) / (2 · 2))) |
10 | expcl 10628 | . . . . 5 ⊢ ((2 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (2↑𝑁) ∈ ℂ) | |
11 | 5, 10 | mpan 424 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (2↑𝑁) ∈ ℂ) |
12 | 5 | a1i 9 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℂ) |
13 | 2ap0 9075 | . . . . 5 ⊢ 2 # 0 | |
14 | 13 | a1i 9 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 2 # 0) |
15 | 11, 12, 12, 12, 14, 14 | divmuldivapd 8851 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (((2↑𝑁) / 2) · (2 / 2)) = (((2↑𝑁) · 2) / (2 · 2))) |
16 | 2div2e1 9114 | . . . . 5 ⊢ (2 / 2) = 1 | |
17 | 16 | oveq2i 5929 | . . . 4 ⊢ (((2↑𝑁) / 2) · (2 / 2)) = (((2↑𝑁) / 2) · 1) |
18 | 11 | halfcld 9227 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → ((2↑𝑁) / 2) ∈ ℂ) |
19 | 18 | mulridd 8036 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (((2↑𝑁) / 2) · 1) = ((2↑𝑁) / 2)) |
20 | 17, 19 | eqtrid 2238 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (((2↑𝑁) / 2) · (2 / 2)) = ((2↑𝑁) / 2)) |
21 | 9, 15, 20 | 3eqtr2rd 2233 | . 2 ⊢ (𝑁 ∈ ℕ0 → ((2↑𝑁) / 2) = ((2↑(𝑁 + 1)) / (2↑2))) |
22 | 2nn0 9257 | . . . 4 ⊢ 2 ∈ ℕ0 | |
23 | faclbnd 10812 | . . . 4 ⊢ ((2 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (2↑(𝑁 + 1)) ≤ ((2↑2) · (!‘𝑁))) | |
24 | 22, 23 | mpan 424 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (2↑(𝑁 + 1)) ≤ ((2↑2) · (!‘𝑁))) |
25 | 2re 9052 | . . . . 5 ⊢ 2 ∈ ℝ | |
26 | peano2nn0 9280 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | |
27 | reexpcl 10627 | . . . . 5 ⊢ ((2 ∈ ℝ ∧ (𝑁 + 1) ∈ ℕ0) → (2↑(𝑁 + 1)) ∈ ℝ) | |
28 | 25, 26, 27 | sylancr 414 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (2↑(𝑁 + 1)) ∈ ℝ) |
29 | faccl 10806 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) ∈ ℕ) | |
30 | 29 | nnred 8995 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (!‘𝑁) ∈ ℝ) |
31 | 4re 9059 | . . . . . . 7 ⊢ 4 ∈ ℝ | |
32 | 1, 31 | eqeltri 2266 | . . . . . 6 ⊢ (2↑2) ∈ ℝ |
33 | 4pos 9079 | . . . . . . 7 ⊢ 0 < 4 | |
34 | 33, 1 | breqtrri 4056 | . . . . . 6 ⊢ 0 < (2↑2) |
35 | 32, 34 | pm3.2i 272 | . . . . 5 ⊢ ((2↑2) ∈ ℝ ∧ 0 < (2↑2)) |
36 | ledivmul 8896 | . . . . 5 ⊢ (((2↑(𝑁 + 1)) ∈ ℝ ∧ (!‘𝑁) ∈ ℝ ∧ ((2↑2) ∈ ℝ ∧ 0 < (2↑2))) → (((2↑(𝑁 + 1)) / (2↑2)) ≤ (!‘𝑁) ↔ (2↑(𝑁 + 1)) ≤ ((2↑2) · (!‘𝑁)))) | |
37 | 35, 36 | mp3an3 1337 | . . . 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 4051 | 1 ⊢ (𝑁 ∈ ℕ0 → ((2↑𝑁) / 2) ≤ (!‘𝑁)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2164 class class class wbr 4029 ‘cfv 5254 (class class class)co 5918 ℂcc 7870 ℝcr 7871 0cc0 7872 1c1 7873 + caddc 7875 · cmul 7877 < clt 8054 ≤ cle 8055 # cap 8600 / cdiv 8691 2c2 9033 4c4 9035 ℕ0cn0 9240 ↑cexp 10609 !cfa 10796 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-nul 4155 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-iinf 4620 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-mulrcl 7971 ax-addcom 7972 ax-mulcom 7973 ax-addass 7974 ax-mulass 7975 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-1rid 7979 ax-0id 7980 ax-rnegex 7981 ax-precex 7982 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-apti 7987 ax-pre-ltadd 7988 ax-pre-mulgt0 7989 ax-pre-mulext 7990 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-if 3558 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-tr 4128 df-id 4324 df-po 4327 df-iso 4328 df-iord 4397 df-on 4399 df-ilim 4400 df-suc 4402 df-iom 4623 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 df-recs 6358 df-frec 6444 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-reap 8594 df-ap 8601 df-div 8692 df-inn 8983 df-2 9041 df-3 9042 df-4 9043 df-n0 9241 df-z 9318 df-uz 9593 df-rp 9720 df-seqfrec 10519 df-exp 10610 df-fac 10797 |
This theorem is referenced by: ege2le3 11814 |
Copyright terms: Public domain | W3C validator |