iblabsnclem - Mathbox for Brendan Leahy

	Mathbox for Brendan Leahy		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > iblabsnclem		Structured version Visualization version GIF version

Theorem iblabsnclem 37677

Description: Lemma for iblabsnc 37678; cf. iblabslem 25729. (Contributed by Brendan Leahy, 7-Nov-2017.)

**Hypotheses**
Ref	Expression
iblabsnc.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
iblabsnc.2	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ 𝐿¹)
iblabsnclem.1	⊢ 𝐺 = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0))
iblabsnclem.2	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ 𝐿¹)
iblabsnclem.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝐵) ∈ ℝ)

**Assertion**
Ref	Expression
iblabsnclem	⊢ (𝜑 → (𝐺 ∈ MblFn ∧ (∫₂‘𝐺) ∈ ℝ))

Distinct variable groups: 𝑥,𝐴 𝜑,𝑥 Allowed substitution hints: 𝐵(𝑥) 𝐹(𝑥) 𝐺(𝑥) 𝑉(𝑥)

Proof of Theorem iblabsnclem Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iblabsnclem.1	. . 3 ⊢ 𝐺 = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0))
2		iblabsnclem.2	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ 𝐿¹)
3		iblabsnclem.3	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝐵) ∈ ℝ)
4	3	iblrelem 25692	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ 𝐿¹ ↔ ((𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0))) ∈ ℝ ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0))) ∈ ℝ)))
5	2, 4	mpbid 232	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ MblFn ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0))) ∈ ℝ ∧ (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0))) ∈ ℝ))
6	5	simp1d 1142	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ MblFn)
7	6, 3	mbfdm2 25538	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ dom vol)
8		mblss 25432	. . . . 5 ⊢ (𝐴 ∈ dom vol → 𝐴 ⊆ ℝ)
9	7, 8	syl 17	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
10		rembl 25441	. . . . 5 ⊢ ℝ ∈ dom vol
11	10	a1i 11	. . . 4 ⊢ (𝜑 → ℝ ∈ dom vol)
12	3	recnd 11202	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝐵) ∈ ℂ)
13	12	abscld 15405	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (abs‘(𝐹‘𝐵)) ∈ ℝ)
14		0re 11176	. . . . 5 ⊢ 0 ∈ ℝ
15		ifcl 4534	. . . . 5 ⊢ (((abs‘(𝐹‘𝐵)) ∈ ℝ ∧ 0 ∈ ℝ) → if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0) ∈ ℝ)
16	13, 14, 15	sylancl 586	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0) ∈ ℝ)
17		eldifn 4095	. . . . . 6 ⊢ (𝑥 ∈ (ℝ ∖ 𝐴) → ¬ 𝑥 ∈ 𝐴)
18	17	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → ¬ 𝑥 ∈ 𝐴)
19		iffalse 4497	. . . . 5 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0) = 0)
20	18, 19	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0) = 0)
21		iftrue 4494	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0) = (abs‘(𝐹‘𝐵)))
22	21	mpteq2ia 5202	. . . . 5 ⊢ (𝑥 ∈ 𝐴 ↦ if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0)) = (𝑥 ∈ 𝐴 ↦ (abs‘(𝐹‘𝐵)))
23	13	fmpttd 7087	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘(𝐹‘𝐵))):𝐴⟶ℝ)
24	13	adantlr 715	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (abs‘(𝐹‘𝐵)) ∈ ℝ)
25	24	biantrurd 532	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (𝑦 < (abs‘(𝐹‘𝐵)) ↔ ((abs‘(𝐹‘𝐵)) ∈ ℝ ∧ 𝑦 < (abs‘(𝐹‘𝐵)))))
26	3	adantlr 715	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝐵) ∈ ℝ)
27		simplr 768	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ ℝ)
28	26, 27	absled 15399	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐹‘𝐵)) ≤ 𝑦 ↔ (-𝑦 ≤ (𝐹‘𝐵) ∧ (𝐹‘𝐵) ≤ 𝑦)))
29	28	notbid 318	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (¬ (abs‘(𝐹‘𝐵)) ≤ 𝑦 ↔ ¬ (-𝑦 ≤ (𝐹‘𝐵) ∧ (𝐹‘𝐵) ≤ 𝑦)))
30	27, 24	ltnled 11321	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (𝑦 < (abs‘(𝐹‘𝐵)) ↔ ¬ (abs‘(𝐹‘𝐵)) ≤ 𝑦))
31		renegcl 11485	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ ℝ → -𝑦 ∈ ℝ)
32	31	rexrd 11224	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ ℝ → -𝑦 ∈ ℝ^*)
33	32	ad2antlr 727	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → -𝑦 ∈ ℝ^*)
34		elioomnf 13405	. . . . . . . . . . . . . . 15 ⊢ (-𝑦 ∈ ℝ^* → ((𝐹‘𝐵) ∈ (-∞(,)-𝑦) ↔ ((𝐹‘𝐵) ∈ ℝ ∧ (𝐹‘𝐵) < -𝑦)))
35	33, 34	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝐵) ∈ (-∞(,)-𝑦) ↔ ((𝐹‘𝐵) ∈ ℝ ∧ (𝐹‘𝐵) < -𝑦)))
36	26	biantrurd 532	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝐵) < -𝑦 ↔ ((𝐹‘𝐵) ∈ ℝ ∧ (𝐹‘𝐵) < -𝑦)))
37	27	renegcld 11605	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → -𝑦 ∈ ℝ)
38	26, 37	ltnled 11321	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝐵) < -𝑦 ↔ ¬ -𝑦 ≤ (𝐹‘𝐵)))
39	35, 36, 38	3bitr2d 307	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝐵) ∈ (-∞(,)-𝑦) ↔ ¬ -𝑦 ≤ (𝐹‘𝐵)))
40		rexr 11220	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℝ^*)
41	40	ad2antlr 727	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ ℝ^*)
42		elioopnf 13404	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ℝ^* → ((𝐹‘𝐵) ∈ (𝑦(,)+∞) ↔ ((𝐹‘𝐵) ∈ ℝ ∧ 𝑦 < (𝐹‘𝐵))))
43	41, 42	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝐵) ∈ (𝑦(,)+∞) ↔ ((𝐹‘𝐵) ∈ ℝ ∧ 𝑦 < (𝐹‘𝐵))))
44	26	biantrurd 532	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (𝑦 < (𝐹‘𝐵) ↔ ((𝐹‘𝐵) ∈ ℝ ∧ 𝑦 < (𝐹‘𝐵))))
45	27, 26	ltnled 11321	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (𝑦 < (𝐹‘𝐵) ↔ ¬ (𝐹‘𝐵) ≤ 𝑦))
46	43, 44, 45	3bitr2d 307	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝐵) ∈ (𝑦(,)+∞) ↔ ¬ (𝐹‘𝐵) ≤ 𝑦))
47	39, 46	orbi12d 918	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (((𝐹‘𝐵) ∈ (-∞(,)-𝑦) ∨ (𝐹‘𝐵) ∈ (𝑦(,)+∞)) ↔ (¬ -𝑦 ≤ (𝐹‘𝐵) ∨ ¬ (𝐹‘𝐵) ≤ 𝑦)))
48		ianor 983	. . . . . . . . . . . 12 ⊢ (¬ (-𝑦 ≤ (𝐹‘𝐵) ∧ (𝐹‘𝐵) ≤ 𝑦) ↔ (¬ -𝑦 ≤ (𝐹‘𝐵) ∨ ¬ (𝐹‘𝐵) ≤ 𝑦))
49	47, 48	bitr4di 289	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (((𝐹‘𝐵) ∈ (-∞(,)-𝑦) ∨ (𝐹‘𝐵) ∈ (𝑦(,)+∞)) ↔ ¬ (-𝑦 ≤ (𝐹‘𝐵) ∧ (𝐹‘𝐵) ≤ 𝑦)))
50	29, 30, 49	3bitr4rd 312	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (((𝐹‘𝐵) ∈ (-∞(,)-𝑦) ∨ (𝐹‘𝐵) ∈ (𝑦(,)+∞)) ↔ 𝑦 < (abs‘(𝐹‘𝐵))))
51		elioopnf 13404	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℝ^* → ((abs‘(𝐹‘𝐵)) ∈ (𝑦(,)+∞) ↔ ((abs‘(𝐹‘𝐵)) ∈ ℝ ∧ 𝑦 < (abs‘(𝐹‘𝐵)))))
52	41, 51	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐹‘𝐵)) ∈ (𝑦(,)+∞) ↔ ((abs‘(𝐹‘𝐵)) ∈ ℝ ∧ 𝑦 < (abs‘(𝐹‘𝐵)))))
53	25, 50, 52	3bitr4rd 312	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐹‘𝐵)) ∈ (𝑦(,)+∞) ↔ ((𝐹‘𝐵) ∈ (-∞(,)-𝑦) ∨ (𝐹‘𝐵) ∈ (𝑦(,)+∞))))
54	53	rabbidva 3412	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → {𝑥 ∈ 𝐴 ∣ (abs‘(𝐹‘𝐵)) ∈ (𝑦(,)+∞)} = {𝑥 ∈ 𝐴 ∣ ((𝐹‘𝐵) ∈ (-∞(,)-𝑦) ∨ (𝐹‘𝐵) ∈ (𝑦(,)+∞))})
55		eqid 2729	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 ↦ (abs‘(𝐹‘𝐵))) = (𝑥 ∈ 𝐴 ↦ (abs‘(𝐹‘𝐵)))
56	55	mptpreima 6211	. . . . . . . 8 ⊢ (^◡(𝑥 ∈ 𝐴 ↦ (abs‘(𝐹‘𝐵))) “ (𝑦(,)+∞)) = {𝑥 ∈ 𝐴 ∣ (abs‘(𝐹‘𝐵)) ∈ (𝑦(,)+∞)}
57		eqid 2729	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵))
58	57	mptpreima 6211	. . . . . . . . . 10 ⊢ (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-∞(,)-𝑦)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝐵) ∈ (-∞(,)-𝑦)}
59	57	mptpreima 6211	. . . . . . . . . 10 ⊢ (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (𝑦(,)+∞)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝐵) ∈ (𝑦(,)+∞)}
60	58, 59	uneq12i 4129	. . . . . . . . 9 ⊢ ((^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-∞(,)-𝑦)) ∪ (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (𝑦(,)+∞))) = ({𝑥 ∈ 𝐴 ∣ (𝐹‘𝐵) ∈ (-∞(,)-𝑦)} ∪ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝐵) ∈ (𝑦(,)+∞)})
61		unrab 4278	. . . . . . . . 9 ⊢ ({𝑥 ∈ 𝐴 ∣ (𝐹‘𝐵) ∈ (-∞(,)-𝑦)} ∪ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝐵) ∈ (𝑦(,)+∞)}) = {𝑥 ∈ 𝐴 ∣ ((𝐹‘𝐵) ∈ (-∞(,)-𝑦) ∨ (𝐹‘𝐵) ∈ (𝑦(,)+∞))}
62	60, 61	eqtri 2752	. . . . . . . 8 ⊢ ((^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-∞(,)-𝑦)) ∪ (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (𝑦(,)+∞))) = {𝑥 ∈ 𝐴 ∣ ((𝐹‘𝐵) ∈ (-∞(,)-𝑦) ∨ (𝐹‘𝐵) ∈ (𝑦(,)+∞))}
63	54, 56, 62	3eqtr4g 2789	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (^◡(𝑥 ∈ 𝐴 ↦ (abs‘(𝐹‘𝐵))) “ (𝑦(,)+∞)) = ((^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-∞(,)-𝑦)) ∪ (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (𝑦(,)+∞))))
64		iblmbf 25668	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ 𝐿¹ → (𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ MblFn)
65	2, 64	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ MblFn)
66	3	fmpttd 7087	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)):𝐴⟶ℝ)
67		mbfima 25531	. . . . . . . . . 10 ⊢ (((𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)):𝐴⟶ℝ) → (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-∞(,)-𝑦)) ∈ dom vol)
68		mbfima 25531	. . . . . . . . . 10 ⊢ (((𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)):𝐴⟶ℝ) → (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (𝑦(,)+∞)) ∈ dom vol)
69		unmbl 25438	. . . . . . . . . 10 ⊢ (((^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-∞(,)-𝑦)) ∈ dom vol ∧ (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (𝑦(,)+∞)) ∈ dom vol) → ((^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-∞(,)-𝑦)) ∪ (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (𝑦(,)+∞))) ∈ dom vol)
70	67, 68, 69	syl2anc 584	. . . . . . . . 9 ⊢ (((𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)):𝐴⟶ℝ) → ((^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-∞(,)-𝑦)) ∪ (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (𝑦(,)+∞))) ∈ dom vol)
71	65, 66, 70	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → ((^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-∞(,)-𝑦)) ∪ (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (𝑦(,)+∞))) ∈ dom vol)
72	71	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → ((^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-∞(,)-𝑦)) ∪ (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (𝑦(,)+∞))) ∈ dom vol)
73	63, 72	eqeltrd 2828	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (^◡(𝑥 ∈ 𝐴 ↦ (abs‘(𝐹‘𝐵))) “ (𝑦(,)+∞)) ∈ dom vol)
74		elioomnf 13405	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ ℝ^* → ((abs‘(𝐹‘𝐵)) ∈ (-∞(,)𝑦) ↔ ((abs‘(𝐹‘𝐵)) ∈ ℝ ∧ (abs‘(𝐹‘𝐵)) < 𝑦)))
75	41, 74	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐹‘𝐵)) ∈ (-∞(,)𝑦) ↔ ((abs‘(𝐹‘𝐵)) ∈ ℝ ∧ (abs‘(𝐹‘𝐵)) < 𝑦)))
76	24	biantrurd 532	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐹‘𝐵)) < 𝑦 ↔ ((abs‘(𝐹‘𝐵)) ∈ ℝ ∧ (abs‘(𝐹‘𝐵)) < 𝑦)))
77	26, 27	absltd 15398	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐹‘𝐵)) < 𝑦 ↔ (-𝑦 < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < 𝑦)))
78	75, 76, 77	3bitr2d 307	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐹‘𝐵)) ∈ (-∞(,)𝑦) ↔ (-𝑦 < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < 𝑦)))
79	26	biantrurd 532	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((-𝑦 < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < 𝑦) ↔ ((𝐹‘𝐵) ∈ ℝ ∧ (-𝑦 < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < 𝑦))))
80	78, 79	bitrd 279	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐹‘𝐵)) ∈ (-∞(,)𝑦) ↔ ((𝐹‘𝐵) ∈ ℝ ∧ (-𝑦 < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < 𝑦))))
81		3anass 1094	. . . . . . . . . . 11 ⊢ (((𝐹‘𝐵) ∈ ℝ ∧ -𝑦 < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < 𝑦) ↔ ((𝐹‘𝐵) ∈ ℝ ∧ (-𝑦 < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < 𝑦)))
82	80, 81	bitr4di 289	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐹‘𝐵)) ∈ (-∞(,)𝑦) ↔ ((𝐹‘𝐵) ∈ ℝ ∧ -𝑦 < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < 𝑦)))
83		elioo2 13347	. . . . . . . . . . . 12 ⊢ ((-𝑦 ∈ ℝ^* ∧ 𝑦 ∈ ℝ^*) → ((𝐹‘𝐵) ∈ (-𝑦(,)𝑦) ↔ ((𝐹‘𝐵) ∈ ℝ ∧ -𝑦 < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < 𝑦)))
84	32, 40, 83	syl2anc 584	. . . . . . . . . . 11 ⊢ (𝑦 ∈ ℝ → ((𝐹‘𝐵) ∈ (-𝑦(,)𝑦) ↔ ((𝐹‘𝐵) ∈ ℝ ∧ -𝑦 < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < 𝑦)))
85	84	ad2antlr 727	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝐵) ∈ (-𝑦(,)𝑦) ↔ ((𝐹‘𝐵) ∈ ℝ ∧ -𝑦 < (𝐹‘𝐵) ∧ (𝐹‘𝐵) < 𝑦)))
86	82, 85	bitr4d 282	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑦 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → ((abs‘(𝐹‘𝐵)) ∈ (-∞(,)𝑦) ↔ (𝐹‘𝐵) ∈ (-𝑦(,)𝑦)))
87	86	rabbidva 3412	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → {𝑥 ∈ 𝐴 ∣ (abs‘(𝐹‘𝐵)) ∈ (-∞(,)𝑦)} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝐵) ∈ (-𝑦(,)𝑦)})
88	55	mptpreima 6211	. . . . . . . 8 ⊢ (^◡(𝑥 ∈ 𝐴 ↦ (abs‘(𝐹‘𝐵))) “ (-∞(,)𝑦)) = {𝑥 ∈ 𝐴 ∣ (abs‘(𝐹‘𝐵)) ∈ (-∞(,)𝑦)}
89	57	mptpreima 6211	. . . . . . . 8 ⊢ (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-𝑦(,)𝑦)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝐵) ∈ (-𝑦(,)𝑦)}
90	87, 88, 89	3eqtr4g 2789	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (^◡(𝑥 ∈ 𝐴 ↦ (abs‘(𝐹‘𝐵))) “ (-∞(,)𝑦)) = (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-𝑦(,)𝑦)))
91		mbfima 25531	. . . . . . . . 9 ⊢ (((𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)):𝐴⟶ℝ) → (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-𝑦(,)𝑦)) ∈ dom vol)
92	65, 66, 91	syl2anc 584	. . . . . . . 8 ⊢ (𝜑 → (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-𝑦(,)𝑦)) ∈ dom vol)
93	92	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (^◡(𝑥 ∈ 𝐴 ↦ (𝐹‘𝐵)) “ (-𝑦(,)𝑦)) ∈ dom vol)
94	90, 93	eqeltrd 2828	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ ℝ) → (^◡(𝑥 ∈ 𝐴 ↦ (abs‘(𝐹‘𝐵))) “ (-∞(,)𝑦)) ∈ dom vol)
95	23, 7, 73, 94	ismbf2d 25541	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ (abs‘(𝐹‘𝐵))) ∈ MblFn)
96	22, 95	eqeltrid 2832	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0)) ∈ MblFn)
97	9, 11, 16, 20, 96	mbfss 25547	. . 3 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0)) ∈ MblFn)
98	1, 97	eqeltrid 2832	. 2 ⊢ (𝜑 → 𝐺 ∈ MblFn)
99		reex 11159	. . . . . . . . 9 ⊢ ℝ ∈ V
100	99	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ℝ ∈ V)
101		ifan 4542	. . . . . . . . . 10 ⊢ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0) = if(𝑥 ∈ 𝐴, if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0), 0)
102		ifcl 4534	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0) ∈ ℝ)
103	3, 14, 102	sylancl 586	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0) ∈ ℝ)
104		max1 13145	. . . . . . . . . . . . 13 ⊢ ((0 ∈ ℝ ∧ (𝐹‘𝐵) ∈ ℝ) → 0 ≤ if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0))
105	14, 3, 104	sylancr 587	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0))
106		elrege0 13415	. . . . . . . . . . . 12 ⊢ (if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0) ∈ (0[,)+∞) ↔ (if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0) ∈ ℝ ∧ 0 ≤ if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0)))
107	103, 105, 106	sylanbrc 583	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0) ∈ (0[,)+∞))
108		0e0icopnf 13419	. . . . . . . . . . . 12 ⊢ 0 ∈ (0[,)+∞)
109	108	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝑥 ∈ 𝐴) → 0 ∈ (0[,)+∞))
110	107, 109	ifclda 4524	. . . . . . . . . 10 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0), 0) ∈ (0[,)+∞))
111	101, 110	eqeltrid 2832	. . . . . . . . 9 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0) ∈ (0[,)+∞))
112	111	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0) ∈ (0[,)+∞))
113		ifan 4542	. . . . . . . . . 10 ⊢ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0) = if(𝑥 ∈ 𝐴, if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0), 0)
114	3	renegcld 11605	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -(𝐹‘𝐵) ∈ ℝ)
115		ifcl 4534	. . . . . . . . . . . . 13 ⊢ ((-(𝐹‘𝐵) ∈ ℝ ∧ 0 ∈ ℝ) → if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0) ∈ ℝ)
116	114, 14, 115	sylancl 586	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0) ∈ ℝ)
117		max1 13145	. . . . . . . . . . . . 13 ⊢ ((0 ∈ ℝ ∧ -(𝐹‘𝐵) ∈ ℝ) → 0 ≤ if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0))
118	14, 114, 117	sylancr 587	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 0 ≤ if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0))
119		elrege0 13415	. . . . . . . . . . . 12 ⊢ (if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0) ∈ (0[,)+∞) ↔ (if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0) ∈ ℝ ∧ 0 ≤ if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0)))
120	116, 118, 119	sylanbrc 583	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0) ∈ (0[,)+∞))
121	120, 109	ifclda 4524	. . . . . . . . . 10 ⊢ (𝜑 → if(𝑥 ∈ 𝐴, if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0), 0) ∈ (0[,)+∞))
122	113, 121	eqeltrid 2832	. . . . . . . . 9 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0) ∈ (0[,)+∞))
123	122	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0) ∈ (0[,)+∞))
124		eqidd 2730	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0)))
125		eqidd 2730	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0)) = (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0)))
126	100, 112, 123, 124, 125	offval2 7673	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0))) = (𝑥 ∈ ℝ ↦ (if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0) + if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0))))
127	101, 113	oveq12i 7399	. . . . . . . . 9 ⊢ (if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0) + if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0)) = (if(𝑥 ∈ 𝐴, if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0), 0) + if(𝑥 ∈ 𝐴, if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0), 0))
128		max0add 15276	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝐵) ∈ ℝ → (if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0) + if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0)) = (abs‘(𝐹‘𝐵)))
129	3, 128	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0) + if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0)) = (abs‘(𝐹‘𝐵)))
130		iftrue 4494	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0), 0) = if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0))
131	130	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0), 0) = if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0))
132		iftrue 4494	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0), 0) = if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0))
133	132	adantl 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0), 0) = if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0))
134	131, 133	oveq12d 7405	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(𝑥 ∈ 𝐴, if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0), 0) + if(𝑥 ∈ 𝐴, if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0), 0)) = (if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0) + if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0)))
135	21	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0) = (abs‘(𝐹‘𝐵)))
136	129, 134, 135	3eqtr4d 2774	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (if(𝑥 ∈ 𝐴, if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0), 0) + if(𝑥 ∈ 𝐴, if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0), 0)) = if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0))
137	136	ex 412	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → (if(𝑥 ∈ 𝐴, if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0), 0) + if(𝑥 ∈ 𝐴, if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0), 0)) = if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0)))
138		00id 11349	. . . . . . . . . . 11 ⊢ (0 + 0) = 0
139		iffalse 4497	. . . . . . . . . . . 12 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0), 0) = 0)
140		iffalse 4497	. . . . . . . . . . . 12 ⊢ (¬ 𝑥 ∈ 𝐴 → if(𝑥 ∈ 𝐴, if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0), 0) = 0)
141	139, 140	oveq12d 7405	. . . . . . . . . . 11 ⊢ (¬ 𝑥 ∈ 𝐴 → (if(𝑥 ∈ 𝐴, if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0), 0) + if(𝑥 ∈ 𝐴, if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0), 0)) = (0 + 0))
142	138, 141, 19	3eqtr4a 2790	. . . . . . . . . 10 ⊢ (¬ 𝑥 ∈ 𝐴 → (if(𝑥 ∈ 𝐴, if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0), 0) + if(𝑥 ∈ 𝐴, if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0), 0)) = if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0))
143	137, 142	pm2.61d1 180	. . . . . . . . 9 ⊢ (𝜑 → (if(𝑥 ∈ 𝐴, if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0), 0) + if(𝑥 ∈ 𝐴, if(0 ≤ -(𝐹‘𝐵), -(𝐹‘𝐵), 0), 0)) = if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0))
144	127, 143	eqtrid 2776	. . . . . . . 8 ⊢ (𝜑 → (if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0) + if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0)) = if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0))
145	144	mpteq2dv 5201	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ (if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0) + if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0)))
146	126, 145	eqtrd 2764	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0))) = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ 𝐴, (abs‘(𝐹‘𝐵)), 0)))
147	1, 146	eqtr4id 2783	. . . . 5 ⊢ (𝜑 → 𝐺 = ((𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0))))
148	147	fveq2d 6862	. . . 4 ⊢ (𝜑 → (∫₂‘𝐺) = (∫₂‘((𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0)))))
149	111	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0) ∈ (0[,)+∞))
150	101, 139	eqtrid 2776	. . . . . . 7 ⊢ (¬ 𝑥 ∈ 𝐴 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0) = 0)
151	18, 150	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0) = 0)
152		ibar 528	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → (0 ≤ (𝐹‘𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵))))
153	152	ifbid 4512	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0))
154	153	mpteq2ia 5202	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 ↦ if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0)) = (𝑥 ∈ 𝐴 ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0))
155	3, 6	mbfpos 25552	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ (𝐹‘𝐵), (𝐹‘𝐵), 0)) ∈ MblFn)
156	154, 155	eqeltrrid 2833	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0)) ∈ MblFn)
157	9, 11, 149, 151, 156	mbfss 25547	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0)) ∈ MblFn)
158	112	fmpttd 7087	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0)):ℝ⟶(0[,)+∞))
159	5	simp2d 1143	. . . . 5 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0))) ∈ ℝ)
160	123	fmpttd 7087	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0)):ℝ⟶(0[,)+∞))
161	5	simp3d 1144	. . . . 5 ⊢ (𝜑 → (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0))) ∈ ℝ)
162	157, 158, 159, 160, 161	itg2addnc 37668	. . . 4 ⊢ (𝜑 → (∫₂‘((𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0)) ∘_f + (𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0)))) = ((∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0)))))
163	148, 162	eqtrd 2764	. . 3 ⊢ (𝜑 → (∫₂‘𝐺) = ((∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0)))))
164	159, 161	readdcld 11203	. . 3 ⊢ (𝜑 → ((∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ (𝐹‘𝐵)), (𝐹‘𝐵), 0))) + (∫₂‘(𝑥 ∈ ℝ ↦ if((𝑥 ∈ 𝐴 ∧ 0 ≤ -(𝐹‘𝐵)), -(𝐹‘𝐵), 0)))) ∈ ℝ)
165	163, 164	eqeltrd 2828	. 2 ⊢ (𝜑 → (∫₂‘𝐺) ∈ ℝ)
166	98, 165	jca 511	1 ⊢ (𝜑 → (𝐺 ∈ MblFn ∧ (∫₂‘𝐺) ∈ ℝ))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 {crab 3405 Vcvv 3447 ∖ cdif 3911 ∪ cun 3912 ⊆ wss 3914 ifcif 4488 class class class wbr 5107 ↦ cmpt 5188 ^◡ccnv 5637 dom cdm 5638 “ cima 5641 ⟶wf 6507 ‘cfv 6511 (class class class)co 7387 ∘_f cof 7651 ℝcr 11067 0cc0 11068 + caddc 11071 +∞cpnf 11205 -∞cmnf 11206 ℝ^*cxr 11207 < clt 11208 ≤ cle 11209 -cneg 11406 (,)cioo 13306 [,)cico 13308 abscabs 15200 volcvol 25364 MblFncmbf 25515 ∫₂citg2 25517 𝐿¹cibl 25518

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-inf2 9594 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146 ax-addf 11147

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-disj 5075 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-se 5592 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-isom 6520 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-of 7653 df-ofr 7654 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-2o 8435 df-er 8671 df-map 8801 df-pm 8802 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-fi 9362 df-sup 9393 df-inf 9394 df-oi 9463 df-dju 9854 df-card 9892 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-3 12250 df-n0 12443 df-z 12530 df-uz 12794 df-q 12908 df-rp 12952 df-xneg 13072 df-xadd 13073 df-xmul 13074 df-ioo 13310 df-ico 13312 df-icc 13313 df-fz 13469 df-fzo 13616 df-fl 13754 df-seq 13967 df-exp 14027 df-hash 14296 df-cj 15065 df-re 15066 df-im 15067 df-sqrt 15201 df-abs 15202 df-clim 15454 df-sum 15653 df-rest 17385 df-topgen 17406 df-psmet 21256 df-xmet 21257 df-met 21258 df-bl 21259 df-mopn 21260 df-top 22781 df-topon 22798 df-bases 22833 df-cmp 23274 df-ovol 25365 df-vol 25366 df-mbf 25520 df-itg1 25521 df-itg2 25522 df-ibl 25523 df-0p 25571

This theorem is referenced by: iblabsnc 37678 iblmulc2nc 37679

W3C validator