Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > aaliou3lem1 | Structured version Visualization version GIF version |
Description: Lemma for aaliou3 24940. (Contributed by Stefan O'Rear, 16-Nov-2014.) |
Ref | Expression |
---|---|
aaliou3lem.a | ⊢ 𝐺 = (𝑐 ∈ (ℤ≥‘𝐴) ↦ ((2↑-(!‘𝐴)) · ((1 / 2)↑(𝑐 − 𝐴)))) |
Ref | Expression |
---|---|
aaliou3lem1 | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → (𝐺‘𝐵) ∈ ℝ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq1 7163 | . . . . . 6 ⊢ (𝑐 = 𝐵 → (𝑐 − 𝐴) = (𝐵 − 𝐴)) | |
2 | 1 | oveq2d 7172 | . . . . 5 ⊢ (𝑐 = 𝐵 → ((1 / 2)↑(𝑐 − 𝐴)) = ((1 / 2)↑(𝐵 − 𝐴))) |
3 | 2 | oveq2d 7172 | . . . 4 ⊢ (𝑐 = 𝐵 → ((2↑-(!‘𝐴)) · ((1 / 2)↑(𝑐 − 𝐴))) = ((2↑-(!‘𝐴)) · ((1 / 2)↑(𝐵 − 𝐴)))) |
4 | aaliou3lem.a | . . . 4 ⊢ 𝐺 = (𝑐 ∈ (ℤ≥‘𝐴) ↦ ((2↑-(!‘𝐴)) · ((1 / 2)↑(𝑐 − 𝐴)))) | |
5 | ovex 7189 | . . . 4 ⊢ ((2↑-(!‘𝐴)) · ((1 / 2)↑(𝐵 − 𝐴))) ∈ V | |
6 | 3, 4, 5 | fvmpt 6768 | . . 3 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → (𝐺‘𝐵) = ((2↑-(!‘𝐴)) · ((1 / 2)↑(𝐵 − 𝐴)))) |
7 | 6 | adantl 484 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → (𝐺‘𝐵) = ((2↑-(!‘𝐴)) · ((1 / 2)↑(𝐵 − 𝐴)))) |
8 | 2rp 12395 | . . . . 5 ⊢ 2 ∈ ℝ+ | |
9 | simpl 485 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → 𝐴 ∈ ℕ) | |
10 | 9 | nnnn0d 11956 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → 𝐴 ∈ ℕ0) |
11 | 10 | faccld 13645 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → (!‘𝐴) ∈ ℕ) |
12 | 11 | nnzd 12087 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → (!‘𝐴) ∈ ℤ) |
13 | 12 | znegcld 12090 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → -(!‘𝐴) ∈ ℤ) |
14 | rpexpcl 13449 | . . . . 5 ⊢ ((2 ∈ ℝ+ ∧ -(!‘𝐴) ∈ ℤ) → (2↑-(!‘𝐴)) ∈ ℝ+) | |
15 | 8, 13, 14 | sylancr 589 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → (2↑-(!‘𝐴)) ∈ ℝ+) |
16 | halfre 11852 | . . . . . 6 ⊢ (1 / 2) ∈ ℝ | |
17 | halfgt0 11854 | . . . . . 6 ⊢ 0 < (1 / 2) | |
18 | 16, 17 | elrpii 12393 | . . . . 5 ⊢ (1 / 2) ∈ ℝ+ |
19 | eluzelz 12254 | . . . . . 6 ⊢ (𝐵 ∈ (ℤ≥‘𝐴) → 𝐵 ∈ ℤ) | |
20 | nnz 12005 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ) | |
21 | zsubcl 12025 | . . . . . 6 ⊢ ((𝐵 ∈ ℤ ∧ 𝐴 ∈ ℤ) → (𝐵 − 𝐴) ∈ ℤ) | |
22 | 19, 20, 21 | syl2anr 598 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → (𝐵 − 𝐴) ∈ ℤ) |
23 | rpexpcl 13449 | . . . . 5 ⊢ (((1 / 2) ∈ ℝ+ ∧ (𝐵 − 𝐴) ∈ ℤ) → ((1 / 2)↑(𝐵 − 𝐴)) ∈ ℝ+) | |
24 | 18, 22, 23 | sylancr 589 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → ((1 / 2)↑(𝐵 − 𝐴)) ∈ ℝ+) |
25 | 15, 24 | rpmulcld 12448 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → ((2↑-(!‘𝐴)) · ((1 / 2)↑(𝐵 − 𝐴))) ∈ ℝ+) |
26 | 25 | rpred 12432 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → ((2↑-(!‘𝐴)) · ((1 / 2)↑(𝐵 − 𝐴))) ∈ ℝ) |
27 | 7, 26 | eqeltrd 2913 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ (ℤ≥‘𝐴)) → (𝐺‘𝐵) ∈ ℝ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ↦ cmpt 5146 ‘cfv 6355 (class class class)co 7156 ℝcr 10536 1c1 10538 · cmul 10542 − cmin 10870 -cneg 10871 / cdiv 11297 ℕcn 11638 2c2 11693 ℤcz 11982 ℤ≥cuz 12244 ℝ+crp 12390 ↑cexp 13430 !cfa 13634 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-nn 11639 df-2 11701 df-n0 11899 df-z 11983 df-uz 12245 df-rp 12391 df-seq 13371 df-exp 13431 df-fac 13635 |
This theorem is referenced by: aaliou3lem2 24932 aaliou3lem3 24933 |
Copyright terms: Public domain | W3C validator |