Theorem vitalilem2 25836

Description: Lemma for vitali 25840. (Contributed by Mario Carneiro, 16-Jun-2014.)

Hypotheses

Ref	Expression
vitali.1	⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (0[,]1) ∧ 𝑦 ∈ (0[,]1)) ∧ (𝑥 − 𝑦) ∈ ℚ)}
vitali.2	⊢ 𝑆 = ((0[,]1) / ∼ )
vitali.3	⊢ (𝜑 → 𝐹 Fn 𝑆)
vitali.4	⊢ (𝜑 → ∀𝑧 ∈ 𝑆 (𝑧 ≠ ∅ → (𝐹‘𝑧) ∈ 𝑧))
vitali.5	⊢ (𝜑 → 𝐺:ℕ–1-1-onto→(ℚ ∩ (-1[,]1)))
vitali.6	⊢ 𝑇 = (𝑛 ∈ ℕ ↦ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑛)) ∈ ran 𝐹})
vitali.7	⊢ (𝜑 → ¬ ran 𝐹 ∈ (𝒫 ℝ ∖ dom vol))

Assertion

Ref	Expression
vitalilem2	⊢ (𝜑 → (ran 𝐹 ⊆ (0[,]1) ∧ (0[,]1) ⊆ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚) ∧ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚) ⊆ (-1[,]2)))

Distinct variable groups:   𝑚,𝑛,𝑠,𝑥,𝑦,𝑧,𝐺   𝜑,𝑚,𝑛,𝑥,𝑧   𝑧,𝑆   𝑇,𝑚,𝑥   𝑚,𝐹,𝑛,𝑠,𝑥,𝑦,𝑧   ∼ ,𝑚,𝑛,𝑠,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑦, 𝑠)   𝑆(𝑥, 𝑦, 𝑚, 𝑛, 𝑠)   𝑇(𝑦, 𝑧, 𝑛, 𝑠)

Proof of Theorem vitalilem2

