Theorem itg2seq 25695

Description: Definitional property of the ∫₂ integral: for any function 𝐹 there is a countable sequence 𝑔 of simple functions less than 𝐹 whose integrals converge to the integral of 𝐹. (This theorem is for the most part unnecessary in lieu of itg2i1fseq 25708, but unlike that theorem this one doesn't require 𝐹 to be measurable.) (Contributed by Mario Carneiro, 14-Aug-2014.)

Assertion

Ref	Expression
itg2seq	⊢ (𝐹:ℝ⟶(0[,]+∞) → ∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ (𝑔‘𝑛) ∘r ≤ 𝐹 ∧ (∫2‘𝐹) = sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < )))

Distinct variable group:   𝑔,𝑛,𝐹

Proof of Theorem itg2seq

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

Step	Hyp	Ref	Expression
1		nnre 12247	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ)
2	1	ad2antlr 727	. . . . . . . . . . 11 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ (∫2‘𝐹) = +∞) → 𝑛 ∈ ℝ)
3	2	ltpnfd 13137	. . . . . . . . . 10 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ (∫2‘𝐹) = +∞) → 𝑛 < +∞)
4		iftrue 4506	. . . . . . . . . . 11 ⊢ ((∫2‘𝐹) = +∞ → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) = 𝑛)
5	4	adantl 481	. . . . . . . . . 10 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ (∫2‘𝐹) = +∞) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) = 𝑛)
6		simpr 484	. . . . . . . . . 10 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ (∫2‘𝐹) = +∞) → (∫2‘𝐹) = +∞)
7	3, 5, 6	3brtr4d 5151	. . . . . . . . 9 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ (∫2‘𝐹) = +∞) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫2‘𝐹))
8		iffalse 4509	. . . . . . . . . . 11 ⊢ (¬ (∫2‘𝐹) = +∞ → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) = ((∫2‘𝐹) − (1 / 𝑛)))
9	8	adantl 481	. . . . . . . . . 10 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ ¬ (∫2‘𝐹) = +∞) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) = ((∫2‘𝐹) − (1 / 𝑛)))
10		itg2cl 25685	. . . . . . . . . . . . . . 15 ⊢ (𝐹:ℝ⟶(0[,]+∞) → (∫2‘𝐹) ∈ ℝ*)
11		xrrebnd 13184	. . . . . . . . . . . . . . 15 ⊢ ((∫2‘𝐹) ∈ ℝ* → ((∫2‘𝐹) ∈ ℝ ↔ (-∞ < (∫2‘𝐹) ∧ (∫2‘𝐹) < +∞)))
12	10, 11	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝐹:ℝ⟶(0[,]+∞) → ((∫2‘𝐹) ∈ ℝ ↔ (-∞ < (∫2‘𝐹) ∧ (∫2‘𝐹) < +∞)))
13		itg2ge0 25688	. . . . . . . . . . . . . . . 16 ⊢ (𝐹:ℝ⟶(0[,]+∞) → 0 ≤ (∫2‘𝐹))
14		mnflt0 13141	. . . . . . . . . . . . . . . . 17 ⊢ -∞ < 0
15		mnfxr 11292	. . . . . . . . . . . . . . . . . 18 ⊢ -∞ ∈ ℝ*
16		0xr 11282	. . . . . . . . . . . . . . . . . 18 ⊢ 0 ∈ ℝ*
17		xrltletr 13173	. . . . . . . . . . . . . . . . . 18 ⊢ ((-∞ ∈ ℝ* ∧ 0 ∈ ℝ* ∧ (∫2‘𝐹) ∈ ℝ*) → ((-∞ < 0 ∧ 0 ≤ (∫2‘𝐹)) → -∞ < (∫2‘𝐹)))
18	15, 16, 10, 17	mp3an12i 1467	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹:ℝ⟶(0[,]+∞) → ((-∞ < 0 ∧ 0 ≤ (∫2‘𝐹)) → -∞ < (∫2‘𝐹)))
19	14, 18	mpani 696	. . . . . . . . . . . . . . . 16 ⊢ (𝐹:ℝ⟶(0[,]+∞) → (0 ≤ (∫2‘𝐹) → -∞ < (∫2‘𝐹)))
20	13, 19	mpd 15	. . . . . . . . . . . . . . 15 ⊢ (𝐹:ℝ⟶(0[,]+∞) → -∞ < (∫2‘𝐹))
21	20	biantrurd 532	. . . . . . . . . . . . . 14 ⊢ (𝐹:ℝ⟶(0[,]+∞) → ((∫2‘𝐹) < +∞ ↔ (-∞ < (∫2‘𝐹) ∧ (∫2‘𝐹) < +∞)))
22		nltpnft 13180	. . . . . . . . . . . . . . . 16 ⊢ ((∫2‘𝐹) ∈ ℝ* → ((∫2‘𝐹) = +∞ ↔ ¬ (∫2‘𝐹) < +∞))
23	10, 22	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝐹:ℝ⟶(0[,]+∞) → ((∫2‘𝐹) = +∞ ↔ ¬ (∫2‘𝐹) < +∞))
24	23	con2bid 354	. . . . . . . . . . . . . 14 ⊢ (𝐹:ℝ⟶(0[,]+∞) → ((∫2‘𝐹) < +∞ ↔ ¬ (∫2‘𝐹) = +∞))
25	12, 21, 24	3bitr2rd 308	. . . . . . . . . . . . 13 ⊢ (𝐹:ℝ⟶(0[,]+∞) → (¬ (∫2‘𝐹) = +∞ ↔ (∫2‘𝐹) ∈ ℝ))
26	25	biimpa 476	. . . . . . . . . . . 12 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ ¬ (∫2‘𝐹) = +∞) → (∫2‘𝐹) ∈ ℝ)
27	26	adantlr 715	. . . . . . . . . . 11 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ ¬ (∫2‘𝐹) = +∞) → (∫2‘𝐹) ∈ ℝ)
28		nnrp 13020	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → 𝑛 ∈ ℝ+)
29	28	rpreccld 13061	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ+)
30	29	ad2antlr 727	. . . . . . . . . . 11 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ ¬ (∫2‘𝐹) = +∞) → (1 / 𝑛) ∈ ℝ+)
31	27, 30	ltsubrpd 13083	. . . . . . . . . 10 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ ¬ (∫2‘𝐹) = +∞) → ((∫2‘𝐹) − (1 / 𝑛)) < (∫2‘𝐹))
32	9, 31	eqbrtrd 5141	. . . . . . . . 9 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ ¬ (∫2‘𝐹) = +∞) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫2‘𝐹))
33	7, 32	pm2.61dan 812	. . . . . . . 8 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫2‘𝐹))
34		nnrecre 12282	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ → (1 / 𝑛) ∈ ℝ)
35	34	ad2antlr 727	. . . . . . . . . . . 12 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ ¬ (∫2‘𝐹) = +∞) → (1 / 𝑛) ∈ ℝ)
36	27, 35	resubcld 11665	. . . . . . . . . . 11 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ ¬ (∫2‘𝐹) = +∞) → ((∫2‘𝐹) − (1 / 𝑛)) ∈ ℝ)
37	2, 36	ifclda 4536	. . . . . . . . . 10 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ)
38	37	rexrd 11285	. . . . . . . . 9 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ*)
39	10	adantr 480	. . . . . . . . 9 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) → (∫2‘𝐹) ∈ ℝ*)
40		xrltnle 11302	. . . . . . . . 9 ⊢ ((if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ* ∧ (∫2‘𝐹) ∈ ℝ*) → (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫2‘𝐹) ↔ ¬ (∫2‘𝐹) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛)))))
41	38, 39, 40	syl2anc 584	. . . . . . . 8 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) → (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫2‘𝐹) ↔ ¬ (∫2‘𝐹) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛)))))
42	33, 41	mpbid 232	. . . . . . 7 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) → ¬ (∫2‘𝐹) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))))
43		itg2leub 25687	. . . . . . . 8 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ*) → ((∫2‘𝐹) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ↔ ∀𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 → (∫1‘𝑓) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))))))
44	38, 43	syldan 591	. . . . . . 7 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) → ((∫2‘𝐹) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ↔ ∀𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 → (∫1‘𝑓) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))))))
45	42, 44	mtbid 324	. . . . . 6 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) → ¬ ∀𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 → (∫1‘𝑓) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛)))))
46		rexanali 3091	. . . . . 6 ⊢ (∃𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 ∧ ¬ (∫1‘𝑓) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛)))) ↔ ¬ ∀𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 → (∫1‘𝑓) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛)))))
47	45, 46	sylibr 234	. . . . 5 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) → ∃𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 ∧ ¬ (∫1‘𝑓) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛)))))
48		itg1cl 25638	. . . . . . . 8 ⊢ (𝑓 ∈ dom ∫1 → (∫1‘𝑓) ∈ ℝ)
49		ltnle 11314	. . . . . . . 8 ⊢ ((if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ ∧ (∫1‘𝑓) ∈ ℝ) → (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘𝑓) ↔ ¬ (∫1‘𝑓) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛)))))
50	37, 48, 49	syl2an 596	. . . . . . 7 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ 𝑓 ∈ dom ∫1) → (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘𝑓) ↔ ¬ (∫1‘𝑓) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛)))))
51	50	anbi2d 630	. . . . . 6 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) ∧ 𝑓 ∈ dom ∫1) → ((𝑓 ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘𝑓)) ↔ (𝑓 ∘r ≤ 𝐹 ∧ ¬ (∫1‘𝑓) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))))))
52	51	rexbidva 3162	. . . . 5 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) → (∃𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘𝑓)) ↔ ∃𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 ∧ ¬ (∫1‘𝑓) ≤ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))))))
53	47, 52	mpbird 257	. . . 4 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑛 ∈ ℕ) → ∃𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘𝑓)))
54	53	ralrimiva 3132	. . 3 ⊢ (𝐹:ℝ⟶(0[,]+∞) → ∀𝑛 ∈ ℕ ∃𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘𝑓)))
55		ovex 7438	. . . . 5 ⊢ (ℝ ↑m ℝ) ∈ V
56		i1ff 25629	. . . . . . 7 ⊢ (𝑥 ∈ dom ∫1 → 𝑥:ℝ⟶ℝ)
57		reex 11220	. . . . . . . 8 ⊢ ℝ ∈ V
58	57, 57	elmap 8885	. . . . . . 7 ⊢ (𝑥 ∈ (ℝ ↑m ℝ) ↔ 𝑥:ℝ⟶ℝ)
59	56, 58	sylibr 234	. . . . . 6 ⊢ (𝑥 ∈ dom ∫1 → 𝑥 ∈ (ℝ ↑m ℝ))
60	59	ssriv 3962	. . . . 5 ⊢ dom ∫1 ⊆ (ℝ ↑m ℝ)
61	55, 60	ssexi 5292	. . . 4 ⊢ dom ∫1 ∈ V
62		nnenom 13998	. . . 4 ⊢ ℕ ≈ ω
63		breq1 5122	. . . . 5 ⊢ (𝑓 = (𝑔‘𝑛) → (𝑓 ∘r ≤ 𝐹 ↔ (𝑔‘𝑛) ∘r ≤ 𝐹))
64		fveq2 6876	. . . . . 6 ⊢ (𝑓 = (𝑔‘𝑛) → (∫1‘𝑓) = (∫1‘(𝑔‘𝑛)))
65	64	breq2d 5131	. . . . 5 ⊢ (𝑓 = (𝑔‘𝑛) → (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘𝑓) ↔ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))
66	63, 65	anbi12d 632	. . . 4 ⊢ (𝑓 = (𝑔‘𝑛) → ((𝑓 ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘𝑓)) ↔ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛)))))
67	61, 62, 66	axcc4 10453	. . 3 ⊢ (∀𝑛 ∈ ℕ ∃𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘𝑓)) → ∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛)))))
68	54, 67	syl 17	. 2 ⊢ (𝐹:ℝ⟶(0[,]+∞) → ∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛)))))
69		simprl 770	. . . . 5 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → 𝑔:ℕ⟶dom ∫1)
70		simpl 482	. . . . . . 7 ⊢ (((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))) → (𝑔‘𝑛) ∘r ≤ 𝐹)
71	70	ralimi 3073	. . . . . 6 ⊢ (∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))) → ∀𝑛 ∈ ℕ (𝑔‘𝑛) ∘r ≤ 𝐹)
72	71	ad2antll 729	. . . . 5 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → ∀𝑛 ∈ ℕ (𝑔‘𝑛) ∘r ≤ 𝐹)
73	10	adantr 480	. . . . . 6 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → (∫2‘𝐹) ∈ ℝ*)
74		ffvelcdm 7071	. . . . . . . . . . . 12 ⊢ ((𝑔:ℕ⟶dom ∫1 ∧ 𝑛 ∈ ℕ) → (𝑔‘𝑛) ∈ dom ∫1)
75		itg1cl 25638	. . . . . . . . . . . 12 ⊢ ((𝑔‘𝑛) ∈ dom ∫1 → (∫1‘(𝑔‘𝑛)) ∈ ℝ)
76	74, 75	syl 17	. . . . . . . . . . 11 ⊢ ((𝑔:ℕ⟶dom ∫1 ∧ 𝑛 ∈ ℕ) → (∫1‘(𝑔‘𝑛)) ∈ ℝ)
77	76	fmpttd 7105	. . . . . . . . . 10 ⊢ (𝑔:ℕ⟶dom ∫1 → (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))):ℕ⟶ℝ)
78	77	ad2antrl 728	. . . . . . . . 9 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))):ℕ⟶ℝ)
79	78	frnd 6714	. . . . . . . 8 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))) ⊆ ℝ)
80		ressxr 11279	. . . . . . . 8 ⊢ ℝ ⊆ ℝ*
81	79, 80	sstrdi 3971	. . . . . . 7 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))) ⊆ ℝ*)
82		supxrcl 13331	. . . . . . 7 ⊢ (ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))) ⊆ ℝ* → sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < ) ∈ ℝ*)
83	81, 82	syl 17	. . . . . 6 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < ) ∈ ℝ*)
84	38	adantlr 715	. . . . . . . . . . . . 13 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ*)
85	76	adantll 714	. . . . . . . . . . . . . 14 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → (∫1‘(𝑔‘𝑛)) ∈ ℝ)
86	85	rexrd 11285	. . . . . . . . . . . . 13 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → (∫1‘(𝑔‘𝑛)) ∈ ℝ*)
87		xrltle 13165	. . . . . . . . . . . . 13 ⊢ ((if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ* ∧ (∫1‘(𝑔‘𝑛)) ∈ ℝ*) → (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛)) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ (∫1‘(𝑔‘𝑛))))
88	84, 86, 87	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛)) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ (∫1‘(𝑔‘𝑛))))
89		2fveq3 6881	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑚 → (∫1‘(𝑔‘𝑛)) = (∫1‘(𝑔‘𝑚)))
90	89	cbvmptv 5225	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))) = (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚)))
91	90	rneqi 5917	. . . . . . . . . . . . . . 15 ⊢ ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))) = ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚)))
92	77	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) → (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))):ℕ⟶ℝ)
93	92	frnd 6714	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) → ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))) ⊆ ℝ)
94	93, 80	sstrdi 3971	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) → ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))) ⊆ ℝ*)
95	94	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))) ⊆ ℝ*)
96	91, 95	eqsstrrid 3998	. . . . . . . . . . . . . 14 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))) ⊆ ℝ*)
97		2fveq3 6881	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 = 𝑛 → (∫1‘(𝑔‘𝑚)) = (∫1‘(𝑔‘𝑛)))
98		eqid 2735	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))) = (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚)))
99		fvex 6889	. . . . . . . . . . . . . . . . 17 ⊢ (∫1‘(𝑔‘𝑛)) ∈ V
100	97, 98, 99	fvmpt 6986	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → ((𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚)))‘𝑛) = (∫1‘(𝑔‘𝑛)))
101		fvex 6889	. . . . . . . . . . . . . . . . . 18 ⊢ (∫1‘(𝑔‘𝑚)) ∈ V
102	101, 98	fnmpti 6681	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))) Fn ℕ
103		fnfvelrn 7070	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))) Fn ℕ ∧ 𝑛 ∈ ℕ) → ((𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚)))‘𝑛) ∈ ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))))
104	102, 103	mpan 690	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 ∈ ℕ → ((𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚)))‘𝑛) ∈ ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))))
105	100, 104	eqeltrrd 2835	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → (∫1‘(𝑔‘𝑛)) ∈ ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))))
106	105	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → (∫1‘(𝑔‘𝑛)) ∈ ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))))
107		supxrub 13340	. . . . . . . . . . . . . 14 ⊢ ((ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))) ⊆ ℝ* ∧ (∫1‘(𝑔‘𝑛)) ∈ ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚)))) → (∫1‘(𝑔‘𝑛)) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ))
108	96, 106, 107	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → (∫1‘(𝑔‘𝑛)) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ))
109	91	supeq1i 9459	. . . . . . . . . . . . . . 15 ⊢ sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < ) = sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )
110	95, 82	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < ) ∈ ℝ*)
111	109, 110	eqeltrrid 2839	. . . . . . . . . . . . . 14 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ) ∈ ℝ*)
112		xrletr 13174	. . . . . . . . . . . . . 14 ⊢ ((if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ* ∧ (∫1‘(𝑔‘𝑛)) ∈ ℝ* ∧ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ) ∈ ℝ*) → ((if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ (∫1‘(𝑔‘𝑛)) ∧ (∫1‘(𝑔‘𝑛)) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )))
113	84, 86, 111, 112	syl3anc 1373	. . . . . . . . . . . . 13 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → ((if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ (∫1‘(𝑔‘𝑛)) ∧ (∫1‘(𝑔‘𝑛)) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )))
114	108, 113	mpan2d 694	. . . . . . . . . . . 12 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ (∫1‘(𝑔‘𝑛)) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )))
115	88, 114	syld 47	. . . . . . . . . . 11 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛)) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )))
116	115	adantld 490	. . . . . . . . . 10 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → (((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )))
117	116	ralimdva 3152	. . . . . . . . 9 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) → (∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))) → ∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )))
118	117	impr 454	. . . . . . . 8 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → ∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ))
119		breq2 5123	. . . . . . . . . . 11 ⊢ (𝑥 = sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ) → (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 ↔ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )))
120	119	ralbidv 3163	. . . . . . . . . 10 ⊢ (𝑥 = sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ) → (∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 ↔ ∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )))
121		breq2 5123	. . . . . . . . . 10 ⊢ (𝑥 = sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ) → ((∫2‘𝐹) ≤ 𝑥 ↔ (∫2‘𝐹) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )))
122	120, 121	imbi12d 344	. . . . . . . . 9 ⊢ (𝑥 = sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ) → ((∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 → (∫2‘𝐹) ≤ 𝑥) ↔ (∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ) → (∫2‘𝐹) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ))))
123		elxr 13132	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℝ* ↔ (𝑥 ∈ ℝ ∨ 𝑥 = +∞ ∨ 𝑥 = -∞))
124		simplrl 776	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ (∫2‘𝐹) = +∞) → 𝑥 ∈ ℝ)
125		arch 12498	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ ℝ → ∃𝑛 ∈ ℕ 𝑥 < 𝑛)
126	124, 125	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ (∫2‘𝐹) = +∞) → ∃𝑛 ∈ ℕ 𝑥 < 𝑛)
127	4	adantl 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ (∫2‘𝐹) = +∞) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) = 𝑛)
128	127	breq2d 5131	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ (∫2‘𝐹) = +∞) → (𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ↔ 𝑥 < 𝑛))
129	128	rexbidv 3164	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ (∫2‘𝐹) = +∞) → (∃𝑛 ∈ ℕ 𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ↔ ∃𝑛 ∈ ℕ 𝑥 < 𝑛))
130	126, 129	mpbird 257	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ (∫2‘𝐹) = +∞) → ∃𝑛 ∈ ℕ 𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))))
131	26	adantlr 715	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) → (∫2‘𝐹) ∈ ℝ)
132		simplrl 776	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) → 𝑥 ∈ ℝ)
133	131, 132	resubcld 11665	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) → ((∫2‘𝐹) − 𝑥) ∈ ℝ)
134		simplrr 777	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) → 𝑥 < (∫2‘𝐹))
135	132, 131	posdifd 11824	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) → (𝑥 < (∫2‘𝐹) ↔ 0 < ((∫2‘𝐹) − 𝑥)))
136	134, 135	mpbid 232	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) → 0 < ((∫2‘𝐹) − 𝑥))
137		nnrecl 12499	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((∫2‘𝐹) − 𝑥) ∈ ℝ ∧ 0 < ((∫2‘𝐹) − 𝑥)) → ∃𝑛 ∈ ℕ (1 / 𝑛) < ((∫2‘𝐹) − 𝑥))
138	133, 136, 137	syl2anc 584	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) → ∃𝑛 ∈ ℕ (1 / 𝑛) < ((∫2‘𝐹) − 𝑥))
139	34	adantl 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) ∧ 𝑛 ∈ ℕ) → (1 / 𝑛) ∈ ℝ)
140	131	adantr 480	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) ∧ 𝑛 ∈ ℕ) → (∫2‘𝐹) ∈ ℝ)
141	132	adantr 480	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) ∧ 𝑛 ∈ ℕ) → 𝑥 ∈ ℝ)
142		ltsub13 11718	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((1 / 𝑛) ∈ ℝ ∧ (∫2‘𝐹) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((1 / 𝑛) < ((∫2‘𝐹) − 𝑥) ↔ 𝑥 < ((∫2‘𝐹) − (1 / 𝑛))))
143	139, 140, 141, 142	syl3anc 1373	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) ∧ 𝑛 ∈ ℕ) → ((1 / 𝑛) < ((∫2‘𝐹) − 𝑥) ↔ 𝑥 < ((∫2‘𝐹) − (1 / 𝑛))))
144	8	ad2antlr 727	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) ∧ 𝑛 ∈ ℕ) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) = ((∫2‘𝐹) − (1 / 𝑛)))
145	144	breq2d 5131	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) ∧ 𝑛 ∈ ℕ) → (𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ↔ 𝑥 < ((∫2‘𝐹) − (1 / 𝑛))))
146	143, 145	bitr4d 282	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) ∧ 𝑛 ∈ ℕ) → ((1 / 𝑛) < ((∫2‘𝐹) − 𝑥) ↔ 𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛)))))
147	146	rexbidva 3162	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) → (∃𝑛 ∈ ℕ (1 / 𝑛) < ((∫2‘𝐹) − 𝑥) ↔ ∃𝑛 ∈ ℕ 𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛)))))
148	138, 147	mpbid 232	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) ∧ ¬ (∫2‘𝐹) = +∞) → ∃𝑛 ∈ ℕ 𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))))
149	130, 148	pm2.61dan 812	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∧ 𝑥 < (∫2‘𝐹))) → ∃𝑛 ∈ ℕ 𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))))
150	149	expr 456	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) → (𝑥 < (∫2‘𝐹) → ∃𝑛 ∈ ℕ 𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛)))))
151		rexr 11281	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ*)
152		xrltnle 11302	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ ℝ* ∧ (∫2‘𝐹) ∈ ℝ*) → (𝑥 < (∫2‘𝐹) ↔ ¬ (∫2‘𝐹) ≤ 𝑥))
153	151, 10, 152	syl2anr 597	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) → (𝑥 < (∫2‘𝐹) ↔ ¬ (∫2‘𝐹) ≤ 𝑥))
154	151	ad2antlr 727	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) ∧ 𝑛 ∈ ℕ) → 𝑥 ∈ ℝ*)
155	38	adantlr 715	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) ∧ 𝑛 ∈ ℕ) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ*)
156		xrltnle 11302	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∈ ℝ* ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ*) → (𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ↔ ¬ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥))
157	154, 155, 156	syl2anc 584	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) ∧ 𝑛 ∈ ℕ) → (𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ↔ ¬ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥))
158	157	rexbidva 3162	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) → (∃𝑛 ∈ ℕ 𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ↔ ∃𝑛 ∈ ℕ ¬ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥))
159		rexnal 3089	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑛 ∈ ℕ ¬ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 ↔ ¬ ∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥)
160	158, 159	bitrdi 287	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) → (∃𝑛 ∈ ℕ 𝑥 < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ↔ ¬ ∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥))
161	150, 153, 160	3imtr3d 293	. . . . . . . . . . . . . 14 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) → (¬ (∫2‘𝐹) ≤ 𝑥 → ¬ ∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥))
162	161	con4d 115	. . . . . . . . . . . . 13 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) → (∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 → (∫2‘𝐹) ≤ 𝑥))
163	10	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = +∞) → (∫2‘𝐹) ∈ ℝ*)
164		pnfge 13146	. . . . . . . . . . . . . . . 16 ⊢ ((∫2‘𝐹) ∈ ℝ* → (∫2‘𝐹) ≤ +∞)
165	163, 164	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = +∞) → (∫2‘𝐹) ≤ +∞)
166		simpr 484	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = +∞) → 𝑥 = +∞)
167	165, 166	breqtrrd 5147	. . . . . . . . . . . . . 14 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = +∞) → (∫2‘𝐹) ≤ 𝑥)
168	167	a1d 25	. . . . . . . . . . . . 13 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = +∞) → (∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 → (∫2‘𝐹) ≤ 𝑥))
169		1nn 12251	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℕ
170	169	ne0ii 4319	. . . . . . . . . . . . . . 15 ⊢ ℕ ≠ ∅
171		r19.2z 4470	. . . . . . . . . . . . . . 15 ⊢ ((ℕ ≠ ∅ ∧ ∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥) → ∃𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥)
172	170, 171	mpan 690	. . . . . . . . . . . . . 14 ⊢ (∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 → ∃𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥)
173	37	adantlr 715	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = -∞) ∧ 𝑛 ∈ ℕ) → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ)
174		mnflt 13139	. . . . . . . . . . . . . . . . . . 19 ⊢ (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ → -∞ < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))))
175		rexr 11281	. . . . . . . . . . . . . . . . . . . 20 ⊢ (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ → if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ*)
176		xrltnle 11302	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((-∞ ∈ ℝ* ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ*) → (-∞ < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ↔ ¬ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ -∞))
177	15, 175, 176	sylancr 587	. . . . . . . . . . . . . . . . . . 19 ⊢ (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ → (-∞ < if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ↔ ¬ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ -∞))
178	174, 177	mpbid 232	. . . . . . . . . . . . . . . . . 18 ⊢ (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ∈ ℝ → ¬ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ -∞)
179	173, 178	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = -∞) ∧ 𝑛 ∈ ℕ) → ¬ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ -∞)
180		simplr 768	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = -∞) ∧ 𝑛 ∈ ℕ) → 𝑥 = -∞)
181	180	breq2d 5131	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = -∞) ∧ 𝑛 ∈ ℕ) → (if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 ↔ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ -∞))
182	179, 181	mtbird 325	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = -∞) ∧ 𝑛 ∈ ℕ) → ¬ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥)
183	182	nrexdv 3135	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = -∞) → ¬ ∃𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥)
184	183	pm2.21d 121	. . . . . . . . . . . . . 14 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = -∞) → (∃𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 → (∫2‘𝐹) ≤ 𝑥))
185	172, 184	syl5 34	. . . . . . . . . . . . 13 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 = -∞) → (∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 → (∫2‘𝐹) ≤ 𝑥))
186	162, 168, 185	3jaodan 1433	. . . . . . . . . . . 12 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑥 ∈ ℝ ∨ 𝑥 = +∞ ∨ 𝑥 = -∞)) → (∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 → (∫2‘𝐹) ≤ 𝑥))
187	123, 186	sylan2b 594	. . . . . . . . . . 11 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ*) → (∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 → (∫2‘𝐹) ≤ 𝑥))
188	187	ralrimiva 3132	. . . . . . . . . 10 ⊢ (𝐹:ℝ⟶(0[,]+∞) → ∀𝑥 ∈ ℝ* (∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 → (∫2‘𝐹) ≤ 𝑥))
189	188	adantr 480	. . . . . . . . 9 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → ∀𝑥 ∈ ℝ* (∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ 𝑥 → (∫2‘𝐹) ≤ 𝑥))
190	109, 83	eqeltrrid 2839	. . . . . . . . 9 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ) ∈ ℝ*)
191	122, 189, 190	rspcdva 3602	. . . . . . . 8 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → (∀𝑛 ∈ ℕ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ) → (∫2‘𝐹) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < )))
192	118, 191	mpd 15	. . . . . . 7 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → (∫2‘𝐹) ≤ sup(ran (𝑚 ∈ ℕ ↦ (∫1‘(𝑔‘𝑚))), ℝ*, < ))
193	192, 109	breqtrrdi 5161	. . . . . 6 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → (∫2‘𝐹) ≤ sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < ))
194		itg2ub 25686	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔‘𝑛) ∈ dom ∫1 ∧ (𝑔‘𝑛) ∘r ≤ 𝐹) → (∫1‘(𝑔‘𝑛)) ≤ (∫2‘𝐹))
195	194	3expia 1121	. . . . . . . . . . . . . 14 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔‘𝑛) ∈ dom ∫1) → ((𝑔‘𝑛) ∘r ≤ 𝐹 → (∫1‘(𝑔‘𝑛)) ≤ (∫2‘𝐹)))
196	74, 195	sylan2 593	. . . . . . . . . . . . 13 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ 𝑛 ∈ ℕ)) → ((𝑔‘𝑛) ∘r ≤ 𝐹 → (∫1‘(𝑔‘𝑛)) ≤ (∫2‘𝐹)))
197	196	anassrs 467	. . . . . . . . . . . 12 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → ((𝑔‘𝑛) ∘r ≤ 𝐹 → (∫1‘(𝑔‘𝑛)) ≤ (∫2‘𝐹)))
198	197	adantrd 491	. . . . . . . . . . 11 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) ∧ 𝑛 ∈ ℕ) → (((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))) → (∫1‘(𝑔‘𝑛)) ≤ (∫2‘𝐹)))
199	198	ralimdva 3152	. . . . . . . . . 10 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑔:ℕ⟶dom ∫1) → (∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))) → ∀𝑛 ∈ ℕ (∫1‘(𝑔‘𝑛)) ≤ (∫2‘𝐹)))
200	199	impr 454	. . . . . . . . 9 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → ∀𝑛 ∈ ℕ (∫1‘(𝑔‘𝑛)) ≤ (∫2‘𝐹))
201		eqid 2735	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))) = (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))
202	89, 201, 101	fvmpt 6986	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ ℕ → ((𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))‘𝑚) = (∫1‘(𝑔‘𝑚)))
203	202	breq1d 5129	. . . . . . . . . . 11 ⊢ (𝑚 ∈ ℕ → (((𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))‘𝑚) ≤ (∫2‘𝐹) ↔ (∫1‘(𝑔‘𝑚)) ≤ (∫2‘𝐹)))
204	203	ralbiia 3080	. . . . . . . . . 10 ⊢ (∀𝑚 ∈ ℕ ((𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))‘𝑚) ≤ (∫2‘𝐹) ↔ ∀𝑚 ∈ ℕ (∫1‘(𝑔‘𝑚)) ≤ (∫2‘𝐹))
205	89	breq1d 5129	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑚 → ((∫1‘(𝑔‘𝑛)) ≤ (∫2‘𝐹) ↔ (∫1‘(𝑔‘𝑚)) ≤ (∫2‘𝐹)))
206	205	cbvralvw 3220	. . . . . . . . . 10 ⊢ (∀𝑛 ∈ ℕ (∫1‘(𝑔‘𝑛)) ≤ (∫2‘𝐹) ↔ ∀𝑚 ∈ ℕ (∫1‘(𝑔‘𝑚)) ≤ (∫2‘𝐹))
207	204, 206	bitr4i 278	. . . . . . . . 9 ⊢ (∀𝑚 ∈ ℕ ((𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))‘𝑚) ≤ (∫2‘𝐹) ↔ ∀𝑛 ∈ ℕ (∫1‘(𝑔‘𝑛)) ≤ (∫2‘𝐹))
208	200, 207	sylibr 234	. . . . . . . 8 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → ∀𝑚 ∈ ℕ ((𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))‘𝑚) ≤ (∫2‘𝐹))
209		ffn 6706	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))):ℕ⟶ℝ → (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))) Fn ℕ)
210		breq1 5122	. . . . . . . . . 10 ⊢ (𝑧 = ((𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))‘𝑚) → (𝑧 ≤ (∫2‘𝐹) ↔ ((𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))‘𝑚) ≤ (∫2‘𝐹)))
211	210	ralrn 7078	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))) Fn ℕ → (∀𝑧 ∈ ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))𝑧 ≤ (∫2‘𝐹) ↔ ∀𝑚 ∈ ℕ ((𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))‘𝑚) ≤ (∫2‘𝐹)))
212	78, 209, 211	3syl 18	. . . . . . . 8 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → (∀𝑧 ∈ ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))𝑧 ≤ (∫2‘𝐹) ↔ ∀𝑚 ∈ ℕ ((𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))‘𝑚) ≤ (∫2‘𝐹)))
213	208, 212	mpbird 257	. . . . . . 7 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → ∀𝑧 ∈ ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))𝑧 ≤ (∫2‘𝐹))
214		supxrleub 13342	. . . . . . . 8 ⊢ ((ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))) ⊆ ℝ* ∧ (∫2‘𝐹) ∈ ℝ*) → (sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < ) ≤ (∫2‘𝐹) ↔ ∀𝑧 ∈ ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))𝑧 ≤ (∫2‘𝐹)))
215	81, 73, 214	syl2anc 584	. . . . . . 7 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → (sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < ) ≤ (∫2‘𝐹) ↔ ∀𝑧 ∈ ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛)))𝑧 ≤ (∫2‘𝐹)))
216	213, 215	mpbird 257	. . . . . 6 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < ) ≤ (∫2‘𝐹))
217	73, 83, 193, 216	xrletrid 13171	. . . . 5 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → (∫2‘𝐹) = sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < ))
218	69, 72, 217	3jca 1128	. . . 4 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛))))) → (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ (𝑔‘𝑛) ∘r ≤ 𝐹 ∧ (∫2‘𝐹) = sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < )))
219	218	ex 412	. . 3 ⊢ (𝐹:ℝ⟶(0[,]+∞) → ((𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛)))) → (𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ (𝑔‘𝑛) ∘r ≤ 𝐹 ∧ (∫2‘𝐹) = sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < ))))
220	219	eximdv 1917	. 2 ⊢ (𝐹:ℝ⟶(0[,]+∞) → (∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ ((𝑔‘𝑛) ∘r ≤ 𝐹 ∧ if((∫2‘𝐹) = +∞, 𝑛, ((∫2‘𝐹) − (1 / 𝑛))) < (∫1‘(𝑔‘𝑛)))) → ∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ (𝑔‘𝑛) ∘r ≤ 𝐹 ∧ (∫2‘𝐹) = sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < ))))
221	68, 220	mpd 15	1 ⊢ (𝐹:ℝ⟶(0[,]+∞) → ∃𝑔(𝑔:ℕ⟶dom ∫1 ∧ ∀𝑛 ∈ ℕ (𝑔‘𝑛) ∘r ≤ 𝐹 ∧ (∫2‘𝐹) = sup(ran (𝑛 ∈ ℕ ↦ (∫1‘(𝑔‘𝑛))), ℝ*, < )))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ w3o 1085   ∧ w3a 1086   = wceq 1540  ∃wex 1779   ∈ wcel 2108   ≠ wne 2932  ∀wral 3051  ∃wrex 3060   ⊆ wss 3926  ∅c0 4308  ifcif 4500   class class class wbr 5119   ↦ cmpt 5201  dom cdm 5654  ran crn 5655   Fn wfn 6526  ⟶wf 6527  ‘cfv 6531  (class class class)co 7405   ∘_r cofr 7670   ↑_m cmap 8840  supcsup 9452  ℝcr 11128  0cc0 11129  1c1 11130  +∞cpnf 11266  -∞cmnf 11267  ℝ^*cxr 11268   < clt 11269   ≤ cle 11270   − cmin 11466   / cdiv 11894  ℕcn 12240  ℝ⁺crp 13008  [,]cicc 13365  ∫₁citg1 25568  ∫₂citg2 25569

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-inf2 9655  ax-cc 10449  ax-cnex 11185  ax-resscn 11186  ax-1cn 11187  ax-icn 11188  ax-addcl 11189  ax-addrcl 11190  ax-mulcl 11191  ax-mulrcl 11192  ax-mulcom 11193  ax-addass 11194  ax-mulass 11195  ax-distr 11196  ax-i2m1 11197  ax-1ne0 11198  ax-1rid 11199  ax-rnegex 11200  ax-rrecex 11201  ax-cnre 11202  ax-pre-lttri 11203  ax-pre-lttrn 11204  ax-pre-ltadd 11205  ax-pre-mulgt0 11206  ax-pre-sup 11207

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 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-int 4923  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-se 5607  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-isom 6540  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-of 7671  df-ofr 7672  df-om 7862  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-1o 8480  df-2o 8481  df-er 8719  df-map 8842  df-pm 8843  df-en 8960  df-dom 8961  df-sdom 8962  df-fin 8963  df-sup 9454  df-inf 9455  df-oi 9524  df-dju 9915  df-card 9953  df-pnf 11271  df-mnf 11272  df-xr 11273  df-ltxr 11274  df-le 11275  df-sub 11468  df-neg 11469  df-div 11895  df-nn 12241  df-2 12303  df-3 12304  df-n0 12502  df-z 12589  df-uz 12853  df-q 12965  df-rp 13009  df-xadd 13129  df-ioo 13366  df-ico 13368  df-icc 13369  df-fz 13525  df-fzo 13672  df-fl 13809  df-seq 14020  df-exp 14080  df-hash 14349  df-cj 15118  df-re 15119  df-im 15120  df-sqrt 15254  df-abs 15255  df-clim 15504  df-sum 15703  df-xmet 21308  df-met 21309  df-ovol 25417  df-vol 25418  df-mbf 25572  df-itg1 25573  df-itg2 25574

This theorem is referenced by: (None)