ovolicc2lem5 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ovolicc2lem5		Structured version Visualization version GIF version

Theorem ovolicc2lem5 25038

Description: Lemma for ovolicc2 25039. (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 11264	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
4		ovolicc.2	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℝ)
5	4	rexrd 11264	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
6		ovolicc.3	. . . . 5 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
7		lbicc2 13441	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵))
8	3, 5, 6, 7	syl3anc 1372	. . . 4 ⊢ (𝜑 → 𝐴 ∈ (𝐴[,]𝐵))
9	1, 8	sseldd 3984	. . 3 ⊢ (𝜑 → 𝐴 ∈ ∪ 𝑈)
10		eluni2 4913	. . 3 ⊢ (𝐴 ∈ ∪ 𝑈 ↔ ∃𝑧 ∈ 𝑈 𝐴 ∈ 𝑧)
11	9, 10	sylib 217	. 2 ⊢ (𝜑 → ∃𝑧 ∈ 𝑈 𝐴 ∈ 𝑧)
12		ovolicc2.6	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ (𝒫 ran ((,) ∘ 𝐹) ∩ Fin))
13	12	elin2d 4200	. . . . . 6 ⊢ (𝜑 → 𝑈 ∈ Fin)
14		ovolicc2.10	. . . . . . 7 ⊢ 𝑇 = {𝑢 ∈ 𝑈 ∣ (𝑢 ∩ (𝐴[,]𝐵)) ≠ ∅}
15	14	ssrab3 4081	. . . . . 6 ⊢ 𝑇 ⊆ 𝑈
16		ssfi 9173	. . . . . 6 ⊢ ((𝑈 ∈ Fin ∧ 𝑇 ⊆ 𝑈) → 𝑇 ∈ Fin)
17	13, 15, 16	sylancl 587	. . . . 5 ⊢ (𝜑 → 𝑇 ∈ Fin)
18	1	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐴[,]𝐵) ⊆ ∪ 𝑈)
19		ovolicc2.8	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐺:𝑈⟶ℕ)
20		ineq1 4206	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑢 = 𝑡 → (𝑢 ∩ (𝐴[,]𝐵)) = (𝑡 ∩ (𝐴[,]𝐵)))
21	20	neeq1d 3001	. . . . . . . . . . . . . . . . 17 ⊢ (𝑢 = 𝑡 → ((𝑢 ∩ (𝐴[,]𝐵)) ≠ ∅ ↔ (𝑡 ∩ (𝐴[,]𝐵)) ≠ ∅))
22	21, 14	elrab2 3687	. . . . . . . . . . . . . . . 16 ⊢ (𝑡 ∈ 𝑇 ↔ (𝑡 ∈ 𝑈 ∧ (𝑡 ∩ (𝐴[,]𝐵)) ≠ ∅))
23	22	simplbi 499	. . . . . . . . . . . . . . 15 ⊢ (𝑡 ∈ 𝑇 → 𝑡 ∈ 𝑈)
24		ffvelcdm 7084	. . . . . . . . . . . . . . 15 ⊢ ((𝐺:𝑈⟶ℕ ∧ 𝑡 ∈ 𝑈) → (𝐺‘𝑡) ∈ ℕ)
25	19, 23, 24	syl2an 597	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐺‘𝑡) ∈ ℕ)
26		ovolicc2.5	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
27	26	ffvelcdmda 7087	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝐺‘𝑡) ∈ ℕ) → (𝐹‘(𝐺‘𝑡)) ∈ ( ≤ ∩ (ℝ × ℝ)))
28	25, 27	syldan 592	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘(𝐺‘𝑡)) ∈ ( ≤ ∩ (ℝ × ℝ)))
29	28	elin2d 4200	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘(𝐺‘𝑡)) ∈ (ℝ × ℝ))
30		xp2nd 8008	. . . . . . . . . . . 12 ⊢ ((𝐹‘(𝐺‘𝑡)) ∈ (ℝ × ℝ) → (2^nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ)
31	29, 30	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (2^nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ)
32	4	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝐵 ∈ ℝ)
33	31, 32	ifcld 4575	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ ℝ)
34	22	simprbi 498	. . . . . . . . . . . . . 14 ⊢ (𝑡 ∈ 𝑇 → (𝑡 ∩ (𝐴[,]𝐵)) ≠ ∅)
35	34	adantl 483	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑡 ∩ (𝐴[,]𝐵)) ≠ ∅)
36		n0 4347	. . . . . . . . . . . . 13 ⊢ ((𝑡 ∩ (𝐴[,]𝐵)) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))
37	35, 36	sylib 217	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ∃𝑦 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))
38	2	adantr 482	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝐴 ∈ ℝ)
39		simprr 772	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))
40	39	elin2d 4200	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 ∈ (𝐴[,]𝐵))
41	4	adantr 482	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝐵 ∈ ℝ)
42		elicc2 13389	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑦 ∈ (𝐴[,]𝐵) ↔ (𝑦 ∈ ℝ ∧ 𝐴 ≤ 𝑦 ∧ 𝑦 ≤ 𝐵)))
43	2, 41, 42	syl2an2r 684	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝑦 ∈ (𝐴[,]𝐵) ↔ (𝑦 ∈ ℝ ∧ 𝐴 ≤ 𝑦 ∧ 𝑦 ≤ 𝐵)))
44	40, 43	mpbid 231	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝑦 ∈ ℝ ∧ 𝐴 ≤ 𝑦 ∧ 𝑦 ≤ 𝐵))
45	44	simp1d 1143	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 ∈ ℝ)
46	29	adantrr 716	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝐹‘(𝐺‘𝑡)) ∈ (ℝ × ℝ))
47	46, 30	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (2^nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ)
48	44	simp2d 1144	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝐴 ≤ 𝑦)
49	39	elin1d 4199	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 ∈ 𝑡)
50	25	adantrr 716	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝐺‘𝑡) ∈ ℕ)
51		fvco3 6991	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ (𝐺‘𝑡) ∈ ℕ) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = ((,)‘(𝐹‘(𝐺‘𝑡))))
52	26, 50, 51	syl2an2r 684	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = ((,)‘(𝐹‘(𝐺‘𝑡))))
53		ovolicc2.9	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑈) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = 𝑡)
54	23, 53	sylan2 594	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = 𝑡)
55	54	adantrr 716	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = 𝑡)
56		1st2nd2 8014	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐹‘(𝐺‘𝑡)) ∈ (ℝ × ℝ) → (𝐹‘(𝐺‘𝑡)) = ⟨(1^st ‘(𝐹‘(𝐺‘𝑡))), (2^nd ‘(𝐹‘(𝐺‘𝑡)))⟩)
57	46, 56	syl 17	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝐹‘(𝐺‘𝑡)) = ⟨(1^st ‘(𝐹‘(𝐺‘𝑡))), (2^nd ‘(𝐹‘(𝐺‘𝑡)))⟩)
58	57	fveq2d 6896	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → ((,)‘(𝐹‘(𝐺‘𝑡))) = ((,)‘⟨(1^st ‘(𝐹‘(𝐺‘𝑡))), (2^nd ‘(𝐹‘(𝐺‘𝑡)))⟩))
59		df-ov 7412	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((1^st ‘(𝐹‘(𝐺‘𝑡)))(,)(2^nd ‘(𝐹‘(𝐺‘𝑡)))) = ((,)‘⟨(1^st ‘(𝐹‘(𝐺‘𝑡))), (2^nd ‘(𝐹‘(𝐺‘𝑡)))⟩)
60	58, 59	eqtr4di 2791	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → ((,)‘(𝐹‘(𝐺‘𝑡))) = ((1^st ‘(𝐹‘(𝐺‘𝑡)))(,)(2^nd ‘(𝐹‘(𝐺‘𝑡)))))
61	52, 55, 60	3eqtr3d 2781	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑡 = ((1^st ‘(𝐹‘(𝐺‘𝑡)))(,)(2^nd ‘(𝐹‘(𝐺‘𝑡)))))
62	49, 61	eleqtrd 2836	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 ∈ ((1^st ‘(𝐹‘(𝐺‘𝑡)))(,)(2^nd ‘(𝐹‘(𝐺‘𝑡)))))
63		xp1st 8007	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹‘(𝐺‘𝑡)) ∈ (ℝ × ℝ) → (1^st ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ)
64	46, 63	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (1^st ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ)
65		rexr 11260	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((1^st ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ → (1^st ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ^*)
66		rexr 11260	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((2^nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ → (2^nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ^*)
67		elioo2 13365	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((1^st ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ^* ∧ (2^nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ^*) → (𝑦 ∈ ((1^st ‘(𝐹‘(𝐺‘𝑡)))(,)(2^nd ‘(𝐹‘(𝐺‘𝑡)))) ↔ (𝑦 ∈ ℝ ∧ (1^st ‘(𝐹‘(𝐺‘𝑡))) < 𝑦 ∧ 𝑦 < (2^nd ‘(𝐹‘(𝐺‘𝑡))))))
68	65, 66, 67	syl2an 597	. . . . . . . . . . . . . . . . . . 19 ⊢ (((1^st ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ ∧ (2^nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ) → (𝑦 ∈ ((1^st ‘(𝐹‘(𝐺‘𝑡)))(,)(2^nd ‘(𝐹‘(𝐺‘𝑡)))) ↔ (𝑦 ∈ ℝ ∧ (1^st ‘(𝐹‘(𝐺‘𝑡))) < 𝑦 ∧ 𝑦 < (2^nd ‘(𝐹‘(𝐺‘𝑡))))))
69	64, 47, 68	syl2anc 585	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝑦 ∈ ((1^st ‘(𝐹‘(𝐺‘𝑡)))(,)(2^nd ‘(𝐹‘(𝐺‘𝑡)))) ↔ (𝑦 ∈ ℝ ∧ (1^st ‘(𝐹‘(𝐺‘𝑡))) < 𝑦 ∧ 𝑦 < (2^nd ‘(𝐹‘(𝐺‘𝑡))))))
70	62, 69	mpbid 231	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → (𝑦 ∈ ℝ ∧ (1^st ‘(𝐹‘(𝐺‘𝑡))) < 𝑦 ∧ 𝑦 < (2^nd ‘(𝐹‘(𝐺‘𝑡)))))
71	70	simp3d 1145	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 < (2^nd ‘(𝐹‘(𝐺‘𝑡))))
72	45, 47, 71	ltled 11362	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝑦 ≤ (2^nd ‘(𝐹‘(𝐺‘𝑡))))
73	38, 45, 47, 48, 72	letrd 11371	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑡 ∈ 𝑇 ∧ 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)))) → 𝐴 ≤ (2^nd ‘(𝐹‘(𝐺‘𝑡))))
74	73	expr 458	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)) → 𝐴 ≤ (2^nd ‘(𝐹‘(𝐺‘𝑡)))))
75	74	exlimdv 1937	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (∃𝑦 𝑦 ∈ (𝑡 ∩ (𝐴[,]𝐵)) → 𝐴 ≤ (2^nd ‘(𝐹‘(𝐺‘𝑡)))))
76	37, 75	mpd 15	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝐴 ≤ (2^nd ‘(𝐹‘(𝐺‘𝑡))))
77	6	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝐴 ≤ 𝐵)
78		breq2 5153	. . . . . . . . . . . 12 ⊢ ((2^nd ‘(𝐹‘(𝐺‘𝑡))) = if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) → (𝐴 ≤ (2^nd ‘(𝐹‘(𝐺‘𝑡))) ↔ 𝐴 ≤ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵)))
79		breq2 5153	. . . . . . . . . . . 12 ⊢ (𝐵 = if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) → (𝐴 ≤ 𝐵 ↔ 𝐴 ≤ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵)))
80	78, 79	ifboth 4568	. . . . . . . . . . 11 ⊢ ((𝐴 ≤ (2^nd ‘(𝐹‘(𝐺‘𝑡))) ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵))
81	76, 77, 80	syl2anc 585	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝐴 ≤ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵))
82		min2 13169	. . . . . . . . . . 11 ⊢ (((2^nd ‘(𝐹‘(𝐺‘𝑡))) ∈ ℝ ∧ 𝐵 ∈ ℝ) → if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ≤ 𝐵)
83	31, 32, 82	syl2anc 585	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ≤ 𝐵)
84		elicc2 13389	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (𝐴[,]𝐵) ↔ (if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ ℝ ∧ 𝐴 ≤ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∧ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ≤ 𝐵)))
85	2, 4, 84	syl2anc 585	. . . . . . . . . . 11 ⊢ (𝜑 → (if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (𝐴[,]𝐵) ↔ (if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ ℝ ∧ 𝐴 ≤ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∧ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ≤ 𝐵)))
86	85	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (𝐴[,]𝐵) ↔ (if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ ℝ ∧ 𝐴 ≤ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∧ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ≤ 𝐵)))
87	33, 81, 83, 86	mpbir3and 1343	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (𝐴[,]𝐵))
88	18, 87	sseldd 3984	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ ∪ 𝑈)
89		eluni2 4913	. . . . . . . 8 ⊢ (if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ ∪ 𝑈 ↔ ∃𝑥 ∈ 𝑈 if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)
90	88, 89	sylib 217	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ∃𝑥 ∈ 𝑈 if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)
91		simprl 770	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ (𝑥 ∈ 𝑈 ∧ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)) → 𝑥 ∈ 𝑈)
92		simprr 772	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ (𝑥 ∈ 𝑈 ∧ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)) → if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)
93	87	adantr 482	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ (𝑥 ∈ 𝑈 ∧ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)) → if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (𝐴[,]𝐵))
94		inelcm 4465	. . . . . . . . 9 ⊢ ((if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥 ∧ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (𝐴[,]𝐵)) → (𝑥 ∩ (𝐴[,]𝐵)) ≠ ∅)
95	92, 93, 94	syl2anc 585	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ (𝑥 ∈ 𝑈 ∧ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)) → (𝑥 ∩ (𝐴[,]𝐵)) ≠ ∅)
96		ineq1 4206	. . . . . . . . . 10 ⊢ (𝑢 = 𝑥 → (𝑢 ∩ (𝐴[,]𝐵)) = (𝑥 ∩ (𝐴[,]𝐵)))
97	96	neeq1d 3001	. . . . . . . . 9 ⊢ (𝑢 = 𝑥 → ((𝑢 ∩ (𝐴[,]𝐵)) ≠ ∅ ↔ (𝑥 ∩ (𝐴[,]𝐵)) ≠ ∅))
98	97, 14	elrab2 3687	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑇 ↔ (𝑥 ∈ 𝑈 ∧ (𝑥 ∩ (𝐴[,]𝐵)) ≠ ∅))
99	91, 95, 98	sylanbrc 584	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ (𝑥 ∈ 𝑈 ∧ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)) → 𝑥 ∈ 𝑇)
100	90, 99, 92	reximssdv 3173	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ∃𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)
101	100	ralrimiva 3147	. . . . 5 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 ∃𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥)
102		eleq2 2823	. . . . . 6 ⊢ (𝑥 = (ℎ‘𝑡) → (if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥 ↔ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)))
103	102	ac6sfi 9287	. . . . 5 ⊢ ((𝑇 ∈ Fin ∧ ∀𝑡 ∈ 𝑇 ∃𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ 𝑥) → ∃ℎ(ℎ:𝑇⟶𝑇 ∧ ∀𝑡 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)))
104	17, 101, 103	syl2anc 585	. . . 4 ⊢ (𝜑 → ∃ℎ(ℎ:𝑇⟶𝑇 ∧ ∀𝑡 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)))
105	104	adantr 482	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) → ∃ℎ(ℎ:𝑇⟶𝑇 ∧ ∀𝑡 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)))
106		2fveq3 6897	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑡 → (𝐹‘(𝐺‘𝑥)) = (𝐹‘(𝐺‘𝑡)))
107	106	fveq2d 6896	. . . . . . . . . 10 ⊢ (𝑥 = 𝑡 → (2^nd ‘(𝐹‘(𝐺‘𝑥))) = (2^nd ‘(𝐹‘(𝐺‘𝑡))))
108	107	breq1d 5159	. . . . . . . . 9 ⊢ (𝑥 = 𝑡 → ((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵 ↔ (2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵))
109	108, 107	ifbieq1d 4553	. . . . . . . 8 ⊢ (𝑥 = 𝑡 → if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) = if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵))
110		fveq2 6892	. . . . . . . 8 ⊢ (𝑥 = 𝑡 → (ℎ‘𝑥) = (ℎ‘𝑡))
111	109, 110	eleq12d 2828	. . . . . . 7 ⊢ (𝑥 = 𝑡 → (if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥) ↔ if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)))
112	111	cbvralvw 3235	. . . . . 6 ⊢ (∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥) ↔ ∀𝑡 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡))
113	2	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐴 ∈ ℝ)
114	4	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐵 ∈ ℝ)
115	6	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐴 ≤ 𝐵)
116		ovolicc2.4	. . . . . . . . 9 ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹))
117	26	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
118	12	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝑈 ∈ (𝒫 ran ((,) ∘ 𝐹) ∩ Fin))
119	1	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → (𝐴[,]𝐵) ⊆ ∪ 𝑈)
120	19	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐺:𝑈⟶ℕ)
121	53	adantlr 714	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) ∧ 𝑡 ∈ 𝑈) → (((,) ∘ 𝐹)‘(𝐺‘𝑡)) = 𝑡)
122		simprrl 780	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → ℎ:𝑇⟶𝑇)
123		simprrr 781	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥))
124	111	rspccva 3612	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥) ∧ 𝑡 ∈ 𝑇) → if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡))
125	123, 124	sylan 581	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) ∧ 𝑡 ∈ 𝑇) → if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡))
126		simprlr 779	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐴 ∈ 𝑧)
127		simprll 778	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝑧 ∈ 𝑈)
128	8	adantr 482	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝐴 ∈ (𝐴[,]𝐵))
129		inelcm 4465	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑧 ∧ 𝐴 ∈ (𝐴[,]𝐵)) → (𝑧 ∩ (𝐴[,]𝐵)) ≠ ∅)
130	126, 128, 129	syl2anc 585	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → (𝑧 ∩ (𝐴[,]𝐵)) ≠ ∅)
131		ineq1 4206	. . . . . . . . . . . 12 ⊢ (𝑢 = 𝑧 → (𝑢 ∩ (𝐴[,]𝐵)) = (𝑧 ∩ (𝐴[,]𝐵)))
132	131	neeq1d 3001	. . . . . . . . . . 11 ⊢ (𝑢 = 𝑧 → ((𝑢 ∩ (𝐴[,]𝐵)) ≠ ∅ ↔ (𝑧 ∩ (𝐴[,]𝐵)) ≠ ∅))
133	132, 14	elrab2 3687	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑇 ↔ (𝑧 ∈ 𝑈 ∧ (𝑧 ∩ (𝐴[,]𝐵)) ≠ ∅))
134	127, 130, 133	sylanbrc 584	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → 𝑧 ∈ 𝑇)
135		eqid 2733	. . . . . . . . 9 ⊢ seq1((ℎ ∘ 1^st ), (ℕ × {𝑧})) = seq1((ℎ ∘ 1^st ), (ℕ × {𝑧}))
136		fveq2 6892	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑛 → (seq1((ℎ ∘ 1^st ), (ℕ × {𝑧}))‘𝑚) = (seq1((ℎ ∘ 1^st ), (ℕ × {𝑧}))‘𝑛))
137	136	eleq2d 2820	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → (𝐵 ∈ (seq1((ℎ ∘ 1^st ), (ℕ × {𝑧}))‘𝑚) ↔ 𝐵 ∈ (seq1((ℎ ∘ 1^st ), (ℕ × {𝑧}))‘𝑛)))
138	137	cbvrabv 3443	. . . . . . . . 9 ⊢ {𝑚 ∈ ℕ ∣ 𝐵 ∈ (seq1((ℎ ∘ 1^st ), (ℕ × {𝑧}))‘𝑚)} = {𝑛 ∈ ℕ ∣ 𝐵 ∈ (seq1((ℎ ∘ 1^st ), (ℕ × {𝑧}))‘𝑛)}
139		eqid 2733	. . . . . . . . 9 ⊢ inf({𝑚 ∈ ℕ ∣ 𝐵 ∈ (seq1((ℎ ∘ 1^st ), (ℕ × {𝑧}))‘𝑚)}, ℝ, < ) = inf({𝑚 ∈ ℕ ∣ 𝐵 ∈ (seq1((ℎ ∘ 1^st ), (ℕ × {𝑧}))‘𝑚)}, ℝ, < )
140	113, 114, 115, 116, 117, 118, 119, 120, 121, 14, 122, 125, 126, 134, 135, 138, 139	ovolicc2lem4 25037	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥)))) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ^*, < ))
141	140	anassrs 469	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) ∧ (ℎ:𝑇⟶𝑇 ∧ ∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥))) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ^*, < ))
142	141	expr 458	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) ∧ ℎ:𝑇⟶𝑇) → (∀𝑥 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑥))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑥))), 𝐵) ∈ (ℎ‘𝑥) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ^*, < )))
143	112, 142	biimtrrid 242	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) ∧ ℎ:𝑇⟶𝑇) → (∀𝑡 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ^*, < )))
144	143	expimpd 455	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) → ((ℎ:𝑇⟶𝑇 ∧ ∀𝑡 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ^*, < )))
145	144	exlimdv 1937	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) → (∃ℎ(ℎ:𝑇⟶𝑇 ∧ ∀𝑡 ∈ 𝑇 if((2^nd ‘(𝐹‘(𝐺‘𝑡))) ≤ 𝐵, (2^nd ‘(𝐹‘(𝐺‘𝑡))), 𝐵) ∈ (ℎ‘𝑡)) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ^*, < )))
146	105, 145	mpd 15	. 2 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑈 ∧ 𝐴 ∈ 𝑧)) → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ^*, < ))
147	11, 146	rexlimddv 3162	1 ⊢ (𝜑 → (𝐵 − 𝐴) ≤ sup(ran 𝑆, ℝ^*, < ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∃wex 1782 ∈ wcel 2107 ≠ wne 2941 ∀wral 3062 ∃wrex 3071 {crab 3433 ∩ cin 3948 ⊆ wss 3949 ∅c0 4323 ifcif 4529 𝒫 cpw 4603 {csn 4629 ⟨cop 4635 ∪ cuni 4909 class class class wbr 5149 × cxp 5675 ran crn 5678 ∘ ccom 5681 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 1^st c1st 7973 2^nd c2nd 7974 Fincfn 8939 supcsup 9435 infcinf 9436 ℝcr 11109 1c1 11111 + caddc 11113 ℝ^*cxr 11247 < clt 11248 ≤ cle 11249 − cmin 11444 ℕcn 12212 (,)cioo 13324 [,]cicc 13327 seqcseq 13966 abscabs 15181

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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-inf2 9636 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-isom 6553 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9437 df-inf 9438 df-oi 9505 df-card 9934 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-n0 12473 df-z 12559 df-uz 12823 df-rp 12975 df-ioo 13328 df-ico 13330 df-icc 13331 df-fz 13485 df-fzo 13628 df-seq 13967 df-exp 14028 df-hash 14291 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-clim 15432 df-sum 15633

This theorem is referenced by: ovolicc2 25039

W3C validator