Theorem mbfi1fseqlem2 25683

Description: Lemma for mbfi1fseq 25688. (Contributed by Mario Carneiro, 16-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)

Hypotheses

Ref	Expression
mbfi1fseq.1	⊢ (𝜑 → 𝐹 ∈ MblFn)
mbfi1fseq.2	⊢ (𝜑 → 𝐹:ℝ⟶(0[,)+∞))
mbfi1fseq.3	⊢ 𝐽 = (𝑚 ∈ ℕ, 𝑦 ∈ ℝ ↦ ((⌊‘((𝐹‘𝑦) · (2↑𝑚))) / (2↑𝑚)))
mbfi1fseq.4	⊢ 𝐺 = (𝑚 ∈ ℕ ↦ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0)))

Assertion

Ref	Expression
mbfi1fseqlem2	⊢ (𝐴 ∈ ℕ → (𝐺‘𝐴) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0)))

Distinct variable groups:   𝑥,𝑚,𝑦,𝐹   𝑥,𝐺   𝑚,𝐽   𝜑,𝑚,𝑥,𝑦   𝐴,𝑚,𝑥,𝑦

Allowed substitution hints:   𝐺(𝑦,𝑚)   𝐽(𝑥,𝑦)

Proof of Theorem mbfi1fseqlem2

Step	Hyp	Ref	Expression
1		negeq 11385	. . . . . 6 ⊢ (𝑚 = 𝐴 → -𝑚 = -𝐴)
2		id 22	. . . . . 6 ⊢ (𝑚 = 𝐴 → 𝑚 = 𝐴)
3	1, 2	oveq12d 7385	. . . . 5 ⊢ (𝑚 = 𝐴 → (-𝑚[,]𝑚) = (-𝐴[,]𝐴))
4	3	eleq2d 2822	. . . 4 ⊢ (𝑚 = 𝐴 → (𝑥 ∈ (-𝑚[,]𝑚) ↔ 𝑥 ∈ (-𝐴[,]𝐴)))
5		oveq1 7374	. . . . . 6 ⊢ (𝑚 = 𝐴 → (𝑚𝐽𝑥) = (𝐴𝐽𝑥))
6	5, 2	breq12d 5098	. . . . 5 ⊢ (𝑚 = 𝐴 → ((𝑚𝐽𝑥) ≤ 𝑚 ↔ (𝐴𝐽𝑥) ≤ 𝐴))
7	6, 5, 2	ifbieq12d 4495	. . . 4 ⊢ (𝑚 = 𝐴 → if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚) = if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴))
8	4, 7	ifbieq1d 4491	. . 3 ⊢ (𝑚 = 𝐴 → if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0) = if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0))
9	8	mpteq2dv 5179	. 2 ⊢ (𝑚 = 𝐴 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0)) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0)))
10		mbfi1fseq.4	. 2 ⊢ 𝐺 = (𝑚 ∈ ℕ ↦ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝑚[,]𝑚), if((𝑚𝐽𝑥) ≤ 𝑚, (𝑚𝐽𝑥), 𝑚), 0)))
11		reex 11129	. . 3 ⊢ ℝ ∈ V
12	11	mptex 7178	. 2 ⊢ (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0)) ∈ V
13	9, 10, 12	fvmpt 6947	1 ⊢ (𝐴 ∈ ℕ → (𝐺‘𝐴) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (-𝐴[,]𝐴), if((𝐴𝐽𝑥) ≤ 𝐴, (𝐴𝐽𝑥), 𝐴), 0)))

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  ifcif 4466   class class class wbr 5085   ↦ cmpt 5166  ⟶wf 6494  ‘cfv 6498  (class class class)co 7367   ∈ cmpo 7369  ℝcr 11037  0cc0 11038   · cmul 11043  +∞cpnf 11176   ≤ cle 11180  -cneg 11378   / cdiv 11807  ℕcn 12174  2c2 12236  [,)cico 13300  [,]cicc 13301  ⌊cfl 13749  ↑cexp 14023  MblFncmbf 25581

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-cnex 11094  ax-resscn 11095

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-neg 11380

This theorem is referenced by:  mbfi1fseqlem3  25684  mbfi1fseqlem4  25685  mbfi1fseqlem5  25686  mbfi1fseqlem6  25687