mbfsup - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > mbfsup		Structured version Visualization version GIF version

Theorem mbfsup 25718

Description: The supremum of a sequence of measurable, real-valued functions is measurable. Note that in this and related theorems, 𝐵(𝑛, 𝑥) is a function of both 𝑛 and 𝑥, since it is an 𝑛-indexed sequence of functions on 𝑥. (Contributed by Mario Carneiro, 14-Aug-2014.) (Revised by Mario Carneiro, 7-Sep-2014.)

**Hypotheses**
Ref	Expression
mbfsup.1	⊢ 𝑍 = (ℤ_≥‘𝑀)
mbfsup.2	⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ))
mbfsup.3	⊢ (𝜑 → 𝑀 ∈ ℤ)
mbfsup.4	⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
mbfsup.5	⊢ ((𝜑 ∧ (𝑛 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴)) → 𝐵 ∈ ℝ)
mbfsup.6	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝐵 ≤ 𝑦)

**Assertion**
Ref	Expression
mbfsup	⊢ (𝜑 → 𝐺 ∈ MblFn)

Distinct variable groups: 𝑥,𝑛,𝑦,𝐴 𝑦,𝐵 𝜑,𝑛,𝑥,𝑦 𝑛,𝑍,𝑥,𝑦 Allowed substitution hints: 𝐵(𝑥,𝑛) 𝐺(𝑥,𝑦,𝑛) 𝑀(𝑥,𝑦,𝑛)

