Theorem smflimsuplem1 43114

Description: If 𝐻 converges, the lim sup of 𝐹 is real. (Contributed by Glauco Siliprandi, 23-Oct-2021.)

Hypotheses

Ref	Expression
smflimsuplem1.z	⊢ 𝑍 = (ℤ≥‘𝑀)
smflimsuplem1.e	⊢ 𝐸 = (𝑛 ∈ 𝑍 ↦ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ})
smflimsuplem1.h	⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )))
smflimsuplem1.k	⊢ (𝜑 → 𝐾 ∈ 𝑍)

Assertion

Ref	Expression
smflimsuplem1	⊢ (𝜑 → dom (𝐻‘𝐾) ⊆ dom (𝐹‘𝐾))

Distinct variable groups:   𝑛,𝐸,𝑥   𝑚,𝐹,𝑛,𝑥   𝑛,𝐾,𝑥   𝑛,𝑍

Allowed substitution hints:   𝜑(𝑥,𝑚,𝑛)   𝐸(𝑚)   𝐻(𝑥,𝑚,𝑛)   𝐾(𝑚)   𝑀(𝑥,𝑚,𝑛)   𝑍(𝑥,𝑚)

Proof of Theorem smflimsuplem1

Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		smflimsuplem1.h	. . . . 5 ⊢ 𝐻 = (𝑛 ∈ 𝑍 ↦ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )))
2		fveq2 6670	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑗 → (𝐹‘𝑚) = (𝐹‘𝑗))
3	2	fveq1d 6672	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑗 → ((𝐹‘𝑚)‘𝑥) = ((𝐹‘𝑗)‘𝑥))
4	3	cbvmptv 5169	. . . . . . . . . 10 ⊢ (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥))
5	4	rneqi 5807	. . . . . . . . 9 ⊢ ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥))
6	5	supeq1i 8911	. . . . . . . 8 ⊢ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) = sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )
7	6	mpteq2i 5158	. . . . . . 7 ⊢ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ))
8	7	a1i 11	. . . . . 6 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
9		fveq2 6670	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (𝐸‘𝑛) = (𝐸‘𝐾))
10		fveq2 6670	. . . . . . . . . 10 ⊢ (𝑛 = 𝐾 → (ℤ≥‘𝑛) = (ℤ≥‘𝐾))
11	10	mpteq1d 5155	. . . . . . . . 9 ⊢ (𝑛 = 𝐾 → (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)))
12	11	rneqd 5808	. . . . . . . 8 ⊢ (𝑛 = 𝐾 → ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)) = ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)))
13	12	supeq1d 8910	. . . . . . 7 ⊢ (𝑛 = 𝐾 → sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) = sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ))
14	9, 13	mpteq12dv 5151	. . . . . 6 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
15	8, 14	eqtrd 2856	. . . . 5 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
16		smflimsuplem1.k	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ 𝑍)
17		fvex 6683	. . . . . . 7 ⊢ (𝐸‘𝐾) ∈ V
18	17	mptex 6986	. . . . . 6 ⊢ (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) ∈ V
19	18	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) ∈ V)
20	1, 15, 16, 19	fvmptd3 6791	. . . 4 ⊢ (𝜑 → (𝐻‘𝐾) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
21	20	dmeqd 5774	. . 3 ⊢ (𝜑 → dom (𝐻‘𝐾) = dom (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
22		xrltso 12535	. . . . . 6 ⊢ < Or ℝ*
23	22	supex 8927	. . . . 5 ⊢ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ V
24		eqid 2821	. . . . 5 ⊢ (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ))
25	23, 24	dmmpti 6492	. . . 4 ⊢ dom (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝐸‘𝐾)
26	25	a1i 11	. . 3 ⊢ (𝜑 → dom (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝐸‘𝐾))
27		smflimsuplem1.e	. . . 4 ⊢ 𝐸 = (𝑛 ∈ 𝑍 ↦ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ})
28	2	dmeqd 5774	. . . . . . . . . 10 ⊢ (𝑚 = 𝑗 → dom (𝐹‘𝑚) = dom (𝐹‘𝑗))
29	28	cbviinv 4966	. . . . . . . . 9 ⊢ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) = ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗)
30	29	eleq2i 2904	. . . . . . . 8 ⊢ (𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ↔ 𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗))
31	6	eleq1i 2903	. . . . . . . 8 ⊢ (sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ ↔ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ)
32	30, 31	anbi12i 628	. . . . . . 7 ⊢ ((𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∧ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ) ↔ (𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∧ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ))
33	32	rabbia2 3477	. . . . . 6 ⊢ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ}
34	33	a1i 11	. . . . 5 ⊢ (𝑛 = 𝐾 → {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
35	10	iineq1d 41376	. . . . . . . 8 ⊢ (𝑛 = 𝐾 → ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) = ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗))
36	35	eleq2d 2898	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ↔ 𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗)))
37	13	eleq1d 2897	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ ↔ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ))
38	36, 37	anbi12d 632	. . . . . 6 ⊢ (𝑛 = 𝐾 → ((𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∧ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ) ↔ (𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∧ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ)))
39	38	rabbidva2 3476	. . . . 5 ⊢ (𝑛 = 𝐾 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
40	34, 39	eqtrd 2856	. . . 4 ⊢ (𝑛 = 𝐾 → {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
41		eqid 2821	. . . . 5 ⊢ {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ}
42		smflimsuplem1.z	. . . . . . . 8 ⊢ 𝑍 = (ℤ≥‘𝑀)
43	42, 16	eluzelz2d 41707	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ ℤ)
44		uzid 12259	. . . . . . 7 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ (ℤ≥‘𝐾))
45		ne0i 4300	. . . . . . 7 ⊢ (𝐾 ∈ (ℤ≥‘𝐾) → (ℤ≥‘𝐾) ≠ ∅)
46	43, 44, 45	3syl 18	. . . . . 6 ⊢ (𝜑 → (ℤ≥‘𝐾) ≠ ∅)
47		fvex 6683	. . . . . . . . 9 ⊢ (𝐹‘𝑗) ∈ V
48	47	dmex 7616	. . . . . . . 8 ⊢ dom (𝐹‘𝑗) ∈ V
49	48	rgenw 3150	. . . . . . 7 ⊢ ∀𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∈ V
50	49	a1i 11	. . . . . 6 ⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∈ V)
51	46, 50	iinexd 41420	. . . . 5 ⊢ (𝜑 → ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∈ V)
52	41, 51	rabexd 5236	. . . 4 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ∈ V)
53	27, 40, 16, 52	fvmptd3 6791	. . 3 ⊢ (𝜑 → (𝐸‘𝐾) = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
54	21, 26, 53	3eqtrd 2860	. 2 ⊢ (𝜑 → dom (𝐻‘𝐾) = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
55		ssrab2 4056	. . . 4 ⊢ {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ⊆ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗)
56	55	a1i 11	. . 3 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ⊆ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗))
57	43, 44	syl 17	. . . 4 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘𝐾))
58		fveq2 6670	. . . . 5 ⊢ (𝑗 = 𝐾 → (𝐹‘𝑗) = (𝐹‘𝐾))
59	58	dmeqd 5774	. . . 4 ⊢ (𝑗 = 𝐾 → dom (𝐹‘𝑗) = dom (𝐹‘𝐾))
60		ssid 3989	. . . . 5 ⊢ dom (𝐹‘𝐾) ⊆ dom (𝐹‘𝐾)
61	60	a1i 11	. . . 4 ⊢ (𝜑 → dom (𝐹‘𝐾) ⊆ dom (𝐹‘𝐾))
62	57, 59, 61	iinssd 41417	. . 3 ⊢ (𝜑 → ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ⊆ dom (𝐹‘𝐾))
63	56, 62	sstrd 3977	. 2 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ⊆ dom (𝐹‘𝐾))
64	54, 63	eqsstrd 4005	1 ⊢ (𝜑 → dom (𝐻‘𝐾) ⊆ dom (𝐹‘𝐾))

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2114   ≠ wne 3016  ∀wral 3138  {crab 3142  Vcvv 3494   ⊆ wss 3936  ∅c0 4291  ∩ ciin 4920   ↦ cmpt 5146  dom cdm 5555  ran crn 5556  ‘cfv 6355  supcsup 8904  ℝcr 10536  ℝ^*cxr 10674   < clt 10675  ℤcz 11982  ℤ_≥cuz 12244

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 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-cnex 10593  ax-resscn 10594  ax-pre-lttri 10611  ax-pre-lttrn 10612

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 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-iin 4922  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-po 5474  df-so 5475  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-ov 7159  df-er 8289  df-en 8510  df-dom 8511  df-sdom 8512  df-sup 8906  df-pnf 10677  df-mnf 10678  df-xr 10679  df-ltxr 10680  df-le 10681  df-neg 10873  df-z 11983  df-uz 12245

This theorem is referenced by:  smflimsuplem4  43117