smfliminfmpt - Mathbox for Glauco Siliprandi

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

Theorem smfliminfmpt 47282

Description: The inferior limit of a countable set of sigma-measurable functions is sigma-measurable. Proposition 121F (e) 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, 2-Jan-2022.)

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

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

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

**Proof of Theorem smfliminfmpt**
Step	Hyp	Ref	Expression
1		smfliminfmpt.g	. . . 4 ⊢ 𝐺 = (𝑥 ∈ 𝐷 ↦ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)))
2	1	a1i 11	. . 3 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐷 ↦ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵))))
3		smfliminfmpt.x	. . . 4 ⊢ Ⅎ𝑥𝜑
4		smfliminfmpt.d	. . . . . 6 ⊢ 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ}
5	4	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ})
6		simpr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
7		smfliminfmpt.n	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛𝜑
8		smfliminfmpt.p	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑚𝜑
9		nfv 1921	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑚 𝑛 ∈ 𝑍
10	8, 9	nfan 1906	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑚(𝜑 ∧ 𝑛 ∈ 𝑍)
11		simpll 772	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝜑)
12		smfliminfmpt.z	. . . . . . . . . . . . . . . 16 ⊢ 𝑍 = (ℤ_≥‘𝑀)
13	12	uztrn2 12805	. . . . . . . . . . . . . . 15 ⊢ ((𝑛 ∈ 𝑍 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑚 ∈ 𝑍)
14	13	adantll 720	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑚 ∈ 𝑍)
15		simpr 485	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → 𝑚 ∈ 𝑍)
16		smfliminfmpt.f	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ (SMblFn‘𝑆))
17	16	elexd 3456	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V)
18		eqid 2740	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵)) = (𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))
19	18	fvmpt2 6954	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 ∈ 𝑍 ∧ (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) → ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) = (𝑥 ∈ 𝐴 ↦ 𝐵))
20	15, 17, 19	syl2anc 590	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) = (𝑥 ∈ 𝐴 ↦ 𝐵))
21	20	dmeqd 5854	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) = dom (𝑥 ∈ 𝐴 ↦ 𝐵))
22		nfv 1921	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥 𝑚 ∈ 𝑍
23	3, 22	nfan 1906	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑚 ∈ 𝑍)
24		eqid 2740	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
25		smfliminfmpt.b	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
26	25	3expa 1124	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑍) ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑉)
27	23, 24, 26	dmmptdf 45676	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → dom (𝑥 ∈ 𝐴 ↦ 𝐵) = 𝐴)
28	21, 27	eqtr2d 2776	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → 𝐴 = dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
29	11, 14, 28	syl2anc 590	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝐴 = dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
30	10, 29	iineq2d 4952	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 = ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
31	7, 30	iuneq2df 45502	. . . . . . . . . . 11 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 = ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
32	31	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 = ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
33	6, 32	eleqtrd 2842	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
34	33	adantrr 723	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
35		eliun 4932	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ↔ ∃𝑛 ∈ 𝑍 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
36	35	bilani 505	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → ∃𝑛 ∈ 𝑍 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
37		nfv 1921	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛(lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵))
38		nfcv 2902	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑚𝑥
39		nfii1 4965	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑚∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴
40	38, 39	nfel 2916	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑚 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴
41	8, 9, 40	nf3an 1908	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑚(𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
42	20	fveq1d 6836	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
43	11, 14, 42	syl2anc 590	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
44	43	3adantl3 1175	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥) = ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥))
45		eliinid 45565	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑥 ∈ 𝐴)
46	45	3ad2antl3 1194	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑥 ∈ 𝐴)
47		simpl1 1198	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝜑)
48		simp2 1143	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → 𝑛 ∈ 𝑍)
49	48, 13	sylan 586	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑚 ∈ 𝑍)
50	47, 49, 46, 25	syl3anc 1379	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝐵 ∈ 𝑉)
51	24	fvmpt2 6954	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ 𝑉) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
52	46, 50, 51	syl2anc 590	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → ((𝑥 ∈ 𝐴 ↦ 𝐵)‘𝑥) = 𝐵)
53	44, 52	eqtrd 2775	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥) = 𝐵)
54	41, 53	mpteq2da 5171	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (𝑚 ∈ (ℤ_≥‘𝑛) ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥)) = (𝑚 ∈ (ℤ_≥‘𝑛) ↦ 𝐵))
55	54	fveq2d 6838	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (lim inf‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim inf‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ 𝐵)))
56		nfcv 2902	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑚𝑍
57		nfcv 2902	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑚(ℤ_≥‘𝑛)
58		eqid 2740	. . . . . . . . . . . . . . . 16 ⊢ (ℤ_≥‘𝑛) = (ℤ_≥‘𝑛)
59	12	eluzelz2 45853	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ ℤ)
60	59	uzidd 12802	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ (ℤ_≥‘𝑛))
61	60	3ad2ant2 1140	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → 𝑛 ∈ (ℤ_≥‘𝑛))
62		fvexd 6849	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥) ∈ V)
63	41, 56, 57, 12, 58, 48, 61, 62	liminfequzmpt2 46241	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim inf‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))))
64	41, 56, 57, 12, 58, 48, 61, 50	liminfequzmpt2 46241	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) = (lim inf‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ 𝐵)))
65	55, 63, 64	3eqtr4d 2785	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍 ∧ 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)))
66	65	3exp 1125	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑛 ∈ 𝑍 → (𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 → (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)))))
67	7, 37, 66	rexlimd 3247	. . . . . . . . . . . 12 ⊢ (𝜑 → (∃𝑛 ∈ 𝑍 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 → (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵))))
68	67	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (∃𝑛 ∈ 𝑍 𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 → (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵))))
69	36, 68	mpd 15	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)))
70	69	adantrr 723	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)) → (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) = (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)))
71		simprr 778	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)) → (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)
72	70, 71	eqeltrd 2840	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)) → (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)
73	34, 72	jca 516	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)) → (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ))
74		simpl 483	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)) → 𝜑)
75		simpr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚))
76	31	eqcomd 2746	. . . . . . . . . . 11 ⊢ (𝜑 → ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) = ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
77	76	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)) → ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) = ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
78	75, 77	eleqtrd 2842	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
79	78	adantrr 723	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
80		simprr 778	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)) → (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)
81		simp2 1143	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
82	69	eqcomd 2746	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴) → (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) = (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))))
83	82	3adant3 1138	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ) → (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) = (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))))
84		simp3 1144	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ) → (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)
85	83, 84	eqeltrd 2840	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ) → (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ)
86	81, 85	jca 516	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ) → (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ))
87	74, 79, 80, 86	syl3anc 1379	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)) → (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ))
88	73, 87	impbida 806	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ) ↔ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∧ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ)))
89	3, 88	rabbida3 45589	. . . . 5 ⊢ (𝜑 → {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ} = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ})
90	5, 89	eqtrd 2775	. . . 4 ⊢ (𝜑 → 𝐷 = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ})
91	4	eleq2i 2832	. . . . . . 7 ⊢ (𝑥 ∈ 𝐷 ↔ 𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ})
92	91	biimpi 217	. . . . . 6 ⊢ (𝑥 ∈ 𝐷 → 𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ})
93		rabidim1 3414	. . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴 ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) ∈ ℝ} → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
94	92, 93	syl 17	. . . . 5 ⊢ (𝑥 ∈ 𝐷 → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)𝐴)
95	94, 82	sylan2 599	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐷) → (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵)) = (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))))
96	3, 90, 95	mpteq12da 5162	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ (lim inf‘(𝑚 ∈ 𝑍 ↦ 𝐵))) = (𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ} ↦ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥)))))
97	2, 96	eqtrd 2775	. 2 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ} ↦ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥)))))
98		nfmpt1 5178	. . 3 ⊢ Ⅎ𝑚(𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))
99		nfcv 2902	. . . 4 ⊢ Ⅎ𝑥𝑍
100		nfmpt1 5178	. . . 4 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐵)
101	99, 100	nfmpt 5177	. . 3 ⊢ Ⅎ𝑥(𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))
102		smfliminfmpt.m	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ)
103		smfliminfmpt.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ SAlg)
104	8, 16	fmptd2f 45686	. . 3 ⊢ (𝜑 → (𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵)):𝑍⟶(SMblFn‘𝑆))
105		eqid 2740	. . 3 ⊢ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ} = {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ}
106		eqid 2740	. . 3 ⊢ (𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ} ↦ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥)))) = (𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ} ↦ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))))
107	98, 101, 102, 12, 103, 104, 105, 106	smfliminf 47281	. 2 ⊢ (𝜑 → (𝑥 ∈ {𝑥 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom ((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚) ∣ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥))) ∈ ℝ} ↦ (lim inf‘(𝑚 ∈ 𝑍 ↦ (((𝑚 ∈ 𝑍 ↦ (𝑥 ∈ 𝐴 ↦ 𝐵))‘𝑚)‘𝑥)))) ∈ (SMblFn‘𝑆))
108	97, 107	eqeltrd 2840	1 ⊢ (𝜑 → 𝐺 ∈ (SMblFn‘𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1092 = wceq 1547 Ⅎwnf 1790 ∈ wcel 2119 ∃wrex 3064 {crab 3392 Vcvv 3432 ∪ ciun 4928 ∩ ciin 4929 ↦ cmpt 5160 dom cdm 5625 ‘cfv 6492 ℝcr 11035 ℤcz 12522 ℤ_≥cuz 12786 lim infclsi 46201 SAlgcsalg 46758 SMblFncsmblfn 47145

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-inf2 9560 ax-cc 10355 ax-ac2 10383 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 ax-pre-sup 11114

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-tp 4567 df-op 4569 df-uni 4846 df-int 4885 df-iun 4930 df-iin 4931 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 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 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-2o 8403 df-oadd 8406 df-omul 8407 df-er 8640 df-map 8772 df-pm 8773 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-sup 9352 df-inf 9353 df-oi 9422 df-card 9861 df-acn 9864 df-ac 10036 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-div 11806 df-nn 12173 df-2 12242 df-3 12243 df-4 12244 df-n0 12436 df-z 12523 df-uz 12787 df-q 12897 df-rp 12941 df-xneg 13061 df-ioo 13300 df-ioc 13301 df-ico 13302 df-icc 13303 df-fz 13460 df-fzo 13607 df-fl 13749 df-ceil 13750 df-seq 13962 df-exp 14022 df-hash 14291 df-word 14474 df-concat 14531 df-s1 14557 df-s2 14808 df-s3 14809 df-s4 14810 df-cj 15059 df-re 15060 df-im 15061 df-sqrt 15195 df-abs 15196 df-limsup 15431 df-clim 15448 df-rlim 15449 df-rest 17383 df-topgen 17404 df-top 22884 df-bases 22936 df-liminf 46202 df-salg 46759 df-salgen 46763 df-smblfn 47146

This theorem is referenced by: (None)

W3C validator