Dummy variables 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vitali.3	. . . 4 ⊢ (𝜑 → 𝐹 Fn 𝑆)
2		vitali.4	. . . . 5 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 (𝑧 ≠ ∅ → (𝐹‘𝑧) ∈ 𝑧))
3		vitali.2	. . . . . . . . 9 ⊢ 𝑆 = ((0[,]1) / ∼ )
4		neeq1 3019	. . . . . . . . 9 ⊢ ([𝑣] ∼ = 𝑧 → ([𝑣] ∼ ≠ ∅ ↔ 𝑧 ≠ ∅))
5		vitali.1	. . . . . . . . . . . . . 14 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (0[,]1) ∧ 𝑦 ∈ (0[,]1)) ∧ (𝑥 − 𝑦) ∈ ℚ)}
6	5	vitalilem1 25835	. . . . . . . . . . . . 13 ⊢ ∼ Er (0[,]1)
7		erdm 8710	. . . . . . . . . . . . 13 ⊢ ( ∼ Er (0[,]1) → dom ∼ = (0[,]1))
8	6, 7	ax-mp 5	. . . . . . . . . . . 12 ⊢ dom ∼ = (0[,]1)
9	8	eleq2i 2854	. . . . . . . . . . 11 ⊢ (𝑣 ∈ dom ∼ ↔ 𝑣 ∈ (0[,]1))
10		ecdmn0 8752	. . . . . . . . . . 11 ⊢ (𝑣 ∈ dom ∼ ↔ [𝑣] ∼ ≠ ∅)
11	9, 10	bitr3i 280	. . . . . . . . . 10 ⊢ (𝑣 ∈ (0[,]1) ↔ [𝑣] ∼ ≠ ∅)
12	11	biimpi 219	. . . . . . . . 9 ⊢ (𝑣 ∈ (0[,]1) → [𝑣] ∼ ≠ ∅)
13	3, 4, 12	ectocl 8786	. . . . . . . 8 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ≠ ∅)
14	13	adantl 487	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → 𝑧 ≠ ∅)
15		sseq1 3959	. . . . . . . . . 10 ⊢ ([𝑤] ∼ = 𝑧 → ([𝑤] ∼ ⊆ (0[,]1) ↔ 𝑧 ⊆ (0[,]1)))
16	6	a1i 11	. . . . . . . . . . 11 ⊢ (𝑤 ∈ (0[,]1) → ∼ Er (0[,]1))
17	16	ecss 8751	. . . . . . . . . 10 ⊢ (𝑤 ∈ (0[,]1) → [𝑤] ∼ ⊆ (0[,]1))
18	3, 15, 17	ectocl 8786	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ⊆ (0[,]1))
19	18	adantl 487	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → 𝑧 ⊆ (0[,]1))
20	19	sseld 3933	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((𝐹‘𝑧) ∈ 𝑧 → (𝐹‘𝑧) ∈ (0[,]1)))
21	14, 20	embantd 60	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((𝑧 ≠ ∅ → (𝐹‘𝑧) ∈ 𝑧) → (𝐹‘𝑧) ∈ (0[,]1)))
22	21	ralimdva 3176	. . . . 5 ⊢ (𝜑 → (∀𝑧 ∈ 𝑆 (𝑧 ≠ ∅ → (𝐹‘𝑧) ∈ 𝑧) → ∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ (0[,]1)))
23	2, 22	mpd 16	. . . 4 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ (0[,]1))
24		ffnfv 7115	. . . 4 ⊢ (𝐹:𝑆⟶(0[,]1) ↔ (𝐹 Fn 𝑆 ∧ ∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ (0[,]1)))
25	1, 23, 24	sylanbrc 595	. . 3 ⊢ (𝜑 → 𝐹:𝑆⟶(0[,]1))
26	25	frnd 6715	. 2 ⊢ (𝜑 → ran 𝐹 ⊆ (0[,]1))
27		vitali.5	. . . . . . . 8 ⊢ (𝜑 → 𝐺:ℕ–1-1-onto→(ℚ ∩ (-1[,]1)))
28	27	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝐺:ℕ–1-1-onto→(ℚ ∩ (-1[,]1)))
29		f1ocnv 6834	. . . . . . 7 ⊢ (𝐺:ℕ–1-1-onto→(ℚ ∩ (-1[,]1)) → ◡𝐺:(ℚ ∩ (-1[,]1))–1-1-onto→ℕ)
30		f1of 6821	. . . . . . 7 ⊢ (◡𝐺:(ℚ ∩ (-1[,]1))–1-1-onto→ℕ → ◡𝐺:(ℚ ∩ (-1[,]1))⟶ℕ)
31	28, 29, 30	3syl 19	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ◡𝐺:(ℚ ∩ (-1[,]1))⟶ℕ)
32	11	bilani 510	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → [𝑣] ∼ ≠ ∅)
33		neeq1 3019	. . . . . . . . . . . 12 ⊢ (𝑧 = [𝑣] ∼ → (𝑧 ≠ ∅ ↔ [𝑣] ∼ ≠ ∅))
34		fveq2 6882	. . . . . . . . . . . . 13 ⊢ (𝑧 = [𝑣] ∼ → (𝐹‘𝑧) = (𝐹‘[𝑣] ∼ ))
35		id 23	. . . . . . . . . . . . 13 ⊢ (𝑧 = [𝑣] ∼ → 𝑧 = [𝑣] ∼ )
36	34, 35	eleq12d 2856	. . . . . . . . . . . 12 ⊢ (𝑧 = [𝑣] ∼ → ((𝐹‘𝑧) ∈ 𝑧 ↔ (𝐹‘[𝑣] ∼ ) ∈ [𝑣] ∼ ))
37	33, 36	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑧 = [𝑣] ∼ → ((𝑧 ≠ ∅ → (𝐹‘𝑧) ∈ 𝑧) ↔ ([𝑣] ∼ ≠ ∅ → (𝐹‘[𝑣] ∼ ) ∈ [𝑣] ∼ )))
38	2	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ∀𝑧 ∈ 𝑆 (𝑧 ≠ ∅ → (𝐹‘𝑧) ∈ 𝑧))
39		ovex 7449	. . . . . . . . . . . . . . 15 ⊢ (0[,]1) ∈ V
40		erex 8724	. . . . . . . . . . . . . . 15 ⊢ ( ∼ Er (0[,]1) → ((0[,]1) ∈ V → ∼ ∈ V))
41	6, 39, 40	mp2 9	. . . . . . . . . . . . . 14 ⊢ ∼ ∈ V
42	41	ecelqsi 8772	. . . . . . . . . . . . 13 ⊢ (𝑣 ∈ (0[,]1) → [𝑣] ∼ ∈ ((0[,]1) / ∼ ))
43	42	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → [𝑣] ∼ ∈ ((0[,]1) / ∼ ))
44	43, 3	eleqtrrdi 2873	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → [𝑣] ∼ ∈ 𝑆)
45	37, 38, 44	rspcdva 3580	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ([𝑣] ∼ ≠ ∅ → (𝐹‘[𝑣] ∼ ) ∈ [𝑣] ∼ ))
46	32, 45	mpd 16	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐹‘[𝑣] ∼ ) ∈ [𝑣] ∼ )
47		fvex 6895	. . . . . . . . . . 11 ⊢ (𝐹‘[𝑣] ∼ ) ∈ V
48		vex 3457	. . . . . . . . . . 11 ⊢ 𝑣 ∈ V
49	47, 48	elec 8746	. . . . . . . . . 10 ⊢ ((𝐹‘[𝑣] ∼ ) ∈ [𝑣] ∼ ↔ 𝑣 ∼ (𝐹‘[𝑣] ∼ ))
50		oveq12 7425	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝑣 ∧ 𝑦 = (𝐹‘[𝑣] ∼ )) → (𝑥 − 𝑦) = (𝑣 − (𝐹‘[𝑣] ∼ )))
51	50	eleq1d 2847	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝑣 ∧ 𝑦 = (𝐹‘[𝑣] ∼ )) → ((𝑥 − 𝑦) ∈ ℚ ↔ (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℚ))
52	51, 5	brab2a 5752	. . . . . . . . . 10 ⊢ (𝑣 ∼ (𝐹‘[𝑣] ∼ ) ↔ ((𝑣 ∈ (0[,]1) ∧ (𝐹‘[𝑣] ∼ ) ∈ (0[,]1)) ∧ (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℚ))
53	49, 52	bitri 278	. . . . . . . . 9 ⊢ ((𝐹‘[𝑣] ∼ ) ∈ [𝑣] ∼ ↔ ((𝑣 ∈ (0[,]1) ∧ (𝐹‘[𝑣] ∼ ) ∈ (0[,]1)) ∧ (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℚ))
54	46, 53	sylib 221	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ((𝑣 ∈ (0[,]1) ∧ (𝐹‘[𝑣] ∼ ) ∈ (0[,]1)) ∧ (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℚ))
55	54	simprd 501	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℚ)
56		elicc01 13519	. . . . . . . . . . 11 ⊢ (𝑣 ∈ (0[,]1) ↔ (𝑣 ∈ ℝ ∧ 0 ≤ 𝑣 ∧ 𝑣 ≤ 1))
57	56	bilani 510	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 ∈ ℝ ∧ 0 ≤ 𝑣 ∧ 𝑣 ≤ 1))
58	57	simp1d 1160	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ∈ ℝ)
59	54	simpld 500	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 ∈ (0[,]1) ∧ (𝐹‘[𝑣] ∼ ) ∈ (0[,]1)))
60	59	simprd 501	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐹‘[𝑣] ∼ ) ∈ (0[,]1))
61		elicc01 13519	. . . . . . . . . . 11 ⊢ ((𝐹‘[𝑣] ∼ ) ∈ (0[,]1) ↔ ((𝐹‘[𝑣] ∼ ) ∈ ℝ ∧ 0 ≤ (𝐹‘[𝑣] ∼ ) ∧ (𝐹‘[𝑣] ∼ ) ≤ 1))
62	60, 61	sylib 221	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ((𝐹‘[𝑣] ∼ ) ∈ ℝ ∧ 0 ≤ (𝐹‘[𝑣] ∼ ) ∧ (𝐹‘[𝑣] ∼ ) ≤ 1))
63	62	simp1d 1160	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐹‘[𝑣] ∼ ) ∈ ℝ)
64	58, 63	resubcld 11667	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℝ)
65	63, 58	resubcld 11667	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ((𝐹‘[𝑣] ∼ ) − 𝑣) ∈ ℝ)
66		1red 11234	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 1 ∈ ℝ)
67	57	simp2d 1161	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 0 ≤ 𝑣)
68	63, 58	subge02d 11831	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (0 ≤ 𝑣 ↔ ((𝐹‘[𝑣] ∼ ) − 𝑣) ≤ (𝐹‘[𝑣] ∼ )))
69	67, 68	mpbid 235	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ((𝐹‘[𝑣] ∼ ) − 𝑣) ≤ (𝐹‘[𝑣] ∼ ))
70	62	simp3d 1162	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐹‘[𝑣] ∼ ) ≤ 1)
71	65, 63, 66, 69, 70	letrd 11392	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ((𝐹‘[𝑣] ∼ ) − 𝑣) ≤ 1)
72	65, 66	lenegd 11818	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (((𝐹‘[𝑣] ∼ ) − 𝑣) ≤ 1 ↔ -1 ≤ -((𝐹‘[𝑣] ∼ ) − 𝑣)))
73	71, 72	mpbid 235	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → -1 ≤ -((𝐹‘[𝑣] ∼ ) − 𝑣))
74	63	recnd 11262	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐹‘[𝑣] ∼ ) ∈ ℂ)
75	58	recnd 11262	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ∈ ℂ)
76	74, 75	negsubdi2d 11610	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → -((𝐹‘[𝑣] ∼ ) − 𝑣) = (𝑣 − (𝐹‘[𝑣] ∼ )))
77	73, 76	breqtrd 5135	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → -1 ≤ (𝑣 − (𝐹‘[𝑣] ∼ )))
78	62	simp2d 1161	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 0 ≤ (𝐹‘[𝑣] ∼ ))
79	58, 63	subge02d 11831	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (0 ≤ (𝐹‘[𝑣] ∼ ) ↔ (𝑣 − (𝐹‘[𝑣] ∼ )) ≤ 𝑣))
80	78, 79	mpbid 235	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐹‘[𝑣] ∼ )) ≤ 𝑣)
81	57	simp3d 1162	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ≤ 1)
82	64, 58, 66, 80, 81	letrd 11392	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐹‘[𝑣] ∼ )) ≤ 1)
83		neg1rr 12229	. . . . . . . . 9 ⊢ -1 ∈ ℝ
84		1re 11233	. . . . . . . . 9 ⊢ 1 ∈ ℝ
85	83, 84	elicc2i 13465	. . . . . . . 8 ⊢ ((𝑣 − (𝐹‘[𝑣] ∼ )) ∈ (-1[,]1) ↔ ((𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℝ ∧ -1 ≤ (𝑣 − (𝐹‘[𝑣] ∼ )) ∧ (𝑣 − (𝐹‘[𝑣] ∼ )) ≤ 1))
86	64, 77, 82, 85	syl3anbrc 1362	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ (-1[,]1))
87	55, 86	elind 4149	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ (ℚ ∩ (-1[,]1)))
88	31, 87	ffvelcdmd 7081	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) ∈ ℕ)
89		oveq1 7423	. . . . . . . 8 ⊢ (𝑠 = 𝑣 → (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) = (𝑣 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))))
90	89	eleq1d 2847	. . . . . . 7 ⊢ (𝑠 = 𝑣 → ((𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹 ↔ (𝑣 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹))
91		f1ocnvfv2 7281	. . . . . . . . . . 11 ⊢ ((𝐺:ℕ–1-1-onto→(ℚ ∩ (-1[,]1)) ∧ (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ (ℚ ∩ (-1[,]1))) → (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))) = (𝑣 − (𝐹‘[𝑣] ∼ )))
92	27, 87, 91	syl2an2r 698	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))) = (𝑣 − (𝐹‘[𝑣] ∼ )))
93	92	oveq2d 7432	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) = (𝑣 − (𝑣 − (𝐹‘[𝑣] ∼ ))))
94	75, 74	nncand 11599	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝑣 − (𝐹‘[𝑣] ∼ ))) = (𝐹‘[𝑣] ∼ ))
95	93, 94	eqtrd 2797	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) = (𝐹‘[𝑣] ∼ ))
96		fnfvelrn 7076	. . . . . . . . 9 ⊢ ((𝐹 Fn 𝑆 ∧ [𝑣] ∼ ∈ 𝑆) → (𝐹‘[𝑣] ∼ ) ∈ ran 𝐹)
97	1, 44, 96	syl2an2r 698	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐹‘[𝑣] ∼ ) ∈ ran 𝐹)
98	95, 97	eqeltrd 2862	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹)
99	90, 58, 98	elrabd 3650	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ∈ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹})
100		fveq2 6882	. . . . . . . . . . 11 ⊢ (𝑛 = (◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) → (𝐺‘𝑛) = (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))))
101	100	oveq2d 7432	. . . . . . . . . 10 ⊢ (𝑛 = (◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) → (𝑠 − (𝐺‘𝑛)) = (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))))
102	101	eleq1d 2847	. . . . . . . . 9 ⊢ (𝑛 = (◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) → ((𝑠 − (𝐺‘𝑛)) ∈ ran 𝐹 ↔ (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹))
103	102	rabbidv 3421	. . . . . . . 8 ⊢ (𝑛 = (◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) → {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑛)) ∈ ran 𝐹} = {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹})
104		vitali.6	. . . . . . . 8 ⊢ 𝑇 = (𝑛 ∈ ℕ ↦ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑛)) ∈ ran 𝐹})
105		reex 11216	. . . . . . . . 9 ⊢ ℝ ∈ V
106	105	rabex 5307	. . . . . . . 8 ⊢ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹} ∈ V
107	103, 104, 106	fvmpt 6990	. . . . . . 7 ⊢ ((◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) ∈ ℕ → (𝑇‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))) = {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹})
108	88, 107	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑇‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))) = {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹})
109	99, 108	eleqtrrd 2865	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ∈ (𝑇‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))))
110		fveq2 6882	. . . . . 6 ⊢ (𝑚 = (◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) → (𝑇‘𝑚) = (𝑇‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))))
111	110	eliuni 4960	. . . . 5 ⊢ (((◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) ∈ ℕ ∧ 𝑣 ∈ (𝑇‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) → 𝑣 ∈ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚))
112	88, 109, 111	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ∈ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚))
113	112	ex 418	. . 3 ⊢ (𝜑 → (𝑣 ∈ (0[,]1) → 𝑣 ∈ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚)))
114	113	ssrdv 3940	. 2 ⊢ (𝜑 → (0[,]1) ⊆ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚))
115		eliun 4958	. . . 4 ⊢ (𝑥 ∈ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚) ↔ ∃𝑚 ∈ ℕ 𝑥 ∈ (𝑇‘𝑚))
116		fveq2 6882	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑚 → (𝐺‘𝑛) = (𝐺‘𝑚))
117	116	oveq2d 7432	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑚 → (𝑠 − (𝐺‘𝑛)) = (𝑠 − (𝐺‘𝑚)))
118	117	eleq1d 2847	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑚 → ((𝑠 − (𝐺‘𝑛)) ∈ ran 𝐹 ↔ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹))
119	118	rabbidv 3421	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑚 → {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑛)) ∈ ran 𝐹} = {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹})
120	105	rabex 5307	. . . . . . . . . . . 12 ⊢ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹} ∈ V
121	119, 104, 120	fvmpt 6990	. . . . . . . . . . 11 ⊢ (𝑚 ∈ ℕ → (𝑇‘𝑚) = {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹})
122	121	adantl 487	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝑇‘𝑚) = {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹})
123	122	eleq2d 2848	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝑥 ∈ (𝑇‘𝑚) ↔ 𝑥 ∈ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹}))
124	123	biimpa 482	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 𝑥 ∈ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹})
125		oveq1 7423	. . . . . . . . . 10 ⊢ (𝑠 = 𝑥 → (𝑠 − (𝐺‘𝑚)) = (𝑥 − (𝐺‘𝑚)))
126	125	eleq1d 2847	. . . . . . . . 9 ⊢ (𝑠 = 𝑥 → ((𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹 ↔ (𝑥 − (𝐺‘𝑚)) ∈ ran 𝐹))
127	126	elrab 3648	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹} ↔ (𝑥 ∈ ℝ ∧ (𝑥 − (𝐺‘𝑚)) ∈ ran 𝐹))
128	124, 127	sylib 221	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝑥 ∈ ℝ ∧ (𝑥 − (𝐺‘𝑚)) ∈ ran 𝐹))
129	128	simpld 500	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 𝑥 ∈ ℝ)
130	83	a1i 11	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → -1 ∈ ℝ)
131		iccssre 13482	. . . . . . . . . 10 ⊢ ((-1 ∈ ℝ ∧ 1 ∈ ℝ) → (-1[,]1) ⊆ ℝ)
132	83, 84, 131	mp2an 705	. . . . . . . . 9 ⊢ (-1[,]1) ⊆ ℝ
133		f1of 6821	. . . . . . . . . . . 12 ⊢ (𝐺:ℕ–1-1-onto→(ℚ ∩ (-1[,]1)) → 𝐺:ℕ⟶(ℚ ∩ (-1[,]1)))
134	27, 133	syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺:ℕ⟶(ℚ ∩ (-1[,]1)))
135	134	ffvelcdmda 7080	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝐺‘𝑚) ∈ (ℚ ∩ (-1[,]1)))
136	135	elin2d 4154	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝐺‘𝑚) ∈ (-1[,]1))
137	132, 136	sselid 3932	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝐺‘𝑚) ∈ ℝ)
138	137	adantr 486	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝐺‘𝑚) ∈ ℝ)
139	136	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝐺‘𝑚) ∈ (-1[,]1))
140	83, 84	elicc2i 13465	. . . . . . . . 9 ⊢ ((𝐺‘𝑚) ∈ (-1[,]1) ↔ ((𝐺‘𝑚) ∈ ℝ ∧ -1 ≤ (𝐺‘𝑚) ∧ (𝐺‘𝑚) ≤ 1))
141	139, 140	sylib 221	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ((𝐺‘𝑚) ∈ ℝ ∧ -1 ≤ (𝐺‘𝑚) ∧ (𝐺‘𝑚) ≤ 1))
142	141	simp2d 1161	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → -1 ≤ (𝐺‘𝑚))
143	26	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ran 𝐹 ⊆ (0[,]1))
144	128	simprd 501	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝑥 − (𝐺‘𝑚)) ∈ ran 𝐹)
145	143, 144	sseldd 3935	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝑥 − (𝐺‘𝑚)) ∈ (0[,]1))
146		elicc01 13519	. . . . . . . . . 10 ⊢ ((𝑥 − (𝐺‘𝑚)) ∈ (0[,]1) ↔ ((𝑥 − (𝐺‘𝑚)) ∈ ℝ ∧ 0 ≤ (𝑥 − (𝐺‘𝑚)) ∧ (𝑥 − (𝐺‘𝑚)) ≤ 1))
147	145, 146	sylib 221	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ((𝑥 − (𝐺‘𝑚)) ∈ ℝ ∧ 0 ≤ (𝑥 − (𝐺‘𝑚)) ∧ (𝑥 − (𝐺‘𝑚)) ≤ 1))
148	147	simp2d 1161	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 0 ≤ (𝑥 − (𝐺‘𝑚)))
149	129, 138	subge0d 11829	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (0 ≤ (𝑥 − (𝐺‘𝑚)) ↔ (𝐺‘𝑚) ≤ 𝑥))
150	148, 149	mpbid 235	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝐺‘𝑚) ≤ 𝑥)
151	130, 138, 129, 142, 150	letrd 11392	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → -1 ≤ 𝑥)
152		peano2re 11408	. . . . . . . 8 ⊢ ((𝐺‘𝑚) ∈ ℝ → ((𝐺‘𝑚) + 1) ∈ ℝ)
153	138, 152	syl 18	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ((𝐺‘𝑚) + 1) ∈ ℝ)
154		2re 12340	. . . . . . . 8 ⊢ 2 ∈ ℝ
155	154	a1i 11	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 2 ∈ ℝ)
156	147	simp3d 1162	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝑥 − (𝐺‘𝑚)) ≤ 1)
157		1red 11234	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 1 ∈ ℝ)
158	129, 138, 157	lesubadd2d 11838	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ((𝑥 − (𝐺‘𝑚)) ≤ 1 ↔ 𝑥 ≤ ((𝐺‘𝑚) + 1)))
159	156, 158	mpbid 235	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 𝑥 ≤ ((𝐺‘𝑚) + 1))
160	141	simp3d 1162	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝐺‘𝑚) ≤ 1)
161	138, 157, 157, 160	leadd1dd 11853	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ((𝐺‘𝑚) + 1) ≤ (1 + 1))
162		df-2 12328	. . . . . . . 8 ⊢ 2 = (1 + 1)
163	161, 162	breqtrrdi 5151	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ((𝐺‘𝑚) + 1) ≤ 2)
164	129, 153, 155, 159, 163	letrd 11392	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 𝑥 ≤ 2)
165	83, 154	elicc2i 13465	. . . . . 6 ⊢ (𝑥 ∈ (-1[,]2) ↔ (𝑥 ∈ ℝ ∧ -1 ≤ 𝑥 ∧ 𝑥 ≤ 2))
166	129, 151, 164, 165	syl3anbrc 1362	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 𝑥 ∈ (-1[,]2))
167	166	rexlimdva2 3167	. . . 4 ⊢ (𝜑 → (∃𝑚 ∈ ℕ 𝑥 ∈ (𝑇‘𝑚) → 𝑥 ∈ (-1[,]2)))
168	115, 167	biimtrid 245	. . 3 ⊢ (𝜑 → (𝑥 ∈ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚) → 𝑥 ∈ (-1[,]2)))
169	168	ssrdv 3940	. 2 ⊢ (𝜑 → ∪ 𝑚 ∈ ℕ (𝑇‘𝑚) ⊆ (-1[,]2))
170	26, 114, 169	3jca 1146	1 ⊢ (𝜑 → (ran 𝐹 ⊆ (0[,]1) ∧ (0[,]1) ⊆ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚) ∧ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚) ⊆ (-1[,]2)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  {crab 3414  Vcvv 3453   ∖ cdif 3899   ∩ cin 3901   ⊆ wss 3902  ∅c0 4282  𝒫 cpw 4560  ∪ ciun 4954   class class class wbr 5107  {copab 5171   ↦ cmpt 5190  ^◡ccnv 5658  dom cdm 5659  ran crn 5660   Fn wfn 6532  ⟶wf 6533  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7416   Er wer 8696  [cec 8697   / cqs 8698  ℝcr 11124  0cc0 11125  1c1 11126   + caddc 11128   ≤ cle 11269   − cmin 11466  -cneg 11467  ℕcn 12258  2c2 12320  ℚcq 12998  [,]cicc 13401  volcvol 25690

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11181  ax-resscn 11182  ax-1cn 11183  ax-icn 11184  ax-addcl 11185  ax-addrcl 11186  ax-mulcl 11187  ax-mulrcl 11188  ax-mulcom 11189  ax-addass 11190  ax-mulass 11191  ax-distr 11192  ax-i2m1 11193  ax-1ne0 11194  ax-1rid 11195  ax-rnegex 11196  ax-rrecex 11197  ax-cnre 11198  ax-pre-lttri 11199  ax-pre-lttrn 11200  ax-pre-ltadd 11201  ax-pre-mulgt0 11202

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-er 8699  df-ec 8701  df-qs 8705  df-en 8956  df-dom 8957  df-sdom 8958  df-pnf 11270  df-mnf 11271  df-xr 11272  df-ltxr 11273  df-le 11274  df-sub 11468  df-neg 11469  df-div 11897  df-nn 12259  df-2 12328  df-n0 12530  df-z 12617  df-q 12999  df-icc 13405

This theorem is used by:  vitalilem3  25837  vitalilem4  25838  vitalilem5  25839