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 25109

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 25108	. 2 ⊢ (𝜑 → ∪ ([,] “ 𝐴) = ∪ ([,] “ 𝐺))
5		isfinite 9644	. . . 4 ⊢ (𝐺 ∈ Fin ↔ 𝐺 ≺ ω)
6		iccf 13422	. . . . . 6 ⊢ [,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^
7		ffun 6718	. . . . . 6 ⊢ ([,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^ → Fun [,])
8		funiunfv 7244	. . . . . 6 ⊢ (Fun [,] → ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) = ∪ ([,] “ 𝐺))
9	6, 7, 8	mp2b 10	. . . . 5 ⊢ ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) = ∪ ([,] “ 𝐺)
10		simpr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → 𝐺 ∈ Fin)
11	2	ssrab3 4080	. . . . . . . . . . . . . . 15 ⊢ 𝐺 ⊆ 𝐴
12	11, 3	sstrid 3993	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺 ⊆ ran 𝐹)
13	1	dyadf 25100	. . . . . . . . . . . . . . . 16 ⊢ 𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ))
14		frn 6722	. . . . . . . . . . . . . . . 16 ⊢ (𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ)) → ran 𝐹 ⊆ ( ≤ ∩ (ℝ × ℝ)))
15	13, 14	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ ran 𝐹 ⊆ ( ≤ ∩ (ℝ × ℝ))
16		inss2 4229	. . . . . . . . . . . . . . 15 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ)
17	15, 16	sstri 3991	. . . . . . . . . . . . . 14 ⊢ ran 𝐹 ⊆ (ℝ × ℝ)
18	12, 17	sstrdi 3994	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺 ⊆ (ℝ × ℝ))
19	18	adantr 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → 𝐺 ⊆ (ℝ × ℝ))
20	19	sselda 3982	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → 𝑛 ∈ (ℝ × ℝ))
21		1st2nd2 8011	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℝ × ℝ) → 𝑛 = ⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩)
22	20, 21	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → 𝑛 = ⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩)
23	22	fveq2d 6893	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ([,]‘𝑛) = ([,]‘⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩))
24		df-ov 7409	. . . . . . . . 9 ⊢ ((1^st ‘𝑛)[,](2^nd ‘𝑛)) = ([,]‘⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩)
25	23, 24	eqtr4di 2791	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ([,]‘𝑛) = ((1^st ‘𝑛)[,](2^nd ‘𝑛)))
26		xp1st 8004	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℝ × ℝ) → (1^st ‘𝑛) ∈ ℝ)
27	20, 26	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → (1^st ‘𝑛) ∈ ℝ)
28		xp2nd 8005	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℝ × ℝ) → (2^nd ‘𝑛) ∈ ℝ)
29	20, 28	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → (2^nd ‘𝑛) ∈ ℝ)
30		iccmbl 25075	. . . . . . . . 9 ⊢ (((1^st ‘𝑛) ∈ ℝ ∧ (2^nd ‘𝑛) ∈ ℝ) → ((1^st ‘𝑛)[,](2^nd ‘𝑛)) ∈ dom vol)
31	27, 29, 30	syl2anc 585	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ((1^st ‘𝑛)[,](2^nd ‘𝑛)) ∈ dom vol)
32	25, 31	eqeltrd 2834	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ([,]‘𝑛) ∈ dom vol)
33	32	ralrimiva 3147	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → ∀𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol)
34		finiunmbl 25053	. . . . . 6 ⊢ ((𝐺 ∈ Fin ∧ ∀𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol) → ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol)
35	10, 33, 34	syl2anc 585	. . . . 5 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol)
36	9, 35	eqeltrrid 2839	. . . 4 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → ∪ ([,] “ 𝐺) ∈ dom vol)
37	5, 36	sylan2br 596	. . 3 ⊢ ((𝜑 ∧ 𝐺 ≺ ω) → ∪ ([,] “ 𝐺) ∈ dom vol)
38		rnco2 6250	. . . . . . . . 9 ⊢ ran ([,] ∘ 𝑓) = ([,] “ ran 𝑓)
39		f1ofo 6838	. . . . . . . . . . . 12 ⊢ (𝑓:ℕ–1-1-onto→𝐺 → 𝑓:ℕ–onto→𝐺)
40	39	adantl 483	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ–onto→𝐺)
41		forn 6806	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–onto→𝐺 → ran 𝑓 = 𝐺)
42	40, 41	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ran 𝑓 = 𝐺)
43	42	imaeq2d 6058	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ([,] “ ran 𝑓) = ([,] “ 𝐺))
44	38, 43	eqtrid 2785	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ran ([,] ∘ 𝑓) = ([,] “ 𝐺))
45	44	unieqd 4922	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∪ ran ([,] ∘ 𝑓) = ∪ ([,] “ 𝐺))
46		f1of 6831	. . . . . . . . 9 ⊢ (𝑓:ℕ–1-1-onto→𝐺 → 𝑓:ℕ⟶𝐺)
47	12, 15	sstrdi 3994	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ⊆ ( ≤ ∩ (ℝ × ℝ)))
48		fss 6732	. . . . . . . . 9 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝐺 ⊆ ( ≤ ∩ (ℝ × ℝ))) → 𝑓:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
49	46, 47, 48	syl2anr 598	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
50		fss 6732	. . . . . . . . . . . . . 14 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝐺 ⊆ ran 𝐹) → 𝑓:ℕ⟶ran 𝐹)
51	46, 12, 50	syl2anr 598	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ⟶ran 𝐹)
52		simpl 484	. . . . . . . . . . . . 13 ⊢ ((𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ) → 𝑎 ∈ ℕ)
53		ffvelcdm 7081	. . . . . . . . . . . . 13 ⊢ ((𝑓:ℕ⟶ran 𝐹 ∧ 𝑎 ∈ ℕ) → (𝑓‘𝑎) ∈ ran 𝐹)
54	51, 52, 53	syl2an 597	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑎) ∈ ran 𝐹)
55		simpr 486	. . . . . . . . . . . . 13 ⊢ ((𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ) → 𝑏 ∈ ℕ)
56		ffvelcdm 7081	. . . . . . . . . . . . 13 ⊢ ((𝑓:ℕ⟶ran 𝐹 ∧ 𝑏 ∈ ℕ) → (𝑓‘𝑏) ∈ ran 𝐹)
57	51, 55, 56	syl2an 597	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑏) ∈ ran 𝐹)
58	1	dyaddisj 25105	. . . . . . . . . . . 12 ⊢ (((𝑓‘𝑎) ∈ ran 𝐹 ∧ (𝑓‘𝑏) ∈ ran 𝐹) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) ∨ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
59	54, 57, 58	syl2anc 585	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) ∨ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
60		fveq2 6889	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝑓‘𝑏) → ([,]‘𝑤) = ([,]‘(𝑓‘𝑏)))
61	60	sseq2d 4014	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑏) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏))))
62		eqeq2 2745	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑏) → ((𝑓‘𝑎) = 𝑤 ↔ (𝑓‘𝑎) = (𝑓‘𝑏)))
63	61, 62	imbi12d 345	. . . . . . . . . . . . . 14 ⊢ (𝑤 = (𝑓‘𝑏) → ((([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤) ↔ (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) → (𝑓‘𝑎) = (𝑓‘𝑏))))
64	46	adantl 483	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ⟶𝐺)
65		ffvelcdm 7081	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝑎 ∈ ℕ) → (𝑓‘𝑎) ∈ 𝐺)
66	64, 52, 65	syl2an 597	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑎) ∈ 𝐺)
67		fveq2 6889	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝑓‘𝑎) → ([,]‘𝑧) = ([,]‘(𝑓‘𝑎)))
68	67	sseq1d 4013	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑎) → (([,]‘𝑧) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤)))
69		eqeq1 2737	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑎) → (𝑧 = 𝑤 ↔ (𝑓‘𝑎) = 𝑤))
70	68, 69	imbi12d 345	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = (𝑓‘𝑎) → ((([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤)))
71	70	ralbidv 3178	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = (𝑓‘𝑎) → (∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤)))
72	71, 2	elrab2 3686	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑎) ∈ 𝐺 ↔ ((𝑓‘𝑎) ∈ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤)))
73	72	simprbi 498	. . . . . . . . . . . . . . 15 ⊢ ((𝑓‘𝑎) ∈ 𝐺 → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤))
74	66, 73	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤))
75		ffvelcdm 7081	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝑏 ∈ ℕ) → (𝑓‘𝑏) ∈ 𝐺)
76	64, 55, 75	syl2an 597	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑏) ∈ 𝐺)
77	11, 76	sselid 3980	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑏) ∈ 𝐴)
78	63, 74, 77	rspcdva 3614	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) → (𝑓‘𝑎) = (𝑓‘𝑏)))
79		f1of1 6830	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:ℕ–1-1-onto→𝐺 → 𝑓:ℕ–1-1→𝐺)
80	79	adantl 483	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ–1-1→𝐺)
81		f1fveq 7258	. . . . . . . . . . . . . . 15 ⊢ ((𝑓:ℕ–1-1→𝐺 ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑓‘𝑎) = (𝑓‘𝑏) ↔ 𝑎 = 𝑏))
82	80, 81	sylan 581	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑓‘𝑎) = (𝑓‘𝑏) ↔ 𝑎 = 𝑏))
83		orc 866	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑏 → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
84	82, 83	syl6bi 253	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑓‘𝑎) = (𝑓‘𝑏) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
85	78, 84	syld 47	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
86		fveq2 6889	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝑓‘𝑎) → ([,]‘𝑤) = ([,]‘(𝑓‘𝑎)))
87	86	sseq2d 4014	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑎) → (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎))))
88		eqeq2 2745	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝑓‘𝑎) → ((𝑓‘𝑏) = 𝑤 ↔ (𝑓‘𝑏) = (𝑓‘𝑎)))
89		eqcom 2740	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑏) = (𝑓‘𝑎) ↔ (𝑓‘𝑎) = (𝑓‘𝑏))
90	88, 89	bitrdi 287	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑎) → ((𝑓‘𝑏) = 𝑤 ↔ (𝑓‘𝑎) = (𝑓‘𝑏)))
91	87, 90	imbi12d 345	. . . . . . . . . . . . . 14 ⊢ (𝑤 = (𝑓‘𝑎) → ((([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤) ↔ (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) → (𝑓‘𝑎) = (𝑓‘𝑏))))
92		fveq2 6889	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝑓‘𝑏) → ([,]‘𝑧) = ([,]‘(𝑓‘𝑏)))
93	92	sseq1d 4013	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑏) → (([,]‘𝑧) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤)))
94		eqeq1 2737	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑏) → (𝑧 = 𝑤 ↔ (𝑓‘𝑏) = 𝑤))
95	93, 94	imbi12d 345	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = (𝑓‘𝑏) → ((([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤)))
96	95	ralbidv 3178	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = (𝑓‘𝑏) → (∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤)))
97	96, 2	elrab2 3686	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑏) ∈ 𝐺 ↔ ((𝑓‘𝑏) ∈ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤)))
98	97	simprbi 498	. . . . . . . . . . . . . . 15 ⊢ ((𝑓‘𝑏) ∈ 𝐺 → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤))
99	76, 98	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤))
100	11, 66	sselid 3980	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑎) ∈ 𝐴)
101	91, 99, 100	rspcdva 3614	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) → (𝑓‘𝑎) = (𝑓‘𝑏)))
102	101, 84	syld 47	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
103		olc 867	. . . . . . . . . . . . 13 ⊢ ((((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅ → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
104	103	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅ → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
105	85, 102, 104	3jaod 1429	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) ∨ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
106	59, 105	mpd 15	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
107	106	ralrimivva 3201	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∀𝑎 ∈ ℕ ∀𝑏 ∈ ℕ (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
108		2fveq3 6894	. . . . . . . . . 10 ⊢ (𝑎 = 𝑏 → ((,)‘(𝑓‘𝑎)) = ((,)‘(𝑓‘𝑏)))
109	108	disjor 5128	. . . . . . . . 9 ⊢ (Disj 𝑎 ∈ ℕ ((,)‘(𝑓‘𝑎)) ↔ ∀𝑎 ∈ ℕ ∀𝑏 ∈ ℕ (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
110	107, 109	sylibr 233	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → Disj 𝑎 ∈ ℕ ((,)‘(𝑓‘𝑎)))
111		eqid 2733	. . . . . . . 8 ⊢ seq1( + , ((abs ∘ − ) ∘ 𝑓)) = seq1( + , ((abs ∘ − ) ∘ 𝑓))
112	49, 110, 111	uniiccmbl 25099	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∪ ran ([,] ∘ 𝑓) ∈ dom vol)
113	45, 112	eqeltrrd 2835	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∪ ([,] “ 𝐺) ∈ dom vol)
114	113	ex 414	. . . . 5 ⊢ (𝜑 → (𝑓:ℕ–1-1-onto→𝐺 → ∪ ([,] “ 𝐺) ∈ dom vol))
115	114	exlimdv 1937	. . . 4 ⊢ (𝜑 → (∃𝑓 𝑓:ℕ–1-1-onto→𝐺 → ∪ ([,] “ 𝐺) ∈ dom vol))
116		nnenom 13942	. . . . . 6 ⊢ ℕ ≈ ω
117		ensym 8996	. . . . . 6 ⊢ (𝐺 ≈ ω → ω ≈ 𝐺)
118		entr 8999	. . . . . 6 ⊢ ((ℕ ≈ ω ∧ ω ≈ 𝐺) → ℕ ≈ 𝐺)
119	116, 117, 118	sylancr 588	. . . . 5 ⊢ (𝐺 ≈ ω → ℕ ≈ 𝐺)
120		bren 8946	. . . . 5 ⊢ (ℕ ≈ 𝐺 ↔ ∃𝑓 𝑓:ℕ–1-1-onto→𝐺)
121	119, 120	sylib 217	. . . 4 ⊢ (𝐺 ≈ ω → ∃𝑓 𝑓:ℕ–1-1-onto→𝐺)
122	115, 121	impel 507	. . 3 ⊢ ((𝜑 ∧ 𝐺 ≈ ω) → ∪ ([,] “ 𝐺) ∈ dom vol)
123		reex 11198	. . . . . . . . 9 ⊢ ℝ ∈ V
124	123, 123	xpex 7737	. . . . . . . 8 ⊢ (ℝ × ℝ) ∈ V
125	124	inex2 5318	. . . . . . 7 ⊢ ( ≤ ∩ (ℝ × ℝ)) ∈ V
126	125, 15	ssexi 5322	. . . . . 6 ⊢ ran 𝐹 ∈ V
127		ssdomg 8993	. . . . . 6 ⊢ (ran 𝐹 ∈ V → (𝐺 ⊆ ran 𝐹 → 𝐺 ≼ ran 𝐹))
128	126, 12, 127	mpsyl 68	. . . . 5 ⊢ (𝜑 → 𝐺 ≼ ran 𝐹)
129		omelon 9638	. . . . . . . 8 ⊢ ω ∈ On
130		znnen 16152	. . . . . . . . . . . 12 ⊢ ℤ ≈ ℕ
131	130, 116	entri 9001	. . . . . . . . . . 11 ⊢ ℤ ≈ ω
132		nn0ennn 13941	. . . . . . . . . . . 12 ⊢ ℕ₀ ≈ ℕ
133	132, 116	entri 9001	. . . . . . . . . . 11 ⊢ ℕ₀ ≈ ω
134		xpen 9137	. . . . . . . . . . 11 ⊢ ((ℤ ≈ ω ∧ ℕ₀ ≈ ω) → (ℤ × ℕ₀) ≈ (ω × ω))
135	131, 133, 134	mp2an 691	. . . . . . . . . 10 ⊢ (ℤ × ℕ₀) ≈ (ω × ω)
136		xpomen 10007	. . . . . . . . . 10 ⊢ (ω × ω) ≈ ω
137	135, 136	entri 9001	. . . . . . . . 9 ⊢ (ℤ × ℕ₀) ≈ ω
138	137	ensymi 8997	. . . . . . . 8 ⊢ ω ≈ (ℤ × ℕ₀)
139		isnumi 9938	. . . . . . . 8 ⊢ ((ω ∈ On ∧ ω ≈ (ℤ × ℕ₀)) → (ℤ × ℕ₀) ∈ dom card)
140	129, 138, 139	mp2an 691	. . . . . . 7 ⊢ (ℤ × ℕ₀) ∈ dom card
141		ffn 6715	. . . . . . . . 9 ⊢ (𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ)) → 𝐹 Fn (ℤ × ℕ₀))
142	13, 141	ax-mp 5	. . . . . . . 8 ⊢ 𝐹 Fn (ℤ × ℕ₀)
143		dffn4 6809	. . . . . . . 8 ⊢ (𝐹 Fn (ℤ × ℕ₀) ↔ 𝐹:(ℤ × ℕ₀)–onto→ran 𝐹)
144	142, 143	mpbi 229	. . . . . . 7 ⊢ 𝐹:(ℤ × ℕ₀)–onto→ran 𝐹
145		fodomnum 10049	. . . . . . 7 ⊢ ((ℤ × ℕ₀) ∈ dom card → (𝐹:(ℤ × ℕ₀)–onto→ran 𝐹 → ran 𝐹 ≼ (ℤ × ℕ₀)))
146	140, 144, 145	mp2 9	. . . . . 6 ⊢ ran 𝐹 ≼ (ℤ × ℕ₀)
147		domentr 9006	. . . . . 6 ⊢ ((ran 𝐹 ≼ (ℤ × ℕ₀) ∧ (ℤ × ℕ₀) ≈ ω) → ran 𝐹 ≼ ω)
148	146, 137, 147	mp2an 691	. . . . 5 ⊢ ran 𝐹 ≼ ω
149		domtr 9000	. . . . 5 ⊢ ((𝐺 ≼ ran 𝐹 ∧ ran 𝐹 ≼ ω) → 𝐺 ≼ ω)
150	128, 148, 149	sylancl 587	. . . 4 ⊢ (𝜑 → 𝐺 ≼ ω)
151		brdom2 8975	. . . 4 ⊢ (𝐺 ≼ ω ↔ (𝐺 ≺ ω ∨ 𝐺 ≈ ω))
152	150, 151	sylib 217	. . 3 ⊢ (𝜑 → (𝐺 ≺ ω ∨ 𝐺 ≈ ω))
153	37, 122, 152	mpjaodan 958	. 2 ⊢ (𝜑 → ∪ ([,] “ 𝐺) ∈ dom vol)
154	4, 153	eqeltrd 2834	1 ⊢ (𝜑 → ∪ ([,] “ 𝐴) ∈ dom vol)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 ∨ w3o 1087 = wceq 1542 ∃wex 1782 ∈ wcel 2107 ∀wral 3062 {crab 3433 Vcvv 3475 ∩ cin 3947 ⊆ wss 3948 ∅c0 4322 𝒫 cpw 4602 ⟨cop 4634 ∪ cuni 4908 ∪ ciun 4997 Disj wdisj 5113 class class class wbr 5148 × cxp 5674 dom cdm 5676 ran crn 5677 “ cima 5679 ∘ ccom 5680 Oncon0 6362 Fun wfun 6535 Fn wfn 6536 ⟶wf 6537 –1-1→wf1 6538 –onto→wfo 6539 –1-1-onto→wf1o 6540 ‘cfv 6541 (class class class)co 7406 ∈ cmpo 7408 ωcom 7852 1^st c1st 7970 2^nd c2nd 7971 ≈ cen 8933 ≼ cdom 8934 ≺ csdm 8935 Fincfn 8936 cardccrd 9927 ℝcr 11106 1c1 11108 + caddc 11110 ℝ^*cxr 11244 ≤ cle 11246 − cmin 11441 / cdiv 11868 ℕcn 12209 2c2 12264 ℕ₀cn0 12469 ℤcz 12555 (,)cioo 13321 [,]cicc 13324 seqcseq 13963 ↑cexp 14024 abscabs 15178 volcvol 24972

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 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-inf2 9633 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 ax-pre-sup 11185

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 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-disj 5114 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 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-isom 6550 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-of 7667 df-om 7853 df-1st 7972 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-1o 8463 df-2o 8464 df-oadd 8467 df-omul 8468 df-er 8700 df-map 8819 df-pm 8820 df-en 8937 df-dom 8938 df-sdom 8939 df-fin 8940 df-fi 9403 df-sup 9434 df-inf 9435 df-oi 9502 df-dju 9893 df-card 9931 df-acn 9934 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-div 11869 df-nn 12210 df-2 12272 df-3 12273 df-4 12274 df-n0 12470 df-z 12556 df-uz 12820 df-q 12930 df-rp 12972 df-xneg 13089 df-xadd 13090 df-xmul 13091 df-ioo 13325 df-ico 13327 df-icc 13328 df-fz 13482 df-fzo 13625 df-fl 13754 df-seq 13964 df-exp 14025 df-hash 14288 df-cj 15043 df-re 15044 df-im 15045 df-sqrt 15179 df-abs 15180 df-clim 15429 df-rlim 15430 df-sum 15630 df-rest 17365 df-topgen 17386 df-psmet 20929 df-xmet 20930 df-met 20931 df-bl 20932 df-mopn 20933 df-top 22388 df-topon 22405 df-bases 22441 df-cmp 22883 df-ovol 24973 df-vol 24974

This theorem is referenced by: opnmbllem 25110

W3C validator