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 41030

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 2693	. . . . . . . . . . 11 ⊢ (𝑁 ∈ 𝑍 ↔ 𝑁 ∈ (ℤ_≥‘𝑀))
5	4	biimpi 206	. . . . . . . . . 10 ⊢ (𝑁 ∈ 𝑍 → 𝑁 ∈ (ℤ_≥‘𝑀))
6		uzss 11708	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (ℤ_≥‘𝑁) ⊆ (ℤ_≥‘𝑀))
7	5, 6	syl 17	. . . . . . . . 9 ⊢ (𝑁 ∈ 𝑍 → (ℤ_≥‘𝑁) ⊆ (ℤ_≥‘𝑀))
8	7, 3	syl6sseqr 3652	. . . . . . . 8 ⊢ (𝑁 ∈ 𝑍 → (ℤ_≥‘𝑁) ⊆ 𝑍)
9	2, 8	syl 17	. . . . . . 7 ⊢ (𝜑 → (ℤ_≥‘𝑁) ⊆ 𝑍)
10	9	sselda 3603	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑛 ∈ 𝑍)
11		smflimsuplem5.e	. . . . . . . . . 10 ⊢ 𝐸 = (𝑛 ∈ 𝑍 ↦ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
12		nfcv 2764	. . . . . . . . . . 11 ⊢ Ⅎ𝑥𝑍
13		nfrab1 3122	. . . . . . . . . . 11 ⊢ Ⅎ𝑥{𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ}
14	12, 13	nfmpt 4746	. . . . . . . . . 10 ⊢ Ⅎ𝑥(𝑛 ∈ 𝑍 ↦ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
15	11, 14	nfcxfr 2762	. . . . . . . . 9 ⊢ Ⅎ𝑥𝐸
16		nfcv 2764	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑛
17	15, 16	nffv 6198	. . . . . . . 8 ⊢ Ⅎ𝑥(𝐸‘𝑛)
18		fvex 6201	. . . . . . . 8 ⊢ (𝐸‘𝑛) ∈ V
19	17, 18	mptexf 39444	. . . . . . 7 ⊢ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )) ∈ V
20	19	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )) ∈ V)
21		smflimsuplem5.h	. . . . . . 7 ⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )))
22	21	fvmpt2 6291	. . . . . 6 ⊢ ((𝑛 ∈ 𝑍 ∧ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < )) ∈ V) → (𝐻‘𝑛) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < )))
23	10, 20, 22	syl2anc 693	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (𝐻‘𝑛) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )))
24	23	fveq1d 6193	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ((𝐻‘𝑛)‘𝑋) = ((𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ))‘𝑋))
25		nfcv 2764	. . . . . 6 ⊢ Ⅎ𝑦(𝐸‘𝑛)
26		nfcv 2764	. . . . . 6 ⊢ Ⅎ𝑦sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < )
27		nfcv 2764	. . . . . 6 ⊢ Ⅎ𝑥sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^*, < )
28		fveq2 6191	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ((𝐹‘𝑚)‘𝑥) = ((𝐹‘𝑚)‘𝑦))
29	28	mpteq2dv 4745	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)))
30	29	rneqd 5353	. . . . . . 7 ⊢ (𝑥 = 𝑦 → ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)))
31	30	supeq1d 8352	. . . . . 6 ⊢ (𝑥 = 𝑦 → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ))
32	17, 25, 26, 27, 31	cbvmptf 4748	. . . . 5 ⊢ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < )) = (𝑦 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ))
33		simpl 473	. . . . . . . . 9 ⊢ ((𝑦 = 𝑋 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑦 = 𝑋)
34	33	fveq2d 6195	. . . . . . . 8 ⊢ ((𝑦 = 𝑋 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑚)‘𝑦) = ((𝐹‘𝑚)‘𝑋))
35	34	mpteq2dva 4744	. . . . . . 7 ⊢ (𝑦 = 𝑋 → (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)) = (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)))
36	35	rneqd 5353	. . . . . 6 ⊢ (𝑦 = 𝑋 → ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)) = ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)))
37	36	supeq1d 8352	. . . . 5 ⊢ (𝑦 = 𝑋 → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^, < ))
38	37	eleq1d 2686	. . . . . . . 8 ⊢ (𝑦 = 𝑋 → (sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) ∈ ℝ ↔ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^, < ) ∈ ℝ))
39		uzss 11708	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → (ℤ_≥‘𝑛) ⊆ (ℤ_≥‘𝑁))
40		iinss1 4533	. . . . . . . . . . 11 ⊢ ((ℤ_≥‘𝑛) ⊆ (ℤ_≥‘𝑁) → ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ⊆ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚))
41	39, 40	syl 17	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ⊆ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚))
42	41	adantl 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ⊆ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚))
43		smflimsuplem5.x	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚))
44	43	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚))
45	42, 44	sseldd 3604	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚))
46		smflimsuplem5.b	. . . . . . . . . . 11 ⊢ Ⅎ𝑚𝜑
47		nfv 1843	. . . . . . . . . . 11 ⊢ Ⅎ𝑚 𝑛 ∈ (ℤ_≥‘𝑁)
48	46, 47	nfan 1828	. . . . . . . . . 10 ⊢ Ⅎ𝑚(𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁))
49		eqid 2622	. . . . . . . . . 10 ⊢ (ℤ_≥‘𝑛) = (ℤ_≥‘𝑛)
50		simpll 790	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝜑)
51	39	sselda 3603	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ (ℤ_≥‘𝑁) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑚 ∈ (ℤ_≥‘𝑁))
52	51	adantll 750	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑚 ∈ (ℤ_≥‘𝑁))
53		smflimsuplem5.s	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑆 ∈ SAlg)
54	53	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑆 ∈ SAlg)
55		simpl 473	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝜑)
56	9	sselda 3603	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑚 ∈ 𝑍)
57		smflimsuplem5.f	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹:𝑍⟶(SMblFn‘𝑆))
58	57	ffvelrnda 6359	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (𝐹‘𝑚) ∈ (SMblFn‘𝑆))
59	55, 56, 58	syl2anc 693	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → (𝐹‘𝑚) ∈ (SMblFn‘𝑆))
60		eqid 2622	. . . . . . . . . . . . 13 ⊢ dom (𝐹‘𝑚) = dom (𝐹‘𝑚)
61	54, 59, 60	smff 40941	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → (𝐹‘𝑚):dom (𝐹‘𝑚)⟶ℝ)
62		eliin 4525	. . . . . . . . . . . . . . . 16 ⊢ (𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) → (𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ↔ ∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚)))
63	43, 62	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑋 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑁)dom (𝐹‘𝑚) ↔ ∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚)))
64	43, 63	mpbid 222	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚))
65	64	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → ∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚))
66		simpr 477	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑚 ∈ (ℤ_≥‘𝑁))
67		rspa 2930	. . . . . . . . . . . . 13 ⊢ ((∀𝑚 ∈ (ℤ_≥‘𝑁)𝑋 ∈ dom (𝐹‘𝑚) ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ dom (𝐹‘𝑚))
68	65, 66, 67	syl2anc 693	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ dom (𝐹‘𝑚))
69	61, 68	ffvelrnd 6360	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → ((𝐹‘𝑚)‘𝑋) ∈ ℝ)
70	50, 52, 69	syl2anc 693	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑚)‘𝑋) ∈ ℝ)
71		eluzelz 11697	. . . . . . . . . . . . . 14 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → 𝑛 ∈ ℤ)
72	71	adantl 482	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑛 ∈ ℤ)
73		smflimsuplem5.m	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 ∈ ℤ)
74	73	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑀 ∈ ℤ)
75		fvex 6201	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑚)‘𝑋) ∈ V
76	75	a1i 11	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) ∧ 𝑚 ∈ 𝑍) → ((𝐹‘𝑚)‘𝑋) ∈ V)
77	48, 72, 74, 49, 3, 70, 76	limsupequzmpt 39961	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))))
78		smflimsuplem5.r	. . . . . . . . . . . . 13 ⊢ (𝜑 → (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
79	78	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
80	77, 79	eqeltrd 2701	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
81	80	renepnfd 10090	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋))) ≠ +∞)
82	48, 49, 70, 81	limsupubuzmpt 39951	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ∃𝑦 ∈ ℝ ∀𝑚 ∈ (ℤ_≥‘𝑛)((𝐹‘𝑚)‘𝑋) ≤ 𝑦)
83		uzid2 39630	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → 𝑛 ∈ (ℤ_≥‘𝑛))
84		ne0i 3921	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (ℤ_≥‘𝑛) → (ℤ_≥‘𝑛) ≠ ∅)
85	83, 84	syl 17	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → (ℤ_≥‘𝑛) ≠ ∅)
86	85	adantl 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (ℤ_≥‘𝑛) ≠ ∅)
87	48, 86, 70	supxrre3rnmpt 39656	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < ) ∈ ℝ ↔ ∃𝑦 ∈ ℝ ∀𝑚 ∈ (ℤ_≥‘𝑛)((𝐹‘𝑚)‘𝑋) ≤ 𝑦))
88	82, 87	mpbird 247	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < ) ∈ ℝ)
89	38, 45, 88	elrabd 3365	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ {𝑦 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^*, < ) ∈ ℝ})
90		simpl 473	. . . . . . . . . . . . 13 ⊢ ((𝑦 = 𝑥 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → 𝑦 = 𝑥)
91	90	fveq2d 6195	. . . . . . . . . . . 12 ⊢ ((𝑦 = 𝑥 ∧ 𝑚 ∈ (ℤ_≥‘𝑛)) → ((𝐹‘𝑚)‘𝑦) = ((𝐹‘𝑚)‘𝑥))
92	91	mpteq2dva 4744	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑥 → (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)) = (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)))
93	92	rneqd 5353	. . . . . . . . . 10 ⊢ (𝑦 = 𝑥 → ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)) = ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)))
94	93	supeq1d 8352	. . . . . . . . 9 ⊢ (𝑦 = 𝑥 → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ))
95	94	eleq1d 2686	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) ∈ ℝ ↔ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ))
96	95	cbvrabv 3199	. . . . . . 7 ⊢ {𝑦 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑦)), ℝ^, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ}
97	89, 96	syl6eleq 2711	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
98		eqid 2622	. . . . . . . 8 ⊢ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ}
99		fvex 6201	. . . . . . . . . . . . 13 ⊢ (𝐹‘𝑚) ∈ V
100	99	dmex 7099	. . . . . . . . . . . 12 ⊢ dom (𝐹‘𝑚) ∈ V
101	100	rgenw 2924	. . . . . . . . . . 11 ⊢ ∀𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∈ V
102	101	a1i 11	. . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → ∀𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
103	85, 102	iinexd 39318	. . . . . . . . 9 ⊢ (𝑛 ∈ (ℤ_≥‘𝑁) → ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
104	103	adantl 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∈ V)
105	98, 104	rabexd 4814	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ} ∈ V)
106	11	fvmpt2 6291	. . . . . . 7 ⊢ ((𝑛 ∈ 𝑍 ∧ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ} ∈ V) → (𝐸‘𝑛) = {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ) ∈ ℝ})
107	10, 105, 106	syl2anc 693	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (𝐸‘𝑛) = {𝑥 ∈ ∩ 𝑚 ∈ (ℤ_≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^*, < ) ∈ ℝ})
108	97, 107	eleqtrrd 2704	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑋 ∈ (𝐸‘𝑛))
109	88	elexd 3214	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < ) ∈ V)
110	32, 37, 108, 109	fvmptd3 39447	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ((𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ^, < ))‘𝑋) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^, < ))
111	24, 110	eqtrd 2656	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → ((𝐻‘𝑛)‘𝑋) = sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < ))
112	1, 111	mpteq2da 4743	. 2 ⊢ (𝜑 → (𝑛 ∈ (ℤ_≥‘𝑁) ↦ ((𝐻‘𝑛)‘𝑋)) = (𝑛 ∈ (ℤ_≥‘𝑁) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < )))
113	3	eluzelz2 39627	. . . 4 ⊢ (𝑁 ∈ 𝑍 → 𝑁 ∈ ℤ)
114	2, 113	syl 17	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ)
115		eqid 2622	. . 3 ⊢ (ℤ_≥‘𝑁) = (ℤ_≥‘𝑁)
116	75	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → ((𝐹‘𝑚)‘𝑋) ∈ V)
117	75	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → ((𝐹‘𝑚)‘𝑋) ∈ V)
118	46, 114, 73, 115, 3, 116, 117	limsupequzmpt 39961	. . . 4 ⊢ (𝜑 → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))) = (lim sup‘(𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚)‘𝑋))))
119	118, 78	eqeltrd 2701	. . 3 ⊢ (𝜑 → (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))) ∈ ℝ)
120	46, 114, 115, 69, 119	supcnvlimsupmpt 39973	. 2 ⊢ (𝜑 → (𝑛 ∈ (ℤ_≥‘𝑁) ↦ sup(ran (𝑚 ∈ (ℤ_≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑋)), ℝ^*, < )) ⇝ (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))))
121	112, 120	eqbrtrd 4675	1 ⊢ (𝜑 → (𝑛 ∈ (ℤ_≥‘𝑁) ↦ ((𝐻‘𝑛)‘𝑋)) ⇝ (lim sup‘(𝑚 ∈ (ℤ_≥‘𝑁) ↦ ((𝐹‘𝑚)‘𝑋))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 Ⅎwnf 1708 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 ∃wrex 2913 {crab 2916 Vcvv 3200 ⊆ wss 3574 ∅c0 3915 ∩ ciin 4521 class class class wbr 4653 ↦ cmpt 4729 dom cdm 5114 ran crn 5115 ⟶wf 5884 ‘cfv 5888 supcsup 8346 ℝcr 9935 ℝ^*cxr 10073 < clt 10074 ≤ cle 10075 ℤcz 11377 ℤ_≥cuz 11687 lim supclsp 14201 ⇝ cli 14215 SAlgcsalg 40528 SMblFncsmblfn 40909

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-iin 4523 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-pm 7860 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-sup 8348 df-inf 8349 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-z 11378 df-uz 11688 df-q 11789 df-rp 11833 df-ioo 12179 df-ico 12181 df-fz 12327 df-fl 12593 df-ceil 12594 df-seq 12802 df-exp 12861 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-limsup 14202 df-clim 14219 df-smblfn 40910

This theorem is referenced by: smflimsuplem6 41031 smflimsuplem8 41033

W3C validator