Theorem vitalilem2 25567

Description: Lemma for vitali 25571. (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 2995	. . . . . . . . 9 ⊢ ([𝑣] ∼ = 𝑧 → ([𝑣] ∼ ≠ ∅ ↔ 𝑧 ≠ ∅))
5		vitali.1	. . . . . . . . . . . . . 14 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (0[,]1) ∧ 𝑦 ∈ (0[,]1)) ∧ (𝑥 − 𝑦) ∈ ℚ)}
6	5	vitalilem1 25566	. . . . . . . . . . . . 13 ⊢ ∼ Er (0[,]1)
7		erdm 8734	. . . . . . . . . . . . 13 ⊢ ( ∼ Er (0[,]1) → dom ∼ = (0[,]1))
8	6, 7	ax-mp 5	. . . . . . . . . . . 12 ⊢ dom ∼ = (0[,]1)
9	8	eleq2i 2827	. . . . . . . . . . 11 ⊢ (𝑣 ∈ dom ∼ ↔ 𝑣 ∈ (0[,]1))
10		ecdmn0 8773	. . . . . . . . . . 11 ⊢ (𝑣 ∈ dom ∼ ↔ [𝑣] ∼ ≠ ∅)
11	9, 10	bitr3i 277	. . . . . . . . . 10 ⊢ (𝑣 ∈ (0[,]1) ↔ [𝑣] ∼ ≠ ∅)
12	11	biimpi 216	. . . . . . . . 9 ⊢ (𝑣 ∈ (0[,]1) → [𝑣] ∼ ≠ ∅)
13	3, 4, 12	ectocl 8804	. . . . . . . 8 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ≠ ∅)
14	13	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → 𝑧 ≠ ∅)
15		sseq1 3989	. . . . . . . . . 10 ⊢ ([𝑤] ∼ = 𝑧 → ([𝑤] ∼ ⊆ (0[,]1) ↔ 𝑧 ⊆ (0[,]1)))
16	6	a1i 11	. . . . . . . . . . 11 ⊢ (𝑤 ∈ (0[,]1) → ∼ Er (0[,]1))
17	16	ecss 8772	. . . . . . . . . 10 ⊢ (𝑤 ∈ (0[,]1) → [𝑤] ∼ ⊆ (0[,]1))
18	3, 15, 17	ectocl 8804	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑆 → 𝑧 ⊆ (0[,]1))
19	18	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → 𝑧 ⊆ (0[,]1))
20	19	sseld 3962	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((𝐹‘𝑧) ∈ 𝑧 → (𝐹‘𝑧) ∈ (0[,]1)))
21	14, 20	embantd 59	. . . . . 6 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝑆) → ((𝑧 ≠ ∅ → (𝐹‘𝑧) ∈ 𝑧) → (𝐹‘𝑧) ∈ (0[,]1)))
22	21	ralimdva 3153	. . . . 5 ⊢ (𝜑 → (∀𝑧 ∈ 𝑆 (𝑧 ≠ ∅ → (𝐹‘𝑧) ∈ 𝑧) → ∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ (0[,]1)))
23	2, 22	mpd 15	. . . 4 ⊢ (𝜑 → ∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ (0[,]1))
24		ffnfv 7114	. . . 4 ⊢ (𝐹:𝑆⟶(0[,]1) ↔ (𝐹 Fn 𝑆 ∧ ∀𝑧 ∈ 𝑆 (𝐹‘𝑧) ∈ (0[,]1)))
25	1, 23, 24	sylanbrc 583	. . 3 ⊢ (𝜑 → 𝐹:𝑆⟶(0[,]1))
26	25	frnd 6719	. 2 ⊢ (𝜑 → ran 𝐹 ⊆ (0[,]1))
27		vitali.5	. . . . . . . 8 ⊢ (𝜑 → 𝐺:ℕ–1-1-onto→(ℚ ∩ (-1[,]1)))
28	27	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝐺:ℕ–1-1-onto→(ℚ ∩ (-1[,]1)))
29		f1ocnv 6835	. . . . . . 7 ⊢ (𝐺:ℕ–1-1-onto→(ℚ ∩ (-1[,]1)) → ◡𝐺:(ℚ ∩ (-1[,]1))–1-1-onto→ℕ)
30		f1of 6823	. . . . . . 7 ⊢ (◡𝐺:(ℚ ∩ (-1[,]1))–1-1-onto→ℕ → ◡𝐺:(ℚ ∩ (-1[,]1))⟶ℕ)
31	28, 29, 30	3syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ◡𝐺:(ℚ ∩ (-1[,]1))⟶ℕ)
32		simpr 484	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ∈ (0[,]1))
33	32, 11	sylib 218	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → [𝑣] ∼ ≠ ∅)
34		neeq1 2995	. . . . . . . . . . . 12 ⊢ (𝑧 = [𝑣] ∼ → (𝑧 ≠ ∅ ↔ [𝑣] ∼ ≠ ∅))
35		fveq2 6881	. . . . . . . . . . . . 13 ⊢ (𝑧 = [𝑣] ∼ → (𝐹‘𝑧) = (𝐹‘[𝑣] ∼ ))
36		id 22	. . . . . . . . . . . . 13 ⊢ (𝑧 = [𝑣] ∼ → 𝑧 = [𝑣] ∼ )
37	35, 36	eleq12d 2829	. . . . . . . . . . . 12 ⊢ (𝑧 = [𝑣] ∼ → ((𝐹‘𝑧) ∈ 𝑧 ↔ (𝐹‘[𝑣] ∼ ) ∈ [𝑣] ∼ ))
38	34, 37	imbi12d 344	. . . . . . . . . . 11 ⊢ (𝑧 = [𝑣] ∼ → ((𝑧 ≠ ∅ → (𝐹‘𝑧) ∈ 𝑧) ↔ ([𝑣] ∼ ≠ ∅ → (𝐹‘[𝑣] ∼ ) ∈ [𝑣] ∼ )))
39	2	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ∀𝑧 ∈ 𝑆 (𝑧 ≠ ∅ → (𝐹‘𝑧) ∈ 𝑧))
40		ovex 7443	. . . . . . . . . . . . . . 15 ⊢ (0[,]1) ∈ V
41		erex 8748	. . . . . . . . . . . . . . 15 ⊢ ( ∼ Er (0[,]1) → ((0[,]1) ∈ V → ∼ ∈ V))
42	6, 40, 41	mp2 9	. . . . . . . . . . . . . 14 ⊢ ∼ ∈ V
43	42	ecelqsi 8792	. . . . . . . . . . . . 13 ⊢ (𝑣 ∈ (0[,]1) → [𝑣] ∼ ∈ ((0[,]1) / ∼ ))
44	43	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → [𝑣] ∼ ∈ ((0[,]1) / ∼ ))
45	44, 3	eleqtrrdi 2846	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → [𝑣] ∼ ∈ 𝑆)
46	38, 39, 45	rspcdva 3607	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ([𝑣] ∼ ≠ ∅ → (𝐹‘[𝑣] ∼ ) ∈ [𝑣] ∼ ))
47	33, 46	mpd 15	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐹‘[𝑣] ∼ ) ∈ [𝑣] ∼ )
48		fvex 6894	. . . . . . . . . . 11 ⊢ (𝐹‘[𝑣] ∼ ) ∈ V
49		vex 3468	. . . . . . . . . . 11 ⊢ 𝑣 ∈ V
50	48, 49	elec 8770	. . . . . . . . . 10 ⊢ ((𝐹‘[𝑣] ∼ ) ∈ [𝑣] ∼ ↔ 𝑣 ∼ (𝐹‘[𝑣] ∼ ))
51		oveq12 7419	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝑣 ∧ 𝑦 = (𝐹‘[𝑣] ∼ )) → (𝑥 − 𝑦) = (𝑣 − (𝐹‘[𝑣] ∼ )))
52	51	eleq1d 2820	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝑣 ∧ 𝑦 = (𝐹‘[𝑣] ∼ )) → ((𝑥 − 𝑦) ∈ ℚ ↔ (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℚ))
53	52, 5	brab2a 5753	. . . . . . . . . 10 ⊢ (𝑣 ∼ (𝐹‘[𝑣] ∼ ) ↔ ((𝑣 ∈ (0[,]1) ∧ (𝐹‘[𝑣] ∼ ) ∈ (0[,]1)) ∧ (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℚ))
54	50, 53	bitri 275	. . . . . . . . 9 ⊢ ((𝐹‘[𝑣] ∼ ) ∈ [𝑣] ∼ ↔ ((𝑣 ∈ (0[,]1) ∧ (𝐹‘[𝑣] ∼ ) ∈ (0[,]1)) ∧ (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℚ))
55	47, 54	sylib 218	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ((𝑣 ∈ (0[,]1) ∧ (𝐹‘[𝑣] ∼ ) ∈ (0[,]1)) ∧ (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℚ))
56	55	simprd 495	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℚ)
57		elicc01 13488	. . . . . . . . . . 11 ⊢ (𝑣 ∈ (0[,]1) ↔ (𝑣 ∈ ℝ ∧ 0 ≤ 𝑣 ∧ 𝑣 ≤ 1))
58	32, 57	sylib 218	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 ∈ ℝ ∧ 0 ≤ 𝑣 ∧ 𝑣 ≤ 1))
59	58	simp1d 1142	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ∈ ℝ)
60	55	simpld 494	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 ∈ (0[,]1) ∧ (𝐹‘[𝑣] ∼ ) ∈ (0[,]1)))
61	60	simprd 495	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐹‘[𝑣] ∼ ) ∈ (0[,]1))
62		elicc01 13488	. . . . . . . . . . 11 ⊢ ((𝐹‘[𝑣] ∼ ) ∈ (0[,]1) ↔ ((𝐹‘[𝑣] ∼ ) ∈ ℝ ∧ 0 ≤ (𝐹‘[𝑣] ∼ ) ∧ (𝐹‘[𝑣] ∼ ) ≤ 1))
63	61, 62	sylib 218	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ((𝐹‘[𝑣] ∼ ) ∈ ℝ ∧ 0 ≤ (𝐹‘[𝑣] ∼ ) ∧ (𝐹‘[𝑣] ∼ ) ≤ 1))
64	63	simp1d 1142	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐹‘[𝑣] ∼ ) ∈ ℝ)
65	59, 64	resubcld 11670	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℝ)
66	64, 59	resubcld 11670	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ((𝐹‘[𝑣] ∼ ) − 𝑣) ∈ ℝ)
67		1red 11241	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 1 ∈ ℝ)
68	58	simp2d 1143	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 0 ≤ 𝑣)
69	64, 59	subge02d 11834	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (0 ≤ 𝑣 ↔ ((𝐹‘[𝑣] ∼ ) − 𝑣) ≤ (𝐹‘[𝑣] ∼ )))
70	68, 69	mpbid 232	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ((𝐹‘[𝑣] ∼ ) − 𝑣) ≤ (𝐹‘[𝑣] ∼ ))
71	63	simp3d 1144	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐹‘[𝑣] ∼ ) ≤ 1)
72	66, 64, 67, 70, 71	letrd 11397	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → ((𝐹‘[𝑣] ∼ ) − 𝑣) ≤ 1)
73	66, 67	lenegd 11821	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (((𝐹‘[𝑣] ∼ ) − 𝑣) ≤ 1 ↔ -1 ≤ -((𝐹‘[𝑣] ∼ ) − 𝑣)))
74	72, 73	mpbid 232	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → -1 ≤ -((𝐹‘[𝑣] ∼ ) − 𝑣))
75	64	recnd 11268	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐹‘[𝑣] ∼ ) ∈ ℂ)
76	59	recnd 11268	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ∈ ℂ)
77	75, 76	negsubdi2d 11615	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → -((𝐹‘[𝑣] ∼ ) − 𝑣) = (𝑣 − (𝐹‘[𝑣] ∼ )))
78	74, 77	breqtrd 5150	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → -1 ≤ (𝑣 − (𝐹‘[𝑣] ∼ )))
79	63	simp2d 1143	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 0 ≤ (𝐹‘[𝑣] ∼ ))
80	59, 64	subge02d 11834	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (0 ≤ (𝐹‘[𝑣] ∼ ) ↔ (𝑣 − (𝐹‘[𝑣] ∼ )) ≤ 𝑣))
81	79, 80	mpbid 232	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐹‘[𝑣] ∼ )) ≤ 𝑣)
82	58	simp3d 1144	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ≤ 1)
83	65, 59, 67, 81, 82	letrd 11397	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐹‘[𝑣] ∼ )) ≤ 1)
84		neg1rr 12360	. . . . . . . . 9 ⊢ -1 ∈ ℝ
85		1re 11240	. . . . . . . . 9 ⊢ 1 ∈ ℝ
86	84, 85	elicc2i 13434	. . . . . . . 8 ⊢ ((𝑣 − (𝐹‘[𝑣] ∼ )) ∈ (-1[,]1) ↔ ((𝑣 − (𝐹‘[𝑣] ∼ )) ∈ ℝ ∧ -1 ≤ (𝑣 − (𝐹‘[𝑣] ∼ )) ∧ (𝑣 − (𝐹‘[𝑣] ∼ )) ≤ 1))
87	65, 78, 83, 86	syl3anbrc 1344	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ (-1[,]1))
88	56, 87	elind 4180	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ (ℚ ∩ (-1[,]1)))
89	31, 88	ffvelcdmd 7080	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) ∈ ℕ)
90		oveq1 7417	. . . . . . . 8 ⊢ (𝑠 = 𝑣 → (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) = (𝑣 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))))
91	90	eleq1d 2820	. . . . . . 7 ⊢ (𝑠 = 𝑣 → ((𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹 ↔ (𝑣 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹))
92		f1ocnvfv2 7275	. . . . . . . . . . 11 ⊢ ((𝐺:ℕ–1-1-onto→(ℚ ∩ (-1[,]1)) ∧ (𝑣 − (𝐹‘[𝑣] ∼ )) ∈ (ℚ ∩ (-1[,]1))) → (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))) = (𝑣 − (𝐹‘[𝑣] ∼ )))
93	27, 88, 92	syl2an2r 685	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))) = (𝑣 − (𝐹‘[𝑣] ∼ )))
94	93	oveq2d 7426	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) = (𝑣 − (𝑣 − (𝐹‘[𝑣] ∼ ))))
95	76, 75	nncand 11604	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝑣 − (𝐹‘[𝑣] ∼ ))) = (𝐹‘[𝑣] ∼ ))
96	94, 95	eqtrd 2771	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) = (𝐹‘[𝑣] ∼ ))
97		fnfvelrn 7075	. . . . . . . . 9 ⊢ ((𝐹 Fn 𝑆 ∧ [𝑣] ∼ ∈ 𝑆) → (𝐹‘[𝑣] ∼ ) ∈ ran 𝐹)
98	1, 45, 97	syl2an2r 685	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝐹‘[𝑣] ∼ ) ∈ ran 𝐹)
99	96, 98	eqeltrd 2835	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑣 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹)
100	91, 59, 99	elrabd 3678	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ∈ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹})
101		fveq2 6881	. . . . . . . . . . 11 ⊢ (𝑛 = (◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) → (𝐺‘𝑛) = (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))))
102	101	oveq2d 7426	. . . . . . . . . 10 ⊢ (𝑛 = (◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) → (𝑠 − (𝐺‘𝑛)) = (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))))
103	102	eleq1d 2820	. . . . . . . . 9 ⊢ (𝑛 = (◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) → ((𝑠 − (𝐺‘𝑛)) ∈ ran 𝐹 ↔ (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹))
104	103	rabbidv 3428	. . . . . . . 8 ⊢ (𝑛 = (◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) → {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑛)) ∈ ran 𝐹} = {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹})
105		vitali.6	. . . . . . . 8 ⊢ 𝑇 = (𝑛 ∈ ℕ ↦ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑛)) ∈ ran 𝐹})
106		reex 11225	. . . . . . . . 9 ⊢ ℝ ∈ V
107	106	rabex 5314	. . . . . . . 8 ⊢ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹} ∈ V
108	104, 105, 107	fvmpt 6991	. . . . . . 7 ⊢ ((◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) ∈ ℕ → (𝑇‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))) = {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹})
109	89, 108	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → (𝑇‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))) = {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) ∈ ran 𝐹})
110	100, 109	eleqtrrd 2838	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ∈ (𝑇‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))))
111		fveq2 6881	. . . . . 6 ⊢ (𝑚 = (◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) → (𝑇‘𝑚) = (𝑇‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ )))))
112	111	eliuni 4978	. . . . 5 ⊢ (((◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))) ∈ ℕ ∧ 𝑣 ∈ (𝑇‘(◡𝐺‘(𝑣 − (𝐹‘[𝑣] ∼ ))))) → 𝑣 ∈ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚))
113	89, 110, 112	syl2anc 584	. . . 4 ⊢ ((𝜑 ∧ 𝑣 ∈ (0[,]1)) → 𝑣 ∈ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚))
114	113	ex 412	. . 3 ⊢ (𝜑 → (𝑣 ∈ (0[,]1) → 𝑣 ∈ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚)))
115	114	ssrdv 3969	. 2 ⊢ (𝜑 → (0[,]1) ⊆ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚))
116		eliun 4976	. . . 4 ⊢ (𝑥 ∈ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚) ↔ ∃𝑚 ∈ ℕ 𝑥 ∈ (𝑇‘𝑚))
117		fveq2 6881	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑚 → (𝐺‘𝑛) = (𝐺‘𝑚))
118	117	oveq2d 7426	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑚 → (𝑠 − (𝐺‘𝑛)) = (𝑠 − (𝐺‘𝑚)))
119	118	eleq1d 2820	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑚 → ((𝑠 − (𝐺‘𝑛)) ∈ ran 𝐹 ↔ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹))
120	119	rabbidv 3428	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑚 → {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑛)) ∈ ran 𝐹} = {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹})
121	106	rabex 5314	. . . . . . . . . . . 12 ⊢ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹} ∈ V
122	120, 105, 121	fvmpt 6991	. . . . . . . . . . 11 ⊢ (𝑚 ∈ ℕ → (𝑇‘𝑚) = {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹})
123	122	adantl 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝑇‘𝑚) = {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹})
124	123	eleq2d 2821	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝑥 ∈ (𝑇‘𝑚) ↔ 𝑥 ∈ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹}))
125	124	biimpa 476	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 𝑥 ∈ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹})
126		oveq1 7417	. . . . . . . . . 10 ⊢ (𝑠 = 𝑥 → (𝑠 − (𝐺‘𝑚)) = (𝑥 − (𝐺‘𝑚)))
127	126	eleq1d 2820	. . . . . . . . 9 ⊢ (𝑠 = 𝑥 → ((𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹 ↔ (𝑥 − (𝐺‘𝑚)) ∈ ran 𝐹))
128	127	elrab 3676	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑠 ∈ ℝ ∣ (𝑠 − (𝐺‘𝑚)) ∈ ran 𝐹} ↔ (𝑥 ∈ ℝ ∧ (𝑥 − (𝐺‘𝑚)) ∈ ran 𝐹))
129	125, 128	sylib 218	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝑥 ∈ ℝ ∧ (𝑥 − (𝐺‘𝑚)) ∈ ran 𝐹))
130	129	simpld 494	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 𝑥 ∈ ℝ)
131	84	a1i 11	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → -1 ∈ ℝ)
132		iccssre 13451	. . . . . . . . . 10 ⊢ ((-1 ∈ ℝ ∧ 1 ∈ ℝ) → (-1[,]1) ⊆ ℝ)
133	84, 85, 132	mp2an 692	. . . . . . . . 9 ⊢ (-1[,]1) ⊆ ℝ
134		f1of 6823	. . . . . . . . . . . 12 ⊢ (𝐺:ℕ–1-1-onto→(ℚ ∩ (-1[,]1)) → 𝐺:ℕ⟶(ℚ ∩ (-1[,]1)))
135	27, 134	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺:ℕ⟶(ℚ ∩ (-1[,]1)))
136	135	ffvelcdmda 7079	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝐺‘𝑚) ∈ (ℚ ∩ (-1[,]1)))
137	136	elin2d 4185	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝐺‘𝑚) ∈ (-1[,]1))
138	133, 137	sselid 3961	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ ℕ) → (𝐺‘𝑚) ∈ ℝ)
139	138	adantr 480	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝐺‘𝑚) ∈ ℝ)
140	137	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝐺‘𝑚) ∈ (-1[,]1))
141	84, 85	elicc2i 13434	. . . . . . . . 9 ⊢ ((𝐺‘𝑚) ∈ (-1[,]1) ↔ ((𝐺‘𝑚) ∈ ℝ ∧ -1 ≤ (𝐺‘𝑚) ∧ (𝐺‘𝑚) ≤ 1))
142	140, 141	sylib 218	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ((𝐺‘𝑚) ∈ ℝ ∧ -1 ≤ (𝐺‘𝑚) ∧ (𝐺‘𝑚) ≤ 1))
143	142	simp2d 1143	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → -1 ≤ (𝐺‘𝑚))
144	26	ad2antrr 726	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ran 𝐹 ⊆ (0[,]1))
145	129	simprd 495	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝑥 − (𝐺‘𝑚)) ∈ ran 𝐹)
146	144, 145	sseldd 3964	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝑥 − (𝐺‘𝑚)) ∈ (0[,]1))
147		elicc01 13488	. . . . . . . . . 10 ⊢ ((𝑥 − (𝐺‘𝑚)) ∈ (0[,]1) ↔ ((𝑥 − (𝐺‘𝑚)) ∈ ℝ ∧ 0 ≤ (𝑥 − (𝐺‘𝑚)) ∧ (𝑥 − (𝐺‘𝑚)) ≤ 1))
148	146, 147	sylib 218	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ((𝑥 − (𝐺‘𝑚)) ∈ ℝ ∧ 0 ≤ (𝑥 − (𝐺‘𝑚)) ∧ (𝑥 − (𝐺‘𝑚)) ≤ 1))
149	148	simp2d 1143	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 0 ≤ (𝑥 − (𝐺‘𝑚)))
150	130, 139	subge0d 11832	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (0 ≤ (𝑥 − (𝐺‘𝑚)) ↔ (𝐺‘𝑚) ≤ 𝑥))
151	149, 150	mpbid 232	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝐺‘𝑚) ≤ 𝑥)
152	131, 139, 130, 143, 151	letrd 11397	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → -1 ≤ 𝑥)
153		peano2re 11413	. . . . . . . 8 ⊢ ((𝐺‘𝑚) ∈ ℝ → ((𝐺‘𝑚) + 1) ∈ ℝ)
154	139, 153	syl 17	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ((𝐺‘𝑚) + 1) ∈ ℝ)
155		2re 12319	. . . . . . . 8 ⊢ 2 ∈ ℝ
156	155	a1i 11	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 2 ∈ ℝ)
157	148	simp3d 1144	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝑥 − (𝐺‘𝑚)) ≤ 1)
158		1red 11241	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 1 ∈ ℝ)
159	130, 139, 158	lesubadd2d 11841	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ((𝑥 − (𝐺‘𝑚)) ≤ 1 ↔ 𝑥 ≤ ((𝐺‘𝑚) + 1)))
160	157, 159	mpbid 232	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 𝑥 ≤ ((𝐺‘𝑚) + 1))
161	142	simp3d 1144	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → (𝐺‘𝑚) ≤ 1)
162	139, 158, 158, 161	leadd1dd 11856	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ((𝐺‘𝑚) + 1) ≤ (1 + 1))
163		df-2 12308	. . . . . . . 8 ⊢ 2 = (1 + 1)
164	162, 163	breqtrrdi 5166	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → ((𝐺‘𝑚) + 1) ≤ 2)
165	130, 154, 156, 160, 164	letrd 11397	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 𝑥 ≤ 2)
166	84, 155	elicc2i 13434	. . . . . 6 ⊢ (𝑥 ∈ (-1[,]2) ↔ (𝑥 ∈ ℝ ∧ -1 ≤ 𝑥 ∧ 𝑥 ≤ 2))
167	130, 152, 165, 166	syl3anbrc 1344	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ℕ) ∧ 𝑥 ∈ (𝑇‘𝑚)) → 𝑥 ∈ (-1[,]2))
168	167	rexlimdva2 3144	. . . 4 ⊢ (𝜑 → (∃𝑚 ∈ ℕ 𝑥 ∈ (𝑇‘𝑚) → 𝑥 ∈ (-1[,]2)))
169	116, 168	biimtrid 242	. . 3 ⊢ (𝜑 → (𝑥 ∈ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚) → 𝑥 ∈ (-1[,]2)))
170	169	ssrdv 3969	. 2 ⊢ (𝜑 → ∪ 𝑚 ∈ ℕ (𝑇‘𝑚) ⊆ (-1[,]2))
171	26, 115, 170	3jca 1128	1 ⊢ (𝜑 → (ran 𝐹 ⊆ (0[,]1) ∧ (0[,]1) ⊆ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚) ∧ ∪ 𝑚 ∈ ℕ (𝑇‘𝑚) ⊆ (-1[,]2)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2933  ∀wral 3052  ∃wrex 3061  {crab 3420  Vcvv 3464   ∖ cdif 3928   ∩ cin 3930   ⊆ wss 3931  ∅c0 4313  𝒫 cpw 4580  ∪ ciun 4972   class class class wbr 5124  {copab 5186   ↦ cmpt 5206  ^◡ccnv 5658  dom cdm 5659  ran crn 5660   Fn wfn 6531  ⟶wf 6532  –1-1-onto→wf1o 6535  ‘cfv 6536  (class class class)co 7410   Er wer 8721  [cec 8722   / cqs 8723  ℝcr 11133  0cc0 11134  1c1 11135   + caddc 11137   ≤ cle 11275   − cmin 11471  -cneg 11472  ℕcn 12245  2c2 12300  ℚcq 12969  [,]cicc 13370  volcvol 25421

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 2708  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734  ax-cnex 11190  ax-resscn 11191  ax-1cn 11192  ax-icn 11193  ax-addcl 11194  ax-addrcl 11195  ax-mulcl 11196  ax-mulrcl 11197  ax-mulcom 11198  ax-addass 11199  ax-mulass 11200  ax-distr 11201  ax-i2m1 11202  ax-1ne0 11203  ax-1rid 11204  ax-rnegex 11205  ax-rrecex 11206  ax-cnre 11207  ax-pre-lttri 11208  ax-pre-lttrn 11209  ax-pre-ltadd 11210  ax-pre-mulgt0 11211

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 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3062  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  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 6295  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7867  df-1st 7993  df-2nd 7994  df-frecs 8285  df-wrecs 8316  df-recs 8390  df-rdg 8429  df-er 8724  df-ec 8726  df-qs 8730  df-en 8965  df-dom 8966  df-sdom 8967  df-pnf 11276  df-mnf 11277  df-xr 11278  df-ltxr 11279  df-le 11280  df-sub 11473  df-neg 11474  df-div 11900  df-nn 12246  df-2 12308  df-n0 12507  df-z 12594  df-q 12970  df-icc 13374

This theorem is referenced by:  vitalilem3  25568  vitalilem4  25569  vitalilem5  25570