Theorem mbfposb 25702

Description: A function is measurable iff its positive and negative parts are measurable. (Contributed by Mario Carneiro, 11-Aug-2014.)

Hypothesis

Ref	Expression
mbfpos.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)

Assertion

Ref	Expression
mbfposb	⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ↔ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)))

Distinct variable groups:   𝑥,𝐴   𝜑,𝑥

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem mbfposb

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfcv 2903	. . . . . . . . 9 ⊢ Ⅎ𝑥0
2		nfcv 2903	. . . . . . . . 9 ⊢ Ⅎ𝑥 ≤
3		nffvmpt1 6918	. . . . . . . . 9 ⊢ Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)
4	1, 2, 3	nfbr 5195	. . . . . . . 8 ⊢ Ⅎ𝑥0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)
5	4, 3, 1	nfif 4561	. . . . . . 7 ⊢ Ⅎ𝑥if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)
6		nfcv 2903	. . . . . . 7 ⊢ Ⅎ𝑦if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), 0)
7		fveq2 6907	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
8	7	breq2d 5160	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦) ↔ 0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)))
9	8, 7	ifbieq1d 4555	. . . . . . 7 ⊢ (𝑦 = 𝑥 → if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0) = if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), 0))
10	5, 6, 9	cbvmpt 5259	. . . . . 6 ⊢ (𝑦 ∈ 𝐴 ↦ if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), 0))
11		simpr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
12		mbfpos.1	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
13		eqid 2735	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
14	13	fvmpt2 7027	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ ℝ) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
15	11, 12, 14	syl2anc 584	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
16	15	breq2d 5160	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ↔ 0 ≤ 𝐵))
17	16, 15	ifbieq1d 4555	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), 0) = if(0 ≤ 𝐵, 𝐵, 0))
18	17	mpteq2dva 5248	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)))
19	10, 18	eqtrid 2787	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↦ if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)))
20	19	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn) → (𝑦 ∈ 𝐴 ↦ if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)))
21	12	fmpttd 7135	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℝ)
22	21	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn) → (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℝ)
23	22	ffvelcdmda 7104	. . . . 5 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn) ∧ 𝑦 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦) ∈ ℝ)
24		nfcv 2903	. . . . . . . . 9 ⊢ Ⅎ𝑦((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)
25	3, 24, 7	cbvmpt 5259	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐴 ↦ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)) = (𝑥 ∈ 𝐴 ↦ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
26	15	mpteq2dva 5248	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)) = (𝑥 ∈ 𝐴 ↦ 𝐵))
27	25, 26	eqtrid 2787	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↦ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)) = (𝑥 ∈ 𝐴 ↦ 𝐵))
28	27	eleq1d 2824	. . . . . 6 ⊢ (𝜑 → ((𝑦 ∈ 𝐴 ↦ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)) ∈ MblFn ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn))
29	28	biimpar 477	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn) → (𝑦 ∈ 𝐴 ↦ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)) ∈ MblFn)
30	23, 29	mbfpos 25700	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn) → (𝑦 ∈ 𝐴 ↦ if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)) ∈ MblFn)
31	20, 30	eqeltrrd 2840	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn) → (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn)
32	3	nfneg 11502	. . . . . . . . 9 ⊢ Ⅎ𝑥-((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)
33	1, 2, 32	nfbr 5195	. . . . . . . 8 ⊢ Ⅎ𝑥0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)
34	33, 32, 1	nfif 4561	. . . . . . 7 ⊢ Ⅎ𝑥if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)
35		nfcv 2903	. . . . . . 7 ⊢ Ⅎ𝑦if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), 0)
36	7	negeqd 11500	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦) = -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
37	36	breq2d 5160	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦) ↔ 0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)))
38	37, 36	ifbieq1d 4555	. . . . . . 7 ⊢ (𝑦 = 𝑥 → if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0) = if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), 0))
39	34, 35, 38	cbvmpt 5259	. . . . . 6 ⊢ (𝑦 ∈ 𝐴 ↦ if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), 0))
40	15	negeqd 11500	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = -𝐵)
41	40	breq2d 5160	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ↔ 0 ≤ -𝐵))
42	41, 40	ifbieq1d 4555	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), 0) = if(0 ≤ -𝐵, -𝐵, 0))
43	42	mpteq2dva 5248	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥), 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)))
44	39, 43	eqtrid 2787	. . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐴 ↦ if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)))
45	44	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn) → (𝑦 ∈ 𝐴 ↦ if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)))
46	23	renegcld 11688	. . . . 5 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn) ∧ 𝑦 ∈ 𝐴) → -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦) ∈ ℝ)
47	23, 29	mbfneg 25699	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn) → (𝑦 ∈ 𝐴 ↦ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)) ∈ MblFn)
48	46, 47	mbfpos 25700	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn) → (𝑦 ∈ 𝐴 ↦ if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)) ∈ MblFn)
49	45, 48	eqeltrrd 2840	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn) → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)
50	31, 49	jca 511	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn) → ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn))
51	27	adantr 480	. . 3 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑦 ∈ 𝐴 ↦ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)) = (𝑥 ∈ 𝐴 ↦ 𝐵))
52	21	ffvelcdmda 7104	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦) ∈ ℝ)
53	52	adantlr 715	. . . 4 ⊢ (((𝜑 ∧ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) ∧ 𝑦 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦) ∈ ℝ)
54	19	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑦 ∈ 𝐴 ↦ if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)))
55		simprl 771	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn)
56	54, 55	eqeltrd 2839	. . . 4 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑦 ∈ 𝐴 ↦ if(0 ≤ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)) ∈ MblFn)
57	44	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑦 ∈ 𝐴 ↦ if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)) = (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)))
58		simprr 773	. . . . 5 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)
59	57, 58	eqeltrd 2839	. . . 4 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑦 ∈ 𝐴 ↦ if(0 ≤ -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), -((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦), 0)) ∈ MblFn)
60	53, 56, 59	mbfposr 25701	. . 3 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑦 ∈ 𝐴 ↦ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑦)) ∈ MblFn)
61	51, 60	eqeltrrd 2840	. 2 ⊢ ((𝜑 ∧ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
62	50, 61	impbida 801	1 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ↔ ((𝑥 ∈ 𝐴 ↦ if(0 ≤ 𝐵, 𝐵, 0)) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ if(0 ≤ -𝐵, -𝐵, 0)) ∈ MblFn)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2106  ifcif 4531   class class class wbr 5148   ↦ cmpt 5231  ⟶wf 6559  ‘cfv 6563  ℝcr 11152  0cc0 11153   ≤ cle 11294  -cneg 11491  MblFncmbf 25663

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-inf2 9679  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230  ax-pre-sup 11231

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-se 5642  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-isom 6572  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-of 7697  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-2o 8506  df-er 8744  df-map 8867  df-pm 8868  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-sup 9480  df-inf 9481  df-oi 9548  df-dju 9939  df-card 9977  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-div 11919  df-nn 12265  df-2 12327  df-3 12328  df-n0 12525  df-z 12612  df-uz 12877  df-q 12989  df-rp 13033  df-xadd 13153  df-ioo 13388  df-ico 13390  df-icc 13391  df-fz 13545  df-fzo 13692  df-fl 13829  df-seq 14040  df-exp 14100  df-hash 14367  df-cj 15135  df-re 15136  df-im 15137  df-sqrt 15271  df-abs 15272  df-clim 15521  df-sum 15720  df-xmet 21375  df-met 21376  df-ovol 25513  df-vol 25514  df-mbf 25668

This theorem is referenced by:  iblre  25844