Theorem ovolicc2lem5 24685

Description: Lemma for ovolicc2 24686. (Contributed by Mario Carneiro, 14-Jun-2014.)

Hypotheses

Ref	Expression
ovolicc.1	⊢ (𝜑 → 𝐴 ∈ ℝ)
ovolicc.2	⊢ (𝜑 → 𝐵 ∈ ℝ)
ovolicc.3	⊢ (𝜑 → 𝐴 ≤ 𝐵)
ovolicc2.4	⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹))
ovolicc2.5	⊢ (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
ovolicc2.6	⊢ (𝜑 → 𝑈 ∈ (𝒫 ran ((,) ∘ 𝐹) ∩ Fin))
ovolicc2.7	⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ∪ 𝑈)
ovolicc2.8	⊢ (𝜑 → 𝐺:𝑈⟶ℕ)
ovolicc2.9	⊢ ((𝜑 ∧ 𝑡 ∈ 𝑈) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = 𝑡)
ovolicc2.10	⊢ 𝑇 = {𝑢 ∈ 𝑈 ∣ (𝑢 ∩ (𝐴[,]𝐵)) ≠ ∅}

Assertion

Ref	Expression
ovolicc2lem5	⊢ (𝜑 → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ*, < ))

Distinct variable groups:   𝑢,𝑡,𝐴   𝑡,𝐵,𝑢   𝑡,𝐹   𝑡,𝐺   𝜑,𝑡   𝑡,𝑇   𝑡,𝑈,𝑢

Allowed substitution hints:   𝜑(𝑢)   𝑆(𝑢,𝑡)   𝑇(𝑢)   𝐹(𝑢)   𝐺(𝑢)

Proof of Theorem ovolicc2lem5

