smflimsupmpt - Mathbox for Glauco Siliprandi

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

Theorem smflimsupmpt 48054

Description: The superior limit of a sequence of sigma-measurable functions is sigma-measurable. Proposition 121F (d) of [Fremlin1] p. 39 . 𝐴 can contain 𝑚 as a free variable, in other words it can be thought of as an indexed collection 𝐴(𝑚). 𝐵 can be thought of as a collection with two indices 𝐵(𝑚, 𝑥). (Contributed by Glauco Siliprandi, 23-Oct-2021.)

**Hypotheses**
Ref	Expression
smflimsupmpt.p	⊢ Ⅎ𝑚𝜑
smflimsupmpt.x	⊢ Ⅎ𝑥𝜑
smflimsupmpt.n	⊢ Ⅎ𝑛𝜑
smflimsupmpt.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
smflimsupmpt.z	⊢ 𝑍 = (ℤ_≥‘𝑀)
smflimsupmpt.s	⊢ (𝜑 → 𝑆 ∈ SAlg)
smflimsupmpt.b	⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊)
smflimsupmpt.f	⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ (SMblFn‘𝑆))
smflimsupmpt.d	⊢ 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ}
smflimsupmpt.g	⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)))

**Assertion**
Ref	Expression
smflimsupmpt	⊢ (𝜑 → 𝐺 ∈ (SMblFn‘𝑆))

Distinct variable groups: 𝐴,𝑛,𝑥 𝐵,𝑛 𝑚,𝑀 𝑆,𝑚 𝑚,𝑍,𝑛,𝑥 Allowed substitution hints: 𝜑(𝑥, 𝑚, 𝑛) 𝐴(𝑚) 𝐵(𝑥, 𝑚) 𝐷(𝑥, 𝑚, 𝑛) 𝑆(𝑥, 𝑛) 𝐺(𝑥, 𝑚, 𝑛) 𝑀(𝑥, 𝑛) 𝑊(𝑥, 𝑚, 𝑛)

