smflimsuplem5 - Mathbox for Glauco Siliprandi

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

Theorem smflimsuplem5 43455

Description: 𝐻 converges to the superior limit of 𝐹. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

**Hypotheses**
Ref	Expression
smflimsuplem5.a	⊢ Ⅎ𝑛𝜑
smflimsuplem5.b	⊢ Ⅎ𝑚𝜑
smflimsuplem5.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
smflimsuplem5.z	⊢ 𝑍 = (ℤ_≥‘𝑀)
smflimsuplem5.s	⊢ (𝜑 → 𝑆 ∈ SAlg)
smflimsuplem5.f	⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
smflimsuplem5.e	⊢ 𝐸 = (𝑛 ∈ 𝑍 ↦ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
smflimsuplem5.h	⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )))
smflimsuplem5.r	⊢ (𝜑 → (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
smflimsuplem5.n	⊢ (𝜑 → 𝑁 ∈ 𝑍)
smflimsuplem5.x	⊢ (𝜑 → 𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚))

**Assertion**
Ref	Expression
smflimsuplem5	⊢ (𝜑 → (𝑛 ∈ (ℤ_≥‘𝑁) ↦ ((𝐻‘𝑛)‘𝑋)) ⇝ (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))))

Distinct variable groups: 𝑛,𝐹,𝑥 𝑚,𝑀 𝑚,𝑁,𝑛 𝑚,𝑋,𝑛 𝑚,𝑍,𝑛,𝑥 Allowed substitution hints: 𝜑(𝑥,𝑚,𝑛) 𝑆(𝑥,𝑚,𝑛) 𝐸(𝑥,𝑚,𝑛) 𝐹(𝑚) 𝐻(𝑥,𝑚,𝑛) 𝑀(𝑥,𝑛) 𝑁(𝑥) 𝑋(𝑥)

