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 24964

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 24963	. 2 ⊢ (𝜑 → ∪ ([,] “ 𝐴) = ∪ ([,] “ 𝐺))
5		isfinite 9588	. . . 4 ⊢ (𝐺 ∈ Fin ↔ 𝐺 ≺ ω)
6		iccf 13365	. . . . . 6 ⊢ [,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^
7		ffun 6671	. . . . . 6 ⊢ ([,]:(ℝ^* × ℝ^)⟶𝒫 ℝ^ → Fun [,])
8		funiunfv 7195	. . . . . 6 ⊢ (Fun [,] → ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) = ∪ ([,] “ 𝐺))
9	6, 7, 8	mp2b 10	. . . . 5 ⊢ ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) = ∪ ([,] “ 𝐺)
10		simpr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → 𝐺 ∈ Fin)
11	2	ssrab3 4040	. . . . . . . . . . . . . . 15 ⊢ 𝐺 ⊆ 𝐴
12	11, 3	sstrid 3955	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺 ⊆ ran 𝐹)
13	1	dyadf 24955	. . . . . . . . . . . . . . . 16 ⊢ 𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ))
14		frn 6675	. . . . . . . . . . . . . . . 16 ⊢ (𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ)) → ran 𝐹 ⊆ ( ≤ ∩ (ℝ × ℝ)))
15	13, 14	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ ran 𝐹 ⊆ ( ≤ ∩ (ℝ × ℝ))
16		inss2 4189	. . . . . . . . . . . . . . 15 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ)
17	15, 16	sstri 3953	. . . . . . . . . . . . . 14 ⊢ ran 𝐹 ⊆ (ℝ × ℝ)
18	12, 17	sstrdi 3956	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺 ⊆ (ℝ × ℝ))
19	18	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → 𝐺 ⊆ (ℝ × ℝ))
20	19	sselda 3944	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → 𝑛 ∈ (ℝ × ℝ))
21		1st2nd2 7960	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℝ × ℝ) → 𝑛 = ⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩)
22	20, 21	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → 𝑛 = ⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩)
23	22	fveq2d 6846	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ([,]‘𝑛) = ([,]‘⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩))
24		df-ov 7360	. . . . . . . . 9 ⊢ ((1^st ‘𝑛)[,](2^nd ‘𝑛)) = ([,]‘⟨(1^st ‘𝑛), (2^nd ‘𝑛)⟩)
25	23, 24	eqtr4di 2794	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ([,]‘𝑛) = ((1^st ‘𝑛)[,](2^nd ‘𝑛)))
26		xp1st 7953	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℝ × ℝ) → (1^st ‘𝑛) ∈ ℝ)
27	20, 26	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → (1^st ‘𝑛) ∈ ℝ)
28		xp2nd 7954	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℝ × ℝ) → (2^nd ‘𝑛) ∈ ℝ)
29	20, 28	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → (2^nd ‘𝑛) ∈ ℝ)
30		iccmbl 24930	. . . . . . . . 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 2838	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐺 ∈ Fin) ∧ 𝑛 ∈ 𝐺) → ([,]‘𝑛) ∈ dom vol)
33	32	ralrimiva 3143	. . . . . 6 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → ∀𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol)
34		finiunmbl 24908	. . . . . 6 ⊢ ((𝐺 ∈ Fin ∧ ∀𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol) → ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol)
35	10, 33, 34	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → ∪ 𝑛 ∈ 𝐺 ([,]‘𝑛) ∈ dom vol)
36	9, 35	eqeltrrid 2843	. . . 4 ⊢ ((𝜑 ∧ 𝐺 ∈ Fin) → ∪ ([,] “ 𝐺) ∈ dom vol)
37	5, 36	sylan2br 595	. . 3 ⊢ ((𝜑 ∧ 𝐺 ≺ ω) → ∪ ([,] “ 𝐺) ∈ dom vol)
38		rnco2 6205	. . . . . . . . 9 ⊢ ran ([,] ∘ 𝑓) = ([,] “ ran 𝑓)
39		f1ofo 6791	. . . . . . . . . . . 12 ⊢ (𝑓:ℕ–1-1-onto→𝐺 → 𝑓:ℕ–onto→𝐺)
40	39	adantl 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ–onto→𝐺)
41		forn 6759	. . . . . . . . . . 11 ⊢ (𝑓:ℕ–onto→𝐺 → ran 𝑓 = 𝐺)
42	40, 41	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ran 𝑓 = 𝐺)
43	42	imaeq2d 6013	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ([,] “ ran 𝑓) = ([,] “ 𝐺))
44	38, 43	eqtrid 2788	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ran ([,] ∘ 𝑓) = ([,] “ 𝐺))
45	44	unieqd 4879	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∪ ran ([,] ∘ 𝑓) = ∪ ([,] “ 𝐺))
46		f1of 6784	. . . . . . . . 9 ⊢ (𝑓:ℕ–1-1-onto→𝐺 → 𝑓:ℕ⟶𝐺)
47	12, 15	sstrdi 3956	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ⊆ ( ≤ ∩ (ℝ × ℝ)))
48		fss 6685	. . . . . . . . 9 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝐺 ⊆ ( ≤ ∩ (ℝ × ℝ))) → 𝑓:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
49	46, 47, 48	syl2anr 597	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
50		fss 6685	. . . . . . . . . . . . . 14 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝐺 ⊆ ran 𝐹) → 𝑓:ℕ⟶ran 𝐹)
51	46, 12, 50	syl2anr 597	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ⟶ran 𝐹)
52		simpl 483	. . . . . . . . . . . . 13 ⊢ ((𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ) → 𝑎 ∈ ℕ)
53		ffvelcdm 7032	. . . . . . . . . . . . 13 ⊢ ((𝑓:ℕ⟶ran 𝐹 ∧ 𝑎 ∈ ℕ) → (𝑓‘𝑎) ∈ ran 𝐹)
54	51, 52, 53	syl2an 596	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑎) ∈ ran 𝐹)
55		simpr 485	. . . . . . . . . . . . 13 ⊢ ((𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ) → 𝑏 ∈ ℕ)
56		ffvelcdm 7032	. . . . . . . . . . . . 13 ⊢ ((𝑓:ℕ⟶ran 𝐹 ∧ 𝑏 ∈ ℕ) → (𝑓‘𝑏) ∈ ran 𝐹)
57	51, 55, 56	syl2an 596	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑏) ∈ ran 𝐹)
58	1	dyaddisj 24960	. . . . . . . . . . . 12 ⊢ (((𝑓‘𝑎) ∈ ran 𝐹 ∧ (𝑓‘𝑏) ∈ ran 𝐹) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) ∨ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
59	54, 57, 58	syl2anc 584	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) ∨ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
60		fveq2 6842	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝑓‘𝑏) → ([,]‘𝑤) = ([,]‘(𝑓‘𝑏)))
61	60	sseq2d 3976	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑏) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏))))
62		eqeq2 2748	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑏) → ((𝑓‘𝑎) = 𝑤 ↔ (𝑓‘𝑎) = (𝑓‘𝑏)))
63	61, 62	imbi12d 344	. . . . . . . . . . . . . 14 ⊢ (𝑤 = (𝑓‘𝑏) → ((([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤) ↔ (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) → (𝑓‘𝑎) = (𝑓‘𝑏))))
64	46	adantl 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ⟶𝐺)
65		ffvelcdm 7032	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝑎 ∈ ℕ) → (𝑓‘𝑎) ∈ 𝐺)
66	64, 52, 65	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑎) ∈ 𝐺)
67		fveq2 6842	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝑓‘𝑎) → ([,]‘𝑧) = ([,]‘(𝑓‘𝑎)))
68	67	sseq1d 3975	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑎) → (([,]‘𝑧) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤)))
69		eqeq1 2740	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑎) → (𝑧 = 𝑤 ↔ (𝑓‘𝑎) = 𝑤))
70	68, 69	imbi12d 344	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = (𝑓‘𝑎) → ((([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤)))
71	70	ralbidv 3174	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = (𝑓‘𝑎) → (∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤)))
72	71, 2	elrab2 3648	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑎) ∈ 𝐺 ↔ ((𝑓‘𝑎) ∈ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤)))
73	72	simprbi 497	. . . . . . . . . . . . . . 15 ⊢ ((𝑓‘𝑎) ∈ 𝐺 → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤))
74	66, 73	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘𝑤) → (𝑓‘𝑎) = 𝑤))
75		ffvelcdm 7032	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓:ℕ⟶𝐺 ∧ 𝑏 ∈ ℕ) → (𝑓‘𝑏) ∈ 𝐺)
76	64, 55, 75	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑏) ∈ 𝐺)
77	11, 76	sselid 3942	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑏) ∈ 𝐴)
78	63, 74, 77	rspcdva 3582	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) → (𝑓‘𝑎) = (𝑓‘𝑏)))
79		f1of1 6783	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:ℕ–1-1-onto→𝐺 → 𝑓:ℕ–1-1→𝐺)
80	79	adantl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → 𝑓:ℕ–1-1→𝐺)
81		f1fveq 7209	. . . . . . . . . . . . . . 15 ⊢ ((𝑓:ℕ–1-1→𝐺 ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑓‘𝑎) = (𝑓‘𝑏) ↔ 𝑎 = 𝑏))
82	80, 81	sylan 580	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑓‘𝑎) = (𝑓‘𝑏) ↔ 𝑎 = 𝑏))
83		orc 865	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑏 → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
84	82, 83	syl6bi 252	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑓‘𝑎) = (𝑓‘𝑏) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
85	78, 84	syld 47	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
86		fveq2 6842	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝑓‘𝑎) → ([,]‘𝑤) = ([,]‘(𝑓‘𝑎)))
87	86	sseq2d 3976	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑎) → (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎))))
88		eqeq2 2748	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = (𝑓‘𝑎) → ((𝑓‘𝑏) = 𝑤 ↔ (𝑓‘𝑏) = (𝑓‘𝑎)))
89		eqcom 2743	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑏) = (𝑓‘𝑎) ↔ (𝑓‘𝑎) = (𝑓‘𝑏))
90	88, 89	bitrdi 286	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = (𝑓‘𝑎) → ((𝑓‘𝑏) = 𝑤 ↔ (𝑓‘𝑎) = (𝑓‘𝑏)))
91	87, 90	imbi12d 344	. . . . . . . . . . . . . 14 ⊢ (𝑤 = (𝑓‘𝑎) → ((([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤) ↔ (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) → (𝑓‘𝑎) = (𝑓‘𝑏))))
92		fveq2 6842	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝑓‘𝑏) → ([,]‘𝑧) = ([,]‘(𝑓‘𝑏)))
93	92	sseq1d 3975	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑏) → (([,]‘𝑧) ⊆ ([,]‘𝑤) ↔ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤)))
94		eqeq1 2740	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = (𝑓‘𝑏) → (𝑧 = 𝑤 ↔ (𝑓‘𝑏) = 𝑤))
95	93, 94	imbi12d 344	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = (𝑓‘𝑏) → ((([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤)))
96	95	ralbidv 3174	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = (𝑓‘𝑏) → (∀𝑤 ∈ 𝐴 (([,]‘𝑧) ⊆ ([,]‘𝑤) → 𝑧 = 𝑤) ↔ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤)))
97	96, 2	elrab2 3648	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓‘𝑏) ∈ 𝐺 ↔ ((𝑓‘𝑏) ∈ 𝐴 ∧ ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤)))
98	97	simprbi 497	. . . . . . . . . . . . . . 15 ⊢ ((𝑓‘𝑏) ∈ 𝐺 → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤))
99	76, 98	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ∀𝑤 ∈ 𝐴 (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘𝑤) → (𝑓‘𝑏) = 𝑤))
100	11, 66	sselid 3942	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑓‘𝑎) ∈ 𝐴)
101	91, 99, 100	rspcdva 3582	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) → (𝑓‘𝑎) = (𝑓‘𝑏)))
102	101, 84	syld 47	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
103		olc 866	. . . . . . . . . . . . 13 ⊢ ((((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅ → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
104	103	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅ → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
105	85, 102, 104	3jaod 1428	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((([,]‘(𝑓‘𝑎)) ⊆ ([,]‘(𝑓‘𝑏)) ∨ ([,]‘(𝑓‘𝑏)) ⊆ ([,]‘(𝑓‘𝑎)) ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅)))
106	59, 105	mpd 15	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
107	106	ralrimivva 3197	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∀𝑎 ∈ ℕ ∀𝑏 ∈ ℕ (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
108		2fveq3 6847	. . . . . . . . . 10 ⊢ (𝑎 = 𝑏 → ((,)‘(𝑓‘𝑎)) = ((,)‘(𝑓‘𝑏)))
109	108	disjor 5085	. . . . . . . . 9 ⊢ (Disj 𝑎 ∈ ℕ ((,)‘(𝑓‘𝑎)) ↔ ∀𝑎 ∈ ℕ ∀𝑏 ∈ ℕ (𝑎 = 𝑏 ∨ (((,)‘(𝑓‘𝑎)) ∩ ((,)‘(𝑓‘𝑏))) = ∅))
110	107, 109	sylibr 233	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → Disj 𝑎 ∈ ℕ ((,)‘(𝑓‘𝑎)))
111		eqid 2736	. . . . . . . 8 ⊢ seq1( + , ((abs ∘ − ) ∘ 𝑓)) = seq1( + , ((abs ∘ − ) ∘ 𝑓))
112	49, 110, 111	uniiccmbl 24954	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∪ ran ([,] ∘ 𝑓) ∈ dom vol)
113	45, 112	eqeltrrd 2839	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓:ℕ–1-1-onto→𝐺) → ∪ ([,] “ 𝐺) ∈ dom vol)
114	113	ex 413	. . . . 5 ⊢ (𝜑 → (𝑓:ℕ–1-1-onto→𝐺 → ∪ ([,] “ 𝐺) ∈ dom vol))
115	114	exlimdv 1936	. . . 4 ⊢ (𝜑 → (∃𝑓 𝑓:ℕ–1-1-onto→𝐺 → ∪ ([,] “ 𝐺) ∈ dom vol))
116		nnenom 13885	. . . . . 6 ⊢ ℕ ≈ ω
117		ensym 8943	. . . . . 6 ⊢ (𝐺 ≈ ω → ω ≈ 𝐺)
118		entr 8946	. . . . . 6 ⊢ ((ℕ ≈ ω ∧ ω ≈ 𝐺) → ℕ ≈ 𝐺)
119	116, 117, 118	sylancr 587	. . . . 5 ⊢ (𝐺 ≈ ω → ℕ ≈ 𝐺)
120		bren 8893	. . . . 5 ⊢ (ℕ ≈ 𝐺 ↔ ∃𝑓 𝑓:ℕ–1-1-onto→𝐺)
121	119, 120	sylib 217	. . . 4 ⊢ (𝐺 ≈ ω → ∃𝑓 𝑓:ℕ–1-1-onto→𝐺)
122	115, 121	impel 506	. . 3 ⊢ ((𝜑 ∧ 𝐺 ≈ ω) → ∪ ([,] “ 𝐺) ∈ dom vol)
123		reex 11142	. . . . . . . . 9 ⊢ ℝ ∈ V
124	123, 123	xpex 7687	. . . . . . . 8 ⊢ (ℝ × ℝ) ∈ V
125	124	inex2 5275	. . . . . . 7 ⊢ ( ≤ ∩ (ℝ × ℝ)) ∈ V
126	125, 15	ssexi 5279	. . . . . 6 ⊢ ran 𝐹 ∈ V
127		ssdomg 8940	. . . . . 6 ⊢ (ran 𝐹 ∈ V → (𝐺 ⊆ ran 𝐹 → 𝐺 ≼ ran 𝐹))
128	126, 12, 127	mpsyl 68	. . . . 5 ⊢ (𝜑 → 𝐺 ≼ ran 𝐹)
129		omelon 9582	. . . . . . . 8 ⊢ ω ∈ On
130		znnen 16094	. . . . . . . . . . . 12 ⊢ ℤ ≈ ℕ
131	130, 116	entri 8948	. . . . . . . . . . 11 ⊢ ℤ ≈ ω
132		nn0ennn 13884	. . . . . . . . . . . 12 ⊢ ℕ₀ ≈ ℕ
133	132, 116	entri 8948	. . . . . . . . . . 11 ⊢ ℕ₀ ≈ ω
134		xpen 9084	. . . . . . . . . . 11 ⊢ ((ℤ ≈ ω ∧ ℕ₀ ≈ ω) → (ℤ × ℕ₀) ≈ (ω × ω))
135	131, 133, 134	mp2an 690	. . . . . . . . . 10 ⊢ (ℤ × ℕ₀) ≈ (ω × ω)
136		xpomen 9951	. . . . . . . . . 10 ⊢ (ω × ω) ≈ ω
137	135, 136	entri 8948	. . . . . . . . 9 ⊢ (ℤ × ℕ₀) ≈ ω
138	137	ensymi 8944	. . . . . . . 8 ⊢ ω ≈ (ℤ × ℕ₀)
139		isnumi 9882	. . . . . . . 8 ⊢ ((ω ∈ On ∧ ω ≈ (ℤ × ℕ₀)) → (ℤ × ℕ₀) ∈ dom card)
140	129, 138, 139	mp2an 690	. . . . . . 7 ⊢ (ℤ × ℕ₀) ∈ dom card
141		ffn 6668	. . . . . . . . 9 ⊢ (𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ)) → 𝐹 Fn (ℤ × ℕ₀))
142	13, 141	ax-mp 5	. . . . . . . 8 ⊢ 𝐹 Fn (ℤ × ℕ₀)
143		dffn4 6762	. . . . . . . 8 ⊢ (𝐹 Fn (ℤ × ℕ₀) ↔ 𝐹:(ℤ × ℕ₀)–onto→ran 𝐹)
144	142, 143	mpbi 229	. . . . . . 7 ⊢ 𝐹:(ℤ × ℕ₀)–onto→ran 𝐹
145		fodomnum 9993	. . . . . . 7 ⊢ ((ℤ × ℕ₀) ∈ dom card → (𝐹:(ℤ × ℕ₀)–onto→ran 𝐹 → ran 𝐹 ≼ (ℤ × ℕ₀)))
146	140, 144, 145	mp2 9	. . . . . 6 ⊢ ran 𝐹 ≼ (ℤ × ℕ₀)
147		domentr 8953	. . . . . 6 ⊢ ((ran 𝐹 ≼ (ℤ × ℕ₀) ∧ (ℤ × ℕ₀) ≈ ω) → ran 𝐹 ≼ ω)
148	146, 137, 147	mp2an 690	. . . . 5 ⊢ ran 𝐹 ≼ ω
149		domtr 8947	. . . . 5 ⊢ ((𝐺 ≼ ran 𝐹 ∧ ran 𝐹 ≼ ω) → 𝐺 ≼ ω)
150	128, 148, 149	sylancl 586	. . . 4 ⊢ (𝜑 → 𝐺 ≼ ω)
151		brdom2 8922	. . . 4 ⊢ (𝐺 ≼ ω ↔ (𝐺 ≺ ω ∨ 𝐺 ≈ ω))
152	150, 151	sylib 217	. . 3 ⊢ (𝜑 → (𝐺 ≺ ω ∨ 𝐺 ≈ ω))
153	37, 122, 152	mpjaodan 957	. 2 ⊢ (𝜑 → ∪ ([,] “ 𝐺) ∈ dom vol)
154	4, 153	eqeltrd 2838	1 ⊢ (𝜑 → ∪ ([,] “ 𝐴) ∈ dom vol)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 845 ∨ w3o 1086 = wceq 1541 ∃wex 1781 ∈ wcel 2106 ∀wral 3064 {crab 3407 Vcvv 3445 ∩ cin 3909 ⊆ wss 3910 ∅c0 4282 𝒫 cpw 4560 ⟨cop 4592 ∪ cuni 4865 ∪ ciun 4954 Disj wdisj 5070 class class class wbr 5105 × cxp 5631 dom cdm 5633 ran crn 5634 “ cima 5636 ∘ ccom 5637 Oncon0 6317 Fun wfun 6490 Fn wfn 6491 ⟶wf 6492 –1-1→wf1 6493 –onto→wfo 6494 –1-1-onto→wf1o 6495 ‘cfv 6496 (class class class)co 7357 ∈ cmpo 7359 ωcom 7802 1^st c1st 7919 2^nd c2nd 7920 ≈ cen 8880 ≼ cdom 8881 ≺ csdm 8882 Fincfn 8883 cardccrd 9871 ℝcr 11050 1c1 11052 + caddc 11054 ℝ^*cxr 11188 ≤ cle 11190 − cmin 11385 / cdiv 11812 ℕcn 12153 2c2 12208 ℕ₀cn0 12413 ℤcz 12499 (,)cioo 13264 [,]cicc 13267 seqcseq 13906 ↑cexp 13967 abscabs 15119 volcvol 24827

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-inf2 9577 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128 ax-pre-sup 11129

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-int 4908 df-iun 4956 df-disj 5071 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-se 5589 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-isom 6505 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-of 7617 df-om 7803 df-1st 7921 df-2nd 7922 df-frecs 8212 df-wrecs 8243 df-recs 8317 df-rdg 8356 df-1o 8412 df-2o 8413 df-oadd 8416 df-omul 8417 df-er 8648 df-map 8767 df-pm 8768 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fi 9347 df-sup 9378 df-inf 9379 df-oi 9446 df-dju 9837 df-card 9875 df-acn 9878 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-div 11813 df-nn 12154 df-2 12216 df-3 12217 df-4 12218 df-n0 12414 df-z 12500 df-uz 12764 df-q 12874 df-rp 12916 df-xneg 13033 df-xadd 13034 df-xmul 13035 df-ioo 13268 df-ico 13270 df-icc 13271 df-fz 13425 df-fzo 13568 df-fl 13697 df-seq 13907 df-exp 13968 df-hash 14231 df-cj 14984 df-re 14985 df-im 14986 df-sqrt 15120 df-abs 15121 df-clim 15370 df-rlim 15371 df-sum 15571 df-rest 17304 df-topgen 17325 df-psmet 20788 df-xmet 20789 df-met 20790 df-bl 20791 df-mopn 20792 df-top 22243 df-topon 22260 df-bases 22296 df-cmp 22738 df-ovol 24828 df-vol 24829

This theorem is referenced by: opnmbllem 24965

W3C validator