**Proof of Theorem smflimsupmpt**
Step	Hyp	Ref	Expression
1		smflimsupmpt.g	. . . 4 ⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)))
2	1	a1i 11	. . 3 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐷 ↦ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵))))
3		smflimsupmpt.x	. . . 4 ⊢ Ⅎ𝑥𝜑
4		smflimsupmpt.d	. . . . . 6 ⊢ 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ}
5	4	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ})
6		simpr 490	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
7		smflimsupmpt.n	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛𝜑
8		smflimsupmpt.p	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑚𝜑
9		nfv 1949	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑚 𝑛 ∈ 𝑍
10	8, 9	nfan 1934	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑚(𝜑 ∧ 𝑛 ∈ 𝑍)
11		simpll 779	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝜑)
12		smflimsupmpt.z	. . . . . . . . . . . . . . . . 17 ⊢ 𝑍 = (ℤ_≥‘𝑀)
13	12	uztrn2 13014	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ 𝑍 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑚 ∈ 𝑍)
14	13	adantll 727	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑚 ∈ 𝑍)
15		simpr 490	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → 𝑚 ∈ 𝑍)
16		smflimsupmpt.f	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ (SMblFn‘𝑆))
17	16	elexd 3477	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V)
18		eqid 2763	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵)) = (𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))
19	18	fvmpt2 7031	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑚 ∈ 𝑍 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) → ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) = (𝑥 ∈ 𝐴 ↦ 𝐵))
20	15, 17, 19	syl2anc 596	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) = (𝑥 ∈ 𝐴 ↦ 𝐵))
21	20	dmeqd 5895	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) = dom (𝑥 ∈ 𝐴 ↦ 𝐵))
22		nfv 1949	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑥 𝑚 ∈ 𝑍
23	3, 22	nfan 1934	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑚 ∈ 𝑍)
24		eqid 2763	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
25		smflimsupmpt.b	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊)
26	25	3expa 1136	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑍) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊)
27	23, 24, 26	dmmptdf 46452	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → dom (𝑥 ∈ 𝐴 ↦ 𝐵) = 𝐴)
28	21, 27	eqtr2d 2799	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → 𝐴 = dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
29	11, 14, 28	syl2anc 596	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝐴 = dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
30	10, 29	iineq2d 4978	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 = ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
31	7, 30	iuneq2df 46280	. . . . . . . . . . . 12 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 = ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
32	31	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 = ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
33	6, 32	eleqtrd 2866	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
34	33	adantrr 730	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
35		eliun 4958	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ↔ ∃𝑛 ∈ 𝑍 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
36	35	bilani 510	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → ∃𝑛 ∈ 𝑍 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
37		nfv 1949	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛(lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵))
38		nfcv 2926	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑚𝑥
39		nfii1 4990	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑚∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴
40	38, 39	nfel 2940	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑚 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴
41	8, 9, 40	nf3an 1936	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑚(𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
42	20	fveq1d 6913	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
43	11, 14, 42	syl2anc 596	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
44	43	3adantl3 1187	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
45		eliinid 46341	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑥 ∈ 𝐴)
46	45	3ad2antl3 1206	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑥 ∈ 𝐴)
47		simpl1 1210	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝜑)
48	14	3adantl3 1187	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑚 ∈ 𝑍)
49	47, 48, 46, 25	syl3anc 1399	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝐵 ∈ 𝑊)
50	24	fvmpt2 7031	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑊) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
51	46, 49, 50	syl2anc 596	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
52	44, 51	eqtrd 2798	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥) = 𝐵)
53	41, 52	mpteq2da 5201	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (𝑚 ∈ (ℤ_≥‘𝑛) ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥)) = (𝑚 ∈ (ℤ_≥‘𝑛) ↦ 𝐵))
54	53	fveq2d 6915	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ 𝐵)))
55		smflimsupmpt.m	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝑀 ∈ ℤ)
56	55	3ad2ant1 1151	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → 𝑀 ∈ ℤ)
57	12	eluzelz2 46628	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ ℤ)
58	57	3ad2ant2 1152	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → 𝑛 ∈ ℤ)
59		eqid 2763	. . . . . . . . . . . . . . . . 17 ⊢ (ℤ_≥‘𝑛) = (ℤ_≥‘𝑛)
60		fvexd 6926	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ 𝑍) → (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥) ∈ V)
61	48, 60	syldan 603	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥) ∈ V)
62	41, 56, 58, 12, 59, 60, 61	limsupequzmpt 46954	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))))
63	9	nfci 2914	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑚𝑍
64		nfcv 2926	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑚(ℤ_≥‘𝑛)
65		simp2 1155	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → 𝑛 ∈ 𝑍)
66	58	uzidd 13011	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → 𝑛 ∈ (ℤ_≥‘𝑛))
67	41, 63, 64, 12, 59, 65, 66, 49	limsupequzmpt2 46943	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) = (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ 𝐵)))
68	54, 62, 67	3eqtr4d 2808	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)))
69	68	3exp 1137	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑛 ∈ 𝑍 → (𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 → (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)))))
70	7, 37, 69	rexlimd 3273	. . . . . . . . . . . . 13 ⊢ (𝜑 → (∃𝑛 ∈ 𝑍 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 → (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵))))
71	70	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (∃𝑛 ∈ 𝑍 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 → (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵))))
72	36, 71	mpd 16	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)))
73	72	adantrr 730	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)) → (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)))
74		simprr 785	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)) → (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)
75	73, 74	eqeltrd 2864	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)) → (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)
76	34, 75	jca 521	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)) → (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ))
77	76	ex 418	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ) → (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)))
78		simpl 488	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)) → 𝜑)
79		simpr 490	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
80	31	eqcomd 2769	. . . . . . . . . . . 12 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) = ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
81	80	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)) → ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) = ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
82	79, 81	eleqtrd 2866	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
83	82	adantrr 730	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
84		simprr 785	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)) → (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)
85		simp2 1155	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
86	72	eqcomd 2769	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) = (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))))
87	86	3adant3 1150	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ) → (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) = (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))))
88		simp3 1156	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ) → (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)
89	87, 88	eqeltrd 2864	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ) → (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)
90	85, 89	jca 521	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ) → (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ))
91	78, 83, 84, 90	syl3anc 1399	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)) → (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ))
92	91	ex 418	. . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ) → (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)))
93	77, 92	impbid 215	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ) ↔ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)))
94	3, 93	rabbida3 46365	. . . . 5 ⊢ (𝜑 → {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ} = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ})
95	5, 94	eqtrd 2798	. . . 4 ⊢ (𝜑 → 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ})
96	4	eleq2i 2856	. . . . . . 7 ⊢ (𝑥 ∈ 𝐷 ↔ 𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ})
97	96	biimpi 219	. . . . . 6 ⊢ (𝑥 ∈ 𝐷 → 𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ})
98		rabidim1 3437	. . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ} → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
99	97, 98	syl 18	. . . . 5 ⊢ (𝑥 ∈ 𝐷 → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
100	99, 86	sylan2 605	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵)) = (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))))
101	3, 95, 100	mpteq12da 5192	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ (lim sup‘(𝑚 ∈ 𝑍 ↦ 𝐵))) = (𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ} ↦ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥)))))
102	2, 101	eqtrd 2798	. 2 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ} ↦ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥)))))
103		nfmpt1 5208	. . 3 ⊢ Ⅎ𝑚(𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))
104		nfcv 2926	. . . 4 ⊢ Ⅎ𝑥𝑍
105		nfmpt1 5208	. . . 4 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
106	104, 105	nfmpt 5207	. . 3 ⊢ Ⅎ𝑥(𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))
107		smflimsupmpt.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ SAlg)
108	8, 16	fmptd2f 46462	. . 3 ⊢ (𝜑 → (𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵)):𝑍⟶(SMblFn‘𝑆))
109		eqid 2763	. . 3 ⊢ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ} = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ}
110		eqid 2763	. . 3 ⊢ (𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ} ↦ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥)))) = (𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ} ↦ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))))
111	103, 106, 55, 12, 107, 108, 109, 110	smflimsup 48053	. 2 ⊢ (𝜑 → (𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ} ↦ (lim sup‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥)))) ∈ (SMblFn‘𝑆))
112	102, 111	eqeltrd 2864	1 ⊢ (𝜑 → 𝐺 ∈ (SMblFn‘𝑆))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2147 ∃wrex 3090 {crab 3416 Vcvv 3454 ∪ ciun 4954 ∩ ciin 4955 ↦ cmpt 5190 dom cdm 5656 ‘cfv 6561 ℝcr 11229 ℤcz 12723 ℤ_≥cuz 12995 lim supclsp 15669 SAlgcsalg 47533 SMblFncsmblfn 47920

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-inf2 9672 ax-cc 10543 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 ax-pre-sup 11308

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-se 5610 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-om 7905 df-1st 8028 df-2nd 8029 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-1o 8507 df-2o 8508 df-oadd 8511 df-omul 8512 df-er 8748 df-map 8880 df-pm 8881 df-en 9005 df-dom 9006 df-sdom 9007 df-fin 9008 df-sup 9464 df-inf 9465 df-oi 9534 df-card 10050 df-acn 10053 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-div 12004 df-nn 12366 df-2 12435 df-3 12436 df-n0 12637 df-z 12724 df-uz 12996 df-q 13106 df-rp 13151 df-ioo 13510 df-ioc 13511 df-ico 13512 df-fz 13670 df-fl 13962 df-ceil 13963 df-seq 14175 df-exp 14235 df-cj 15298 df-re 15299 df-im 15300 df-sqrt 15434 df-abs 15435 df-limsup 15670 df-clim 15687 df-rlim 15688 df-rest 17625 df-topgen 17646 df-top 23245 df-bases 23297 df-salg 47534 df-salgen 47538 df-smblfn 47921

This theorem is used by: smfliminflem 48055

W3C validator