Theorem smfinflem 47138

Description: The infimum of a countable set of sigma-measurable functions is sigma-measurable. Proposition 121F (c) of [Fremlin1] p. 38 . (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
smfinflem.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
smfinflem.z	⊢ 𝑍 = (ℤ≥‘𝑀)
smfinflem.s	⊢ (𝜑 → 𝑆 ∈ SAlg)
smfinflem.f	⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
smfinflem.d	⊢ 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)}
smfinflem.g	⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ inf(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < ))

Assertion

Ref	Expression
smfinflem	⊢ (𝜑 → 𝐺 ∈ (SMblFn‘𝑆))

Distinct variable groups:   𝐷,𝑛,𝑥,𝑦   𝑛,𝐹,𝑥,𝑦   𝑆,𝑛   𝑛,𝑍,𝑥,𝑦   𝜑,𝑛,𝑥,𝑦

Allowed substitution hints:   𝑆(𝑥,𝑦)   𝐺(𝑥,𝑦,𝑛)   𝑀(𝑥,𝑦,𝑛)

Proof of Theorem smfinflem

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

Step	Hyp	Ref	Expression
1		smfinflem.g	. . . 4 ⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ inf(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < ))
2	1	a1i 11	. . 3 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐷 ↦ inf(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < )))
3		nfv 1916	. . . . 5 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑥 ∈ 𝐷)
4		smfinflem.m	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℤ)
5		smfinflem.z	. . . . . . 7 ⊢ 𝑍 = (ℤ≥‘𝑀)
6	4, 5	uzn0d 45746	. . . . . 6 ⊢ (𝜑 → 𝑍 ≠ ∅)
7	6	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝑍 ≠ ∅)
8		smfinflem.s	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ∈ SAlg)
9	8	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑆 ∈ SAlg)
10		smfinflem.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
11	10	ffvelcdmda 7031	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) ∈ (SMblFn‘𝑆))
12		eqid 2737	. . . . . . . 8 ⊢ dom (𝐹‘𝑛) = dom (𝐹‘𝑛)
13	9, 11, 12	smff 47053	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ)
14	13	adantlr 716	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ)
15		ssrab2 4033	. . . . . . . . . 10 ⊢ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)} ⊆ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
16		smfinflem.d	. . . . . . . . . . . 12 ⊢ 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)}
17	16	eleq2i 2829	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐷 ↔ 𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)})
18	17	biimpi 216	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐷 → 𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)})
19	15, 18	sselid 3932	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐷 → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
20	19	adantr 480	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
21		simpr 484	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
22		eliinid 45433	. . . . . . . 8 ⊢ ((𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
23	20, 21, 22	syl2anc 585	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
24	23	adantll 715	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
25	14, 24	ffvelcdmd 7032	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
26		rabidim2 45424	. . . . . . 7 ⊢ (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)} → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
27	18, 26	syl 17	. . . . . 6 ⊢ (𝑥 ∈ 𝐷 → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
28	27	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
29	3, 7, 25, 28	infnsuprnmpt 45571	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → inf(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < ) = -sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ))
30	29	mpteq2dva 5192	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ inf(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < )) = (𝑥 ∈ 𝐷 ↦ -sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )))
31	2, 30	eqtrd 2772	. 2 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐷 ↦ -sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )))
32		nfv 1916	. . 3 ⊢ Ⅎ𝑥𝜑
33		fvex 6848	. . . . . . . 8 ⊢ (𝐹‘𝑛) ∈ V
34	33	dmex 7854	. . . . . . 7 ⊢ dom (𝐹‘𝑛) ∈ V
35	34	rgenw 3056	. . . . . 6 ⊢ ∀𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∈ V
36	35	a1i 11	. . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∈ V)
37	6, 36	iinexd 45455	. . . 4 ⊢ (𝜑 → ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∈ V)
38	16, 37	rabexd 5286	. . 3 ⊢ (𝜑 → 𝐷 ∈ V)
39	25	renegcld 11569	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑛 ∈ 𝑍) → -((𝐹‘𝑛)‘𝑥) ∈ ℝ)
40		fveq2 6835	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → ((𝐹‘𝑚)‘𝑤) = ((𝐹‘𝑚)‘𝑥))
41	40	breq2d 5111	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → (𝑧 ≤ ((𝐹‘𝑚)‘𝑤) ↔ 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)))
42	41	ralbidv 3160	. . . . . . . . . 10 ⊢ (𝑤 = 𝑥 → (∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤) ↔ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)))
43	42	rexbidv 3161	. . . . . . . . 9 ⊢ (𝑤 = 𝑥 → (∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤) ↔ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)))
44		nfcv 2899	. . . . . . . . . . 11 ⊢ Ⅎ𝑤∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
45		nfcv 2899	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝑍
46		nfcv 2899	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥(𝐹‘𝑚)
47	46	nfdm 5901	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥dom (𝐹‘𝑚)
48	45, 47	nfiin 4980	. . . . . . . . . . 11 ⊢ Ⅎ𝑥∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚)
49		nfv 1916	. . . . . . . . . . 11 ⊢ Ⅎ𝑤∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)
50		nfv 1916	. . . . . . . . . . 11 ⊢ Ⅎ𝑥∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)
51		nfcv 2899	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑚dom (𝐹‘𝑛)
52		nfcv 2899	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛(𝐹‘𝑚)
53	52	nfdm 5901	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛dom (𝐹‘𝑚)
54		fveq2 6835	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑚 → (𝐹‘𝑛) = (𝐹‘𝑚))
55	54	dmeqd 5855	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑚 → dom (𝐹‘𝑛) = dom (𝐹‘𝑚))
56	51, 53, 55	cbviin 4992	. . . . . . . . . . . 12 ⊢ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) = ∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚)
57	56	a1i 11	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑤 → ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) = ∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚))
58		fveq2 6835	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑤 → ((𝐹‘𝑛)‘𝑥) = ((𝐹‘𝑛)‘𝑤))
59	58	breq2d 5111	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑤 → (𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ 𝑦 ≤ ((𝐹‘𝑛)‘𝑤)))
60	59	ralbidv 3160	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑤 → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑤)))
61		nfv 1916	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑚 𝑦 ≤ ((𝐹‘𝑛)‘𝑤)
62		nfcv 2899	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑛𝑦
63		nfcv 2899	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑛 ≤
64		nfcv 2899	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑛𝑤
65	52, 64	nffv 6845	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑛((𝐹‘𝑚)‘𝑤)
66	62, 63, 65	nfbr 5146	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑛 𝑦 ≤ ((𝐹‘𝑚)‘𝑤)
67	54	fveq1d 6837	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑚 → ((𝐹‘𝑛)‘𝑤) = ((𝐹‘𝑚)‘𝑤))
68	67	breq2d 5111	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑚 → (𝑦 ≤ ((𝐹‘𝑛)‘𝑤) ↔ 𝑦 ≤ ((𝐹‘𝑚)‘𝑤)))
69	61, 66, 68	cbvralw 3279	. . . . . . . . . . . . . . 15 ⊢ (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑤) ↔ ∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤))
70	69	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑤 → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑤) ↔ ∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤)))
71	60, 70	bitrd 279	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤)))
72	71	rexbidv 3161	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑤 → (∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∃𝑦 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤)))
73		breq1 5102	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑧 → (𝑦 ≤ ((𝐹‘𝑚)‘𝑤) ↔ 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)))
74	73	ralbidv 3160	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑧 → (∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤) ↔ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)))
75	74	cbvrexvw 3216	. . . . . . . . . . . . 13 ⊢ (∃𝑦 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤) ↔ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤))
76	75	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑤 → (∃𝑦 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤) ↔ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)))
77	72, 76	bitrd 279	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑤 → (∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)))
78	44, 48, 49, 50, 57, 77	cbvrabcsfw 3891	. . . . . . . . . 10 ⊢ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)} = {𝑤 ∈ ∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚) ∣ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)}
79	16, 78	eqtri 2760	. . . . . . . . 9 ⊢ 𝐷 = {𝑤 ∈ ∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚) ∣ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)}
80	43, 79	elrab2 3650	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐷 ↔ (𝑥 ∈ ∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚) ∧ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)))
81	80	biimpi 216	. . . . . . 7 ⊢ (𝑥 ∈ 𝐷 → (𝑥 ∈ ∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚) ∧ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)))
82	81	simprd 495	. . . . . 6 ⊢ (𝑥 ∈ 𝐷 → ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥))
83	82	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥))
84		renegcl 11449	. . . . . . . 8 ⊢ (𝑧 ∈ ℝ → -𝑧 ∈ ℝ)
85	84	ad2antlr 728	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) → -𝑧 ∈ ℝ)
86		fveq2 6835	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (𝐹‘𝑚) = (𝐹‘𝑛))
87	86	fveq1d 6837	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → ((𝐹‘𝑚)‘𝑥) = ((𝐹‘𝑛)‘𝑥))
88	87	breq2d 5111	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑛 → (𝑧 ≤ ((𝐹‘𝑚)‘𝑥) ↔ 𝑧 ≤ ((𝐹‘𝑛)‘𝑥)))
89	88	rspcva 3575	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ 𝑍 ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) → 𝑧 ≤ ((𝐹‘𝑛)‘𝑥))
90	89	ancoms 458	. . . . . . . . . 10 ⊢ ((∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥) ∧ 𝑛 ∈ 𝑍) → 𝑧 ≤ ((𝐹‘𝑛)‘𝑥))
91	90	adantll 715	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑧 ≤ ((𝐹‘𝑛)‘𝑥))
92		simpllr 776	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑧 ∈ ℝ)
93	25	ad4ant14 753	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
94	92, 93	lenegd 11721	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → (𝑧 ≤ ((𝐹‘𝑛)‘𝑥) ↔ -((𝐹‘𝑛)‘𝑥) ≤ -𝑧))
95	91, 94	mpbid 232	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → -((𝐹‘𝑛)‘𝑥) ≤ -𝑧)
96	95	ralrimiva 3129	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) → ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ -𝑧)
97		brralrspcev 5159	. . . . . . 7 ⊢ ((-𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ -𝑧) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑦)
98	85, 96, 97	syl2anc 585	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑦)
99	98	rexlimdva2 3140	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑦))
100	83, 99	mpd 15	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑦)
101	3, 7, 39, 100	suprclrnmpt 45572	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ) ∈ ℝ)
102	16	a1i 11	. . . . . . 7 ⊢ (𝜑 → 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)})
103		nfv 1916	. . . . . . . . . 10 ⊢ Ⅎ𝑦(𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
104		nfv 1916	. . . . . . . . . 10 ⊢ Ⅎ𝑦∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧
105		renegcl 11449	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ → -𝑦 ∈ ℝ)
106	105	3ad2ant2 1135	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → -𝑦 ∈ ℝ)
107		nfv 1916	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑛𝜑
108		nfcv 2899	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑛𝑥
109		nfii1 4985	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑛∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
110	108, 109	nfel 2914	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑛 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
111	107, 110	nfan 1901	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
112	62	nfel1 2916	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛 𝑦 ∈ ℝ
113		nfra1 3261	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)
114	111, 112, 113	nf3an 1903	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
115		simpl2 1194	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑦 ∈ ℝ)
116		simpll 767	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑛 ∈ 𝑍) → 𝜑)
117		simpr 484	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
118	22	adantll 715	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
119	13	3adant3 1133	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ)
120		simp3 1139	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → 𝑥 ∈ dom (𝐹‘𝑛))
121	119, 120	ffvelcdmd 7032	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
122	116, 117, 118, 121	syl3anc 1374	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
123	122	3ad2antl1 1187	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
124		rspa 3226	. . . . . . . . . . . . . . . 16 ⊢ ((∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ∧ 𝑛 ∈ 𝑍) → 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
125	124	3ad2antl3 1189	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
126		leneg 11645	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ ℝ ∧ ((𝐹‘𝑛)‘𝑥) ∈ ℝ) → (𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ -((𝐹‘𝑛)‘𝑥) ≤ -𝑦))
127	126	biimp3a 1472	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ ℝ ∧ ((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → -((𝐹‘𝑛)‘𝑥) ≤ -𝑦)
128	115, 123, 125, 127	syl3anc 1374	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → -((𝐹‘𝑛)‘𝑥) ≤ -𝑦)
129	128	ex 412	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → (𝑛 ∈ 𝑍 → -((𝐹‘𝑛)‘𝑥) ≤ -𝑦))
130	114, 129	ralrimi 3235	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ -𝑦)
131		brralrspcev 5159	. . . . . . . . . . . 12 ⊢ ((-𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ -𝑦) → ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)
132	106, 130, 131	syl2anc 585	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)
133	132	3exp 1120	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) → (𝑦 ∈ ℝ → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) → ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)))
134	103, 104, 133	rexlimd 3244	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) → (∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) → ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧))
135	84	3ad2ant2 1135	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → -𝑧 ∈ ℝ)
136		nfv 1916	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛 𝑧 ∈ ℝ
137		nfra1 3261	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧
138	111, 136, 137	nf3an 1903	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)
139	122	3ad2antl1 1187	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
140		simpl2 1194	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) ∧ 𝑛 ∈ 𝑍) → 𝑧 ∈ ℝ)
141		rspa 3226	. . . . . . . . . . . . . . . 16 ⊢ ((∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧 ∧ 𝑛 ∈ 𝑍) → -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)
142	141	3ad2antl3 1189	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) ∧ 𝑛 ∈ 𝑍) → -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)
143		simp3 1139	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)
144		renegcl 11449	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹‘𝑛)‘𝑥) ∈ ℝ → -((𝐹‘𝑛)‘𝑥) ∈ ℝ)
145	144	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ) → -((𝐹‘𝑛)‘𝑥) ∈ ℝ)
146		simpr 484	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ) → 𝑧 ∈ ℝ)
147		leneg 11645	. . . . . . . . . . . . . . . . . . 19 ⊢ ((-((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ) → (-((𝐹‘𝑛)‘𝑥) ≤ 𝑧 ↔ -𝑧 ≤ --((𝐹‘𝑛)‘𝑥)))
148	145, 146, 147	syl2anc 585	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ) → (-((𝐹‘𝑛)‘𝑥) ≤ 𝑧 ↔ -𝑧 ≤ --((𝐹‘𝑛)‘𝑥)))
149	148	3adant3 1133	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → (-((𝐹‘𝑛)‘𝑥) ≤ 𝑧 ↔ -𝑧 ≤ --((𝐹‘𝑛)‘𝑥)))
150	143, 149	mpbid 232	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → -𝑧 ≤ --((𝐹‘𝑛)‘𝑥))
151		recn 11121	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹‘𝑛)‘𝑥) ∈ ℝ → ((𝐹‘𝑛)‘𝑥) ∈ ℂ)
152	151	negnegd 11488	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹‘𝑛)‘𝑥) ∈ ℝ → --((𝐹‘𝑛)‘𝑥) = ((𝐹‘𝑛)‘𝑥))
153	152	3ad2ant1 1134	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → --((𝐹‘𝑛)‘𝑥) = ((𝐹‘𝑛)‘𝑥))
154	150, 153	breqtrd 5125	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → -𝑧 ≤ ((𝐹‘𝑛)‘𝑥))
155	139, 140, 142, 154	syl3anc 1374	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) ∧ 𝑛 ∈ 𝑍) → -𝑧 ≤ ((𝐹‘𝑛)‘𝑥))
156	155	ex 412	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → (𝑛 ∈ 𝑍 → -𝑧 ≤ ((𝐹‘𝑛)‘𝑥)))
157	138, 156	ralrimi 3235	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → ∀𝑛 ∈ 𝑍 -𝑧 ≤ ((𝐹‘𝑛)‘𝑥))
158		breq1 5102	. . . . . . . . . . . . . 14 ⊢ (𝑦 = -𝑧 → (𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ -𝑧 ≤ ((𝐹‘𝑛)‘𝑥)))
159	158	ralbidv 3160	. . . . . . . . . . . . 13 ⊢ (𝑦 = -𝑧 → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∀𝑛 ∈ 𝑍 -𝑧 ≤ ((𝐹‘𝑛)‘𝑥)))
160	159	rspcev 3577	. . . . . . . . . . . 12 ⊢ ((-𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -𝑧 ≤ ((𝐹‘𝑛)‘𝑥)) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
161	135, 157, 160	syl2anc 585	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
162	161	3exp 1120	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) → (𝑧 ∈ ℝ → (∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧 → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))))
163	162	rexlimdv 3136	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) → (∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧 → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)))
164	134, 163	impbid 212	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) → (∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧))
165	32, 164	rabbida 3426	. . . . . . 7 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)} = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧})
166	102, 165	eqtrd 2772	. . . . . 6 ⊢ (𝜑 → 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧})
167	32, 166	alrimi 2221	. . . . 5 ⊢ (𝜑 → ∀𝑥 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧})
168		eqid 2737	. . . . . . 7 ⊢ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ) = sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )
169	168	rgenw 3056	. . . . . 6 ⊢ ∀𝑥 ∈ 𝐷 sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ) = sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )
170	169	a1i 11	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐷 sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ) = sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ))
171		mpteq12f 5184	. . . . 5 ⊢ ((∀𝑥 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} ∧ ∀𝑥 ∈ 𝐷 sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ) = sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) → (𝑥 ∈ 𝐷 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) = (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )))
172	167, 170, 171	syl2anc 585	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) = (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )))
173		nfv 1916	. . . . 5 ⊢ Ⅎ𝑧𝜑
174	121	renegcld 11569	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → -((𝐹‘𝑛)‘𝑥) ∈ ℝ)
175		nfv 1916	. . . . . 6 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑛 ∈ 𝑍)
176	34	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → dom (𝐹‘𝑛) ∈ V)
177	121	3expa 1119	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
178	13	feqmptd 6903	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) = (𝑥 ∈ dom (𝐹‘𝑛) ↦ ((𝐹‘𝑛)‘𝑥)))
179	178	eqcomd 2743	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ dom (𝐹‘𝑛) ↦ ((𝐹‘𝑛)‘𝑥)) = (𝐹‘𝑛))
180	179, 11	eqeltrd 2837	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ dom (𝐹‘𝑛) ↦ ((𝐹‘𝑛)‘𝑥)) ∈ (SMblFn‘𝑆))
181	175, 9, 176, 177, 180	smfneg 47124	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ dom (𝐹‘𝑛) ↦ -((𝐹‘𝑛)‘𝑥)) ∈ (SMblFn‘𝑆))
182		eqid 2737	. . . . 5 ⊢ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧}
183		eqid 2737	. . . . 5 ⊢ (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) = (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ))
184	107, 32, 173, 4, 5, 8, 174, 181, 182, 183	smfsupmpt 47136	. . . 4 ⊢ (𝜑 → (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) ∈ (SMblFn‘𝑆))
185	172, 184	eqeltrd 2837	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) ∈ (SMblFn‘𝑆))
186	32, 8, 38, 101, 185	smfneg 47124	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ -sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) ∈ (SMblFn‘𝑆))
187	31, 186	eqeltrd 2837	1 ⊢ (𝜑 → 𝐺 ∈ (SMblFn‘𝑆))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087  ∀wal 1540   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3061  {crab 3400  Vcvv 3441  ∅c0 4286  ∩ ciin 4948   class class class wbr 5099   ↦ cmpt 5180  dom cdm 5625  ran crn 5626  ⟶wf 6489  ‘cfv 6493  supcsup 9348  infcinf 9349  ℝcr 11030   < clt 11171   ≤ cle 11172  -cneg 11370  ℤcz 12493  ℤ_≥cuz 12756  SAlgcsalg 46629  SMblFncsmblfn 47016

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7683  ax-inf2 9555  ax-cc 10350  ax-ac2 10378  ax-cnex 11087  ax-resscn 11088  ax-1cn 11089  ax-icn 11090  ax-addcl 11091  ax-addrcl 11092  ax-mulcl 11093  ax-mulrcl 11094  ax-mulcom 11095  ax-addass 11096  ax-mulass 11097  ax-distr 11098  ax-i2m1 11099  ax-1ne0 11100  ax-1rid 11101  ax-rnegex 11102  ax-rrecex 11103  ax-cnre 11104  ax-pre-lttri 11105  ax-pre-lttrn 11106  ax-pre-ltadd 11107  ax-pre-mulgt0 11108  ax-pre-sup 11109

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3062  df-rmo 3351  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-iin 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-se 5579  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-isom 6502  df-riota 7318  df-ov 7364  df-oprab 7365  df-mpo 7366  df-om 7812  df-1st 7936  df-2nd 7937  df-frecs 8226  df-wrecs 8257  df-recs 8306  df-rdg 8344  df-1o 8400  df-2o 8401  df-oadd 8404  df-omul 8405  df-er 8638  df-map 8770  df-pm 8771  df-en 8889  df-dom 8890  df-sdom 8891  df-fin 8892  df-sup 9350  df-inf 9351  df-oi 9420  df-card 9856  df-acn 9859  df-ac 10031  df-pnf 11173  df-mnf 11174  df-xr 11175  df-ltxr 11176  df-le 11177  df-sub 11371  df-neg 11372  df-div 11800  df-nn 12151  df-2 12213  df-3 12214  df-4 12215  df-n0 12407  df-z 12494  df-uz 12757  df-q 12867  df-rp 12911  df-ioo 13270  df-ioc 13271  df-ico 13272  df-icc 13273  df-fz 13429  df-fzo 13576  df-fl 13717  df-seq 13930  df-exp 13990  df-hash 14259  df-word 14442  df-concat 14499  df-s1 14525  df-s2 14776  df-s3 14777  df-s4 14778  df-cj 15027  df-re 15028  df-im 15029  df-sqrt 15163  df-abs 15164  df-rest 17347  df-topgen 17368  df-top 22843  df-bases 22895  df-salg 46630  df-salgen 46634  df-smblfn 47017

This theorem is referenced by:  smfinf  47139