dyadmbl - Metamath Proof Explorer

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

Theorem dyadmbl 25740

Description: Any union of dyadic rational intervals is measurable. (Contributed by Mario Carneiro, 26-Mar-2015.)

**Hypotheses**
Ref	Expression
dyadmbl.1	⊢ 𝐹 = (𝑥 ∈ ℤ, 𝑦 ∈ ℕ₀ ↦ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩)
dyadmbl.2	⊢ 𝐺 = {𝑧 ∈ 𝐴 ∣ ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤)}
dyadmbl.3	⊢ (𝜑 → 𝐴 ⊆ ran 𝐹)

**Assertion**
Ref	Expression
dyadmbl	⊢ (𝜑 → ∪ ([,] “ 𝐴) ∈ dom vol)

Distinct variable groups: 𝑥,𝑦 𝑧,𝑤,𝜑 𝑥,𝑤,𝑦,𝐴,𝑧 𝑧,𝐺 𝑤,𝐹,𝑥,𝑦,𝑧 Allowed substitution hints: 𝜑(𝑥,𝑦) 𝐺(𝑥,𝑦,𝑤)

Proof of Theorem dyadmbl Dummy variables 𝑓 𝑎 𝑏 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dyadmbl.1	. . 3 ⊢ 𝐹 = (𝑥 ∈ ℤ, 𝑦 ∈ ℕ₀ ↦ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩)
2		dyadmbl.2	. . 3 ⊢ 𝐺 = {𝑧 ∈ 𝐴 ∣ ∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤)}
3		dyadmbl.3	. . 3 ⊢ (𝜑 → 𝐴 ⊆ ran 𝐹)
4	1, 2, 3	dyadmbllem 25739	. 2 ⊢ (𝜑 → ∪ ([,] “ 𝐴) = ∪ ([,] “ 𝐺))
5		isfinite 9622	. . . 4 ⊢ (𝐺 ∈ Fin ↔ 𝐺 ≺ ω)
6		iccf 13476	. . . . . 6 ⊢ [,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^
7		ffun 6710	. . . . . 6 ⊢ ([,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^ → Fun [,])
8		funiunfv 7248	. . . . . 6 ⊢ (Fun [,] → ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) = ∪ ([,] “ 𝐺))
9	6, 7, 8	mp2b 10	. . . . 5 ⊢ ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) = ∪ ([,] “ 𝐺)
10		simpr 489	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → 𝐺 ∈ Fin)
11	2	ssrab3 4037	. . . . . . . . . . . . . . 15 ⊢ 𝐺 ⊆ 𝐴
12	11, 3	sstrid 3949	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺 ⊆ ran 𝐹)
13	1	dyadf 25731	. . . . . . . . . . . . . . . 16 ⊢ 𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ))
14		frn 6715	. . . . . . . . . . . . . . . 16 ⊢ (𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ)) → ran 𝐹 ⊆ ( ≤ ∩ (ℝ × ℝ)))
15	13, 14	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ ran 𝐹 ⊆ ( ≤ ∩ (ℝ × ℝ))
16		inss2 4191	. . . . . . . . . . . . . . 15 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ)
17	15, 16	sstri 3947	. . . . . . . . . . . . . 14 ⊢ ran 𝐹 ⊆ (ℝ × ℝ)
18	12, 17	sstrdi 3950	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺 ⊆ (ℝ × ℝ))
19	18	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → 𝐺 ⊆ (ℝ × ℝ))
20	19	sselda 3938	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → 𝑛 ∈ (ℝ × ℝ))
21		1st2nd2 8026	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℝ × ℝ) → 𝑛 = ⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩)
22	20, 21	syl 18	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → 𝑛 = ⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩)
23	22	fveq2d 6887	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ([,]‘𝑛) = ([,]‘⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩))
24		df-ov 7415	. . . . . . . . 9 ⊢ ((1^st ‘𝑛)[,](2^nd ‘𝑛)) = ([,]‘⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩)
25	23, 24	eqtr4di 2816	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ([,]‘𝑛) = ((1^st ‘𝑛)[,](2^nd ‘𝑛)))
26		xp1st 8019	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℝ × ℝ) → (1^st ‘𝑛) ∈ ℝ)
27	20, 26	syl 18	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → (1^st ‘𝑛) ∈ ℝ)
28		xp2nd 8020	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℝ × ℝ) → (2^nd ‘𝑛) ∈ ℝ)
29	20, 28	syl 18	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → (2^nd ‘𝑛) ∈ ℝ)
30		iccmbl 25706	. . . . . . . . 9 ⊢ (((1^st ‘𝑛) ∈ ℝ ∧ (2^nd ‘𝑛) ∈ ℝ) → ((1^st ‘𝑛)[,](2^nd ‘𝑛)) ∈ dom vol)
31	27, 29, 30	syl2anc 595	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ((1^st ‘𝑛)[,](2^nd ‘𝑛)) ∈ dom vol)
32	25, 31	eqeltrd 2863	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ([,]‘𝑛) ∈ dom vol)
33	32	ralrimiva 3157	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → ∀𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol)
34		finiunmbl 25684	. . . . . 6 ⊢ ((𝐺 ∈ Fin ∧ ∀𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol) → ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol)
35	10, 33, 34	syl2anc 595	. . . . 5 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol)
36	9, 35	eqeltrrid 2868	. . . 4 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → ∪ ([,] “ 𝐺) ∈ dom vol)
37	5, 36	sylan2br 606	. . 3 ⊢ ((𝜑 ∧ 𝐺 ≺ ω) → ∪ ([,] “ 𝐺) ∈ dom vol)
38		rnco2 6257	. . . . . . . . 9 ⊢ ran ([,] ∘ 𝑓) = ([,] “ ran 𝑓)
39		f1ofo 6830	. . . . . . . . . . . 12 ⊢ (𝑓:ℕ–1-1-onto→𝐺 → 𝑓:ℕ–onto→𝐺)
40	39	adantl 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ–onto→𝐺)
41		forn 6797	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–onto→𝐺 → ran 𝑓 = 𝐺)
42	40, 41	syl 18	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ran 𝑓 = 𝐺)
43	42	imaeq2d 6064	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ([,] “ ran 𝑓) = ([,] “ 𝐺))
44	38, 43	eqtrid 2810	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ran ([,] ∘ 𝑓) = ([,] “ 𝐺))
45	44	unieqd 4886	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∪ ran ([,] ∘ 𝑓) = ∪ ([,] “ 𝐺))
46		f1of 6822	. . . . . . . . 9 ⊢ (𝑓:ℕ–1-1-onto→𝐺 → 𝑓:ℕ⟶𝐺)
47	12, 15	sstrdi 3950	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ⊆ ( ≤ ∩ (ℝ × ℝ)))
48		fss 6724	. . . . . . . . 9 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝐺 ⊆ ( ≤ ∩ (ℝ × ℝ))) → 𝑓:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
49	46, 47, 48	syl2anr 608	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
50		fss 6724	. . . . . . . . . . . . . 14 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝐺 ⊆ ran 𝐹) → 𝑓:ℕ⟶ran 𝐹)
51	46, 12, 50	syl2anr 608	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ⟶ran 𝐹)
52		simpl 487	. . . . . . . . . . . . 13 ⊢ ((𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ) → 𝑎 ∈ ℕ)
53		ffvelcdm 7078	. . . . . . . . . . . . 13 ⊢ ((𝑓:ℕ⟶ran 𝐹 ∧ 𝑎 ∈ ℕ) → (𝑓‘𝑎) ∈ ran 𝐹)
54	51, 52, 53	syl2an 607	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑎) ∈ ran 𝐹)
55		simpr 489	. . . . . . . . . . . . 13 ⊢ ((𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ) → 𝑏 ∈ ℕ)
56		ffvelcdm 7078	. . . . . . . . . . . . 13 ⊢ ((𝑓:ℕ⟶ran 𝐹 ∧ 𝑏 ∈ ℕ) → (𝑓‘𝑏) ∈ ran 𝐹)
57	51, 55, 56	syl2an 607	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑏) ∈ ran 𝐹)
58	1	dyaddisj 25736	. . . . . . . . . . . 12 ⊢ (((𝑓‘𝑎) ∈ ran 𝐹 ∧ (𝑓‘𝑏) ∈ ran 𝐹) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) ∨ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
59	54, 57, 58	syl2anc 595	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) ∨ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
60		fveq2 6883	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝑓‘𝑏) → ([,]‘𝑤) = ([,]‘(𝑓‘𝑏)))
61	60	sseq2d 3970	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑏) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏))))
62		eqeq2 2775	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑏) → ((𝑓‘𝑎) = 𝑤 ↔ (𝑓‘𝑎) = (𝑓‘𝑏)))
63	61, 62	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ (𝑤 = (𝑓‘𝑏) → ((([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤) ↔ (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) → (𝑓‘𝑎) = (𝑓‘𝑏))))
64	46	adantl 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ⟶𝐺)
65		ffvelcdm 7078	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝑎 ∈ ℕ) → (𝑓‘𝑎) ∈ 𝐺)
66	64, 52, 65	syl2an 607	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑎) ∈ 𝐺)
67		fveq2 6883	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝑓‘𝑎) → ([,]‘𝑧) = ([,]‘(𝑓‘𝑎)))
68	67	sseq1d 3969	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑎) → (([,]‘𝑧) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤)))
69		eqeq1 2767	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑎) → (𝑧 = 𝑤 ↔ (𝑓‘𝑎) = 𝑤))
70	68, 69	imbi12d 347	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = (𝑓‘𝑎) → ((([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤)))
71	70	ralbidv 3188	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = (𝑓‘𝑎) → (∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤)))
72	71, 2	elrab2 3655	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑎) ∈ 𝐺 ↔ ((𝑓‘𝑎) ∈ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤)))
73	72	simprbi 502	. . . . . . . . . . . . . . 15 ⊢ ((𝑓‘𝑎) ∈ 𝐺 → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤))
74	66, 73	syl 18	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤))
75		ffvelcdm 7078	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝑏 ∈ ℕ) → (𝑓‘𝑏) ∈ 𝐺)
76	64, 55, 75	syl2an 607	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑏) ∈ 𝐺)
77	11, 76	sselid 3936	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑏) ∈ 𝐴)
78	63, 74, 77	rspcdva 3583	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) → (𝑓‘𝑎) = (𝑓‘𝑏)))
79		f1of1 6821	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:ℕ–1-1-onto→𝐺 → 𝑓:ℕ–1-1→𝐺)
80	79	adantl 486	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ–1-1→𝐺)
81		f1fveq 7262	. . . . . . . . . . . . . . 15 ⊢ ((𝑓:ℕ–1-1→𝐺 ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑓‘𝑎) = (𝑓‘𝑏) ↔ 𝑎 = 𝑏))
82	80, 81	sylan 591	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑓‘𝑎) = (𝑓‘𝑏) ↔ 𝑎 = 𝑏))
83		orc 880	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑏 → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
84	82, 83	biimtrdi 256	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑓‘𝑎) = (𝑓‘𝑏) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
85	78, 84	syld 48	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
86		fveq2 6883	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝑓‘𝑎) → ([,]‘𝑤) = ([,]‘(𝑓‘𝑎)))
87	86	sseq2d 3970	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑎) → (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎))))
88		eqeq2 2775	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝑓‘𝑎) → ((𝑓‘𝑏) = 𝑤 ↔ (𝑓‘𝑏) = (𝑓‘𝑎)))
89		eqcom 2770	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑏) = (𝑓‘𝑎) ↔ (𝑓‘𝑎) = (𝑓‘𝑏))
90	88, 89	bitrdi 290	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑎) → ((𝑓‘𝑏) = 𝑤 ↔ (𝑓‘𝑎) = (𝑓‘𝑏)))
91	87, 90	imbi12d 347	. . . . . . . . . . . . . 14 ⊢ (𝑤 = (𝑓‘𝑎) → ((([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤) ↔ (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) → (𝑓‘𝑎) = (𝑓‘𝑏))))
92		fveq2 6883	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝑓‘𝑏) → ([,]‘𝑧) = ([,]‘(𝑓‘𝑏)))
93	92	sseq1d 3969	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑏) → (([,]‘𝑧) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤)))
94		eqeq1 2767	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑏) → (𝑧 = 𝑤 ↔ (𝑓‘𝑏) = 𝑤))
95	93, 94	imbi12d 347	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = (𝑓‘𝑏) → ((([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤)))
96	95	ralbidv 3188	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = (𝑓‘𝑏) → (∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤)))
97	96, 2	elrab2 3655	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑏) ∈ 𝐺 ↔ ((𝑓‘𝑏) ∈ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤)))
98	97	simprbi 502	. . . . . . . . . . . . . . 15 ⊢ ((𝑓‘𝑏) ∈ 𝐺 → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤))
99	76, 98	syl 18	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤))
100	11, 66	sselid 3936	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑎) ∈ 𝐴)
101	91, 99, 100	rspcdva 3583	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) → (𝑓‘𝑎) = (𝑓‘𝑏)))
102	101, 84	syld 48	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
103		olc 881	. . . . . . . . . . . . 13 ⊢ ((((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅ → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
104	103	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅ → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
105	85, 102, 104	3jaod 1456	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) ∨ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
106	59, 105	mpd 16	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
107	106	ralrimivva 3208	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∀𝑎 ∈ ℕ ∀𝑏 ∈ ℕ (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
108		2fveq3 6888	. . . . . . . . . 10 ⊢ (𝑎 = 𝑏 → ((,)‘(𝑓‘𝑎)) = ((,)‘(𝑓‘𝑏)))
109	108	disjor 5092	. . . . . . . . 9 ⊢ (Disj 𝑎 ∈ ℕ ((,)‘(𝑓‘𝑎)) ↔ ∀𝑎 ∈ ℕ ∀𝑏 ∈ ℕ (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
110	107, 109	sylibr 237	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → Disj 𝑎 ∈ ℕ ((,)‘(𝑓‘𝑎)))
111		eqid 2763	. . . . . . . 8 ⊢ seq1( + , ((abs ∘ − ) ∘ 𝑓)) = seq1( + , ((abs ∘ − ) ∘ 𝑓))
112	49, 110, 111	uniiccmbl 25730	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∪ ran ([,] ∘ 𝑓) ∈ dom vol)
113	45, 112	eqeltrrd 2864	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∪ ([,] “ 𝐺) ∈ dom vol)
114	113	ex 417	. . . . 5 ⊢ (𝜑 → (𝑓:ℕ–1-1-onto→𝐺 → ∪ ([,] “ 𝐺) ∈ dom vol))
115	114	exlimdv 1963	. . . 4 ⊢ (𝜑 → (∃𝑓 𝑓:ℕ–1-1-onto→𝐺 → ∪ ([,] “ 𝐺) ∈ dom vol))
116		nnenom 14018	. . . . . 6 ⊢ ℕ ≈ ω
117		ensym 9001	. . . . . 6 ⊢ (𝐺 ≈ ω → ω ≈ 𝐺)
118		entr 9004	. . . . . 6 ⊢ ((ℕ ≈ ω ∧ ω ≈ 𝐺) → ℕ ≈ 𝐺)
119	116, 117, 118	sylancr 598	. . . . 5 ⊢ (𝐺 ≈ ω → ℕ ≈ 𝐺)
120		bren 8954	. . . . 5 ⊢ (ℕ ≈ 𝐺 ↔ ∃𝑓 𝑓:ℕ–1-1-onto→𝐺)
121	119, 120	sylib 221	. . . 4 ⊢ (𝐺 ≈ ω → ∃𝑓 𝑓:ℕ–1-1-onto→𝐺)
122	115, 121	impel 514	. . 3 ⊢ ((𝜑 ∧ 𝐺 ≈ ω) → ∪ ([,] “ 𝐺) ∈ dom vol)
123		reex 11192	. . . . . . . . 9 ⊢ ℝ ∈ V
124	123, 123	xpex 7753	. . . . . . . 8 ⊢ (ℝ × ℝ) ∈ V
125	124	inex2 5288	. . . . . . 7 ⊢ ( ≤ ∩ (ℝ × ℝ)) ∈ V
126	125, 15	ssexi 5294	. . . . . 6 ⊢ ran 𝐹 ∈ V
127		ssdomg 8998	. . . . . 6 ⊢ (ran 𝐹 ∈ V → (𝐺 ⊆ ran 𝐹 → 𝐺 ≼ ran 𝐹))
128	126, 12, 127	mpsyl 69	. . . . 5 ⊢ (𝜑 → 𝐺 ≼ ran 𝐹)
129		omelon 9616	. . . . . . . 8 ⊢ ω ∈ On
130		znnen 16269	. . . . . . . . . . . 12 ⊢ ℤ ≈ ℕ
131	130, 116	entri 9006	. . . . . . . . . . 11 ⊢ ℤ ≈ ω
132		nn0ennn 14017	. . . . . . . . . . . 12 ⊢ ℕ₀ ≈ ℕ
133	132, 116	entri 9006	. . . . . . . . . . 11 ⊢ ℕ₀ ≈ ω
134		xpen 9129	. . . . . . . . . . 11 ⊢ ((ℤ ≈ ω ∧ ℕ₀ ≈ ω) → (ℤ × ℕ₀) ≈ (ω × ω))
135	131, 133, 134	mp2an 704	. . . . . . . . . 10 ⊢ (ℤ × ℕ₀) ≈ (ω × ω)
136		xpomen 10000	. . . . . . . . . 10 ⊢ (ω × ω) ≈ ω
137	135, 136	entri 9006	. . . . . . . . 9 ⊢ (ℤ × ℕ₀) ≈ ω
138	137	ensymi 9002	. . . . . . . 8 ⊢ ω ≈ (ℤ × ℕ₀)
139		isnumi 9933	. . . . . . . 8 ⊢ ((ω ∈ On ∧ ω ≈ (ℤ × ℕ₀)) → (ℤ × ℕ₀) ∈ dom card)
140	129, 138, 139	mp2an 704	. . . . . . 7 ⊢ (ℤ × ℕ₀) ∈ dom card
141		ffn 6707	. . . . . . . . 9 ⊢ (𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ)) → 𝐹 Fn (ℤ × ℕ₀))
142	13, 141	ax-mp 5	. . . . . . . 8 ⊢ 𝐹 Fn (ℤ × ℕ₀)
143		dffn4 6800	. . . . . . . 8 ⊢ (𝐹 Fn (ℤ × ℕ₀) ↔ 𝐹:(ℤ × ℕ₀)–onto→ran 𝐹)
144	142, 143	mpbi 233	. . . . . . 7 ⊢ 𝐹:(ℤ × ℕ₀)–onto→ran 𝐹
145		fodomnum 10042	. . . . . . 7 ⊢ ((ℤ × ℕ₀) ∈ dom card → (𝐹:(ℤ × ℕ₀)–onto→ran 𝐹 → ran 𝐹 ≼ (ℤ × ℕ₀)))
146	140, 144, 145	mp2 9	. . . . . 6 ⊢ ran 𝐹 ≼ (ℤ × ℕ₀)
147		domentr 9011	. . . . . 6 ⊢ ((ran 𝐹 ≼ (ℤ × ℕ₀) ∧ (ℤ × ℕ₀) ≈ ω) → ran 𝐹 ≼ ω)
148	146, 137, 147	mp2an 704	. . . . 5 ⊢ ran 𝐹 ≼ ω
149		domtr 9005	. . . . 5 ⊢ ((𝐺 ≼ ran 𝐹 ∧ ran 𝐹 ≼ ω) → 𝐺 ≼ ω)
150	128, 148, 149	sylancl 597	. . . 4 ⊢ (𝜑 → 𝐺 ≼ ω)
151		brdom2 8980	. . . 4 ⊢ (𝐺 ≼ ω ↔ (𝐺 ≺ ω ∨ 𝐺 ≈ ω))
152	150, 151	sylib 221	. . 3 ⊢ (𝜑 → (𝐺 ≺ ω ∨ 𝐺 ≈ ω))
153	37, 122, 152	mpjaodan 973	. 2 ⊢ (𝜑 → ∪ ([,] “ 𝐺) ∈ dom vol)
154	4, 153	eqeltrd 2863	1 ⊢ (𝜑 → ∪ ([,] “ 𝐴) ∈ dom vol)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 ∨ w3o 1102 = wceq 1570 ∃wex 1809 ∈ wcel 2143 ∀wral 3079 {crab 3416 Vcvv 3455 ∩ cin 3905 ⊆ wss 3906 ∅c0 4287 𝒫 cpw 4563 ⟨cop 4596 ∪ cuni 4873 ∪ ciun 4957 Disj wdisj 5077 class class class wbr 5110 × cxp 5661 dom cdm 5663 ran crn 5664 “ cima 5666 ∘ ccom 5667 Oncon0 6362 Fun wfun 6532 Fn wfn 6533 ⟶wf 6534 –1-1→wf1 6535 –onto→wfo 6536 –1-1-onto→wf1o 6537 ‘cfv 6538 (class class class)co 7412 ∈ cmpo 7414 ωcom 7863 1^st c1st 7985 2^nd c2nd 7986 ≈ cen 8941 ≼ cdom 8942 ≺ csdm 8943 Fincfn 8944 cardccrd 9922 ℝcr 11100 1c1 11102 + caddc 11104 ℝ^*cxr 11243 ≤ cle 11245 − cmin 11442 / cdiv 11872 ℕcn 12234 2c2 12296 ℕ₀cn0 12505 ℤcz 12592 (,)cioo 13373 [,]cicc 13376 seqcseq 14039 ↑cexp 14099 abscabs 15287 volcvol 25603

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-inf2 9611 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-disj 5078 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7676 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-2o 8455 df-oadd 8458 df-omul 8459 df-er 8695 df-map 8827 df-pm 8828 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-fi 9372 df-sup 9403 df-inf 9404 df-oi 9473 df-dju 9888 df-card 9926 df-acn 9929 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-2 12304 df-3 12305 df-4 12306 df-n0 12506 df-z 12593 df-uz 12864 df-q 12974 df-rp 13018 df-xneg 13138 df-xadd 13139 df-xmul 13140 df-ioo 13377 df-ico 13379 df-icc 13380 df-fz 13537 df-fzo 13685 df-fl 13827 df-seq 14040 df-exp 14100 df-hash 14369 df-cj 15152 df-re 15153 df-im 15154 df-sqrt 15288 df-abs 15289 df-clim 15541 df-rlim 15542 df-sum 15740 df-rest 17476 df-topgen 17497 df-psmet 21495 df-xmet 21496 df-met 21497 df-bl 21498 df-mopn 21499 df-top 23032 df-topon 23049 df-bases 23084 df-cmp 23525 df-ovol 25604 df-vol 25605

This theorem is referenced by: opnmbllem 25741

W3C validator