smfinflem - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > smfinflem		Structured version Visualization version GIF version

Theorem smfinflem 46268

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 1909	. . . . 5 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑥 ∈ 𝐷)
4		smfinflem.m	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℤ)
5		smfinflem.z	. . . . . . 7 ⊢ 𝑍 = (ℤ_≥‘𝑀)
6	4, 5	uzn0d 44870	. . . . . 6 ⊢ (𝜑 → 𝑍 ≠ ∅)
7	6	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → 𝑍 ≠ ∅)
8		smfinflem.s	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ∈ SAlg)
9	8	adantr 479	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑆 ∈ SAlg)
10		smfinflem.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
11	10	ffvelcdmda 7091	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) ∈ (SMblFn‘𝑆))
12		eqid 2725	. . . . . . . 8 ⊢ dom (𝐹‘𝑛) = dom (𝐹‘𝑛)
13	9, 11, 12	smff 46183	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ)
14	13	adantlr 713	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ)
15		ssrab2 4074	. . . . . . . . . 10 ⊢ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)} ⊆ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
16		smfinflem.d	. . . . . . . . . . . 12 ⊢ 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)}
17	16	eleq2i 2817	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐷 ↔ 𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)})
18	17	biimpi 215	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐷 → 𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)})
19	15, 18	sselid 3975	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐷 → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
20	19	adantr 479	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
21		simpr 483	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
22		eliinid 44542	. . . . . . . 8 ⊢ ((𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
23	20, 21, 22	syl2anc 582	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
24	23	adantll 712	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
25	14, 24	ffvelcdmd 7092	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
26		rabidim2 44533	. . . . . . 7 ⊢ (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)} → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
27	18, 26	syl 17	. . . . . 6 ⊢ (𝑥 ∈ 𝐷 → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
28	27	adantl 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
29	3, 7, 25, 28	infnsuprnmpt 44689	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → inf(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < ) = -sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ))
30	29	mpteq2dva 5248	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ inf(ran (𝑛 ∈ 𝑍 ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < )) = (𝑥 ∈ 𝐷 ↦ -sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )))
31	2, 30	eqtrd 2765	. 2 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐷 ↦ -sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )))
32		nfv 1909	. . 3 ⊢ Ⅎ𝑥𝜑
33		fvex 6907	. . . . . . . 8 ⊢ (𝐹‘𝑛) ∈ V
34	33	dmex 7915	. . . . . . 7 ⊢ dom (𝐹‘𝑛) ∈ V
35	34	rgenw 3055	. . . . . 6 ⊢ ∀𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∈ V
36	35	a1i 11	. . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∈ V)
37	6, 36	iinexd 44564	. . . 4 ⊢ (𝜑 → ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∈ V)
38	16, 37	rabexd 5335	. . 3 ⊢ (𝜑 → 𝐷 ∈ V)
39	25	renegcld 11671	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑛 ∈ 𝑍) → -((𝐹‘𝑛)‘𝑥) ∈ ℝ)
40		fveq2 6894	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑥 → ((𝐹‘𝑚)‘𝑤) = ((𝐹‘𝑚)‘𝑥))
41	40	breq2d 5160	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑥 → (𝑧 ≤ ((𝐹‘𝑚)‘𝑤) ↔ 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)))
42	41	ralbidv 3168	. . . . . . . . . 10 ⊢ (𝑤 = 𝑥 → (∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤) ↔ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)))
43	42	rexbidv 3169	. . . . . . . . 9 ⊢ (𝑤 = 𝑥 → (∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤) ↔ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)))
44		nfcv 2892	. . . . . . . . . . 11 ⊢ Ⅎ𝑤∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
45		nfcv 2892	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝑍
46		nfcv 2892	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥(𝐹‘𝑚)
47	46	nfdm 5952	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥dom (𝐹‘𝑚)
48	45, 47	nfiin 5027	. . . . . . . . . . 11 ⊢ Ⅎ𝑥∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚)
49		nfv 1909	. . . . . . . . . . 11 ⊢ Ⅎ𝑤∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)
50		nfv 1909	. . . . . . . . . . 11 ⊢ Ⅎ𝑥∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)
51		nfcv 2892	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑚dom (𝐹‘𝑛)
52		nfcv 2892	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛(𝐹‘𝑚)
53	52	nfdm 5952	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛dom (𝐹‘𝑚)
54		fveq2 6894	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑚 → (𝐹‘𝑛) = (𝐹‘𝑚))
55	54	dmeqd 5907	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑚 → dom (𝐹‘𝑛) = dom (𝐹‘𝑚))
56	51, 53, 55	cbviin 5040	. . . . . . . . . . . 12 ⊢ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) = ∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚)
57	56	a1i 11	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑤 → ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) = ∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚))
58		fveq2 6894	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑤 → ((𝐹‘𝑛)‘𝑥) = ((𝐹‘𝑛)‘𝑤))
59	58	breq2d 5160	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑤 → (𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ 𝑦 ≤ ((𝐹‘𝑛)‘𝑤)))
60	59	ralbidv 3168	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑤 → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑤)))
61		nfv 1909	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑚 𝑦 ≤ ((𝐹‘𝑛)‘𝑤)
62		nfcv 2892	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑛𝑦
63		nfcv 2892	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑛 ≤
64		nfcv 2892	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑛𝑤
65	52, 64	nffv 6904	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑛((𝐹‘𝑚)‘𝑤)
66	62, 63, 65	nfbr 5195	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑛 𝑦 ≤ ((𝐹‘𝑚)‘𝑤)
67	54	fveq1d 6896	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑚 → ((𝐹‘𝑛)‘𝑤) = ((𝐹‘𝑚)‘𝑤))
68	67	breq2d 5160	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑚 → (𝑦 ≤ ((𝐹‘𝑛)‘𝑤) ↔ 𝑦 ≤ ((𝐹‘𝑚)‘𝑤)))
69	61, 66, 68	cbvralw 3294	. . . . . . . . . . . . . . 15 ⊢ (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑤) ↔ ∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤))
70	69	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑤 → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑤) ↔ ∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤)))
71	60, 70	bitrd 278	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑤 → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤)))
72	71	rexbidv 3169	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑤 → (∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∃𝑦 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤)))
73		breq1 5151	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑧 → (𝑦 ≤ ((𝐹‘𝑚)‘𝑤) ↔ 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)))
74	73	ralbidv 3168	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑧 → (∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤) ↔ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)))
75	74	cbvrexvw 3226	. . . . . . . . . . . . 13 ⊢ (∃𝑦 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤) ↔ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤))
76	75	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑤 → (∃𝑦 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑚)‘𝑤) ↔ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)))
77	72, 76	bitrd 278	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑤 → (∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)))
78	44, 48, 49, 50, 57, 77	cbvrabcsfw 3934	. . . . . . . . . 10 ⊢ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)} = {𝑤 ∈ ∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚) ∣ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)}
79	16, 78	eqtri 2753	. . . . . . . . 9 ⊢ 𝐷 = {𝑤 ∈ ∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚) ∣ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑤)}
80	43, 79	elrab2 3683	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐷 ↔ (𝑥 ∈ ∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚) ∧ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)))
81	80	biimpi 215	. . . . . . 7 ⊢ (𝑥 ∈ 𝐷 → (𝑥 ∈ ∩ 𝑚 ∈ 𝑍 dom (𝐹‘𝑚) ∧ ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)))
82	81	simprd 494	. . . . . 6 ⊢ (𝑥 ∈ 𝐷 → ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥))
83	82	adantl 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥))
84		renegcl 11553	. . . . . . . 8 ⊢ (𝑧 ∈ ℝ → -𝑧 ∈ ℝ)
85	84	ad2antlr 725	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) → -𝑧 ∈ ℝ)
86		fveq2 6894	. . . . . . . . . . . . . 14 ⊢ (𝑚 = 𝑛 → (𝐹‘𝑚) = (𝐹‘𝑛))
87	86	fveq1d 6896	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → ((𝐹‘𝑚)‘𝑥) = ((𝐹‘𝑛)‘𝑥))
88	87	breq2d 5160	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑛 → (𝑧 ≤ ((𝐹‘𝑚)‘𝑥) ↔ 𝑧 ≤ ((𝐹‘𝑛)‘𝑥)))
89	88	rspcva 3605	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ 𝑍 ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) → 𝑧 ≤ ((𝐹‘𝑛)‘𝑥))
90	89	ancoms 457	. . . . . . . . . 10 ⊢ ((∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥) ∧ 𝑛 ∈ 𝑍) → 𝑧 ≤ ((𝐹‘𝑛)‘𝑥))
91	90	adantll 712	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑧 ≤ ((𝐹‘𝑛)‘𝑥))
92		simpllr 774	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑧 ∈ ℝ)
93	25	ad4ant14 750	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
94	92, 93	lenegd 11823	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → (𝑧 ≤ ((𝐹‘𝑛)‘𝑥) ↔ -((𝐹‘𝑛)‘𝑥) ≤ -𝑧))
95	91, 94	mpbid 231	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → -((𝐹‘𝑛)‘𝑥) ≤ -𝑧)
96	95	ralrimiva 3136	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) → ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ -𝑧)
97		brralrspcev 5208	. . . . . . 7 ⊢ ((-𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ -𝑧) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑦)
98	85, 96, 97	syl2anc 582	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐷) ∧ 𝑧 ∈ ℝ) ∧ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥)) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑦)
99	98	rexlimdva2 3147	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (∃𝑧 ∈ ℝ ∀𝑚 ∈ 𝑍 𝑧 ≤ ((𝐹‘𝑚)‘𝑥) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑦))
100	83, 99	mpd 15	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑦)
101	3, 7, 39, 100	suprclrnmpt 44690	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ) ∈ ℝ)
102	16	a1i 11	. . . . . . 7 ⊢ (𝜑 → 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)})
103		nfv 1909	. . . . . . . . . 10 ⊢ Ⅎ𝑦(𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
104		nfv 1909	. . . . . . . . . 10 ⊢ Ⅎ𝑦∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧
105		renegcl 11553	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℝ → -𝑦 ∈ ℝ)
106	105	3ad2ant2 1131	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → -𝑦 ∈ ℝ)
107		nfv 1909	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑛𝜑
108		nfcv 2892	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑛𝑥
109		nfii1 5032	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑛∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
110	108, 109	nfel 2907	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑛 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)
111	107, 110	nfan 1894	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛))
112	62	nfel1 2909	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛 𝑦 ∈ ℝ
113		nfra1 3272	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)
114	111, 112, 113	nf3an 1896	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
115		simpl2 1189	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑦 ∈ ℝ)
116		simpll 765	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑛 ∈ 𝑍) → 𝜑)
117		simpr 483	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍)
118	22	adantll 712	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑛 ∈ 𝑍) → 𝑥 ∈ dom (𝐹‘𝑛))
119	13	3adant3 1129	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → (𝐹‘𝑛):dom (𝐹‘𝑛)⟶ℝ)
120		simp3 1135	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → 𝑥 ∈ dom (𝐹‘𝑛))
121	119, 120	ffvelcdmd 7092	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
122	116, 117, 118, 121	syl3anc 1368	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
123	122	3ad2antl1 1182	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
124		rspa 3236	. . . . . . . . . . . . . . . 16 ⊢ ((∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ∧ 𝑛 ∈ 𝑍) → 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
125	124	3ad2antl3 1184	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
126		leneg 11747	. . . . . . . . . . . . . . . 16 ⊢ ((𝑦 ∈ ℝ ∧ ((𝐹‘𝑛)‘𝑥) ∈ ℝ) → (𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ -((𝐹‘𝑛)‘𝑥) ≤ -𝑦))
127	126	biimp3a 1465	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ ℝ ∧ ((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → -((𝐹‘𝑛)‘𝑥) ≤ -𝑦)
128	115, 123, 125, 127	syl3anc 1368	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) ∧ 𝑛 ∈ 𝑍) → -((𝐹‘𝑛)‘𝑥) ≤ -𝑦)
129	128	ex 411	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → (𝑛 ∈ 𝑍 → -((𝐹‘𝑛)‘𝑥) ≤ -𝑦))
130	114, 129	ralrimi 3245	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ -𝑦)
131		brralrspcev 5208	. . . . . . . . . . . 12 ⊢ ((-𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ -𝑦) → ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)
132	106, 130, 131	syl2anc 582	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑦 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)) → ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)
133	132	3exp 1116	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) → (𝑦 ∈ ℝ → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) → ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)))
134	103, 104, 133	rexlimd 3254	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) → (∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) → ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧))
135	84	3ad2ant2 1131	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → -𝑧 ∈ ℝ)
136		nfv 1909	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛 𝑧 ∈ ℝ
137		nfra1 3272	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧
138	111, 136, 137	nf3an 1896	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)
139	122	3ad2antl1 1182	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) ∧ 𝑛 ∈ 𝑍) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
140		simpl2 1189	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) ∧ 𝑛 ∈ 𝑍) → 𝑧 ∈ ℝ)
141		rspa 3236	. . . . . . . . . . . . . . . 16 ⊢ ((∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧 ∧ 𝑛 ∈ 𝑍) → -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)
142	141	3ad2antl3 1184	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) ∧ 𝑛 ∈ 𝑍) → -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)
143		simp3 1135	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → -((𝐹‘𝑛)‘𝑥) ≤ 𝑧)
144		renegcl 11553	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹‘𝑛)‘𝑥) ∈ ℝ → -((𝐹‘𝑛)‘𝑥) ∈ ℝ)
145	144	adantr 479	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ) → -((𝐹‘𝑛)‘𝑥) ∈ ℝ)
146		simpr 483	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ) → 𝑧 ∈ ℝ)
147		leneg 11747	. . . . . . . . . . . . . . . . . . 19 ⊢ ((-((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ) → (-((𝐹‘𝑛)‘𝑥) ≤ 𝑧 ↔ -𝑧 ≤ --((𝐹‘𝑛)‘𝑥)))
148	145, 146, 147	syl2anc 582	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ) → (-((𝐹‘𝑛)‘𝑥) ≤ 𝑧 ↔ -𝑧 ≤ --((𝐹‘𝑛)‘𝑥)))
149	148	3adant3 1129	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → (-((𝐹‘𝑛)‘𝑥) ≤ 𝑧 ↔ -𝑧 ≤ --((𝐹‘𝑛)‘𝑥)))
150	143, 149	mpbid 231	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → -𝑧 ≤ --((𝐹‘𝑛)‘𝑥))
151		recn 11228	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹‘𝑛)‘𝑥) ∈ ℝ → ((𝐹‘𝑛)‘𝑥) ∈ ℂ)
152	151	negnegd 11592	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹‘𝑛)‘𝑥) ∈ ℝ → --((𝐹‘𝑛)‘𝑥) = ((𝐹‘𝑛)‘𝑥))
153	152	3ad2ant1 1130	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → --((𝐹‘𝑛)‘𝑥) = ((𝐹‘𝑛)‘𝑥))
154	150, 153	breqtrd 5174	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹‘𝑛)‘𝑥) ∈ ℝ ∧ 𝑧 ∈ ℝ ∧ -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → -𝑧 ≤ ((𝐹‘𝑛)‘𝑥))
155	139, 140, 142, 154	syl3anc 1368	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) ∧ 𝑛 ∈ 𝑍) → -𝑧 ≤ ((𝐹‘𝑛)‘𝑥))
156	155	ex 411	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → (𝑛 ∈ 𝑍 → -𝑧 ≤ ((𝐹‘𝑛)‘𝑥)))
157	138, 156	ralrimi 3245	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → ∀𝑛 ∈ 𝑍 -𝑧 ≤ ((𝐹‘𝑛)‘𝑥))
158		breq1 5151	. . . . . . . . . . . . . 14 ⊢ (𝑦 = -𝑧 → (𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ -𝑧 ≤ ((𝐹‘𝑛)‘𝑥)))
159	158	ralbidv 3168	. . . . . . . . . . . . 13 ⊢ (𝑦 = -𝑧 → (∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∀𝑛 ∈ 𝑍 -𝑧 ≤ ((𝐹‘𝑛)‘𝑥)))
160	159	rspcev 3607	. . . . . . . . . . . 12 ⊢ ((-𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -𝑧 ≤ ((𝐹‘𝑛)‘𝑥)) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
161	135, 157, 160	syl2anc 582	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) ∧ 𝑧 ∈ ℝ ∧ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))
162	161	3exp 1116	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) → (𝑧 ∈ ℝ → (∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧 → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥))))
163	162	rexlimdv 3143	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) → (∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧 → ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)))
164	134, 163	impbid 211	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛)) → (∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥) ↔ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧))
165	32, 164	rabbida 3446	. . . . . . 7 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑦 ∈ ℝ ∀𝑛 ∈ 𝑍 𝑦 ≤ ((𝐹‘𝑛)‘𝑥)} = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧})
166	102, 165	eqtrd 2765	. . . . . 6 ⊢ (𝜑 → 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧})
167	32, 166	alrimi 2201	. . . . 5 ⊢ (𝜑 → ∀𝑥 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧})
168		eqid 2725	. . . . . . 7 ⊢ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ) = sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )
169	168	rgenw 3055	. . . . . 6 ⊢ ∀𝑥 ∈ 𝐷 sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ) = sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )
170	169	a1i 11	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐷 sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ) = sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ))
171		mpteq12f 5236	. . . . 5 ⊢ ((∀𝑥 𝐷 = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} ∧ ∀𝑥 ∈ 𝐷 sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ) = sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) → (𝑥 ∈ 𝐷 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) = (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )))
172	167, 170, 171	syl2anc 582	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) = (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )))
173		nfv 1909	. . . . 5 ⊢ Ⅎ𝑧𝜑
174	121	renegcld 11671	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → -((𝐹‘𝑛)‘𝑥) ∈ ℝ)
175		nfv 1909	. . . . . 6 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑛 ∈ 𝑍)
176	34	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → dom (𝐹‘𝑛) ∈ V)
177	121	3expa 1115	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑥 ∈ dom (𝐹‘𝑛)) → ((𝐹‘𝑛)‘𝑥) ∈ ℝ)
178	13	feqmptd 6964	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐹‘𝑛) = (𝑥 ∈ dom (𝐹‘𝑛) ↦ ((𝐹‘𝑛)‘𝑥)))
179	178	eqcomd 2731	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ dom (𝐹‘𝑛) ↦ ((𝐹‘𝑛)‘𝑥)) = (𝐹‘𝑛))
180	179, 11	eqeltrd 2825	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ dom (𝐹‘𝑛) ↦ ((𝐹‘𝑛)‘𝑥)) ∈ (SMblFn‘𝑆))
181	175, 9, 176, 177, 180	smfneg 46254	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝑥 ∈ dom (𝐹‘𝑛) ↦ -((𝐹‘𝑛)‘𝑥)) ∈ (SMblFn‘𝑆))
182		eqid 2725	. . . . 5 ⊢ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} = {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧}
183		eqid 2725	. . . . 5 ⊢ (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) = (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < ))
184	107, 32, 173, 4, 5, 8, 174, 181, 182, 183	smfsupmpt 46266	. . . 4 ⊢ (𝜑 → (𝑥 ∈ {𝑥 ∈ ∩ 𝑛 ∈ 𝑍 dom (𝐹‘𝑛) ∣ ∃𝑧 ∈ ℝ ∀𝑛 ∈ 𝑍 -((𝐹‘𝑛)‘𝑥) ≤ 𝑧} ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) ∈ (SMblFn‘𝑆))
185	172, 184	eqeltrd 2825	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) ∈ (SMblFn‘𝑆))
186	32, 8, 38, 101, 185	smfneg 46254	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ -sup(ran (𝑛 ∈ 𝑍 ↦ -((𝐹‘𝑛)‘𝑥)), ℝ, < )) ∈ (SMblFn‘𝑆))
187	31, 186	eqeltrd 2825	1 ⊢ (𝜑 → 𝐺 ∈ (SMblFn‘𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 ∀wal 1531 = wceq 1533 ∈ wcel 2098 ≠ wne 2930 ∀wral 3051 ∃wrex 3060 {crab 3419 Vcvv 3463 ∅c0 4323 ∩ ciin 4997 class class class wbr 5148 ↦ cmpt 5231 dom cdm 5677 ran crn 5678 ⟶wf 6543 ‘cfv 6547 supcsup 9463 infcinf 9464 ℝcr 11137 < clt 11278 ≤ cle 11279 -cneg 11475 ℤcz 12588 ℤ_≥cuz 12852 SAlgcsalg 45759 SMblFncsmblfn 46146

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5364 ax-pr 5428 ax-un 7739 ax-inf2 9664 ax-cc 10458 ax-ac2 10486 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215 ax-pre-sup 11216

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3775 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-pss 3965 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-int 4950 df-iun 4998 df-iin 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 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 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6499 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-isom 6556 df-riota 7373 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7870 df-1st 7992 df-2nd 7993 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-oadd 8489 df-omul 8490 df-er 8723 df-map 8845 df-pm 8846 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-sup 9465 df-inf 9466 df-oi 9533 df-card 9962 df-acn 9965 df-ac 10139 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-div 11902 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-n0 12503 df-z 12589 df-uz 12853 df-q 12963 df-rp 13007 df-ioo 13360 df-ioc 13361 df-ico 13362 df-icc 13363 df-fz 13517 df-fzo 13660 df-fl 13789 df-seq 13999 df-exp 14059 df-hash 14322 df-word 14497 df-concat 14553 df-s1 14578 df-s2 14831 df-s3 14832 df-s4 14833 df-cj 15078 df-re 15079 df-im 15080 df-sqrt 15214 df-abs 15215 df-rest 17403 df-topgen 17424 df-top 22826 df-bases 22879 df-salg 45760 df-salgen 45764 df-smblfn 46147

This theorem is referenced by: smfinf 46269

W3C validator