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 36653

Description: Lemma for ftc1anc 36661- the absolute value of a real-valued measurable function is measurable. Would be trivial with cncombf 25182, but this proof avoids ax-cc 10432. (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 7083	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (𝐹‘𝑡) ∈ ℝ)
2	1	recnd 11244	. . . 4 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (𝐹‘𝑡) ∈ ℂ)
3		id 22	. . . . 5 ⊢ (𝐹:𝐴⟶ℝ → 𝐹:𝐴⟶ℝ)
4	3	feqmptd 6960	. . . 4 ⊢ (𝐹:𝐴⟶ℝ → 𝐹 = (𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)))
5		absf 15286	. . . . . 6 ⊢ abs:ℂ⟶ℝ
6	5	a1i 11	. . . . 5 ⊢ (𝐹:𝐴⟶ℝ → abs:ℂ⟶ℝ)
7	6	feqmptd 6960	. . . 4 ⊢ (𝐹:𝐴⟶ℝ → abs = (𝑥 ∈ ℂ ↦ (abs‘𝑥)))
8		fveq2 6891	. . . 4 ⊢ (𝑥 = (𝐹‘𝑡) → (abs‘𝑥) = (abs‘(𝐹‘𝑡)))
9	2, 4, 7, 8	fmptco 7129	. . 3 ⊢ (𝐹:𝐴⟶ℝ → (abs ∘ 𝐹) = (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))))
10	9	adantr 481	. 2 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → (abs ∘ 𝐹) = (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))))
11	2	abscld 15385	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (abs‘(𝐹‘𝑡)) ∈ ℝ)
12	11	fmpttd 7116	. . . 4 ⊢ (𝐹:𝐴⟶ℝ → (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))):𝐴⟶ℝ)
13	12	adantr 481	. . 3 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))):𝐴⟶ℝ)
14		fdm 6726	. . . . 5 ⊢ (𝐹:𝐴⟶ℝ → dom 𝐹 = 𝐴)
15	14	adantr 481	. . . 4 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → dom 𝐹 = 𝐴)
16		mbfdm 25150	. . . . 5 ⊢ (𝐹 ∈ MblFn → dom 𝐹 ∈ dom vol)
17	16	adantl 482	. . . 4 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → dom 𝐹 ∈ dom vol)
18	15, 17	eqeltrrd 2834	. . 3 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → 𝐴 ∈ dom vol)
19		rexr 11262	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ^*)
20		elioopnf 13422	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℝ^* → ((abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞) ↔ ((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ 𝑥 < (abs‘(𝐹‘𝑡)))))
21	19, 20	syl 17	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℝ → ((abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞) ↔ ((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ 𝑥 < (abs‘(𝐹‘𝑡)))))
22	11	biantrurd 533	. . . . . . . . . . . . 13 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (𝑥 < (abs‘(𝐹‘𝑡)) ↔ ((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ 𝑥 < (abs‘(𝐹‘𝑡)))))
23	22	bicomd 222	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ 𝑥 < (abs‘(𝐹‘𝑡))) ↔ 𝑥 < (abs‘(𝐹‘𝑡))))
24	21, 23	sylan9bbr 511	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞) ↔ 𝑥 < (abs‘(𝐹‘𝑡))))
25		ltnle 11295	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ (abs‘(𝐹‘𝑡)) ∈ ℝ) → (𝑥 < (abs‘(𝐹‘𝑡)) ↔ ¬ (abs‘(𝐹‘𝑡)) ≤ 𝑥))
26	25	ancoms 459	. . . . . . . . . . . 12 ⊢ (((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝑥 < (abs‘(𝐹‘𝑡)) ↔ ¬ (abs‘(𝐹‘𝑡)) ≤ 𝑥))
27	11, 26	sylan 580	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (𝑥 < (abs‘(𝐹‘𝑡)) ↔ ¬ (abs‘(𝐹‘𝑡)) ≤ 𝑥))
28		absle 15264	. . . . . . . . . . . . . . 15 ⊢ (((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ≤ 𝑥 ↔ (-𝑥 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 𝑥)))
29	1, 28	sylan 580	. . . . . . . . . . . . . 14 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ≤ 𝑥 ↔ (-𝑥 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 𝑥)))
30		renegcl 11525	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ℝ → -𝑥 ∈ ℝ)
31		lenlt 11294	. . . . . . . . . . . . . . . . 17 ⊢ ((-𝑥 ∈ ℝ ∧ (𝐹‘𝑡) ∈ ℝ) → (-𝑥 ≤ (𝐹‘𝑡) ↔ ¬ (𝐹‘𝑡) < -𝑥))
32	30, 1, 31	syl2anr 597	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (-𝑥 ≤ (𝐹‘𝑡) ↔ ¬ (𝐹‘𝑡) < -𝑥))
33	1	biantrurd 533	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → ((𝐹‘𝑡) < -𝑥 ↔ ((𝐹‘𝑡) ∈ ℝ ∧ (𝐹‘𝑡) < -𝑥)))
34	30	rexrd 11266	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ ℝ → -𝑥 ∈ ℝ^*)
35		elioomnf 13423	. . . . . . . . . . . . . . . . . . . 20 ⊢ (-𝑥 ∈ ℝ^* → ((𝐹‘𝑡) ∈ (-∞(,)-𝑥) ↔ ((𝐹‘𝑡) ∈ ℝ ∧ (𝐹‘𝑡) < -𝑥)))
36	34, 35	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ ℝ → ((𝐹‘𝑡) ∈ (-∞(,)-𝑥) ↔ ((𝐹‘𝑡) ∈ ℝ ∧ (𝐹‘𝑡) < -𝑥)))
37	36	bicomd 222	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ℝ → (((𝐹‘𝑡) ∈ ℝ ∧ (𝐹‘𝑡) < -𝑥) ↔ (𝐹‘𝑡) ∈ (-∞(,)-𝑥)))
38	33, 37	sylan9bb 510	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((𝐹‘𝑡) < -𝑥 ↔ (𝐹‘𝑡) ∈ (-∞(,)-𝑥)))
39	38	notbid 317	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (¬ (𝐹‘𝑡) < -𝑥 ↔ ¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥)))
40	32, 39	bitrd 278	. . . . . . . . . . . . . . 15 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (-𝑥 ≤ (𝐹‘𝑡) ↔ ¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥)))
41		lenlt 11294	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐹‘𝑡) ≤ 𝑥 ↔ ¬ 𝑥 < (𝐹‘𝑡)))
42	1, 41	sylan 580	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((𝐹‘𝑡) ≤ 𝑥 ↔ ¬ 𝑥 < (𝐹‘𝑡)))
43	1	biantrurd 533	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (𝑥 < (𝐹‘𝑡) ↔ ((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 < (𝐹‘𝑡))))
44		elioopnf 13422	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ ℝ^* → ((𝐹‘𝑡) ∈ (𝑥(,)+∞) ↔ ((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 < (𝐹‘𝑡))))
45	19, 44	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ ℝ → ((𝐹‘𝑡) ∈ (𝑥(,)+∞) ↔ ((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 < (𝐹‘𝑡))))
46	45	bicomd 222	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ℝ → (((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 < (𝐹‘𝑡)) ↔ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
47	43, 46	sylan9bb 510	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (𝑥 < (𝐹‘𝑡) ↔ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
48	47	notbid 317	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (¬ 𝑥 < (𝐹‘𝑡) ↔ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
49	42, 48	bitrd 278	. . . . . . . . . . . . . . 15 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((𝐹‘𝑡) ≤ 𝑥 ↔ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
50	40, 49	anbi12d 631	. . . . . . . . . . . . . 14 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((-𝑥 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 𝑥) ↔ (¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∧ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞))))
51	29, 50	bitrd 278	. . . . . . . . . . . . 13 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ≤ 𝑥 ↔ (¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∧ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞))))
52	51	notbid 317	. . . . . . . . . . . 12 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (¬ (abs‘(𝐹‘𝑡)) ≤ 𝑥 ↔ ¬ (¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∧ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞))))
53		elun 4148	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞)) ↔ ((𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∨ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
54		oran 988	. . . . . . . . . . . . 13 ⊢ (((𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∨ (𝐹‘𝑡) ∈ (𝑥(,)+∞)) ↔ ¬ (¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∧ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
55	53, 54	bitri 274	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞)) ↔ ¬ (¬ (𝐹‘𝑡) ∈ (-∞(,)-𝑥) ∧ ¬ (𝐹‘𝑡) ∈ (𝑥(,)+∞)))
56	52, 55	bitr4di 288	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → (¬ (abs‘(𝐹‘𝑡)) ≤ 𝑥 ↔ (𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))))
57	24, 27, 56	3bitrd 304	. . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞) ↔ (𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))))
58	57	an32s 650	. . . . . . . . 9 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) ∧ 𝑡 ∈ 𝐴) → ((abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞) ↔ (𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))))
59	58	rabbidva 3439	. . . . . . . 8 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → {𝑡 ∈ 𝐴 ∣ (abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞)} = {𝑡 ∈ 𝐴 ∣ (𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))})
60		eqid 2732	. . . . . . . . 9 ⊢ (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) = (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡)))
61	60	mptpreima 6237	. . . . . . . 8 ⊢ (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (𝑥(,)+∞)) = {𝑡 ∈ 𝐴 ∣ (abs‘(𝐹‘𝑡)) ∈ (𝑥(,)+∞)}
62		eqid 2732	. . . . . . . . 9 ⊢ (𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) = (𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡))
63	62	mptpreima 6237	. . . . . . . 8 ⊢ (^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) “ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))) = {𝑡 ∈ 𝐴 ∣ (𝐹‘𝑡) ∈ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))}
64	59, 61, 63	3eqtr4g 2797	. . . . . . 7 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (𝑥(,)+∞)) = (^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) “ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))))
65		simpl 483	. . . . . . . . . 10 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → 𝐹:𝐴⟶ℝ)
66	65	feqmptd 6960	. . . . . . . . 9 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → 𝐹 = (𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)))
67	66	cnveqd 5875	. . . . . . . 8 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → ^◡𝐹 = ^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)))
68	67	imaeq1d 6058	. . . . . . 7 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡𝐹 “ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))) = (^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) “ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))))
69	64, 68	eqtr4d 2775	. . . . . 6 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (𝑥(,)+∞)) = (^◡𝐹 “ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))))
70		imaundi 6149	. . . . . 6 ⊢ (^◡𝐹 “ ((-∞(,)-𝑥) ∪ (𝑥(,)+∞))) = ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞)))
71	69, 70	eqtrdi 2788	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (𝑥(,)+∞)) = ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞))))
72	71	adantlr 713	. . . 4 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (𝑥(,)+∞)) = ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞))))
73		mbfima 25154	. . . . . . 7 ⊢ ((𝐹 ∈ MblFn ∧ 𝐹:𝐴⟶ℝ) → (^◡𝐹 “ (-∞(,)-𝑥)) ∈ dom vol)
74		mbfima 25154	. . . . . . 7 ⊢ ((𝐹 ∈ MblFn ∧ 𝐹:𝐴⟶ℝ) → (^◡𝐹 “ (𝑥(,)+∞)) ∈ dom vol)
75		unmbl 25061	. . . . . . 7 ⊢ (((^◡𝐹 “ (-∞(,)-𝑥)) ∈ dom vol ∧ (^◡𝐹 “ (𝑥(,)+∞)) ∈ dom vol) → ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞))) ∈ dom vol)
76	73, 74, 75	syl2anc 584	. . . . . 6 ⊢ ((𝐹 ∈ MblFn ∧ 𝐹:𝐴⟶ℝ) → ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞))) ∈ dom vol)
77	76	ancoms 459	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞))) ∈ dom vol)
78	77	adantr 481	. . . 4 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) ∧ 𝑥 ∈ ℝ) → ((^◡𝐹 “ (-∞(,)-𝑥)) ∪ (^◡𝐹 “ (𝑥(,)+∞))) ∈ dom vol)
79	72, 78	eqeltrd 2833	. . 3 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (𝑥(,)+∞)) ∈ dom vol)
80		abslt 15263	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑡) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) < 𝑥 ↔ (-𝑥 < (𝐹‘𝑡) ∧ (𝐹‘𝑡) < 𝑥)))
81	1, 80	sylan 580	. . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) < 𝑥 ↔ (-𝑥 < (𝐹‘𝑡) ∧ (𝐹‘𝑡) < 𝑥)))
82		elioomnf 13423	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℝ^* → ((abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥) ↔ ((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ (abs‘(𝐹‘𝑡)) < 𝑥)))
83	19, 82	syl 17	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ℝ → ((abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥) ↔ ((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ (abs‘(𝐹‘𝑡)) < 𝑥)))
84	11	biantrurd 533	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → ((abs‘(𝐹‘𝑡)) < 𝑥 ↔ ((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ (abs‘(𝐹‘𝑡)) < 𝑥)))
85	84	bicomd 222	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (((abs‘(𝐹‘𝑡)) ∈ ℝ ∧ (abs‘(𝐹‘𝑡)) < 𝑥) ↔ (abs‘(𝐹‘𝑡)) < 𝑥))
86	83, 85	sylan9bbr 511	. . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥) ↔ (abs‘(𝐹‘𝑡)) < 𝑥))
87	34, 19	jca 512	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ℝ → (-𝑥 ∈ ℝ^* ∧ 𝑥 ∈ ℝ^*))
88	1	rexrd 11266	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) → (𝐹‘𝑡) ∈ ℝ^*)
89		elioo5 13383	. . . . . . . . . . . 12 ⊢ ((-𝑥 ∈ ℝ^* ∧ 𝑥 ∈ ℝ^* ∧ (𝐹‘𝑡) ∈ ℝ^*) → ((𝐹‘𝑡) ∈ (-𝑥(,)𝑥) ↔ (-𝑥 < (𝐹‘𝑡) ∧ (𝐹‘𝑡) < 𝑥)))
90	89	3expa 1118	. . . . . . . . . . 11 ⊢ (((-𝑥 ∈ ℝ^* ∧ 𝑥 ∈ ℝ^) ∧ (𝐹‘𝑡) ∈ ℝ^) → ((𝐹‘𝑡) ∈ (-𝑥(,)𝑥) ↔ (-𝑥 < (𝐹‘𝑡) ∧ (𝐹‘𝑡) < 𝑥)))
91	87, 88, 90	syl2anr 597	. . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((𝐹‘𝑡) ∈ (-𝑥(,)𝑥) ↔ (-𝑥 < (𝐹‘𝑡) ∧ (𝐹‘𝑡) < 𝑥)))
92	81, 86, 91	3bitr4d 310	. . . . . . . . 9 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑡 ∈ 𝐴) ∧ 𝑥 ∈ ℝ) → ((abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥) ↔ (𝐹‘𝑡) ∈ (-𝑥(,)𝑥)))
93	92	an32s 650	. . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) ∧ 𝑡 ∈ 𝐴) → ((abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥) ↔ (𝐹‘𝑡) ∈ (-𝑥(,)𝑥)))
94	93	rabbidva 3439	. . . . . . 7 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → {𝑡 ∈ 𝐴 ∣ (abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥)} = {𝑡 ∈ 𝐴 ∣ (𝐹‘𝑡) ∈ (-𝑥(,)𝑥)})
95	60	mptpreima 6237	. . . . . . 7 ⊢ (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (-∞(,)𝑥)) = {𝑡 ∈ 𝐴 ∣ (abs‘(𝐹‘𝑡)) ∈ (-∞(,)𝑥)}
96	62	mptpreima 6237	. . . . . . 7 ⊢ (^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) “ (-𝑥(,)𝑥)) = {𝑡 ∈ 𝐴 ∣ (𝐹‘𝑡) ∈ (-𝑥(,)𝑥)}
97	94, 95, 96	3eqtr4g 2797	. . . . . 6 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (-∞(,)𝑥)) = (^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) “ (-𝑥(,)𝑥)))
98	67	imaeq1d 6058	. . . . . 6 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡𝐹 “ (-𝑥(,)𝑥)) = (^◡(𝑡 ∈ 𝐴 ↦ (𝐹‘𝑡)) “ (-𝑥(,)𝑥)))
99	97, 98	eqtr4d 2775	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (-∞(,)𝑥)) = (^◡𝐹 “ (-𝑥(,)𝑥)))
100	99	adantlr 713	. . . 4 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (-∞(,)𝑥)) = (^◡𝐹 “ (-𝑥(,)𝑥)))
101		mbfima 25154	. . . . . 6 ⊢ ((𝐹 ∈ MblFn ∧ 𝐹:𝐴⟶ℝ) → (^◡𝐹 “ (-𝑥(,)𝑥)) ∈ dom vol)
102	101	ancoms 459	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → (^◡𝐹 “ (-𝑥(,)𝑥)) ∈ dom vol)
103	102	adantr 481	. . . 4 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) ∧ 𝑥 ∈ ℝ) → (^◡𝐹 “ (-𝑥(,)𝑥)) ∈ dom vol)
104	100, 103	eqeltrd 2833	. . 3 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) ∧ 𝑥 ∈ ℝ) → (^◡(𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) “ (-∞(,)𝑥)) ∈ dom vol)
105	13, 18, 79, 104	ismbf2d 25164	. 2 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → (𝑡 ∈ 𝐴 ↦ (abs‘(𝐹‘𝑡))) ∈ MblFn)
106	10, 105	eqeltrd 2833	1 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐹 ∈ MblFn) → (abs ∘ 𝐹) ∈ MblFn)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 845 = wceq 1541 ∈ wcel 2106 {crab 3432 ∪ cun 3946 class class class wbr 5148 ↦ cmpt 5231 ^◡ccnv 5675 dom cdm 5676 “ cima 5679 ∘ ccom 5680 ⟶wf 6539 ‘cfv 6543 (class class class)co 7411 ℂcc 11110 ℝcr 11111 +∞cpnf 11247 -∞cmnf 11248 ℝ^*cxr 11249 < clt 11250 ≤ cle 11251 -cneg 11447 (,)cioo 13326 abscabs 15183 volcvol 24987 MblFncmbf 25138

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 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-inf2 9638 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7672 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-2o 8469 df-er 8705 df-map 8824 df-pm 8825 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-inf 9440 df-oi 9507 df-dju 9898 df-card 9936 df-pnf 11252 df-mnf 11253 df-xr 11254 df-ltxr 11255 df-le 11256 df-sub 11448 df-neg 11449 df-div 11874 df-nn 12215 df-2 12277 df-3 12278 df-n0 12475 df-z 12561 df-uz 12825 df-q 12935 df-rp 12977 df-xadd 13095 df-ioo 13330 df-ico 13332 df-icc 13333 df-fz 13487 df-fzo 13630 df-fl 13759 df-seq 13969 df-exp 14030 df-hash 14293 df-cj 15048 df-re 15049 df-im 15050 df-sqrt 15184 df-abs 15185 df-clim 15434 df-sum 15635 df-xmet 20943 df-met 20944 df-ovol 24988 df-vol 24989 df-mbf 25143

This theorem is referenced by: ftc1anclem2 36654 ftc1anclem4 36656 ftc1anclem5 36657 ftc1anclem6 36658 ftc1anclem8 36660

W3C validator