![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > mbfi1fseqlem2 | Structured version Visualization version GIF version |
Description: Lemma for mbfi1fseq 25086. (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 11393 | . . . . . 6 ⊢ (𝑚 = 𝐴 → -𝑚 = -𝐴) | |
2 | id 22 | . . . . . 6 ⊢ (𝑚 = 𝐴 → 𝑚 = 𝐴) | |
3 | 1, 2 | oveq12d 7375 | . . . . 5 ⊢ (𝑚 = 𝐴 → (-𝑚[,]𝑚) = (-𝐴[,]𝐴)) |
4 | 3 | eleq2d 2823 | . . . 4 ⊢ (𝑚 = 𝐴 → (𝑥 ∈ (-𝑚[,]𝑚) ↔ 𝑥 ∈ (-𝐴[,]𝐴))) |
5 | oveq1 7364 | . . . . . 6 ⊢ (𝑚 = 𝐴 → (𝑚𝐽𝑥) = (𝐴𝐽𝑥)) | |
6 | 5, 2 | breq12d 5118 | . . . . 5 ⊢ (𝑚 = 𝐴 → ((𝑚𝐽𝑥) ≤ 𝑚 ↔ (𝐴𝐽𝑥) ≤ 𝐴)) |
7 | 6, 5, 2 | ifbieq12d 4514 | . . . 4 ⊢ (𝑚 = 𝐴 → if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚) = if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴)) |
8 | 4, 7 | ifbieq1d 4510 | . . 3 ⊢ (𝑚 = 𝐴 → if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0) = if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0)) |
9 | 8 | mpteq2dv 5207 | . 2 ⊢ (𝑚 = 𝐴 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0))) |
10 | mbfi1fseq.4 | . 2 ⊢ 𝐺 = (𝑚 ∈ ℕ ↦ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0))) | |
11 | reex 11142 | . . 3 ⊢ ℝ ∈ V | |
12 | 11 | mptex 7173 | . 2 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0)) ∈ V |
13 | 9, 10, 12 | fvmpt 6948 | 1 ⊢ (𝐴 ∈ ℕ → (𝐺‘𝐴) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2106 ifcif 4486 class class class wbr 5105 ↦ cmpt 5188 ⟶wf 6492 ‘cfv 6496 (class class class)co 7357 ∈ cmpo 7359 ℝcr 11050 0cc0 11051 · cmul 11056 +∞cpnf 11186 ≤ cle 11190 -cneg 11386 / cdiv 11812 ℕcn 12153 2c2 12208 [,)cico 13266 [,]cicc 13267 ⌊cfl 13695 ↑cexp 13967 MblFncmbf 24978 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pr 5384 ax-cnex 11107 ax-resscn 11108 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-ov 7360 df-neg 11388 |
This theorem is referenced by: mbfi1fseqlem3 25082 mbfi1fseqlem4 25083 mbfi1fseqlem5 25084 mbfi1fseqlem6 25085 |
Copyright terms: Public domain | W3C validator |