Theorem ovolctb 25866

Description: The volume of a denumerable set is 0. (Contributed by Mario Carneiro, 17-Mar-2014.) (Proof shortened by Mario Carneiro, 25-Mar-2015.)

Assertion

Ref	Expression
ovolctb	⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≈ ℕ) → (vol*‘𝐴) = 0)

Proof of Theorem ovolctb

Dummy variables 𝑓 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bren 9021	. . 3 ⊢ (ℕ ≈ 𝐴 ↔ ∃𝑓 𝑓:ℕ⟶1-1onto𝐴)
2		simpll 779	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → 𝐴 ⊆ ℝ)
3		f1of 6854	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:ℕ⟶1-1onto𝐴 → 𝑓:ℕ⟶𝐴)
4	3	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → 𝑓:ℕ⟶𝐴)
5	4	ffvelcdmda 7116	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → (𝑓‘𝑥) ∈ 𝐴)
6	2, 5	sseldd 3914	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → (𝑓‘𝑥) ∈ ℝ)
7	6	leidd 11922	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → (𝑓‘𝑥) ≤ (𝑓‘𝑥))
8		df-br 5109	. . . . . . . . . . . 12 ⊢ ((𝑓‘𝑥) ≤ (𝑓‘𝑥) ↔ ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩ ∈ ≤ )
9	7, 8	sylib 221	. . . . . . . . . . 11 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩ ∈ ≤ )
10	6, 6	opelxpd 5697	. . . . . . . . . . 11 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩ ∈ (ℝ × ℝ))
11	9, 10	elind 4100	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩ ∈ ( ≤ ∩ (ℝ × ℝ)))
12		df-ov 7454	. . . . . . . . . . . 12 ⊢ ((𝑓‘𝑥) I (𝑓‘𝑥)) = ( I ‘⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩)
13		opex 5439	. . . . . . . . . . . . 13 ⊢ ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩ ∈ V
14		fvi 6992	. . . . . . . . . . . . 13 ⊢ (⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩ ∈ V → ( I ‘⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩) = ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩)
15	13, 14	ax-mp 5	. . . . . . . . . . . 12 ⊢ ( I ‘⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩) = ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩
16	12, 15	eqtri 2786	. . . . . . . . . . 11 ⊢ ((𝑓‘𝑥) I (𝑓‘𝑥)) = ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩
17	16	mpteq2i 5207	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℕ ↦ ((𝑓‘𝑥) I (𝑓‘𝑥))) = (𝑥 ∈ ℕ ↦ ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩)
18	11, 17	fmptd 7146	. . . . . . . . 9 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (𝑥 ∈ ℕ ↦ ((𝑓‘𝑥) I (𝑓‘𝑥))):ℕ⟶( ≤ ∩ (ℝ × ℝ)))
19		nnex 12381	. . . . . . . . . . . 12 ⊢ ℕ ∈ V
20	19	a1i 11	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → ℕ ∈ V)
21	6	recnd 11376	. . . . . . . . . . 11 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → (𝑓‘𝑥) ∈ ℂ)
22	4	feqmptd 6984	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → 𝑓 = (𝑥 ∈ ℕ ↦ (𝑓‘𝑥)))
23	20, 21, 21, 22, 22	offval2 7745	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (𝑓 ∘f I 𝑓) = (𝑥 ∈ ℕ ↦ ((𝑓‘𝑥) I (𝑓‘𝑥))))
24	23	feq1d 6721	. . . . . . . . 9 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → ((𝑓 ∘f I 𝑓):ℕ⟶( ≤ ∩ (ℝ × ℝ)) ↔ (𝑥 ∈ ℕ ↦ ((𝑓‘𝑥) I (𝑓‘𝑥))):ℕ⟶( ≤ ∩ (ℝ × ℝ))))
25	18, 24	mpbird 260	. . . . . . . 8 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (𝑓 ∘f I 𝑓):ℕ⟶( ≤ ∩ (ℝ × ℝ)))
26		f1ofo 6862	. . . . . . . . . . . . . . 15 ⊢ (𝑓:ℕ⟶1-1onto𝐴 → 𝑓:ℕ⟶onto𝐴)
27	26	adantl 487	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → 𝑓:ℕ⟶onto𝐴)
28		forn 6829	. . . . . . . . . . . . . 14 ⊢ (𝑓:ℕ⟶onto𝐴 → ran 𝑓 = 𝐴)
29	27, 28	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → ran 𝑓 = 𝐴)
30	29	eleq2d 2850	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (𝑦 ∈ ran 𝑓 ↔ 𝑦 ∈ 𝐴))
31		f1ofn 6855	. . . . . . . . . . . . . 14 ⊢ (𝑓:ℕ⟶1-1onto𝐴 → 𝑓 Fn ℕ)
32	31	adantl 487	. . . . . . . . . . . . 13 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → 𝑓 Fn ℕ)
33		fvelrnb 6976	. . . . . . . . . . . . 13 ⊢ (𝑓 Fn ℕ → (𝑦 ∈ ran 𝑓 ↔ ∃𝑥 ∈ ℕ (𝑓‘𝑥) = 𝑦))
34	32, 33	syl 18	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (𝑦 ∈ ran 𝑓 ↔ ∃𝑥 ∈ ℕ (𝑓‘𝑥) = 𝑦))
35	30, 34	bitr3d 284	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (𝑦 ∈ 𝐴 ↔ ∃𝑥 ∈ ℕ (𝑓‘𝑥) = 𝑦))
36	23, 17	eqtrdi 2814	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (𝑓 ∘f I 𝑓) = (𝑥 ∈ ℕ ↦ ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩))
37	36	fveq1d 6918	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → ((𝑓 ∘f I 𝑓)‘𝑥) = ((𝑥 ∈ ℕ ↦ ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩)‘𝑥))
38		eqid 2763	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ ℕ ↦ ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩) = (𝑥 ∈ ℕ ↦ ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩)
39	38	fvmpt2 7036	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 ∈ ℕ ∧ ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩ ∈ V) → ((𝑥 ∈ ℕ ↦ ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩)‘𝑥) = ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩)
40	13, 39	mpan2 704	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ℕ → ((𝑥 ∈ ℕ ↦ ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩)‘𝑥) = ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩)
41	37, 40	sylan9eq 2818	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → ((𝑓 ∘f I 𝑓)‘𝑥) = ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩)
42	41	fveq2d 6920	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → (1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) = (1st ‘⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩))
43		fvex 6929	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓‘𝑥) ∈ V
44	43, 43	op1st 8043	. . . . . . . . . . . . . . . 16 ⊢ (1st ‘⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩) = (𝑓‘𝑥)
45	42, 44	eqtrdi 2814	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → (1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) = (𝑓‘𝑥))
46	45, 7	eqbrtrd 5133	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → (1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) ≤ (𝑓‘𝑥))
47	41	fveq2d 6920	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥)) = (2nd ‘⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩))
48	43, 43	op2nd 8044	. . . . . . . . . . . . . . . 16 ⊢ (2nd ‘⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩) = (𝑓‘𝑥)
49	47, 48	eqtrdi 2814	. . . . . . . . . . . . . . 15 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥)) = (𝑓‘𝑥))
50	7, 49	breqtrrd 5139	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → (𝑓‘𝑥) ≤ (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥)))
51	46, 50	jca 521	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → ((1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) ≤ (𝑓‘𝑥) ∧ (𝑓‘𝑥) ≤ (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥))))
52		breq2 5112	. . . . . . . . . . . . . 14 ⊢ ((𝑓‘𝑥) = 𝑦 → ((1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) ≤ (𝑓‘𝑥) ↔ (1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) ≤ 𝑦))
53		breq1 5111	. . . . . . . . . . . . . 14 ⊢ ((𝑓‘𝑥) = 𝑦 → ((𝑓‘𝑥) ≤ (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥)) ↔ 𝑦 ≤ (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥))))
54	52, 53	anbi12d 644	. . . . . . . . . . . . 13 ⊢ ((𝑓‘𝑥) = 𝑦 → (((1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) ≤ (𝑓‘𝑥) ∧ (𝑓‘𝑥) ≤ (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥))) ↔ ((1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) ≤ 𝑦 ∧ 𝑦 ≤ (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥)))))
55	51, 54	syl5ibcom 248	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → ((𝑓‘𝑥) = 𝑦 → ((1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) ≤ 𝑦 ∧ 𝑦 ≤ (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥)))))
56	55	reximdva 3179	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (∃𝑥 ∈ ℕ (𝑓‘𝑥) = 𝑦 → ∃𝑥 ∈ ℕ ((1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) ≤ 𝑦 ∧ 𝑦 ≤ (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥)))))
57	35, 56	sylbid 243	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (𝑦 ∈ 𝐴 → ∃𝑥 ∈ ℕ ((1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) ≤ 𝑦 ∧ 𝑦 ≤ (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥)))))
58	57	ralrimiv 3157	. . . . . . . . 9 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → ∀𝑦 ∈ 𝐴 ∃𝑥 ∈ ℕ ((1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) ≤ 𝑦 ∧ 𝑦 ≤ (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥))))
59		ovolficc 25844	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ ℝ ∧ (𝑓 ∘f I 𝑓):ℕ⟶( ≤ ∩ (ℝ × ℝ))) → (𝐴 ⊆ ∪ ran ([,] ∘ (𝑓 ∘f I 𝑓)) ↔ ∀𝑦 ∈ 𝐴 ∃𝑥 ∈ ℕ ((1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) ≤ 𝑦 ∧ 𝑦 ≤ (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥)))))
60	25, 59	syldan 603	. . . . . . . . 9 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (𝐴 ⊆ ∪ ran ([,] ∘ (𝑓 ∘f I 𝑓)) ↔ ∀𝑦 ∈ 𝐴 ∃𝑥 ∈ ℕ ((1st ‘((𝑓 ∘f I 𝑓)‘𝑥)) ≤ 𝑦 ∧ 𝑦 ≤ (2nd ‘((𝑓 ∘f I 𝑓)‘𝑥)))))
61	58, 60	mpbird 260	. . . . . . . 8 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → 𝐴 ⊆ ∪ ran ([,] ∘ (𝑓 ∘f I 𝑓)))
62		eqid 2763	. . . . . . . . 9 ⊢ seq1( + , ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓))) = seq1( + , ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓)))
63	62	ovollb2 25865	. . . . . . . 8 ⊢ (((𝑓 ∘f I 𝑓):ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ([,] ∘ (𝑓 ∘f I 𝑓))) → (vol*‘𝐴) ≤ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓))), ℝ*, < ))
64	25, 61, 63	syl2anc 596	. . . . . . 7 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (vol*‘𝐴) ≤ sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓))), ℝ*, < ))
65	21, 21	opelxpd 5697	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩ ∈ (ℂ × ℂ))
66		absf 15548	. . . . . . . . . . . . . . . . . . 19 ⊢ abs:ℂ⟶ℝ
67		subf 11598	. . . . . . . . . . . . . . . . . . 19 ⊢ − :(ℂ × ℂ)⟶ℂ
68		fco 6764	. . . . . . . . . . . . . . . . . . 19 ⊢ ((abs:ℂ⟶ℝ ∧ − :(ℂ × ℂ)⟶ℂ) → (abs ∘ − ):(ℂ × ℂ)⟶ℝ)
69	66, 67, 68	mp2an 705	. . . . . . . . . . . . . . . . . 18 ⊢ (abs ∘ − ):(ℂ × ℂ)⟶ℝ
70	69	a1i 11	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (abs ∘ − ):(ℂ × ℂ)⟶ℝ)
71	70	feqmptd 6984	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (abs ∘ − ) = (𝑦 ∈ (ℂ × ℂ) ↦ ((abs ∘ − )‘𝑦)))
72		fveq2 6916	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩ → ((abs ∘ − )‘𝑦) = ((abs ∘ − )‘⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩))
73		df-ov 7454	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑓‘𝑥)(abs ∘ − )(𝑓‘𝑥)) = ((abs ∘ − )‘⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩)
74	72, 73	eqtr4di 2816	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = ⟨(𝑓‘𝑥), (𝑓‘𝑥)⟩ → ((abs ∘ − )‘𝑦) = ((𝑓‘𝑥)(abs ∘ − )(𝑓‘𝑥)))
75	65, 36, 71, 74	fmptco 7162	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓)) = (𝑥 ∈ ℕ ↦ ((𝑓‘𝑥)(abs ∘ − )(𝑓‘𝑥))))
76		cnmet 25145	. . . . . . . . . . . . . . . . 17 ⊢ (abs ∘ − ) ∈ (Met‘ℂ)
77		met0 24717	. . . . . . . . . . . . . . . . 17 ⊢ (((abs ∘ − ) ∈ (Met‘ℂ) ∧ (𝑓‘𝑥) ∈ ℂ) → ((𝑓‘𝑥)(abs ∘ − )(𝑓‘𝑥)) = 0)
78	76, 21, 77	sylancr 599	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) ∧ 𝑥 ∈ ℕ) → ((𝑓‘𝑥)(abs ∘ − )(𝑓‘𝑥)) = 0)
79	78	mpteq2dva 5204	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (𝑥 ∈ ℕ ↦ ((𝑓‘𝑥)(abs ∘ − )(𝑓‘𝑥))) = (𝑥 ∈ ℕ ↦ 0))
80	75, 79	eqtrd 2798	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓)) = (𝑥 ∈ ℕ ↦ 0))
81		fconstmpt 5720	. . . . . . . . . . . . . 14 ⊢ (ℕ × {0}) = (𝑥 ∈ ℕ ↦ 0)
82	80, 81	eqtr4di 2816	. . . . . . . . . . . . 13 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓)) = (ℕ × {0}))
83	82	seqeq3d 14192	. . . . . . . . . . . 12 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → seq1( + , ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓))) = seq1( + , (ℕ × {0})))
84		1z 12766	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℤ
85		nnuz 13044	. . . . . . . . . . . . . 14 ⊢ ℕ = (ℤ≥‘1)
86	85	ser0f 14238	. . . . . . . . . . . . 13 ⊢ (1 ∈ ℤ → seq1( + , (ℕ × {0})) = (ℕ × {0}))
87	84, 86	ax-mp 5	. . . . . . . . . . . 12 ⊢ seq1( + , (ℕ × {0})) = (ℕ × {0})
88	83, 87	eqtrdi 2814	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → seq1( + , ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓))) = (ℕ × {0}))
89	88	rneqd 5932	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → ran seq1( + , ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓))) = ran (ℕ × {0}))
90		1nn 12386	. . . . . . . . . . 11 ⊢ 1 ∈ ℕ
91		ne0i 4290	. . . . . . . . . . 11 ⊢ (1 ∈ ℕ → ℕ ≠ ∅)
92		rnxp 6180	. . . . . . . . . . 11 ⊢ (ℕ ≠ ∅ → ran (ℕ × {0}) = {0})
93	90, 91, 92	mp2b 10	. . . . . . . . . 10 ⊢ ran (ℕ × {0}) = {0}
94	89, 93	eqtrdi 2814	. . . . . . . . 9 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → ran seq1( + , ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓))) = {0})
95	94	supeq1d 9475	. . . . . . . 8 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓))), ℝ*, < ) = sup({0}, ℝ*, < ))
96		xrltso 13310	. . . . . . . . 9 ⊢ < Or ℝ*
97		0xr 11395	. . . . . . . . 9 ⊢ 0 ∈ ℝ*
98		supsn 9502	. . . . . . . . 9 ⊢ (( < Or ℝ* ∧ 0 ∈ ℝ*) → sup({0}, ℝ*, < ) = 0)
99	96, 97, 98	mp2an 705	. . . . . . . 8 ⊢ sup({0}, ℝ*, < ) = 0
100	95, 99	eqtrdi 2814	. . . . . . 7 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → sup(ran seq1( + , ((abs ∘ − ) ∘ (𝑓 ∘f I 𝑓))), ℝ*, < ) = 0)
101	64, 100	breqtrd 5137	. . . . . 6 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (vol*‘𝐴) ≤ 0)
102		ovolge0 25857	. . . . . . 7 ⊢ (𝐴 ⊆ ℝ → 0 ≤ (vol*‘𝐴))
103	102	adantr 486	. . . . . 6 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → 0 ≤ (vol*‘𝐴))
104		ovolcl 25854	. . . . . . . 8 ⊢ (𝐴 ⊆ ℝ → (vol*‘𝐴) ∈ ℝ*)
105	104	adantr 486	. . . . . . 7 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (vol*‘𝐴) ∈ ℝ*)
106		xrletri3 13323	. . . . . . 7 ⊢ (((vol*‘𝐴) ∈ ℝ* ∧ 0 ∈ ℝ*) → ((vol*‘𝐴) = 0 ↔ ((vol*‘𝐴) ≤ 0 ∧ 0 ≤ (vol*‘𝐴))))
107	105, 97, 106	sylancl 598	. . . . . 6 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → ((vol*‘𝐴) = 0 ↔ ((vol*‘𝐴) ≤ 0 ∧ 0 ≤ (vol*‘𝐴))))
108	101, 103, 107	mpbir2and 726	. . . . 5 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑓:ℕ⟶1-1onto𝐴) → (vol*‘𝐴) = 0)
109	108	ex 418	. . . 4 ⊢ (𝐴 ⊆ ℝ → (𝑓:ℕ⟶1-1onto𝐴 → (vol*‘𝐴) = 0))
110	109	exlimdv 1968	. . 3 ⊢ (𝐴 ⊆ ℝ → (∃𝑓 𝑓:ℕ⟶1-1onto𝐴 → (vol*‘𝐴) = 0))
111	1, 110	biimtrid 245	. 2 ⊢ (𝐴 ⊆ ℝ → (ℕ ≈ 𝐴 → (vol*‘𝐴) = 0))
112		ensym 9068	. 2 ⊢ (𝐴 ≈ ℕ → ℕ ≈ 𝐴)
113	111, 112	impel 515	1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≈ ℕ) → (vol*‘𝐴) = 0)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  {csn 4588  ⟨cop 4840  ∪ cuni 4872   class class class wbr 5108   ↦ cmpt 5192   I cid 5552   Or wor 5565   × cxp 5656  ran crn 5659   ∘ ccom 5662   Fn wfn 6561  ⟶wf 6562  ⟶ontowfo 6564  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451   ∘_f cof 7723  1^st c1st 8033  2^nd c2nd 8034   ≈ cen 9008  supcsup 9469  ℂcc 11237  ℝcr 11238  0cc0 11239  1c1 11240   + caddc 11242  ℝ^*cxr 11381   < clt 11382   ≤ cle 11383   − cmin 11580  ℕcn 12375  ℤcz 12733  [,]cicc 13519  seqcseq 14184  abscabs 15444  Metcmet 21715  vol*covol 25838

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-inf2 9679  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316  ax-pre-sup 11317

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-of 7725  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-sup 9471  df-inf 9472  df-oi 9541  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-div 12014  df-nn 12376  df-2 12445  df-3 12446  df-n0 12647  df-z 12734  df-uz 13006  df-q 13116  df-rp 13161  df-xadd 13282  df-ioo 13520  df-ico 13522  df-icc 13523  df-fz 13680  df-fzo 13829  df-seq 14185  df-exp 14245  df-hash 14516  df-cj 15309  df-re 15310  df-im 15311  df-sqrt 15445  df-abs 15446  df-clim 15699  df-sum 15898  df-xmet 21722  df-met 21723  df-ovol 25840

This theorem is used by:  ovolq  25867  ovolctb2  25868  ovoliunnfl  38848