ftc1anclem1 - Mathbox for Brendan Leahy

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

Theorem ftc1anclem1 36561

Description: Lemma for ftc1anc 36569- the absolute value of a real-valued measurable function is measurable. Would be trivial with cncombf 25175, but this proof avoids ax-cc 10430. (Contributed by Brendan Leahy, 18-Jun-2018.)

**Assertion**
Ref	Expression
ftc1anclem1	⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → (abs ∘ 𝐹) ∈ MblFn)

Proof of Theorem ftc1anclem1 Dummy variables 𝑥 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ffvelcdm 7084	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (𝐹‘𝑡) ∈ ℝ)
2	1	recnd 11242	. . . 4 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (𝐹‘𝑡) ∈ ℂ)
3		id 22	. . . . 5 ⊢ (𝐹:𝐴⟶ℝ → 𝐹:𝐴⟶ℝ)
4	3	feqmptd 6961	. . . 4 ⊢ (𝐹:𝐴⟶ℝ → 𝐹 = (𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)))
5		absf 15284	. . . . . 6 ⊢ abs:ℂ⟶ℝ
6	5	a1i 11	. . . . 5 ⊢ (𝐹:𝐴⟶ℝ → abs:ℂ⟶ℝ)
7	6	feqmptd 6961	. . . 4 ⊢ (𝐹:𝐴⟶ℝ → abs = (𝑥 ∈ ℂ ↦ (abs‘𝑥)))
8		fveq2 6892	. . . 4 ⊢ (𝑥 = (𝐹‘𝑡) → (abs‘𝑥) = (abs‘(𝐹‘𝑡)))
9	2, 4, 7, 8	fmptco 7127	. . 3 ⊢ (𝐹:𝐴⟶ℝ → (abs ∘ 𝐹) = (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))))
10	9	adantr 482	. 2 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → (abs ∘ 𝐹) = (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))))
11	2	abscld 15383	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (abs‘(𝐹‘𝑡)) ∈ ℝ)
12	11	fmpttd 7115	. . . 4 ⊢ (𝐹:𝐴⟶ℝ → (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))):𝐴⟶ℝ)
13	12	adantr 482	. . 3 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))):𝐴⟶ℝ)
14		fdm 6727	. . . . 5 ⊢ (𝐹:𝐴⟶ℝ → dom 𝐹 = 𝐴)
15	14	adantr 482	. . . 4 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → dom 𝐹 = 𝐴)
16		mbfdm 25143	. . . . 5 ⊢ (𝐹 ∈ MblFn → dom 𝐹 ∈ dom vol)
17	16	adantl 483	. . . 4 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → dom 𝐹 ∈ dom vol)
18	15, 17	eqeltrrd 2835	. . 3 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → 𝐴 ∈ dom vol)
19		rexr 11260	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ^*)
20		elioopnf 13420	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ^* → ((abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞) ↔ ((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ 𝑥 < (abs‘(𝐹‘𝑡)))))
21	19, 20	syl 17	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℝ → ((abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞) ↔ ((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ 𝑥 < (abs‘(𝐹‘𝑡)))))
22	11	biantrurd 534	. . . . . . . . . . . . 13 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (𝑥 < (abs‘(𝐹‘𝑡)) ↔ ((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ 𝑥 < (abs‘(𝐹‘𝑡)))))
23	22	bicomd 222	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ 𝑥 < (abs‘(𝐹‘𝑡))) ↔ 𝑥 < (abs‘(𝐹‘𝑡))))
24	21, 23	sylan9bbr 512	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞) ↔ 𝑥 < (abs‘(𝐹‘𝑡))))
25		ltnle 11293	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ (abs‘(𝐹‘𝑡)) ∈ ℝ) → (𝑥 < (abs‘(𝐹‘𝑡)) ↔ ¬ (abs‘(𝐹‘𝑡)) ≤ 𝑥))
26	25	ancoms 460	. . . . . . . . . . . 12 ⊢ (((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑥 < (abs‘(𝐹‘𝑡)) ↔ ¬ (abs‘(𝐹‘𝑡)) ≤ 𝑥))
27	11, 26	sylan 581	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (𝑥 < (abs‘(𝐹‘𝑡)) ↔ ¬ (abs‘(𝐹‘𝑡)) ≤ 𝑥))
28		absle 15262	. . . . . . . . . . . . . . 15 ⊢ (((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ≤ 𝑥 ↔ (-𝑥 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 𝑥)))
29	1, 28	sylan 581	. . . . . . . . . . . . . 14 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ≤ 𝑥 ↔ (-𝑥 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 𝑥)))
30		renegcl 11523	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ℝ → -𝑥 ∈ ℝ)
31		lenlt 11292	. . . . . . . . . . . . . . . . 17 ⊢ ((-𝑥 ∈ ℝ ∧ (𝐹‘𝑡) ∈ ℝ) → (-𝑥 ≤ (𝐹‘𝑡) ↔ ¬ (𝐹‘𝑡) < -𝑥))
32	30, 1, 31	syl2anr 598	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (-𝑥 ≤ (𝐹‘𝑡) ↔ ¬ (𝐹‘𝑡) < -𝑥))
33	1	biantrurd 534	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → ((𝐹‘𝑡) < -𝑥 ↔ ((𝐹‘𝑡) ∈ ℝ ∧ (𝐹‘𝑡) < -𝑥)))
34	30	rexrd 11264	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ ℝ → -𝑥 ∈ ℝ^*)
35		elioomnf 13421	. . . . . . . . . . . . . . . . . . . 20 ⊢ (-𝑥 ∈ ℝ^* → ((𝐹‘𝑡) ∈ (-∞(,)-𝑥) ↔ ((𝐹‘𝑡) ∈ ℝ ∧ (𝐹‘𝑡) < -𝑥)))
36	34, 35	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ ℝ → ((𝐹‘𝑡) ∈ (-∞(,)-𝑥) ↔ ((𝐹‘𝑡) ∈ ℝ ∧ (𝐹‘𝑡) < -𝑥)))
37	36	bicomd 222	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ℝ → (((𝐹‘𝑡) ∈ ℝ ∧ (𝐹‘𝑡) < -𝑥) ↔ (𝐹‘𝑡) ∈ (-∞(,)-𝑥)))
38	33, 37	sylan9bb 511	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((𝐹‘𝑡) < -𝑥 ↔ (𝐹‘𝑡) ∈ (-∞(,)-𝑥)))
39	38	notbid 318	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (¬ (𝐹‘𝑡) < -𝑥 ↔ ¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥)))
40	32, 39	bitrd 279	. . . . . . . . . . . . . . 15 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (-𝑥 ≤ (𝐹‘𝑡) ↔ ¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥)))
41		lenlt 11292	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐹‘𝑡) ≤ 𝑥 ↔ ¬ 𝑥 < (𝐹‘𝑡)))
42	1, 41	sylan 581	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((𝐹‘𝑡) ≤ 𝑥 ↔ ¬ 𝑥 < (𝐹‘𝑡)))
43	1	biantrurd 534	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (𝑥 < (𝐹‘𝑡) ↔ ((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 < (𝐹‘𝑡))))
44		elioopnf 13420	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ ℝ^* → ((𝐹‘𝑡) ∈ (𝑥(,)+∞) ↔ ((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 < (𝐹‘𝑡))))
45	19, 44	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ ℝ → ((𝐹‘𝑡) ∈ (𝑥(,)+∞) ↔ ((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 < (𝐹‘𝑡))))
46	45	bicomd 222	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ℝ → (((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 < (𝐹‘𝑡)) ↔ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
47	43, 46	sylan9bb 511	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (𝑥 < (𝐹‘𝑡) ↔ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
48	47	notbid 318	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (¬ 𝑥 < (𝐹‘𝑡) ↔ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
49	42, 48	bitrd 279	. . . . . . . . . . . . . . 15 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((𝐹‘𝑡) ≤ 𝑥 ↔ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
50	40, 49	anbi12d 632	. . . . . . . . . . . . . 14 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((-𝑥 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 𝑥) ↔ (¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∧ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞))))
51	29, 50	bitrd 279	. . . . . . . . . . . . 13 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ≤ 𝑥 ↔ (¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∧ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞))))
52	51	notbid 318	. . . . . . . . . . . 12 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (¬ (abs‘(𝐹‘𝑡)) ≤ 𝑥 ↔ ¬ (¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∧ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞))))
53		elun 4149	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞)) ↔ ((𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∨ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
54		oran 989	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∨ (𝐹‘𝑡) ∈ (𝑥(,)+∞)) ↔ ¬ (¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∧ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
55	53, 54	bitri 275	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞)) ↔ ¬ (¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∧ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
56	52, 55	bitr4di 289	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (¬ (abs‘(𝐹‘𝑡)) ≤ 𝑥 ↔ (𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))))
57	24, 27, 56	3bitrd 305	. . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞) ↔ (𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))))
58	57	an32s 651	. . . . . . . . 9 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) ∧ 𝑡 ∈ 𝐴) → ((abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞) ↔ (𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))))
59	58	rabbidva 3440	. . . . . . . 8 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → {𝑡 ∈ 𝐴 ∣ (abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞)} = {𝑡 ∈ 𝐴 ∣ (𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))})
60		eqid 2733	. . . . . . . . 9 ⊢ (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) = (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡)))
61	60	mptpreima 6238	. . . . . . . 8 ⊢ (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (𝑥(,)+∞)) = {𝑡 ∈ 𝐴 ∣ (abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞)}
62		eqid 2733	. . . . . . . . 9 ⊢ (𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) = (𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡))
63	62	mptpreima 6238	. . . . . . . 8 ⊢ (^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) “ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))) = {𝑡 ∈ 𝐴 ∣ (𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))}
64	59, 61, 63	3eqtr4g 2798	. . . . . . 7 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (𝑥(,)+∞)) = (^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) “ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))))
65		simpl 484	. . . . . . . . . 10 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → 𝐹:𝐴⟶ℝ)
66	65	feqmptd 6961	. . . . . . . . 9 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → 𝐹 = (𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)))
67	66	cnveqd 5876	. . . . . . . 8 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → ^◡𝐹 = ^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)))
68	67	imaeq1d 6059	. . . . . . 7 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡𝐹 “ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))) = (^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) “ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))))
69	64, 68	eqtr4d 2776	. . . . . 6 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (𝑥(,)+∞)) = (^◡𝐹 “ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))))
70		imaundi 6150	. . . . . 6 ⊢ (^◡𝐹 “ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))) = ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞)))
71	69, 70	eqtrdi 2789	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (𝑥(,)+∞)) = ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞))))
72	71	adantlr 714	. . . 4 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (𝑥(,)+∞)) = ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞))))
73		mbfima 25147	. . . . . . 7 ⊢ ((𝐹 ∈ MblFn ∧ 𝐹:𝐴⟶ℝ) → (^◡𝐹 “ (-∞(,)-𝑥)) ∈ dom vol)
74		mbfima 25147	. . . . . . 7 ⊢ ((𝐹 ∈ MblFn ∧ 𝐹:𝐴⟶ℝ) → (^◡𝐹 “ (𝑥(,)+∞)) ∈ dom vol)
75		unmbl 25054	. . . . . . 7 ⊢ (((^◡𝐹 “ (-∞(,)-𝑥)) ∈ dom vol ∧ (^◡𝐹 “ (𝑥(,)+∞)) ∈ dom vol) → ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞))) ∈ dom vol)
76	73, 74, 75	syl2anc 585	. . . . . 6 ⊢ ((𝐹 ∈ MblFn ∧ 𝐹:𝐴⟶ℝ) → ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞))) ∈ dom vol)
77	76	ancoms 460	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞))) ∈ dom vol)
78	77	adantr 482	. . . 4 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) ∧ 𝑥 ∈ ℝ) → ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞))) ∈ dom vol)
79	72, 78	eqeltrd 2834	. . 3 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (𝑥(,)+∞)) ∈ dom vol)
80		abslt 15261	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) < 𝑥 ↔ (-𝑥 < (𝐹‘𝑡) ∧ (𝐹‘𝑡) < 𝑥)))
81	1, 80	sylan 581	. . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) < 𝑥 ↔ (-𝑥 < (𝐹‘𝑡) ∧ (𝐹‘𝑡) < 𝑥)))
82		elioomnf 13421	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℝ^* → ((abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥) ↔ ((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ (abs‘(𝐹‘𝑡)) < 𝑥)))
83	19, 82	syl 17	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ℝ → ((abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥) ↔ ((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ (abs‘(𝐹‘𝑡)) < 𝑥)))
84	11	biantrurd 534	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → ((abs‘(𝐹‘𝑡)) < 𝑥 ↔ ((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ (abs‘(𝐹‘𝑡)) < 𝑥)))
85	84	bicomd 222	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ (abs‘(𝐹‘𝑡)) < 𝑥) ↔ (abs‘(𝐹‘𝑡)) < 𝑥))
86	83, 85	sylan9bbr 512	. . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥) ↔ (abs‘(𝐹‘𝑡)) < 𝑥))
87	34, 19	jca 513	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ℝ → (-𝑥 ∈ ℝ^* ∧ 𝑥 ∈ ℝ^*))
88	1	rexrd 11264	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (𝐹‘𝑡) ∈ ℝ^*)
89		elioo5 13381	. . . . . . . . . . . 12 ⊢ ((-𝑥 ∈ ℝ^* ∧ 𝑥 ∈ ℝ^* ∧ (𝐹‘𝑡) ∈ ℝ^*) → ((𝐹‘𝑡) ∈ (-𝑥(,)𝑥) ↔ (-𝑥 < (𝐹‘𝑡) ∧ (𝐹‘𝑡) < 𝑥)))
90	89	3expa 1119	. . . . . . . . . . 11 ⊢ (((-𝑥 ∈ ℝ^* ∧ 𝑥 ∈ ℝ^) ∧ (𝐹‘𝑡) ∈ ℝ^) → ((𝐹‘𝑡) ∈ (-𝑥(,)𝑥) ↔ (-𝑥 < (𝐹‘𝑡) ∧ (𝐹‘𝑡) < 𝑥)))
91	87, 88, 90	syl2anr 598	. . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((𝐹‘𝑡) ∈ (-𝑥(,)𝑥) ↔ (-𝑥 < (𝐹‘𝑡) ∧ (𝐹‘𝑡) < 𝑥)))
92	81, 86, 91	3bitr4d 311	. . . . . . . . 9 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥) ↔ (𝐹‘𝑡) ∈ (-𝑥(,)𝑥)))
93	92	an32s 651	. . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) ∧ 𝑡 ∈ 𝐴) → ((abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥) ↔ (𝐹‘𝑡) ∈ (-𝑥(,)𝑥)))
94	93	rabbidva 3440	. . . . . . 7 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → {𝑡 ∈ 𝐴 ∣ (abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥)} = {𝑡 ∈ 𝐴 ∣ (𝐹‘𝑡) ∈ (-𝑥(,)𝑥)})
95	60	mptpreima 6238	. . . . . . 7 ⊢ (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (-∞(,)𝑥)) = {𝑡 ∈ 𝐴 ∣ (abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥)}
96	62	mptpreima 6238	. . . . . . 7 ⊢ (^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) “ (-𝑥(,)𝑥)) = {𝑡 ∈ 𝐴 ∣ (𝐹‘𝑡) ∈ (-𝑥(,)𝑥)}
97	94, 95, 96	3eqtr4g 2798	. . . . . 6 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (-∞(,)𝑥)) = (^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) “ (-𝑥(,)𝑥)))
98	67	imaeq1d 6059	. . . . . 6 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡𝐹 “ (-𝑥(,)𝑥)) = (^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) “ (-𝑥(,)𝑥)))
99	97, 98	eqtr4d 2776	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (-∞(,)𝑥)) = (^◡𝐹 “ (-𝑥(,)𝑥)))
100	99	adantlr 714	. . . 4 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (-∞(,)𝑥)) = (^◡𝐹 “ (-𝑥(,)𝑥)))
101		mbfima 25147	. . . . . 6 ⊢ ((𝐹 ∈ MblFn ∧ 𝐹:𝐴⟶ℝ) → (^◡𝐹 “ (-𝑥(,)𝑥)) ∈ dom vol)
102	101	ancoms 460	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → (^◡𝐹 “ (-𝑥(,)𝑥)) ∈ dom vol)
103	102	adantr 482	. . . 4 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) ∧ 𝑥 ∈ ℝ) → (^◡𝐹 “ (-𝑥(,)𝑥)) ∈ dom vol)
104	100, 103	eqeltrd 2834	. . 3 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (-∞(,)𝑥)) ∈ dom vol)
105	13, 18, 79, 104	ismbf2d 25157	. 2 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) ∈ MblFn)
106	10, 105	eqeltrd 2834	1 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → (abs ∘ 𝐹) ∈ MblFn)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 = wceq 1542 ∈ wcel 2107 {crab 3433 ∪ cun 3947 class class class wbr 5149 ↦ cmpt 5232 ^◡ccnv 5676 dom cdm 5677 “ cima 5680 ∘ ccom 5681 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 ℂcc 11108 ℝcr 11109 +∞cpnf 11245 -∞cmnf 11246 ℝ^*cxr 11247 < clt 11248 ≤ cle 11249 -cneg 11445 (,)cioo 13324 abscabs 15181 volcvol 24980 MblFncmbf 25131

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-inf2 9636 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-isom 6553 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-of 7670 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-2o 8467 df-er 8703 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9437 df-inf 9438 df-oi 9505 df-dju 9896 df-card 9934 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-n0 12473 df-z 12559 df-uz 12823 df-q 12933 df-rp 12975 df-xadd 13093 df-ioo 13328 df-ico 13330 df-icc 13331 df-fz 13485 df-fzo 13628 df-fl 13757 df-seq 13967 df-exp 14028 df-hash 14291 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-clim 15432 df-sum 15633 df-xmet 20937 df-met 20938 df-ovol 24981 df-vol 24982 df-mbf 25136

This theorem is referenced by: ftc1anclem2 36562 ftc1anclem4 36564 ftc1anclem5 36565 ftc1anclem6 36566 ftc1anclem8 36568

W3C validator