Proof of Theorem mbfsup Dummy variables 𝑚 𝑧 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mbfsup.5	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴)) → 𝐵 ∈ ℝ)
2	1	anassrs 467	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ ℝ)
3	2	an32s 651	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑛 ∈ 𝑍) → 𝐵 ∈ ℝ)
4	3	fmpttd 7149	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑛 ∈ 𝑍 ↦ 𝐵):𝑍⟶ℝ)
5	4	frnd 6755	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ran (𝑛 ∈ 𝑍 ↦ 𝐵) ⊆ ℝ)
6		mbfsup.3	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℤ)
7		uzid 12918	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ_≥‘𝑀))
8	6, 7	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘𝑀))
9		mbfsup.1	. . . . . . . . 9 ⊢ 𝑍 = (ℤ_≥‘𝑀)
10	8, 9	eleqtrrdi 2855	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ 𝑍)
11	10	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑀 ∈ 𝑍)
12		eqid 2740	. . . . . . . 8 ⊢ (𝑛 ∈ 𝑍 ↦ 𝐵) = (𝑛 ∈ 𝑍 ↦ 𝐵)
13	12, 3	dmmptd 6725	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → dom (𝑛 ∈ 𝑍 ↦ 𝐵) = 𝑍)
14	11, 13	eleqtrrd 2847	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑀 ∈ dom (𝑛 ∈ 𝑍 ↦ 𝐵))
15	14	ne0d 4365	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → dom (𝑛 ∈ 𝑍 ↦ 𝐵) ≠ ∅)
16		dm0rn0 5949	. . . . . 6 ⊢ (dom (𝑛 ∈ 𝑍 ↦ 𝐵) = ∅ ↔ ran (𝑛 ∈ 𝑍 ↦ 𝐵) = ∅)
17	16	necon3bii 2999	. . . . 5 ⊢ (dom (𝑛 ∈ 𝑍 ↦ 𝐵) ≠ ∅ ↔ ran (𝑛 ∈ 𝑍 ↦ 𝐵) ≠ ∅)
18	15, 17	sylib 218	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ran (𝑛 ∈ 𝑍 ↦ 𝐵) ≠ ∅)
19		mbfsup.6	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝐵 ≤ 𝑦)
20	4	ffnd 6748	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑛 ∈ 𝑍 ↦ 𝐵) Fn 𝑍)
21		breq1 5169	. . . . . . . . 9 ⊢ (𝑧 = ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) → (𝑧 ≤ 𝑦 ↔ ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) ≤ 𝑦))
22	21	ralrn 7122	. . . . . . . 8 ⊢ ((𝑛 ∈ 𝑍 ↦ 𝐵) Fn 𝑍 → (∀𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑧 ≤ 𝑦 ↔ ∀𝑚 ∈ 𝑍 ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) ≤ 𝑦))
23	20, 22	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (∀𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑧 ≤ 𝑦 ↔ ∀𝑚 ∈ 𝑍 ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) ≤ 𝑦))
24		nffvmpt1 6931	. . . . . . . . . 10 ⊢ Ⅎ𝑛((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚)
25		nfcv 2908	. . . . . . . . . 10 ⊢ Ⅎ𝑛 ≤
26		nfcv 2908	. . . . . . . . . 10 ⊢ Ⅎ𝑛𝑦
27	24, 25, 26	nfbr 5213	. . . . . . . . 9 ⊢ Ⅎ𝑛((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) ≤ 𝑦
28		nfv 1913	. . . . . . . . 9 ⊢ Ⅎ𝑚((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛) ≤ 𝑦
29		fveq2 6920	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) = ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛))
30	29	breq1d 5176	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → (((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) ≤ 𝑦 ↔ ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛) ≤ 𝑦))
31	27, 28, 30	cbvralw 3312	. . . . . . . 8 ⊢ (∀𝑚 ∈ 𝑍 ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) ≤ 𝑦 ↔ ∀𝑛 ∈ 𝑍 ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛) ≤ 𝑦)
32		simpr 484	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
33	12	fvmpt2 7040	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ 𝑍 ∧ 𝐵 ∈ ℝ) → ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛) = 𝐵)
34	32, 3, 33	syl2anc 583	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑛 ∈ 𝑍) → ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛) = 𝐵)
35	34	breq1d 5176	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑛 ∈ 𝑍) → (((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛) ≤ 𝑦 ↔ 𝐵 ≤ 𝑦))
36	35	ralbidva 3182	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (∀𝑛 ∈ 𝑍 ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛) ≤ 𝑦 ↔ ∀𝑛 ∈ 𝑍 𝐵 ≤ 𝑦))
37	31, 36	bitrid 283	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (∀𝑚 ∈ 𝑍 ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) ≤ 𝑦 ↔ ∀𝑛 ∈ 𝑍 𝐵 ≤ 𝑦))
38	23, 37	bitrd 279	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (∀𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑧 ≤ 𝑦 ↔ ∀𝑛 ∈ 𝑍 𝐵 ≤ 𝑦))
39	38	rexbidv 3185	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑧 ≤ 𝑦 ↔ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝐵 ≤ 𝑦))
40	19, 39	mpbird 257	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑧 ≤ 𝑦)
41	5, 18, 40	suprcld 12258	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → sup(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ) ∈ ℝ)
42		mbfsup.2	. . 3 ⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ))
43	41, 42	fmptd 7148	. 2 ⊢ (𝜑 → 𝐺:𝐴⟶ℝ)
44		simpr 484	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
45		ltso 11370	. . . . . . . . . . . . . 14 ⊢ < Or ℝ
46	45	supex 9532	. . . . . . . . . . . . 13 ⊢ sup(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ) ∈ V
47	42	fvmpt2 7040	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝐴 ∧ sup(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ) ∈ V) → (𝐺‘𝑥) = sup(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ))
48	44, 46, 47	sylancl 585	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) = sup(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ))
49	48	breq2d 5178	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (𝑡 < (𝐺‘𝑥) ↔ 𝑡 < sup(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < )))
50	5, 18, 40	3jca 1128	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (ran (𝑛 ∈ 𝑍 ↦ 𝐵) ⊆ ℝ ∧ ran (𝑛 ∈ 𝑍 ↦ 𝐵) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑧 ≤ 𝑦))
51	50	adantlr 714	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (ran (𝑛 ∈ 𝑍 ↦ 𝐵) ⊆ ℝ ∧ ran (𝑛 ∈ 𝑍 ↦ 𝐵) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑧 ≤ 𝑦))
52		simplr 768	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → 𝑡 ∈ ℝ)
53		suprlub 12259	. . . . . . . . . . . 12 ⊢ (((ran (𝑛 ∈ 𝑍 ↦ 𝐵) ⊆ ℝ ∧ ran (𝑛 ∈ 𝑍 ↦ 𝐵) ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑧 ≤ 𝑦) ∧ 𝑡 ∈ ℝ) → (𝑡 < sup(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ) ↔ ∃𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑡 < 𝑧))
54	51, 52, 53	syl2anc 583	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (𝑡 < sup(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ) ↔ ∃𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑡 < 𝑧))
55	20	adantlr 714	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (𝑛 ∈ 𝑍 ↦ 𝐵) Fn 𝑍)
56		breq2 5170	. . . . . . . . . . . . . 14 ⊢ (𝑧 = ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) → (𝑡 < 𝑧 ↔ 𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚)))
57	56	rexrn 7121	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ 𝑍 ↦ 𝐵) Fn 𝑍 → (∃𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑡 < 𝑧 ↔ ∃𝑚 ∈ 𝑍 𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚)))
58	55, 57	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (∃𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑡 < 𝑧 ↔ ∃𝑚 ∈ 𝑍 𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚)))
59		nfcv 2908	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑛𝑡
60		nfcv 2908	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑛 <
61	59, 60, 24	nfbr 5213	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛 𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚)
62		nfv 1913	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑚 𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛)
63	29	breq2d 5178	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) ↔ 𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛)))
64	61, 62, 63	cbvrexw 3313	. . . . . . . . . . . . 13 ⊢ (∃𝑚 ∈ 𝑍 𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛))
65	12	fvmpt2i 7039	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ 𝑍 → ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛) = ( I ‘𝐵))
66		eqid 2740	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
67	66	fvmpt2i 7039	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = ( I ‘𝐵))
68	67	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = ( I ‘𝐵))
69	68	eqcomd 2746	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ( I ‘𝐵) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
70	65, 69	sylan9eqr 2802	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑛 ∈ 𝑍) → ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
71	70	breq2d 5178	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑛 ∈ 𝑍) → (𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛) ↔ 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)))
72	71	rexbidva 3183	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (∃𝑛 ∈ 𝑍 𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)))
73	72	adantlr 714	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (∃𝑛 ∈ 𝑍 𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑛) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)))
74	64, 73	bitrid 283	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (∃𝑚 ∈ 𝑍 𝑡 < ((𝑛 ∈ 𝑍 ↦ 𝐵)‘𝑚) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)))
75	58, 74	bitrd 279	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (∃𝑧 ∈ ran (𝑛 ∈ 𝑍 ↦ 𝐵)𝑡 < 𝑧 ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)))
76	49, 54, 75	3bitrd 305	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑥 ∈ 𝐴) → (𝑡 < (𝐺‘𝑥) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)))
77	76	ralrimiva 3152	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → ∀𝑥 ∈ 𝐴 (𝑡 < (𝐺‘𝑥) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)))
78		nfv 1913	. . . . . . . . . 10 ⊢ Ⅎ𝑧(𝑡 < (𝐺‘𝑥) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
79		nfcv 2908	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝑡
80		nfcv 2908	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥 <
81		nfmpt1 5274	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ 𝐵), ℝ, < ))
82	42, 81	nfcxfr 2906	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥𝐺
83		nfcv 2908	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥𝑧
84	82, 83	nffv 6930	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥(𝐺‘𝑧)
85	79, 80, 84	nfbr 5213	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 𝑡 < (𝐺‘𝑧)
86		nfcv 2908	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝑍
87		nffvmpt1 6931	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧)
88	79, 80, 87	nfbr 5213	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧)
89	86, 88	nfrexw 3319	. . . . . . . . . . 11 ⊢ Ⅎ𝑥∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧)
90	85, 89	nfbi 1902	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑡 < (𝐺‘𝑧) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧))
91		fveq2 6920	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑧 → (𝐺‘𝑥) = (𝐺‘𝑧))
92	91	breq2d 5178	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 → (𝑡 < (𝐺‘𝑥) ↔ 𝑡 < (𝐺‘𝑧)))
93		fveq2 6920	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧))
94	93	breq2d 5178	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑧 → (𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ↔ 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧)))
95	94	rexbidv 3185	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 → (∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧)))
96	92, 95	bibi12d 345	. . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → ((𝑡 < (𝐺‘𝑥) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)) ↔ (𝑡 < (𝐺‘𝑧) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧))))
97	78, 90, 96	cbvralw 3312	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝐴 (𝑡 < (𝐺‘𝑥) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥)) ↔ ∀𝑧 ∈ 𝐴 (𝑡 < (𝐺‘𝑧) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧)))
98	77, 97	sylib 218	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → ∀𝑧 ∈ 𝐴 (𝑡 < (𝐺‘𝑧) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧)))
99	98	r19.21bi 3257	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → (𝑡 < (𝐺‘𝑧) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧)))
100	43	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → 𝐺:𝐴⟶ℝ)
101	100	ffvelcdmda 7118	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → (𝐺‘𝑧) ∈ ℝ)
102		rexr 11336	. . . . . . . . . 10 ⊢ (𝑡 ∈ ℝ → 𝑡 ∈ ℝ^*)
103	102	ad2antlr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → 𝑡 ∈ ℝ^*)
104		elioopnf 13503	. . . . . . . . 9 ⊢ (𝑡 ∈ ℝ^* → ((𝐺‘𝑧) ∈ (𝑡(,)+∞) ↔ ((𝐺‘𝑧) ∈ ℝ ∧ 𝑡 < (𝐺‘𝑧))))
105	103, 104	syl 17	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → ((𝐺‘𝑧) ∈ (𝑡(,)+∞) ↔ ((𝐺‘𝑧) ∈ ℝ ∧ 𝑡 < (𝐺‘𝑧))))
106	101, 105	mpbirand 706	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → ((𝐺‘𝑧) ∈ (𝑡(,)+∞) ↔ 𝑡 < (𝐺‘𝑧)))
107	103	adantr 480	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) ∧ 𝑛 ∈ 𝑍) → 𝑡 ∈ ℝ^*)
108		elioopnf 13503	. . . . . . . . . 10 ⊢ (𝑡 ∈ ℝ^* → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞) ↔ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ ℝ ∧ 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧))))
109	107, 108	syl 17	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) ∧ 𝑛 ∈ 𝑍) → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞) ↔ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ ℝ ∧ 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧))))
110	2	fmpttd 7149	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℝ)
111	110	ffvelcdmda 7118	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ ℝ)
112	111	biantrurd 532	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑧 ∈ 𝐴) → (𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ↔ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ ℝ ∧ 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧))))
113	112	an32s 651	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑧 ∈ 𝐴) ∧ 𝑛 ∈ 𝑍) → (𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ↔ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ ℝ ∧ 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧))))
114	113	adantllr 718	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) ∧ 𝑛 ∈ 𝑍) → (𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ↔ (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ ℝ ∧ 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧))))
115	109, 114	bitr4d 282	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) ∧ 𝑛 ∈ 𝑍) → (((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞) ↔ 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧)))
116	115	rexbidva 3183	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → (∃𝑛 ∈ 𝑍 ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞) ↔ ∃𝑛 ∈ 𝑍 𝑡 < ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧)))
117	99, 106, 116	3bitr4d 311	. . . . . 6 ⊢ (((𝜑 ∧ 𝑡 ∈ ℝ) ∧ 𝑧 ∈ 𝐴) → ((𝐺‘𝑧) ∈ (𝑡(,)+∞) ↔ ∃𝑛 ∈ 𝑍 ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞)))
118	117	pm5.32da 578	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → ((𝑧 ∈ 𝐴 ∧ (𝐺‘𝑧) ∈ (𝑡(,)+∞)) ↔ (𝑧 ∈ 𝐴 ∧ ∃𝑛 ∈ 𝑍 ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞))))
119	43	ffnd 6748	. . . . . . 7 ⊢ (𝜑 → 𝐺 Fn 𝐴)
120	119	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → 𝐺 Fn 𝐴)
121		elpreima 7091	. . . . . 6 ⊢ (𝐺 Fn 𝐴 → (𝑧 ∈ (^◡𝐺 “ (𝑡(,)+∞)) ↔ (𝑧 ∈ 𝐴 ∧ (𝐺‘𝑧) ∈ (𝑡(,)+∞))))
122	120, 121	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → (𝑧 ∈ (^◡𝐺 “ (𝑡(,)+∞)) ↔ (𝑧 ∈ 𝐴 ∧ (𝐺‘𝑧) ∈ (𝑡(,)+∞))))
123		eliun 5019	. . . . . 6 ⊢ (𝑧 ∈ ∪ 𝑛 ∈ 𝑍 (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ↔ ∃𝑛 ∈ 𝑍 𝑧 ∈ (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)))
124	110	ffnd 6748	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴)
125		elpreima 7091	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) Fn 𝐴 → (𝑧 ∈ (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ↔ (𝑧 ∈ 𝐴 ∧ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞))))
126	124, 125	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑧 ∈ (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ↔ (𝑧 ∈ 𝐴 ∧ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞))))
127	126	rexbidva 3183	. . . . . . . 8 ⊢ (𝜑 → (∃𝑛 ∈ 𝑍 𝑧 ∈ (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ↔ ∃𝑛 ∈ 𝑍 (𝑧 ∈ 𝐴 ∧ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞))))
128	127	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → (∃𝑛 ∈ 𝑍 𝑧 ∈ (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ↔ ∃𝑛 ∈ 𝑍 (𝑧 ∈ 𝐴 ∧ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞))))
129		r19.42v 3197	. . . . . . 7 ⊢ (∃𝑛 ∈ 𝑍 (𝑧 ∈ 𝐴 ∧ ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞)) ↔ (𝑧 ∈ 𝐴 ∧ ∃𝑛 ∈ 𝑍 ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞)))
130	128, 129	bitrdi 287	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → (∃𝑛 ∈ 𝑍 𝑧 ∈ (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ↔ (𝑧 ∈ 𝐴 ∧ ∃𝑛 ∈ 𝑍 ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞))))
131	123, 130	bitrid 283	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → (𝑧 ∈ ∪ 𝑛 ∈ 𝑍 (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ↔ (𝑧 ∈ 𝐴 ∧ ∃𝑛 ∈ 𝑍 ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑧) ∈ (𝑡(,)+∞))))
132	118, 122, 131	3bitr4d 311	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → (𝑧 ∈ (^◡𝐺 “ (𝑡(,)+∞)) ↔ 𝑧 ∈ ∪ 𝑛 ∈ 𝑍 (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞))))
133	132	eqrdv 2738	. . 3 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → (^◡𝐺 “ (𝑡(,)+∞)) = ∪ 𝑛 ∈ 𝑍 (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)))
134		zex 12648	. . . . . . 7 ⊢ ℤ ∈ V
135		uzssz 12924	. . . . . . 7 ⊢ (ℤ_≥‘𝑀) ⊆ ℤ
136		ssdomg 9060	. . . . . . 7 ⊢ (ℤ ∈ V → ((ℤ_≥‘𝑀) ⊆ ℤ → (ℤ_≥‘𝑀) ≼ ℤ))
137	134, 135, 136	mp2 9	. . . . . 6 ⊢ (ℤ_≥‘𝑀) ≼ ℤ
138	9, 137	eqbrtri 5187	. . . . 5 ⊢ 𝑍 ≼ ℤ
139		znnen 16260	. . . . 5 ⊢ ℤ ≈ ℕ
140		domentr 9073	. . . . 5 ⊢ ((𝑍 ≼ ℤ ∧ ℤ ≈ ℕ) → 𝑍 ≼ ℕ)
141	138, 139, 140	mp2an 691	. . . 4 ⊢ 𝑍 ≼ ℕ
142		mbfsup.4	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn)
143		mbfima 25684	. . . . . . 7 ⊢ (((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ MblFn ∧ (𝑥 ∈ 𝐴 ↦ 𝐵):𝐴⟶ℝ) → (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ∈ dom vol)
144	142, 110, 143	syl2anc 583	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ∈ dom vol)
145	144	ralrimiva 3152	. . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ 𝑍 (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ∈ dom vol)
146	145	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → ∀𝑛 ∈ 𝑍 (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ∈ dom vol)
147		iunmbl2 25611	. . . 4 ⊢ ((𝑍 ≼ ℕ ∧ ∀𝑛 ∈ 𝑍 (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ∈ dom vol) → ∪ 𝑛 ∈ 𝑍 (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ∈ dom vol)
148	141, 146, 147	sylancr 586	. . 3 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → ∪ 𝑛 ∈ 𝑍 (^◡(𝑥 ∈ 𝐴 ↦ 𝐵) “ (𝑡(,)+∞)) ∈ dom vol)
149	133, 148	eqeltrd 2844	. 2 ⊢ ((𝜑 ∧ 𝑡 ∈ ℝ) → (^◡𝐺 “ (𝑡(,)+∞)) ∈ dom vol)
150	43, 149	ismbf3d 25708	1 ⊢ (𝜑 → 𝐺 ∈ MblFn)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 ∀wral 3067 ∃wrex 3076 Vcvv 3488 ⊆ wss 3976 ∅c0 4352 ∪ ciun 5015 class class class wbr 5166 ↦ cmpt 5249 I cid 5592 ^◡ccnv 5699 dom cdm 5700 ran crn 5701 “ cima 5703 Fn wfn 6568 ⟶wf 6569 ‘cfv 6573 (class class class)co 7448 ≈ cen 9000 ≼ cdom 9001 supcsup 9509 ℝcr 11183 +∞cpnf 11321 ℝ^*cxr 11323 < clt 11324 ≤ cle 11325 ℕcn 12293 ℤcz 12639 ℤ_≥cuz 12903 (,)cioo 13407 volcvol 25517 MblFncmbf 25668

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-inf2 9710 ax-cc 10504 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-pre-sup 11262

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-disj 5134 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-se 5653 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-isom 6582 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-of 7714 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-2o 8523 df-oadd 8526 df-omul 8527 df-er 8763 df-map 8886 df-pm 8887 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-sup 9511 df-inf 9512 df-oi 9579 df-dju 9970 df-card 10008 df-acn 10011 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-div 11948 df-nn 12294 df-2 12356 df-3 12357 df-n0 12554 df-z 12640 df-uz 12904 df-q 13014 df-rp 13058 df-xadd 13176 df-ioo 13411 df-ioc 13412 df-ico 13413 df-icc 13414 df-fz 13568 df-fzo 13712 df-fl 13843 df-seq 14053 df-exp 14113 df-hash 14380 df-cj 15148 df-re 15149 df-im 15150 df-sqrt 15284 df-abs 15285 df-clim 15534 df-rlim 15535 df-sum 15735 df-xmet 21380 df-met 21381 df-ovol 25518 df-vol 25519 df-mbf 25673

This theorem is referenced by: mbfinf 25719 mbflimsup 25720

W3C validator