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 25517

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 25516	. 2 ⊢ (𝜑 → ∪ ([,] “ 𝐴) = ∪ ([,] “ 𝐺))
5		isfinite 9567	. . . 4 ⊢ (𝐺 ∈ Fin ↔ 𝐺 ≺ ω)
6		iccf 13369	. . . . . 6 ⊢ [,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^
7		ffun 6659	. . . . . 6 ⊢ ([,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^ → Fun [,])
8		funiunfv 7188	. . . . . 6 ⊢ (Fun [,] → ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) = ∪ ([,] “ 𝐺))
9	6, 7, 8	mp2b 10	. . . . 5 ⊢ ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) = ∪ ([,] “ 𝐺)
10		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → 𝐺 ∈ Fin)
11	2	ssrab3 4035	. . . . . . . . . . . . . . 15 ⊢ 𝐺 ⊆ 𝐴
12	11, 3	sstrid 3949	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺 ⊆ ran 𝐹)
13	1	dyadf 25508	. . . . . . . . . . . . . . . 16 ⊢ 𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ))
14		frn 6663	. . . . . . . . . . . . . . . 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 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → 𝐺 ⊆ (ℝ × ℝ))
20	19	sselda 3937	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → 𝑛 ∈ (ℝ × ℝ))
21		1st2nd2 7970	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℝ × ℝ) → 𝑛 = ⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩)
22	20, 21	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → 𝑛 = ⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩)
23	22	fveq2d 6830	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ([,]‘𝑛) = ([,]‘⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩))
24		df-ov 7356	. . . . . . . . 9 ⊢ ((1^st ‘𝑛)[,](2^nd ‘𝑛)) = ([,]‘⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩)
25	23, 24	eqtr4di 2782	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ([,]‘𝑛) = ((1^st ‘𝑛)[,](2^nd ‘𝑛)))
26		xp1st 7963	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℝ × ℝ) → (1^st ‘𝑛) ∈ ℝ)
27	20, 26	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → (1^st ‘𝑛) ∈ ℝ)
28		xp2nd 7964	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℝ × ℝ) → (2^nd ‘𝑛) ∈ ℝ)
29	20, 28	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → (2^nd ‘𝑛) ∈ ℝ)
30		iccmbl 25483	. . . . . . . . 9 ⊢ (((1^st ‘𝑛) ∈ ℝ ∧ (2^nd ‘𝑛) ∈ ℝ) → ((1^st ‘𝑛)[,](2^nd ‘𝑛)) ∈ dom vol)
31	27, 29, 30	syl2anc 584	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ((1^st ‘𝑛)[,](2^nd ‘𝑛)) ∈ dom vol)
32	25, 31	eqeltrd 2828	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ([,]‘𝑛) ∈ dom vol)
33	32	ralrimiva 3121	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → ∀𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol)
34		finiunmbl 25461	. . . . . 6 ⊢ ((𝐺 ∈ Fin ∧ ∀𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol) → ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol)
35	10, 33, 34	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol)
36	9, 35	eqeltrrid 2833	. . . 4 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → ∪ ([,] “ 𝐺) ∈ dom vol)
37	5, 36	sylan2br 595	. . 3 ⊢ ((𝜑 ∧ 𝐺 ≺ ω) → ∪ ([,] “ 𝐺) ∈ dom vol)
38		rnco2 6206	. . . . . . . . 9 ⊢ ran ([,] ∘ 𝑓) = ([,] “ ran 𝑓)
39		f1ofo 6775	. . . . . . . . . . . 12 ⊢ (𝑓:ℕ–1-1-onto→𝐺 → 𝑓:ℕ–onto→𝐺)
40	39	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ–onto→𝐺)
41		forn 6743	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–onto→𝐺 → ran 𝑓 = 𝐺)
42	40, 41	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ran 𝑓 = 𝐺)
43	42	imaeq2d 6015	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ([,] “ ran 𝑓) = ([,] “ 𝐺))
44	38, 43	eqtrid 2776	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ran ([,] ∘ 𝑓) = ([,] “ 𝐺))
45	44	unieqd 4874	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∪ ran ([,] ∘ 𝑓) = ∪ ([,] “ 𝐺))
46		f1of 6768	. . . . . . . . 9 ⊢ (𝑓:ℕ–1-1-onto→𝐺 → 𝑓:ℕ⟶𝐺)
47	12, 15	sstrdi 3950	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ⊆ ( ≤ ∩ (ℝ × ℝ)))
48		fss 6672	. . . . . . . . 9 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝐺 ⊆ ( ≤ ∩ (ℝ × ℝ))) → 𝑓:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
49	46, 47, 48	syl2anr 597	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
50		fss 6672	. . . . . . . . . . . . . 14 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝐺 ⊆ ran 𝐹) → 𝑓:ℕ⟶ran 𝐹)
51	46, 12, 50	syl2anr 597	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ⟶ran 𝐹)
52		simpl 482	. . . . . . . . . . . . 13 ⊢ ((𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ) → 𝑎 ∈ ℕ)
53		ffvelcdm 7019	. . . . . . . . . . . . 13 ⊢ ((𝑓:ℕ⟶ran 𝐹 ∧ 𝑎 ∈ ℕ) → (𝑓‘𝑎) ∈ ran 𝐹)
54	51, 52, 53	syl2an 596	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑎) ∈ ran 𝐹)
55		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ) → 𝑏 ∈ ℕ)
56		ffvelcdm 7019	. . . . . . . . . . . . 13 ⊢ ((𝑓:ℕ⟶ran 𝐹 ∧ 𝑏 ∈ ℕ) → (𝑓‘𝑏) ∈ ran 𝐹)
57	51, 55, 56	syl2an 596	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑏) ∈ ran 𝐹)
58	1	dyaddisj 25513	. . . . . . . . . . . 12 ⊢ (((𝑓‘𝑎) ∈ ran 𝐹 ∧ (𝑓‘𝑏) ∈ ran 𝐹) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) ∨ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
59	54, 57, 58	syl2anc 584	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) ∨ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
60		fveq2 6826	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝑓‘𝑏) → ([,]‘𝑤) = ([,]‘(𝑓‘𝑏)))
61	60	sseq2d 3970	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑏) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏))))
62		eqeq2 2741	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑏) → ((𝑓‘𝑎) = 𝑤 ↔ (𝑓‘𝑎) = (𝑓‘𝑏)))
63	61, 62	imbi12d 344	. . . . . . . . . . . . . 14 ⊢ (𝑤 = (𝑓‘𝑏) → ((([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤) ↔ (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) → (𝑓‘𝑎) = (𝑓‘𝑏))))
64	46	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ⟶𝐺)
65		ffvelcdm 7019	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝑎 ∈ ℕ) → (𝑓‘𝑎) ∈ 𝐺)
66	64, 52, 65	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑎) ∈ 𝐺)
67		fveq2 6826	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝑓‘𝑎) → ([,]‘𝑧) = ([,]‘(𝑓‘𝑎)))
68	67	sseq1d 3969	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑎) → (([,]‘𝑧) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤)))
69		eqeq1 2733	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑎) → (𝑧 = 𝑤 ↔ (𝑓‘𝑎) = 𝑤))
70	68, 69	imbi12d 344	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = (𝑓‘𝑎) → ((([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤)))
71	70	ralbidv 3152	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = (𝑓‘𝑎) → (∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤)))
72	71, 2	elrab2 3653	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑎) ∈ 𝐺 ↔ ((𝑓‘𝑎) ∈ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤)))
73	72	simprbi 496	. . . . . . . . . . . . . . 15 ⊢ ((𝑓‘𝑎) ∈ 𝐺 → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤))
74	66, 73	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤))
75		ffvelcdm 7019	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝑏 ∈ ℕ) → (𝑓‘𝑏) ∈ 𝐺)
76	64, 55, 75	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑏) ∈ 𝐺)
77	11, 76	sselid 3935	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑏) ∈ 𝐴)
78	63, 74, 77	rspcdva 3580	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) → (𝑓‘𝑎) = (𝑓‘𝑏)))
79		f1of1 6767	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:ℕ–1-1-onto→𝐺 → 𝑓:ℕ–1-1→𝐺)
80	79	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ–1-1→𝐺)
81		f1fveq 7203	. . . . . . . . . . . . . . 15 ⊢ ((𝑓:ℕ–1-1→𝐺 ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑓‘𝑎) = (𝑓‘𝑏) ↔ 𝑎 = 𝑏))
82	80, 81	sylan 580	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑓‘𝑎) = (𝑓‘𝑏) ↔ 𝑎 = 𝑏))
83		orc 867	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑏 → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
84	82, 83	biimtrdi 253	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑓‘𝑎) = (𝑓‘𝑏) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
85	78, 84	syld 47	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
86		fveq2 6826	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝑓‘𝑎) → ([,]‘𝑤) = ([,]‘(𝑓‘𝑎)))
87	86	sseq2d 3970	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑎) → (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎))))
88		eqeq2 2741	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝑓‘𝑎) → ((𝑓‘𝑏) = 𝑤 ↔ (𝑓‘𝑏) = (𝑓‘𝑎)))
89		eqcom 2736	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑏) = (𝑓‘𝑎) ↔ (𝑓‘𝑎) = (𝑓‘𝑏))
90	88, 89	bitrdi 287	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑎) → ((𝑓‘𝑏) = 𝑤 ↔ (𝑓‘𝑎) = (𝑓‘𝑏)))
91	87, 90	imbi12d 344	. . . . . . . . . . . . . 14 ⊢ (𝑤 = (𝑓‘𝑎) → ((([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤) ↔ (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) → (𝑓‘𝑎) = (𝑓‘𝑏))))
92		fveq2 6826	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝑓‘𝑏) → ([,]‘𝑧) = ([,]‘(𝑓‘𝑏)))
93	92	sseq1d 3969	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑏) → (([,]‘𝑧) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤)))
94		eqeq1 2733	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑏) → (𝑧 = 𝑤 ↔ (𝑓‘𝑏) = 𝑤))
95	93, 94	imbi12d 344	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = (𝑓‘𝑏) → ((([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤)))
96	95	ralbidv 3152	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = (𝑓‘𝑏) → (∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤)))
97	96, 2	elrab2 3653	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑏) ∈ 𝐺 ↔ ((𝑓‘𝑏) ∈ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤)))
98	97	simprbi 496	. . . . . . . . . . . . . . 15 ⊢ ((𝑓‘𝑏) ∈ 𝐺 → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤))
99	76, 98	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤))
100	11, 66	sselid 3935	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑎) ∈ 𝐴)
101	91, 99, 100	rspcdva 3580	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) → (𝑓‘𝑎) = (𝑓‘𝑏)))
102	101, 84	syld 47	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
103		olc 868	. . . . . . . . . . . . 13 ⊢ ((((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅ → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
104	103	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅ → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
105	85, 102, 104	3jaod 1431	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) ∨ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
106	59, 105	mpd 15	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
107	106	ralrimivva 3172	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∀𝑎 ∈ ℕ ∀𝑏 ∈ ℕ (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
108		2fveq3 6831	. . . . . . . . . 10 ⊢ (𝑎 = 𝑏 → ((,)‘(𝑓‘𝑎)) = ((,)‘(𝑓‘𝑏)))
109	108	disjor 5077	. . . . . . . . 9 ⊢ (Disj 𝑎 ∈ ℕ ((,)‘(𝑓‘𝑎)) ↔ ∀𝑎 ∈ ℕ ∀𝑏 ∈ ℕ (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
110	107, 109	sylibr 234	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → Disj 𝑎 ∈ ℕ ((,)‘(𝑓‘𝑎)))
111		eqid 2729	. . . . . . . 8 ⊢ seq1( + , ((abs ∘ − ) ∘ 𝑓)) = seq1( + , ((abs ∘ − ) ∘ 𝑓))
112	49, 110, 111	uniiccmbl 25507	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∪ ran ([,] ∘ 𝑓) ∈ dom vol)
113	45, 112	eqeltrrd 2829	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∪ ([,] “ 𝐺) ∈ dom vol)
114	113	ex 412	. . . . 5 ⊢ (𝜑 → (𝑓:ℕ–1-1-onto→𝐺 → ∪ ([,] “ 𝐺) ∈ dom vol))
115	114	exlimdv 1933	. . . 4 ⊢ (𝜑 → (∃𝑓 𝑓:ℕ–1-1-onto→𝐺 → ∪ ([,] “ 𝐺) ∈ dom vol))
116		nnenom 13905	. . . . . 6 ⊢ ℕ ≈ ω
117		ensym 8935	. . . . . 6 ⊢ (𝐺 ≈ ω → ω ≈ 𝐺)
118		entr 8938	. . . . . 6 ⊢ ((ℕ ≈ ω ∧ ω ≈ 𝐺) → ℕ ≈ 𝐺)
119	116, 117, 118	sylancr 587	. . . . 5 ⊢ (𝐺 ≈ ω → ℕ ≈ 𝐺)
120		bren 8889	. . . . 5 ⊢ (ℕ ≈ 𝐺 ↔ ∃𝑓 𝑓:ℕ–1-1-onto→𝐺)
121	119, 120	sylib 218	. . . 4 ⊢ (𝐺 ≈ ω → ∃𝑓 𝑓:ℕ–1-1-onto→𝐺)
122	115, 121	impel 505	. . 3 ⊢ ((𝜑 ∧ 𝐺 ≈ ω) → ∪ ([,] “ 𝐺) ∈ dom vol)
123		reex 11119	. . . . . . . . 9 ⊢ ℝ ∈ V
124	123, 123	xpex 7693	. . . . . . . 8 ⊢ (ℝ × ℝ) ∈ V
125	124	inex2 5260	. . . . . . 7 ⊢ ( ≤ ∩ (ℝ × ℝ)) ∈ V
126	125, 15	ssexi 5264	. . . . . 6 ⊢ ran 𝐹 ∈ V
127		ssdomg 8932	. . . . . 6 ⊢ (ran 𝐹 ∈ V → (𝐺 ⊆ ran 𝐹 → 𝐺 ≼ ran 𝐹))
128	126, 12, 127	mpsyl 68	. . . . 5 ⊢ (𝜑 → 𝐺 ≼ ran 𝐹)
129		omelon 9561	. . . . . . . 8 ⊢ ω ∈ On
130		znnen 16139	. . . . . . . . . . . 12 ⊢ ℤ ≈ ℕ
131	130, 116	entri 8940	. . . . . . . . . . 11 ⊢ ℤ ≈ ω
132		nn0ennn 13904	. . . . . . . . . . . 12 ⊢ ℕ₀ ≈ ℕ
133	132, 116	entri 8940	. . . . . . . . . . 11 ⊢ ℕ₀ ≈ ω
134		xpen 9064	. . . . . . . . . . 11 ⊢ ((ℤ ≈ ω ∧ ℕ₀ ≈ ω) → (ℤ × ℕ₀) ≈ (ω × ω))
135	131, 133, 134	mp2an 692	. . . . . . . . . 10 ⊢ (ℤ × ℕ₀) ≈ (ω × ω)
136		xpomen 9928	. . . . . . . . . 10 ⊢ (ω × ω) ≈ ω
137	135, 136	entri 8940	. . . . . . . . 9 ⊢ (ℤ × ℕ₀) ≈ ω
138	137	ensymi 8936	. . . . . . . 8 ⊢ ω ≈ (ℤ × ℕ₀)
139		isnumi 9861	. . . . . . . 8 ⊢ ((ω ∈ On ∧ ω ≈ (ℤ × ℕ₀)) → (ℤ × ℕ₀) ∈ dom card)
140	129, 138, 139	mp2an 692	. . . . . . 7 ⊢ (ℤ × ℕ₀) ∈ dom card
141		ffn 6656	. . . . . . . . 9 ⊢ (𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ)) → 𝐹 Fn (ℤ × ℕ₀))
142	13, 141	ax-mp 5	. . . . . . . 8 ⊢ 𝐹 Fn (ℤ × ℕ₀)
143		dffn4 6746	. . . . . . . 8 ⊢ (𝐹 Fn (ℤ × ℕ₀) ↔ 𝐹:(ℤ × ℕ₀)–onto→ran 𝐹)
144	142, 143	mpbi 230	. . . . . . 7 ⊢ 𝐹:(ℤ × ℕ₀)–onto→ran 𝐹
145		fodomnum 9970	. . . . . . 7 ⊢ ((ℤ × ℕ₀) ∈ dom card → (𝐹:(ℤ × ℕ₀)–onto→ran 𝐹 → ran 𝐹 ≼ (ℤ × ℕ₀)))
146	140, 144, 145	mp2 9	. . . . . 6 ⊢ ran 𝐹 ≼ (ℤ × ℕ₀)
147		domentr 8945	. . . . . 6 ⊢ ((ran 𝐹 ≼ (ℤ × ℕ₀) ∧ (ℤ × ℕ₀) ≈ ω) → ran 𝐹 ≼ ω)
148	146, 137, 147	mp2an 692	. . . . 5 ⊢ ran 𝐹 ≼ ω
149		domtr 8939	. . . . 5 ⊢ ((𝐺 ≼ ran 𝐹 ∧ ran 𝐹 ≼ ω) → 𝐺 ≼ ω)
150	128, 148, 149	sylancl 586	. . . 4 ⊢ (𝜑 → 𝐺 ≼ ω)
151		brdom2 8914	. . . 4 ⊢ (𝐺 ≼ ω ↔ (𝐺 ≺ ω ∨ 𝐺 ≈ ω))
152	150, 151	sylib 218	. . 3 ⊢ (𝜑 → (𝐺 ≺ ω ∨ 𝐺 ≈ ω))
153	37, 122, 152	mpjaodan 960	. 2 ⊢ (𝜑 → ∪ ([,] “ 𝐺) ∈ dom vol)
154	4, 153	eqeltrd 2828	1 ⊢ (𝜑 → ∪ ([,] “ 𝐴) ∈ dom vol)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∨ w3o 1085 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ∀wral 3044 {crab 3396 Vcvv 3438 ∩ cin 3904 ⊆ wss 3905 ∅c0 4286 𝒫 cpw 4553 ⟨cop 4585 ∪ cuni 4861 ∪ ciun 4944 Disj wdisj 5062 class class class wbr 5095 × cxp 5621 dom cdm 5623 ran crn 5624 “ cima 5626 ∘ ccom 5627 Oncon0 6311 Fun wfun 6480 Fn wfn 6481 ⟶wf 6482 –1-1→wf1 6483 –onto→wfo 6484 –1-1-onto→wf1o 6485 ‘cfv 6486 (class class class)co 7353 ∈ cmpo 7355 ωcom 7806 1^st c1st 7929 2^nd c2nd 7930 ≈ cen 8876 ≼ cdom 8877 ≺ csdm 8878 Fincfn 8879 cardccrd 9850 ℝcr 11027 1c1 11029 + caddc 11031 ℝ^*cxr 11167 ≤ cle 11169 − cmin 11365 / cdiv 11795 ℕcn 12146 2c2 12201 ℕ₀cn0 12402 ℤcz 12489 (,)cioo 13266 [,]cicc 13269 seqcseq 13926 ↑cexp 13986 abscabs 15159 volcvol 25380

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-inf2 9556 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-pre-sup 11106

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3345 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-int 4900 df-iun 4946 df-disj 5063 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-se 5577 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-isom 6495 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-of 7617 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-oadd 8399 df-omul 8400 df-er 8632 df-map 8762 df-pm 8763 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-fi 9320 df-sup 9351 df-inf 9352 df-oi 9421 df-dju 9816 df-card 9854 df-acn 9857 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-div 11796 df-nn 12147 df-2 12209 df-3 12210 df-4 12211 df-n0 12403 df-z 12490 df-uz 12754 df-q 12868 df-rp 12912 df-xneg 13032 df-xadd 13033 df-xmul 13034 df-ioo 13270 df-ico 13272 df-icc 13273 df-fz 13429 df-fzo 13576 df-fl 13714 df-seq 13927 df-exp 13987 df-hash 14256 df-cj 15024 df-re 15025 df-im 15026 df-sqrt 15160 df-abs 15161 df-clim 15413 df-rlim 15414 df-sum 15612 df-rest 17344 df-topgen 17365 df-psmet 21271 df-xmet 21272 df-met 21273 df-bl 21274 df-mopn 21275 df-top 22797 df-topon 22814 df-bases 22849 df-cmp 23290 df-ovol 25381 df-vol 25382

This theorem is referenced by: opnmbllem 25518

W3C validator