Dummy variables ℎ 𝑚 𝑛 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ovolicc2.7	. . . 4 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ∪ 𝑈)
2		ovolicc.1	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℝ)
3	2	rexrd 11025	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ*)
4		ovolicc.2	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℝ)
5	4	rexrd 11025	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ*)
6		ovolicc.3	. . . . 5 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
7		lbicc2 13196	. . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵))
8	3, 5, 6, 7	syl3anc 1370	. . . 4 ⊢ (𝜑 → 𝐴 ∈ (𝐴[,]𝐵))
9	1, 8	sseldd 3922	. . 3 ⊢ (𝜑 → 𝐴 ∈ ∪ 𝑈)
10		eluni2 4843	. . 3 ⊢ (𝐴 ∈ ∪ 𝑈 ↔ ∃𝑧 ∈ 𝑈 𝐴 ∈ 𝑧)
11	9, 10	sylib 217	. 2 ⊢ (𝜑 → ∃𝑧 ∈ 𝑈 𝐴 ∈ 𝑧)
12		ovolicc2.6	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ (𝒫 ran ((,) ∘ 𝐹) ∩ Fin))
13	12	elin2d 4133	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ Fin)
14		ovolicc2.10	. . . . . . 7 ⊢ 𝑇 = {𝑢 ∈ 𝑈 ∣ (𝑢 ∩ (𝐴[,]𝐵)) ≠ ∅}
15	14	ssrab3 4015	. . . . . 6 ⊢ 𝑇 ⊆ 𝑈
16		ssfi 8956	. . . . . 6 ⊢ ((𝑈 ∈ Fin ∧ 𝑇 ⊆ 𝑈) → 𝑇 ∈ Fin)
17	13, 15, 16	sylancl 586	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ Fin)
18	1	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐴[,]𝐵) ⊆ ∪ 𝑈)
19		ovolicc2.8	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐺:𝑈⟶ℕ)
20		ineq1 4139	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑢 = 𝑡 → (𝑢 ∩ (𝐴[,]𝐵)) = (𝑡 ∩ (𝐴[,]𝐵)))
21	20	neeq1d 3003	. . . . . . . . . . . . . . . . 17 ⊢ (𝑢 = 𝑡 → ((𝑢 ∩ (𝐴[,]𝐵)) ≠ ∅ ↔ (𝑡 ∩ (𝐴[,]𝐵)) ≠ ∅))
22	21, 14	elrab2 3627	. . . . . . . . . . . . . . . 16 ⊢ (𝑡 ∈ 𝑇 ↔ (𝑡 ∈ 𝑈 ∧ (𝑡 ∩ (𝐴[,]𝐵)) ≠ ∅))
23	22	simplbi 498	. . . . . . . . . . . . . . 15 ⊢ (𝑡 ∈ 𝑇 → 𝑡 ∈ 𝑈)
24		ffvelrn 6959	. . . . . . . . . . . . . . 15 ⊢ ((𝐺:𝑈⟶ℕ ∧ 𝑡 ∈ 𝑈) → (𝐺‘𝑡) ∈ ℕ)
25	19, 23, 24	syl2an 596	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐺‘𝑡) ∈ ℕ)
26		ovolicc2.5	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
27	26	ffvelrnda 6961	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝐺‘𝑡) ∈ ℕ) → (𝐹‘(𝐺‘𝑡)) ∈ ( ≤ ∩ (ℝ × ℝ)))
28	25, 27	syldan 591	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘(𝐺‘𝑡)) ∈ ( ≤ ∩ (ℝ × ℝ)))
29	28	elin2d 4133	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘(𝐺‘𝑡)) ∈ (ℝ × ℝ))
30		xp2nd 7864	. . . . . . . . . . . 12 ⊢ ((𝐹‘(𝐺‘𝑡)) ∈ (ℝ × ℝ) → (2nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ)
31	29, 30	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (2nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ)
32	4	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝐵 ∈ ℝ)
33	31, 32	ifcld 4505	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ ℝ)
34	22	simprbi 497	. . . . . . . . . . . . . 14 ⊢ (𝑡 ∈ 𝑇 → (𝑡 ∩ (𝐴[,]𝐵)) ≠ ∅)
35	34	adantl 482	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑡 ∩ (𝐴[,]𝐵)) ≠ ∅)
36		n0 4280	. . . . . . . . . . . . 13 ⊢ ((𝑡 ∩ (𝐴[,]𝐵)) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))
37	35, 36	sylib 217	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ∃𝑦 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))
38	2	adantr 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝐴 ∈ ℝ)
39		simprr 770	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))
40	39	elin2d 4133	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 ∈ (𝐴[,]𝐵))
41	4	adantr 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝐵 ∈ ℝ)
42		elicc2 13144	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑦 ∈ (𝐴[,]𝐵) ↔ (𝑦 ∈ ℝ ∧ 𝐴 ≤ 𝑦 ∧ 𝑦 ≤ 𝐵)))
43	2, 41, 42	syl2an2r 682	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝑦 ∈ (𝐴[,]𝐵) ↔ (𝑦 ∈ ℝ ∧ 𝐴 ≤ 𝑦 ∧ 𝑦 ≤ 𝐵)))
44	40, 43	mpbid 231	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝑦 ∈ ℝ ∧ 𝐴 ≤ 𝑦 ∧ 𝑦 ≤ 𝐵))
45	44	simp1d 1141	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 ∈ ℝ)
46	29	adantrr 714	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝐹‘(𝐺‘𝑡)) ∈ (ℝ × ℝ))
47	46, 30	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (2nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ)
48	44	simp2d 1142	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝐴 ≤ 𝑦)
49	39	elin1d 4132	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 ∈ 𝑡)
50	25	adantrr 714	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝐺‘𝑡) ∈ ℕ)
51		fvco3 6867	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ (𝐺‘𝑡) ∈ ℕ) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = ((,)‘(𝐹‘(𝐺‘𝑡))))
52	26, 50, 51	syl2an2r 682	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = ((,)‘(𝐹‘(𝐺‘𝑡))))
53		ovolicc2.9	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑈) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = 𝑡)
54	23, 53	sylan2 593	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = 𝑡)
55	54	adantrr 714	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = 𝑡)
56		1st2nd2 7870	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐹‘(𝐺‘𝑡)) ∈ (ℝ × ℝ) → (𝐹‘(𝐺‘𝑡)) = ⟨(1st ‘(𝐹‘(𝐺‘𝑡))), (2nd ‘(𝐹‘(𝐺‘𝑡)))⟩)
57	46, 56	syl 17	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝐹‘(𝐺‘𝑡)) = ⟨(1st ‘(𝐹‘(𝐺‘𝑡))), (2nd ‘(𝐹‘(𝐺‘𝑡)))⟩)
58	57	fveq2d 6778	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → ((,)‘(𝐹‘(𝐺‘𝑡))) = ((,)‘⟨(1st ‘(𝐹‘(𝐺‘𝑡))), (2nd ‘(𝐹‘(𝐺‘𝑡)))⟩))
59		df-ov 7278	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((1st ‘(𝐹‘(𝐺‘𝑡)))(,)(2nd ‘(𝐹‘(𝐺‘𝑡)))) = ((,)‘⟨(1st ‘(𝐹‘(𝐺‘𝑡))), (2nd ‘(𝐹‘(𝐺‘𝑡)))⟩)
60	58, 59	eqtr4di 2796	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → ((,)‘(𝐹‘(𝐺‘𝑡))) = ((1st ‘(𝐹‘(𝐺‘𝑡)))(,)(2nd ‘(𝐹‘(𝐺‘𝑡)))))
61	52, 55, 60	3eqtr3d 2786	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑡 = ((1st ‘(𝐹‘(𝐺‘𝑡)))(,)(2nd ‘(𝐹‘(𝐺‘𝑡)))))
62	49, 61	eleqtrd 2841	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 ∈ ((1st ‘(𝐹‘(𝐺‘𝑡)))(,)(2nd ‘(𝐹‘(𝐺‘𝑡)))))
63		xp1st 7863	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹‘(𝐺‘𝑡)) ∈ (ℝ × ℝ) → (1st ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ)
64	46, 63	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (1st ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ)
65		rexr 11021	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((1st ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ → (1st ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ*)
66		rexr 11021	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((2nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ → (2nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ*)
67		elioo2 13120	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((1st ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ* ∧ (2nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ*) → (𝑦 ∈ ((1st ‘(𝐹‘(𝐺‘𝑡)))(,)(2nd ‘(𝐹‘(𝐺‘𝑡)))) ↔ (𝑦 ∈ ℝ ∧ (1st ‘(𝐹‘(𝐺‘𝑡))) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐹‘(𝐺‘𝑡))))))
68	65, 66, 67	syl2an 596	. . . . . . . . . . . . . . . . . . 19 ⊢ (((1st ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ ∧ (2nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ) → (𝑦 ∈ ((1st ‘(𝐹‘(𝐺‘𝑡)))(,)(2nd ‘(𝐹‘(𝐺‘𝑡)))) ↔ (𝑦 ∈ ℝ ∧ (1st ‘(𝐹‘(𝐺‘𝑡))) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐹‘(𝐺‘𝑡))))))
69	64, 47, 68	syl2anc 584	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝑦 ∈ ((1st ‘(𝐹‘(𝐺‘𝑡)))(,)(2nd ‘(𝐹‘(𝐺‘𝑡)))) ↔ (𝑦 ∈ ℝ ∧ (1st ‘(𝐹‘(𝐺‘𝑡))) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐹‘(𝐺‘𝑡))))))
70	62, 69	mpbid 231	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝑦 ∈ ℝ ∧ (1st ‘(𝐹‘(𝐺‘𝑡))) < 𝑦 ∧ 𝑦 < (2nd ‘(𝐹‘(𝐺‘𝑡)))))
71	70	simp3d 1143	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 < (2nd ‘(𝐹‘(𝐺‘𝑡))))
72	45, 47, 71	ltled 11123	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 ≤ (2nd ‘(𝐹‘(𝐺‘𝑡))))
73	38, 45, 47, 48, 72	letrd 11132	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝐴 ≤ (2nd ‘(𝐹‘(𝐺‘𝑡))))
74	73	expr 457	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)) → 𝐴 ≤ (2nd ‘(𝐹‘(𝐺‘𝑡)))))
75	74	exlimdv 1936	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (∃𝑦 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)) → 𝐴 ≤ (2nd ‘(𝐹‘(𝐺‘𝑡)))))
76	37, 75	mpd 15	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝐴 ≤ (2nd ‘(𝐹‘(𝐺‘𝑡))))
77	6	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝐴 ≤ 𝐵)
78		breq2 5078	. . . . . . . . . . . 12 ⊢ ((2nd ‘(𝐹‘(𝐺‘𝑡))) = if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) → (𝐴 ≤ (2nd ‘(𝐹‘(𝐺‘𝑡))) ↔ 𝐴 ≤ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵)))
79		breq2 5078	. . . . . . . . . . . 12 ⊢ (𝐵 = if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) → (𝐴 ≤ 𝐵 ↔ 𝐴 ≤ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵)))
80	78, 79	ifboth 4498	. . . . . . . . . . 11 ⊢ ((𝐴 ≤ (2nd ‘(𝐹‘(𝐺‘𝑡))) ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵))
81	76, 77, 80	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝐴 ≤ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵))
82		min2 12924	. . . . . . . . . . 11 ⊢ (((2nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ ∧ 𝐵 ∈ ℝ) → if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ≤ 𝐵)
83	31, 32, 82	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ≤ 𝐵)
84		elicc2 13144	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (𝐴[,]𝐵) ↔ (if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ ℝ ∧ 𝐴 ≤ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∧ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ≤ 𝐵)))
85	2, 4, 84	syl2anc 584	. . . . . . . . . . 11 ⊢ (𝜑 → (if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (𝐴[,]𝐵) ↔ (if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ ℝ ∧ 𝐴 ≤ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∧ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ≤ 𝐵)))
86	85	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (𝐴[,]𝐵) ↔ (if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ ℝ ∧ 𝐴 ≤ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∧ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ≤ 𝐵)))
87	33, 81, 83, 86	mpbir3and 1341	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (𝐴[,]𝐵))
88	18, 87	sseldd 3922	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ ∪ 𝑈)
89		eluni2 4843	. . . . . . . 8 ⊢ (if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ ∪ 𝑈 ↔ ∃𝑥 ∈ 𝑈 if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)
90	88, 89	sylib 217	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ∃𝑥 ∈ 𝑈 if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)
91		simprl 768	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ (𝑥 ∈ 𝑈 ∧ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)) → 𝑥 ∈ 𝑈)
92		simprr 770	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ (𝑥 ∈ 𝑈 ∧ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)) → if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)
93	87	adantr 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ (𝑥 ∈ 𝑈 ∧ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)) → if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (𝐴[,]𝐵))
94		inelcm 4398	. . . . . . . . 9 ⊢ ((if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥 ∧ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (𝐴[,]𝐵)) → (𝑥 ∩ (𝐴[,]𝐵)) ≠ ∅)
95	92, 93, 94	syl2anc 584	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ (𝑥 ∈ 𝑈 ∧ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)) → (𝑥 ∩ (𝐴[,]𝐵)) ≠ ∅)
96		ineq1 4139	. . . . . . . . . 10 ⊢ (𝑢 = 𝑥 → (𝑢 ∩ (𝐴[,]𝐵)) = (𝑥 ∩ (𝐴[,]𝐵)))
97	96	neeq1d 3003	. . . . . . . . 9 ⊢ (𝑢 = 𝑥 → ((𝑢 ∩ (𝐴[,]𝐵)) ≠ ∅ ↔ (𝑥 ∩ (𝐴[,]𝐵)) ≠ ∅))
98	97, 14	elrab2 3627	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑇 ↔ (𝑥 ∈ 𝑈 ∧ (𝑥 ∩ (𝐴[,]𝐵)) ≠ ∅))
99	91, 95, 98	sylanbrc 583	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ (𝑥 ∈ 𝑈 ∧ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)) → 𝑥 ∈ 𝑇)
100	90, 99, 92	reximssdv 3205	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ∃𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)
101	100	ralrimiva 3103	. . . . 5 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 ∃𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)
102		eleq2 2827	. . . . . 6 ⊢ (𝑥 = (ℎ‘𝑡) → (if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥 ↔ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)))
103	102	ac6sfi 9058	. . . . 5 ⊢ ((𝑇 ∈ Fin ∧ ∀𝑡 ∈ 𝑇 ∃𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥) → ∃ℎ(ℎ:𝑇⟶𝑇 ∧ ∀𝑡 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)))
104	17, 101, 103	syl2anc 584	. . . 4 ⊢ (𝜑 → ∃ℎ(ℎ:𝑇⟶𝑇 ∧ ∀𝑡 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)))
105	104	adantr 481	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) → ∃ℎ(ℎ:𝑇⟶𝑇 ∧ ∀𝑡 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)))
106		2fveq3 6779	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑡 → (𝐹‘(𝐺‘𝑥)) = (𝐹‘(𝐺‘𝑡)))
107	106	fveq2d 6778	. . . . . . . . . 10 ⊢ (𝑥 = 𝑡 → (2nd ‘(𝐹‘(𝐺‘𝑥))) = (2nd ‘(𝐹‘(𝐺‘𝑡))))
108	107	breq1d 5084	. . . . . . . . 9 ⊢ (𝑥 = 𝑡 → ((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵 ↔ (2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵))
109	108, 107	ifbieq1d 4483	. . . . . . . 8 ⊢ (𝑥 = 𝑡 → if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) = if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵))
110		fveq2 6774	. . . . . . . 8 ⊢ (𝑥 = 𝑡 → (ℎ‘𝑥) = (ℎ‘𝑡))
111	109, 110	eleq12d 2833	. . . . . . 7 ⊢ (𝑥 = 𝑡 → (if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥) ↔ if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)))
112	111	cbvralvw 3383	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥) ↔ ∀𝑡 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡))
113	2	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐴 ∈ ℝ)
114	4	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐵 ∈ ℝ)
115	6	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐴 ≤ 𝐵)
116		ovolicc2.4	. . . . . . . . 9 ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹))
117	26	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
118	12	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝑈 ∈ (𝒫 ran ((,) ∘ 𝐹) ∩ Fin))
119	1	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → (𝐴[,]𝐵) ⊆ ∪ 𝑈)
120	19	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐺:𝑈⟶ℕ)
121	53	adantlr 712	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) ∧ 𝑡 ∈ 𝑈) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = 𝑡)
122		simprrl 778	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → ℎ:𝑇⟶𝑇)
123		simprrr 779	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥))
124	111	rspccva 3560	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥) ∧ 𝑡 ∈ 𝑇) → if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡))
125	123, 124	sylan 580	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) ∧ 𝑡 ∈ 𝑇) → if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡))
126		simprlr 777	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐴 ∈ 𝑧)
127		simprll 776	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝑧 ∈ 𝑈)
128	8	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐴 ∈ (𝐴[,]𝐵))
129		inelcm 4398	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑧 ∧ 𝐴 ∈ (𝐴[,]𝐵)) → (𝑧 ∩ (𝐴[,]𝐵)) ≠ ∅)
130	126, 128, 129	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → (𝑧 ∩ (𝐴[,]𝐵)) ≠ ∅)
131		ineq1 4139	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑧 → (𝑢 ∩ (𝐴[,]𝐵)) = (𝑧 ∩ (𝐴[,]𝐵)))
132	131	neeq1d 3003	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑧 → ((𝑢 ∩ (𝐴[,]𝐵)) ≠ ∅ ↔ (𝑧 ∩ (𝐴[,]𝐵)) ≠ ∅))
133	132, 14	elrab2 3627	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑇 ↔ (𝑧 ∈ 𝑈 ∧ (𝑧 ∩ (𝐴[,]𝐵)) ≠ ∅))
134	127, 130, 133	sylanbrc 583	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝑧 ∈ 𝑇)
135		eqid 2738	. . . . . . . . 9 ⊢ seq1((ℎ ∘ 1st ), (ℕ × {𝑧})) = seq1((ℎ ∘ 1st ), (ℕ × {𝑧}))
136		fveq2 6774	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (seq1((ℎ ∘ 1st ), (ℕ × {𝑧}))‘𝑚) = (seq1((ℎ ∘ 1st ), (ℕ × {𝑧}))‘𝑛))
137	136	eleq2d 2824	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → (𝐵 ∈ (seq1((ℎ ∘ 1st ), (ℕ × {𝑧}))‘𝑚) ↔ 𝐵 ∈ (seq1((ℎ ∘ 1st ), (ℕ × {𝑧}))‘𝑛)))
138	137	cbvrabv 3426	. . . . . . . . 9 ⊢ {𝑚 ∈ ℕ ∣ 𝐵 ∈ (seq1((ℎ ∘ 1st ), (ℕ × {𝑧}))‘𝑚)} = {𝑛 ∈ ℕ ∣ 𝐵 ∈ (seq1((ℎ ∘ 1st ), (ℕ × {𝑧}))‘𝑛)}
139		eqid 2738	. . . . . . . . 9 ⊢ inf({𝑚 ∈ ℕ ∣ 𝐵 ∈ (seq1((ℎ ∘ 1st ), (ℕ × {𝑧}))‘𝑚)}, ℝ, < ) = inf({𝑚 ∈ ℕ ∣ 𝐵 ∈ (seq1((ℎ ∘ 1st ), (ℕ × {𝑧}))‘𝑚)}, ℝ, < )
140	113, 114, 115, 116, 117, 118, 119, 120, 121, 14, 122, 125, 126, 134, 135, 138, 139	ovolicc2lem4 24684	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ*, < ))
141	140	anassrs 468	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥))) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ*, < ))
142	141	expr 457	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) ∧ ℎ:𝑇⟶𝑇) → (∀𝑥 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ*, < )))
143	112, 142	syl5bir 242	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) ∧ ℎ:𝑇⟶𝑇) → (∀𝑡 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ*, < )))
144	143	expimpd 454	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) → ((ℎ:𝑇⟶𝑇 ∧ ∀𝑡 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ*, < )))
145	144	exlimdv 1936	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) → (∃ℎ(ℎ:𝑇⟶𝑇 ∧ ∀𝑡 ∈ 𝑇 if((2nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ*, < )))
146	105, 145	mpd 15	. 2 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ*, < ))
147	11, 146	rexlimddv 3220	1 ⊢ (𝜑 → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ*, < ))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1086   = wceq 1539  ∃wex 1782   ∈ wcel 2106   ≠ wne 2943  ∀wral 3064  ∃wrex 3065  {crab 3068   ∩ cin 3886   ⊆ wss 3887  ∅c0 4256  ifcif 4459  𝒫 cpw 4533  {csn 4561  ⟨cop 4567  ∪ cuni 4839   class class class wbr 5074   × cxp 5587  ran crn 5590   ∘ ccom 5593  ⟶wf 6429  ‘cfv 6433  (class class class)co 7275  1^st c1st 7829  2^nd c2nd 7830  Fincfn 8733  supcsup 9199  infcinf 9200  ℝcr 10870  1c1 10872   + caddc 10874  ℝ^*cxr 11008   < clt 11009   ≤ cle 11010   − cmin 11205  ℕcn 11973  (,)cioo 13079  [,]cicc 13082  seqcseq 13721  abscabs 14945

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-inf2 9399  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948  ax-pre-sup 10949

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-se 5545  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-isom 6442  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-er 8498  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737  df-sup 9201  df-inf 9202  df-oi 9269  df-card 9697  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-div 11633  df-nn 11974  df-2 12036  df-3 12037  df-n0 12234  df-z 12320  df-uz 12583  df-rp 12731  df-ioo 13083  df-ico 13085  df-icc 13086  df-fz 13240  df-fzo 13383  df-seq 13722  df-exp 13783  df-hash 14045  df-cj 14810  df-re 14811  df-im 14812  df-sqrt 14946  df-abs 14947  df-clim 15197  df-sum 15398

This theorem is referenced by:  ovolicc2  24686