Proof of Theorem smflimsuplem5 Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		smflimsuplem5.a	. . 3 ⊢ Ⅎ𝑛𝜑
2		smflimsuplem5.n	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ 𝑍)
3		smflimsuplem5.z	. . . . . . . . . . . 12 ⊢ 𝑍 = (ℤ_≥‘𝑀)
4	3	eleq2i 2881	. . . . . . . . . . 11 ⊢ (𝑁 ∈ 𝑍 ↔ 𝑁 ∈ (ℤ_≥‘𝑀))
5	4	biimpi 219	. . . . . . . . . 10 ⊢ (𝑁 ∈ 𝑍 → 𝑁 ∈ (ℤ_≥‘𝑀))
6		uzss 12253	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (ℤ_≥‘𝑁) ⊆ (ℤ_≥‘𝑀))
7	5, 6	syl 17	. . . . . . . . 9 ⊢ (𝑁 ∈ 𝑍 → (ℤ_≥‘𝑁) ⊆ (ℤ_≥‘𝑀))
8	7, 3	sseqtrrdi 3966	. . . . . . . 8 ⊢ (𝑁 ∈ 𝑍 → (ℤ_≥‘𝑁) ⊆ 𝑍)
9	2, 8	syl 17	. . . . . . 7 ⊢ (𝜑 → (ℤ_≥‘𝑁) ⊆ 𝑍)
10	9	sselda 3915	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑛 ∈ 𝑍)
11		smflimsuplem5.e	. . . . . . . . . 10 ⊢ 𝐸 = (𝑛 ∈ 𝑍 ↦ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
12		nfcv 2955	. . . . . . . . . . 11 ⊢ Ⅎ𝑥𝑍
13		nfrab1 3337	. . . . . . . . . . 11 ⊢ Ⅎ𝑥{𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ}
14	12, 13	nfmpt 5127	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑛 ∈ 𝑍 ↦ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
15	11, 14	nfcxfr 2953	. . . . . . . . 9 ⊢ Ⅎ𝑥𝐸
16		nfcv 2955	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑛
17	15, 16	nffv 6655	. . . . . . . 8 ⊢ Ⅎ𝑥(𝐸‘𝑛)
18		fvex 6658	. . . . . . . 8 ⊢ (𝐸‘𝑛) ∈ V
19	17, 18	mptexf 41873	. . . . . . 7 ⊢ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )) ∈ V
20	19	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )) ∈ V)
21		smflimsuplem5.h	. . . . . . 7 ⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )))
22	21	fvmpt2 6756	. . . . . 6 ⊢ ((𝑛 ∈ 𝑍 ∧ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < )) ∈ V) → (𝐻‘𝑛) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < )))
23	10, 20, 22	syl2anc 587	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (𝐻‘𝑛) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )))
24	23	fveq1d 6647	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ((𝐻‘𝑛)‘𝑋) = ((𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ))‘𝑋))
25		nfcv 2955	. . . . . 6 ⊢ Ⅎ𝑦(𝐸‘𝑛)
26		nfcv 2955	. . . . . 6 ⊢ Ⅎ𝑦sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )
27		nfcv 2955	. . . . . 6 ⊢ Ⅎ𝑥sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^*, < )
28		fveq2 6645	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑚)‘𝑥) = ((𝐹‘𝑚)‘𝑦))
29	28	mpteq2dv 5126	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)))
30	29	rneqd 5772	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)))
31	30	supeq1d 8894	. . . . . 6 ⊢ (𝑥 = 𝑦 → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ))
32	17, 25, 26, 27, 31	cbvmptf 5129	. . . . 5 ⊢ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < )) = (𝑦 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ))
33		simpl 486	. . . . . . . . 9 ⊢ ((𝑦 = 𝑋 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑦 = 𝑋)
34	33	fveq2d 6649	. . . . . . . 8 ⊢ ((𝑦 = 𝑋 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑚)‘𝑦) = ((𝐹‘𝑚)‘𝑋))
35	34	mpteq2dva 5125	. . . . . . 7 ⊢ (𝑦 = 𝑋 → (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)) = (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)))
36	35	rneqd 5772	. . . . . 6 ⊢ (𝑦 = 𝑋 → ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)) = ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)))
37	36	supeq1d 8894	. . . . 5 ⊢ (𝑦 = 𝑋 → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^, < ))
38	37	eleq1d 2874	. . . . . . . 8 ⊢ (𝑦 = 𝑋 → (sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) ∈ ℝ ↔ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^, < ) ∈ ℝ))
39		uzss 12253	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → (ℤ_≥‘𝑛) ⊆ (ℤ_≥‘𝑁))
40		iinss1 4896	. . . . . . . . . . 11 ⊢ ((ℤ_≥‘𝑛) ⊆ (ℤ_≥‘𝑁) → ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ⊆ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚))
41	39, 40	syl 17	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ⊆ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚))
42	41	adantl 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ⊆ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚))
43		smflimsuplem5.x	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚))
44	43	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚))
45	42, 44	sseldd 3916	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚))
46		smflimsuplem5.b	. . . . . . . . . . 11 ⊢ Ⅎ𝑚𝜑
47		nfv 1915	. . . . . . . . . . 11 ⊢ Ⅎ𝑚 𝑛 ∈ (ℤ_≥‘𝑁)
48	46, 47	nfan 1900	. . . . . . . . . 10 ⊢ Ⅎ𝑚(𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁))
49		eqid 2798	. . . . . . . . . 10 ⊢ (ℤ_≥‘𝑛) = (ℤ_≥‘𝑛)
50		simpll 766	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝜑)
51	39	sselda 3915	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ (ℤ_≥‘𝑁) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑚 ∈ (ℤ_≥‘𝑁))
52	51	adantll 713	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑚 ∈ (ℤ_≥‘𝑁))
53		smflimsuplem5.s	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑆 ∈ SAlg)
54	53	adantr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑆 ∈ SAlg)
55		simpl 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝜑)
56	9	sselda 3915	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑚 ∈ 𝑍)
57		smflimsuplem5.f	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
58	57	ffvelrnda 6828	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (𝐹‘𝑚) ∈ (SMblFn‘𝑆))
59	55, 56, 58	syl2anc 587	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → (𝐹‘𝑚) ∈ (SMblFn‘𝑆))
60		eqid 2798	. . . . . . . . . . . . 13 ⊢ dom (𝐹‘𝑚) = dom (𝐹‘𝑚)
61	54, 59, 60	smff 43366	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → (𝐹‘𝑚):dom (𝐹‘𝑚)⟶ℝ)
62		eliin 4886	. . . . . . . . . . . . . . . 16 ⊢ (𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) → (𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ↔ ∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚)))
63	43, 62	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ↔ ∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚)))
64	43, 63	mpbid 235	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚))
65	64	adantr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → ∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚))
66		simpr 488	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑚 ∈ (ℤ_≥‘𝑁))
67		rspa 3171	. . . . . . . . . . . . 13 ⊢ ((∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚) ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ dom (𝐹‘𝑚))
68	65, 66, 67	syl2anc 587	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ dom (𝐹‘𝑚))
69	61, 68	ffvelrnd 6829	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → ((𝐹‘𝑚)‘𝑋) ∈ ℝ)
70	50, 52, 69	syl2anc 587	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑚)‘𝑋) ∈ ℝ)
71		eluzelz 12241	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → 𝑛 ∈ ℤ)
72	71	adantl 485	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑛 ∈ ℤ)
73		smflimsuplem5.m	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 ∈ ℤ)
74	73	adantr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑀 ∈ ℤ)
75		fvex 6658	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑚)‘𝑋) ∈ V
76	75	a1i 11	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) ∧ 𝑚 ∈ 𝑍) → ((𝐹‘𝑚)‘𝑋) ∈ V)
77	48, 72, 74, 49, 3, 70, 76	limsupequzmpt 42371	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))))
78		smflimsuplem5.r	. . . . . . . . . . . . 13 ⊢ (𝜑 → (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
79	78	adantr 484	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
80	77, 79	eqeltrd 2890	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
81	80	renepnfd 10681	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋))) ≠ +∞)
82	48, 49, 70, 81	limsupubuzmpt 42361	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ∃𝑦 ∈ ℝ ∀𝑚 ∈ (ℤ_≥‘𝑛)((𝐹‘𝑚)‘𝑋) ≤ 𝑦)
83		uzid2 42042	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → 𝑛 ∈ (ℤ_≥‘𝑛))
84	83	ne0d 4251	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → (ℤ_≥‘𝑛) ≠ ∅)
85	84	adantl 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (ℤ_≥‘𝑛) ≠ ∅)
86	48, 85, 70	supxrre3rnmpt 42066	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < ) ∈ ℝ ↔ ∃𝑦 ∈ ℝ ∀𝑚 ∈ (ℤ_≥‘𝑛)((𝐹‘𝑚)‘𝑋) ≤ 𝑦))
87	82, 86	mpbird 260	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < ) ∈ ℝ)
88	38, 45, 87	elrabd 3630	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ {𝑦 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^*, < ) ∈ ℝ})
89		simpl 486	. . . . . . . . . . . . 13 ⊢ ((𝑦 = 𝑥 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑦 = 𝑥)
90	89	fveq2d 6649	. . . . . . . . . . . 12 ⊢ ((𝑦 = 𝑥 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑚)‘𝑦) = ((𝐹‘𝑚)‘𝑥))
91	90	mpteq2dva 5125	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑥 → (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)) = (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)))
92	91	rneqd 5772	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)) = ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)))
93	92	supeq1d 8894	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ))
94	93	eleq1d 2874	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) ∈ ℝ ↔ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ))
95	94	cbvrabv 3439	. . . . . . 7 ⊢ {𝑦 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ}
96	88, 95	eleqtrdi 2900	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
97		eqid 2798	. . . . . . . 8 ⊢ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ}
98		fvex 6658	. . . . . . . . . . . . 13 ⊢ (𝐹‘𝑚) ∈ V
99	98	dmex 7598	. . . . . . . . . . . 12 ⊢ dom (𝐹‘𝑚) ∈ V
100	99	rgenw 3118	. . . . . . . . . . 11 ⊢ ∀𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∈ V
101	100	a1i 11	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → ∀𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
102	84, 101	iinexd 41769	. . . . . . . . 9 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
103	102	adantl 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
104	97, 103	rabexd 5200	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ} ∈ V)
105	11	fvmpt2 6756	. . . . . . 7 ⊢ ((𝑛 ∈ 𝑍 ∧ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ} ∈ V) → (𝐸‘𝑛) = {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ})
106	10, 104, 105	syl2anc 587	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (𝐸‘𝑛) = {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
107	96, 106	eleqtrrd 2893	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ (𝐸‘𝑛))
108	32, 37, 107, 87	fvmptd3 6768	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ((𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ))‘𝑋) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^, < ))
109	24, 108	eqtrd 2833	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ((𝐻‘𝑛)‘𝑋) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < ))
110	1, 109	mpteq2da 5124	. 2 ⊢ (𝜑 → (𝑛 ∈ (ℤ_≥‘𝑁) ↦ ((𝐻‘𝑛)‘𝑋)) = (𝑛 ∈ (ℤ_≥‘𝑁) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < )))
111	3	eluzelz2 42040	. . . 4 ⊢ (𝑁 ∈ 𝑍 → 𝑁 ∈ ℤ)
112	2, 111	syl 17	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ)
113		eqid 2798	. . 3 ⊢ (ℤ_≥‘𝑁) = (ℤ_≥‘𝑁)
114	75	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → ((𝐹‘𝑚)‘𝑋) ∈ V)
115	75	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → ((𝐹‘𝑚)‘𝑋) ∈ V)
116	46, 112, 73, 113, 3, 114, 115	limsupequzmpt 42371	. . . 4 ⊢ (𝜑 → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))))
117	116, 78	eqeltrd 2890	. . 3 ⊢ (𝜑 → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
118	46, 112, 113, 69, 117	supcnvlimsupmpt 42383	. 2 ⊢ (𝜑 → (𝑛 ∈ (ℤ_≥‘𝑁) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < )) ⇝ (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))))
119	110, 118	eqbrtrd 5052	1 ⊢ (𝜑 → (𝑛 ∈ (ℤ_≥‘𝑁) ↦ ((𝐻‘𝑛)‘𝑋)) ⇝ (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 Ⅎwnf 1785 ∈ wcel 2111 ≠ wne 2987 ∀wral 3106 ∃wrex 3107 {crab 3110 Vcvv 3441 ⊆ wss 3881 ∅c0 4243 ∩ ciin 4882 class class class wbr 5030 ↦ cmpt 5110 dom cdm 5519 ran crn 5520 ⟶wf 6320 ‘cfv 6324 supcsup 8888 ℝcr 10525 ℝ^*cxr 10663 < clt 10664 ≤ cle 10665 ℤcz 11969 ℤ_≥cuz 12231 lim supclsp 14819 ⇝ cli 14833 SAlgcsalg 42950 SMblFncsmblfn 43334

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-iin 4884 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-pm 8392 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-inf 8891 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-q 12337 df-rp 12378 df-ioo 12730 df-ico 12732 df-fz 12886 df-fl 13157 df-ceil 13158 df-seq 13365 df-exp 13426 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-limsup 14820 df-clim 14837 df-smblfn 43335

This theorem is referenced by: smflimsuplem6 43456 smflimsuplem8 43458

W3C validator