Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mbfi1fseqlem2 | Structured version Visualization version GIF version |
Description: Lemma for mbfi1fseq 24249. (Contributed by Mario Carneiro, 16-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.) |
Ref | Expression |
---|---|
mbfi1fseq.1 | ⊢ (𝜑 → 𝐹 ∈ MblFn) |
mbfi1fseq.2 | ⊢ (𝜑 → 𝐹:ℝ⟶(0[,)+∞)) |
mbfi1fseq.3 | ⊢ 𝐽 = (𝑚 ∈ ℕ, 𝑦 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑦) · (2↑𝑚))) / (2↑𝑚))) |
mbfi1fseq.4 | ⊢ 𝐺 = (𝑚 ∈ ℕ ↦ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0))) |
Ref | Expression |
---|---|
mbfi1fseqlem2 | ⊢ (𝐴 ∈ ℕ → (𝐺‘𝐴) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | negeq 10866 | . . . . . 6 ⊢ (𝑚 = 𝐴 → -𝑚 = -𝐴) | |
2 | id 22 | . . . . . 6 ⊢ (𝑚 = 𝐴 → 𝑚 = 𝐴) | |
3 | 1, 2 | oveq12d 7163 | . . . . 5 ⊢ (𝑚 = 𝐴 → (-𝑚[,]𝑚) = (-𝐴[,]𝐴)) |
4 | 3 | eleq2d 2895 | . . . 4 ⊢ (𝑚 = 𝐴 → (𝑥 ∈ (-𝑚[,]𝑚) ↔ 𝑥 ∈ (-𝐴[,]𝐴))) |
5 | oveq1 7152 | . . . . . 6 ⊢ (𝑚 = 𝐴 → (𝑚𝐽𝑥) = (𝐴𝐽𝑥)) | |
6 | 5, 2 | breq12d 5070 | . . . . 5 ⊢ (𝑚 = 𝐴 → ((𝑚𝐽𝑥) ≤ 𝑚 ↔ (𝐴𝐽𝑥) ≤ 𝐴)) |
7 | 6, 5, 2 | ifbieq12d 4490 | . . . 4 ⊢ (𝑚 = 𝐴 → if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚) = if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴)) |
8 | 4, 7 | ifbieq1d 4486 | . . 3 ⊢ (𝑚 = 𝐴 → if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0) = if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0)) |
9 | 8 | mpteq2dv 5153 | . 2 ⊢ (𝑚 = 𝐴 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0))) |
10 | mbfi1fseq.4 | . 2 ⊢ 𝐺 = (𝑚 ∈ ℕ ↦ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0))) | |
11 | reex 10616 | . . 3 ⊢ ℝ ∈ V | |
12 | 11 | mptex 6977 | . 2 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0)) ∈ V |
13 | 9, 10, 12 | fvmpt 6761 | 1 ⊢ (𝐴 ∈ ℕ → (𝐺‘𝐴) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1528 ∈ wcel 2105 ifcif 4463 class class class wbr 5057 ↦ cmpt 5137 ⟶wf 6344 ‘cfv 6348 (class class class)co 7145 ∈ cmpo 7147 ℝcr 10524 0cc0 10525 · cmul 10530 +∞cpnf 10660 ≤ cle 10664 -cneg 10859 / cdiv 11285 ℕcn 11626 2c2 11680 [,)cico 12728 [,]cicc 12729 ⌊cfl 13148 ↑cexp 13417 MblFncmbf 24142 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pr 5320 ax-cnex 10581 ax-resscn 10582 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-ov 7148 df-neg 10861 |
This theorem is referenced by: mbfi1fseqlem3 24245 mbfi1fseqlem4 24246 mbfi1fseqlem5 24247 mbfi1fseqlem6 24248 |
Copyright terms: Public domain | W3C validator |