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 43105

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 2906	. . . . . . . . . . 11 ⊢ (𝑁 ∈ 𝑍 ↔ 𝑁 ∈ (ℤ_≥‘𝑀))
5	4	biimpi 218	. . . . . . . . . 10 ⊢ (𝑁 ∈ 𝑍 → 𝑁 ∈ (ℤ_≥‘𝑀))
6		uzss 12268	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (ℤ_≥‘𝑁) ⊆ (ℤ_≥‘𝑀))
7	5, 6	syl 17	. . . . . . . . 9 ⊢ (𝑁 ∈ 𝑍 → (ℤ_≥‘𝑁) ⊆ (ℤ_≥‘𝑀))
8	7, 3	sseqtrrdi 4020	. . . . . . . 8 ⊢ (𝑁 ∈ 𝑍 → (ℤ_≥‘𝑁) ⊆ 𝑍)
9	2, 8	syl 17	. . . . . . 7 ⊢ (𝜑 → (ℤ_≥‘𝑁) ⊆ 𝑍)
10	9	sselda 3969	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑛 ∈ 𝑍)
11		smflimsuplem5.e	. . . . . . . . . 10 ⊢ 𝐸 = (𝑛 ∈ 𝑍 ↦ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
12		nfcv 2979	. . . . . . . . . . 11 ⊢ Ⅎ𝑥𝑍
13		nfrab1 3386	. . . . . . . . . . 11 ⊢ Ⅎ𝑥{𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ}
14	12, 13	nfmpt 5165	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑛 ∈ 𝑍 ↦ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
15	11, 14	nfcxfr 2977	. . . . . . . . 9 ⊢ Ⅎ𝑥𝐸
16		nfcv 2979	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑛
17	15, 16	nffv 6682	. . . . . . . 8 ⊢ Ⅎ𝑥(𝐸‘𝑛)
18		fvex 6685	. . . . . . . 8 ⊢ (𝐸‘𝑛) ∈ V
19	17, 18	mptexf 41514	. . . . . . 7 ⊢ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )) ∈ V
20	19	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )) ∈ V)
21		smflimsuplem5.h	. . . . . . 7 ⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )))
22	21	fvmpt2 6781	. . . . . 6 ⊢ ((𝑛 ∈ 𝑍 ∧ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < )) ∈ V) → (𝐻‘𝑛) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < )))
23	10, 20, 22	syl2anc 586	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (𝐻‘𝑛) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )))
24	23	fveq1d 6674	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ((𝐻‘𝑛)‘𝑋) = ((𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ))‘𝑋))
25		nfcv 2979	. . . . . 6 ⊢ Ⅎ𝑦(𝐸‘𝑛)
26		nfcv 2979	. . . . . 6 ⊢ Ⅎ𝑦sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )
27		nfcv 2979	. . . . . 6 ⊢ Ⅎ𝑥sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^*, < )
28		fveq2 6672	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑚)‘𝑥) = ((𝐹‘𝑚)‘𝑦))
29	28	mpteq2dv 5164	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)))
30	29	rneqd 5810	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)))
31	30	supeq1d 8912	. . . . . 6 ⊢ (𝑥 = 𝑦 → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ))
32	17, 25, 26, 27, 31	cbvmptf 5167	. . . . 5 ⊢ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < )) = (𝑦 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ))
33		simpl 485	. . . . . . . . 9 ⊢ ((𝑦 = 𝑋 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑦 = 𝑋)
34	33	fveq2d 6676	. . . . . . . 8 ⊢ ((𝑦 = 𝑋 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑚)‘𝑦) = ((𝐹‘𝑚)‘𝑋))
35	34	mpteq2dva 5163	. . . . . . 7 ⊢ (𝑦 = 𝑋 → (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)) = (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)))
36	35	rneqd 5810	. . . . . 6 ⊢ (𝑦 = 𝑋 → ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)) = ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)))
37	36	supeq1d 8912	. . . . 5 ⊢ (𝑦 = 𝑋 → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^, < ))
38	37	eleq1d 2899	. . . . . . . 8 ⊢ (𝑦 = 𝑋 → (sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) ∈ ℝ ↔ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^, < ) ∈ ℝ))
39		uzss 12268	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → (ℤ_≥‘𝑛) ⊆ (ℤ_≥‘𝑁))
40		iinss1 4936	. . . . . . . . . . 11 ⊢ ((ℤ_≥‘𝑛) ⊆ (ℤ_≥‘𝑁) → ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ⊆ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚))
41	39, 40	syl 17	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ⊆ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚))
42	41	adantl 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ⊆ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚))
43		smflimsuplem5.x	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚))
44	43	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚))
45	42, 44	sseldd 3970	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚))
46		smflimsuplem5.b	. . . . . . . . . . 11 ⊢ Ⅎ𝑚𝜑
47		nfv 1915	. . . . . . . . . . 11 ⊢ Ⅎ𝑚 𝑛 ∈ (ℤ_≥‘𝑁)
48	46, 47	nfan 1900	. . . . . . . . . 10 ⊢ Ⅎ𝑚(𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁))
49		eqid 2823	. . . . . . . . . 10 ⊢ (ℤ_≥‘𝑛) = (ℤ_≥‘𝑛)
50		simpll 765	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝜑)
51	39	sselda 3969	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ (ℤ_≥‘𝑁) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑚 ∈ (ℤ_≥‘𝑁))
52	51	adantll 712	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑚 ∈ (ℤ_≥‘𝑁))
53		smflimsuplem5.s	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑆 ∈ SAlg)
54	53	adantr 483	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑆 ∈ SAlg)
55		simpl 485	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝜑)
56	9	sselda 3969	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑚 ∈ 𝑍)
57		smflimsuplem5.f	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
58	57	ffvelrnda 6853	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (𝐹‘𝑚) ∈ (SMblFn‘𝑆))
59	55, 56, 58	syl2anc 586	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → (𝐹‘𝑚) ∈ (SMblFn‘𝑆))
60		eqid 2823	. . . . . . . . . . . . 13 ⊢ dom (𝐹‘𝑚) = dom (𝐹‘𝑚)
61	54, 59, 60	smff 43016	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → (𝐹‘𝑚):dom (𝐹‘𝑚)⟶ℝ)
62		eliin 4926	. . . . . . . . . . . . . . . 16 ⊢ (𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) → (𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ↔ ∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚)))
63	43, 62	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ↔ ∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚)))
64	43, 63	mpbid 234	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚))
65	64	adantr 483	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → ∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚))
66		simpr 487	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑚 ∈ (ℤ_≥‘𝑁))
67		rspa 3208	. . . . . . . . . . . . 13 ⊢ ((∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚) ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ dom (𝐹‘𝑚))
68	65, 66, 67	syl2anc 586	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ dom (𝐹‘𝑚))
69	61, 68	ffvelrnd 6854	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → ((𝐹‘𝑚)‘𝑋) ∈ ℝ)
70	50, 52, 69	syl2anc 586	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑚)‘𝑋) ∈ ℝ)
71		eluzelz 12256	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → 𝑛 ∈ ℤ)
72	71	adantl 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑛 ∈ ℤ)
73		smflimsuplem5.m	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 ∈ ℤ)
74	73	adantr 483	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑀 ∈ ℤ)
75		fvex 6685	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑚)‘𝑋) ∈ V
76	75	a1i 11	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) ∧ 𝑚 ∈ 𝑍) → ((𝐹‘𝑚)‘𝑋) ∈ V)
77	48, 72, 74, 49, 3, 70, 76	limsupequzmpt 42017	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))))
78		smflimsuplem5.r	. . . . . . . . . . . . 13 ⊢ (𝜑 → (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
79	78	adantr 483	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
80	77, 79	eqeltrd 2915	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
81	80	renepnfd 10694	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋))) ≠ +∞)
82	48, 49, 70, 81	limsupubuzmpt 42007	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ∃𝑦 ∈ ℝ ∀𝑚 ∈ (ℤ_≥‘𝑛)((𝐹‘𝑚)‘𝑋) ≤ 𝑦)
83		uzid2 41685	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → 𝑛 ∈ (ℤ_≥‘𝑛))
84	83	ne0d 4303	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → (ℤ_≥‘𝑛) ≠ ∅)
85	84	adantl 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (ℤ_≥‘𝑛) ≠ ∅)
86	48, 85, 70	supxrre3rnmpt 41710	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < ) ∈ ℝ ↔ ∃𝑦 ∈ ℝ ∀𝑚 ∈ (ℤ_≥‘𝑛)((𝐹‘𝑚)‘𝑋) ≤ 𝑦))
87	82, 86	mpbird 259	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < ) ∈ ℝ)
88	38, 45, 87	elrabd 3684	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ {𝑦 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^*, < ) ∈ ℝ})
89		simpl 485	. . . . . . . . . . . . 13 ⊢ ((𝑦 = 𝑥 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑦 = 𝑥)
90	89	fveq2d 6676	. . . . . . . . . . . 12 ⊢ ((𝑦 = 𝑥 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑚)‘𝑦) = ((𝐹‘𝑚)‘𝑥))
91	90	mpteq2dva 5163	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑥 → (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)) = (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)))
92	91	rneqd 5810	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)) = ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)))
93	92	supeq1d 8912	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ))
94	93	eleq1d 2899	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) ∈ ℝ ↔ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ))
95	94	cbvrabv 3493	. . . . . . 7 ⊢ {𝑦 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ}
96	88, 95	eleqtrdi 2925	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
97		eqid 2823	. . . . . . . 8 ⊢ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ}
98		fvex 6685	. . . . . . . . . . . . 13 ⊢ (𝐹‘𝑚) ∈ V
99	98	dmex 7618	. . . . . . . . . . . 12 ⊢ dom (𝐹‘𝑚) ∈ V
100	99	rgenw 3152	. . . . . . . . . . 11 ⊢ ∀𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∈ V
101	100	a1i 11	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → ∀𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
102	84, 101	iinexd 41407	. . . . . . . . 9 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
103	102	adantl 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
104	97, 103	rabexd 5238	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ} ∈ V)
105	11	fvmpt2 6781	. . . . . . 7 ⊢ ((𝑛 ∈ 𝑍 ∧ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ} ∈ V) → (𝐸‘𝑛) = {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ})
106	10, 104, 105	syl2anc 586	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (𝐸‘𝑛) = {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
107	96, 106	eleqtrrd 2918	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ (𝐸‘𝑛))
108	32, 37, 107, 87	fvmptd3 6793	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ((𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ))‘𝑋) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^, < ))
109	24, 108	eqtrd 2858	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ((𝐻‘𝑛)‘𝑋) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < ))
110	1, 109	mpteq2da 5162	. 2 ⊢ (𝜑 → (𝑛 ∈ (ℤ_≥‘𝑁) ↦ ((𝐻‘𝑛)‘𝑋)) = (𝑛 ∈ (ℤ_≥‘𝑁) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < )))
111	3	eluzelz2 41683	. . . 4 ⊢ (𝑁 ∈ 𝑍 → 𝑁 ∈ ℤ)
112	2, 111	syl 17	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ)
113		eqid 2823	. . 3 ⊢ (ℤ_≥‘𝑁) = (ℤ_≥‘𝑁)
114	75	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → ((𝐹‘𝑚)‘𝑋) ∈ V)
115	75	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → ((𝐹‘𝑚)‘𝑋) ∈ V)
116	46, 112, 73, 113, 3, 114, 115	limsupequzmpt 42017	. . . 4 ⊢ (𝜑 → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))))
117	116, 78	eqeltrd 2915	. . 3 ⊢ (𝜑 → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
118	46, 112, 113, 69, 117	supcnvlimsupmpt 42029	. 2 ⊢ (𝜑 → (𝑛 ∈ (ℤ_≥‘𝑁) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < )) ⇝ (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))))
119	110, 118	eqbrtrd 5090	1 ⊢ (𝜑 → (𝑛 ∈ (ℤ_≥‘𝑁) ↦ ((𝐻‘𝑛)‘𝑋)) ⇝ (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 Ⅎwnf 1784 ∈ wcel 2114 ≠ wne 3018 ∀wral 3140 ∃wrex 3141 {crab 3144 Vcvv 3496 ⊆ wss 3938 ∅c0 4293 ∩ ciin 4922 class class class wbr 5068 ↦ cmpt 5148 dom cdm 5557 ran crn 5558 ⟶wf 6353 ‘cfv 6357 supcsup 8906 ℝcr 10538 ℝ^*cxr 10676 < clt 10677 ≤ cle 10678 ℤcz 11984 ℤ_≥cuz 12246 lim supclsp 14829 ⇝ cli 14843 SAlgcsalg 42600 SMblFncsmblfn 42984

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-iin 4924 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-pm 8411 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-sup 8908 df-inf 8909 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-3 11704 df-n0 11901 df-z 11985 df-uz 12247 df-q 12352 df-rp 12393 df-ioo 12745 df-ico 12747 df-fz 12896 df-fl 13165 df-ceil 13166 df-seq 13373 df-exp 13433 df-cj 14460 df-re 14461 df-im 14462 df-sqrt 14596 df-abs 14597 df-limsup 14830 df-clim 14847 df-smblfn 42985

This theorem is referenced by: smflimsuplem6 43106 smflimsuplem8 43108

W3C validator