Theorem smflimsuplem1 41026

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 6191	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑗 → (𝐹‘𝑚) = (𝐹‘𝑗))
3	2	fveq1d 6193	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑗 → ((𝐹‘𝑚)‘𝑥) = ((𝐹‘𝑗)‘𝑥))
4	3	cbvmptv 4750	. . . . . . . . . 10 ⊢ (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥))
5	4	rneqi 5352	. . . . . . . . 9 ⊢ ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥))
6	5	supeq1i 8353	. . . . . . . 8 ⊢ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) = sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )
7	6	mpteq2i 4741	. . . . . . 7 ⊢ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ))
8	7	a1i 11	. . . . . 6 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
9		fveq2 6191	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (𝐸‘𝑛) = (𝐸‘𝐾))
10		fveq2 6191	. . . . . . . . . 10 ⊢ (𝑛 = 𝐾 → (ℤ≥‘𝑛) = (ℤ≥‘𝐾))
11	10	mpteq1d 4738	. . . . . . . . 9 ⊢ (𝑛 = 𝐾 → (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)))
12	11	rneqd 5353	. . . . . . . 8 ⊢ (𝑛 = 𝐾 → ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)) = ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)))
13	12	supeq1d 8352	. . . . . . 7 ⊢ (𝑛 = 𝐾 → sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) = sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ))
14	9, 13	mpteq12dv 4733	. . . . . 6 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
15	8, 14	eqtrd 2656	. . . . 5 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
16		smflimsuplem1.k	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ 𝑍)
17		fvex 6201	. . . . . . 7 ⊢ (𝐸‘𝐾) ∈ V
18	17	mptex 6486	. . . . . 6 ⊢ (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) ∈ V
19	18	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) ∈ V)
20	1, 15, 16, 19	fvmptd3 39447	. . . 4 ⊢ (𝜑 → (𝐻‘𝐾) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
21	20	dmeqd 5326	. . 3 ⊢ (𝜑 → dom (𝐻‘𝐾) = dom (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
22		xrltso 11974	. . . . . 6 ⊢ < Or ℝ*
23	22	supex 8369	. . . . 5 ⊢ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ V
24		eqid 2622	. . . . 5 ⊢ (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ))
25	23, 24	dmmpti 6023	. . . 4 ⊢ dom (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝐸‘𝐾)
26	25	a1i 11	. . 3 ⊢ (𝜑 → dom (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝐸‘𝐾))
27		smflimsuplem1.e	. . . 4 ⊢ 𝐸 = (𝑛 ∈ 𝑍 ↦ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ})
28	2	dmeqd 5326	. . . . . . . . . 10 ⊢ (𝑚 = 𝑗 → dom (𝐹‘𝑚) = dom (𝐹‘𝑗))
29	28	cbviinv 4560	. . . . . . . . 9 ⊢ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) = ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗)
30	29	eleq2i 2693	. . . . . . . 8 ⊢ (𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ↔ 𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗))
31	6	eleq1i 2692	. . . . . . . 8 ⊢ (sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ ↔ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ)
32	30, 31	anbi12i 733	. . . . . . 7 ⊢ ((𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∧ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ) ↔ (𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∧ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ))
33	32	rabbia2 3187	. . . . . 6 ⊢ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ}
34	33	a1i 11	. . . . 5 ⊢ (𝑛 = 𝐾 → {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
35	10	iineq1d 39267	. . . . . . . 8 ⊢ (𝑛 = 𝐾 → ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) = ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗))
36	35	eleq2d 2687	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ↔ 𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗)))
37	13	eleq1d 2686	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ ↔ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ))
38	36, 37	anbi12d 747	. . . . . 6 ⊢ (𝑛 = 𝐾 → ((𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∧ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ) ↔ (𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∧ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ)))
39	38	rabbidva2 3186	. . . . 5 ⊢ (𝑛 = 𝐾 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
40	34, 39	eqtrd 2656	. . . 4 ⊢ (𝑛 = 𝐾 → {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
41		eqid 2622	. . . . 5 ⊢ {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ}
42		smflimsuplem1.z	. . . . . . . 8 ⊢ 𝑍 = (ℤ≥‘𝑀)
43	42, 16	eluzelz2d 39640	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ ℤ)
44		uzid 11702	. . . . . . 7 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ (ℤ≥‘𝐾))
45		ne0i 3921	. . . . . . 7 ⊢ (𝐾 ∈ (ℤ≥‘𝐾) → (ℤ≥‘𝐾) ≠ ∅)
46	43, 44, 45	3syl 18	. . . . . 6 ⊢ (𝜑 → (ℤ≥‘𝐾) ≠ ∅)
47		fvex 6201	. . . . . . . . 9 ⊢ (𝐹‘𝑗) ∈ V
48	47	dmex 7099	. . . . . . . 8 ⊢ dom (𝐹‘𝑗) ∈ V
49	48	rgenw 2924	. . . . . . 7 ⊢ ∀𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∈ V
50	49	a1i 11	. . . . . 6 ⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∈ V)
51	46, 50	iinexd 39318	. . . . 5 ⊢ (𝜑 → ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∈ V)
52	41, 51	rabexd 4814	. . . 4 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ∈ V)
53	27, 40, 16, 52	fvmptd3 39447	. . 3 ⊢ (𝜑 → (𝐸‘𝐾) = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
54	21, 26, 53	3eqtrd 2660	. 2 ⊢ (𝜑 → dom (𝐻‘𝐾) = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
55		ssrab2 3687	. . . 4 ⊢ {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ⊆ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗)
56	55	a1i 11	. . 3 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ⊆ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗))
57	43, 44	syl 17	. . . 4 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘𝐾))
58		fveq2 6191	. . . . 5 ⊢ (𝑗 = 𝐾 → (𝐹‘𝑗) = (𝐹‘𝐾))
59	58	dmeqd 5326	. . . 4 ⊢ (𝑗 = 𝐾 → dom (𝐹‘𝑗) = dom (𝐹‘𝐾))
60		ssid 3624	. . . . 5 ⊢ dom (𝐹‘𝐾) ⊆ dom (𝐹‘𝐾)
61	60	a1i 11	. . . 4 ⊢ (𝜑 → dom (𝐹‘𝐾) ⊆ dom (𝐹‘𝐾))
62	57, 59, 61	iinssd 39314	. . 3 ⊢ (𝜑 → ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ⊆ dom (𝐹‘𝐾))
63	56, 62	sstrd 3613	. 2 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ⊆ dom (𝐹‘𝐾))
64	54, 63	eqsstrd 3639	1 ⊢ (𝜑 → dom (𝐻‘𝐾) ⊆ dom (𝐹‘𝐾))

Syntax hints:   → wi 4   = wceq 1483   ∈ wcel 1990   ≠ wne 2794  ∀wral 2912  {crab 2916  Vcvv 3200   ⊆ wss 3574  ∅c0 3915  ∩ ciin 4521   ↦ cmpt 4729  dom cdm 5114  ran crn 5115  ‘cfv 5888  supcsup 8346  ℝcr 9935  ℝ^*cxr 10073   < clt 10074  ℤcz 11377  ℤ_≥cuz 11687

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-pre-lttri 10010  ax-pre-lttrn 10011

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-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  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-id 5024  df-po 5035  df-so 5036  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-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-sup 8348  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-neg 10269  df-z 11378  df-uz 11688

This theorem is referenced by:  smflimsuplem4  41029