Theorem smflimsuplem1 48035

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 6908	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑗 → (𝐹‘𝑚) = (𝐹‘𝑗))
3	2	fveq1d 6910	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑗 → ((𝐹‘𝑚)‘𝑥) = ((𝐹‘𝑗)‘𝑥))
4	3	cbvmptv 5212	. . . . . . . . . 10 ⊢ (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥))
5	4	rneqi 5926	. . . . . . . . 9 ⊢ ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥))
6	5	supeq1i 9466	. . . . . . . 8 ⊢ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) = sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )
7	6	mpteq2i 5204	. . . . . . 7 ⊢ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ))
8	7	a1i 11	. . . . . 6 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
9		fveq2 6908	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (𝐸‘𝑛) = (𝐸‘𝐾))
10		fveq2 6908	. . . . . . . . . 10 ⊢ (𝑛 = 𝐾 → (ℤ≥‘𝑛) = (ℤ≥‘𝐾))
11	10	mpteq1d 5198	. . . . . . . . 9 ⊢ (𝑛 = 𝐾 → (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)))
12	11	rneqd 5927	. . . . . . . 8 ⊢ (𝑛 = 𝐾 → ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)) = ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)))
13	12	supeq1d 9465	. . . . . . 7 ⊢ (𝑛 = 𝐾 → sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) = sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ))
14	9, 13	mpteq12dv 5195	. . . . . 6 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
15	8, 14	eqtrd 2798	. . . . 5 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
16		smflimsuplem1.k	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ 𝑍)
17		fvex 6921	. . . . . . 7 ⊢ (𝐸‘𝐾) ∈ V
18	17	mptex 7252	. . . . . 6 ⊢ (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) ∈ V
19	18	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) ∈ V)
20	1, 15, 16, 19	fvmptd3 7040	. . . 4 ⊢ (𝜑 → (𝐻‘𝐾) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
21	20	dmeqd 5894	. . 3 ⊢ (𝜑 → dom (𝐻‘𝐾) = dom (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
22		xrltso 13297	. . . . . 6 ⊢ < Or ℝ*
23	22	supex 9483	. . . . 5 ⊢ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ V
24		eqid 2763	. . . . 5 ⊢ (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ))
25	23, 24	dmmpti 6705	. . . 4 ⊢ dom (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝐸‘𝐾)
26	25	a1i 11	. . 3 ⊢ (𝜑 → dom (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝐸‘𝐾))
27		smflimsuplem1.e	. . . 4 ⊢ 𝐸 = (𝑛 ∈ 𝑍 ↦ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ})
28	2	dmeqd 5894	. . . . . . . . . 10 ⊢ (𝑚 = 𝑗 → dom (𝐹‘𝑚) = dom (𝐹‘𝑗))
29	28	cbviinv 5001	. . . . . . . . 9 ⊢ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) = ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗)
30	29	eleq2i 2856	. . . . . . . 8 ⊢ (𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ↔ 𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗))
31	6	eleq1i 2855	. . . . . . . 8 ⊢ (sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ ↔ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ)
32	30, 31	anbi12i 640	. . . . . . 7 ⊢ ((𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∧ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ) ↔ (𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∧ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ))
33	32	rabbia2 3419	. . . . . 6 ⊢ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ}
34	33	a1i 11	. . . . 5 ⊢ (𝑛 = 𝐾 → {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
35	10	iineq1d 46310	. . . . . . . 8 ⊢ (𝑛 = 𝐾 → ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) = ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗))
36	35	eleq2d 2850	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ↔ 𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗)))
37	13	eleq1d 2849	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ ↔ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ))
38	36, 37	anbi12d 644	. . . . . 6 ⊢ (𝑛 = 𝐾 → ((𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∧ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ) ↔ (𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∧ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ)))
39	38	rabbidva2 3418	. . . . 5 ⊢ (𝑛 = 𝐾 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
40	34, 39	eqtrd 2798	. . . 4 ⊢ (𝑛 = 𝐾 → {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
41		eqid 2763	. . . . 5 ⊢ {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ}
42		smflimsuplem1.z	. . . . . . . 8 ⊢ 𝑍 = (ℤ≥‘𝑀)
43	42, 16	eluzelz2d 46628	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ ℤ)
44		uzid 13007	. . . . . . 7 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ (ℤ≥‘𝐾))
45		ne0i 4290	. . . . . . 7 ⊢ (𝐾 ∈ (ℤ≥‘𝐾) → (ℤ≥‘𝐾) ≠ ∅)
46	43, 44, 45	3syl 19	. . . . . 6 ⊢ (𝜑 → (ℤ≥‘𝐾) ≠ ∅)
47		fvex 6921	. . . . . . . . 9 ⊢ (𝐹‘𝑗) ∈ V
48	47	dmex 7945	. . . . . . . 8 ⊢ dom (𝐹‘𝑗) ∈ V
49	48	rgenw 3084	. . . . . . 7 ⊢ ∀𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∈ V
50	49	a1i 11	. . . . . 6 ⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∈ V)
51	46, 50	iinexd 46353	. . . . 5 ⊢ (𝜑 → ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∈ V)
52	41, 51	rabexd 5305	. . . 4 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ∈ V)
53	27, 40, 16, 52	fvmptd3 7040	. . 3 ⊢ (𝜑 → (𝐸‘𝐾) = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
54	21, 26, 53	3eqtrd 2802	. 2 ⊢ (𝜑 → dom (𝐻‘𝐾) = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
55		ssrab2 4008	. . . 4 ⊢ {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ⊆ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗)
56	55	a1i 11	. . 3 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ⊆ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗))
57	43, 44	syl 18	. . . 4 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘𝐾))
58		fveq2 6908	. . . . 5 ⊢ (𝑗 = 𝐾 → (𝐹‘𝑗) = (𝐹‘𝐾))
59	58	dmeqd 5894	. . . 4 ⊢ (𝑗 = 𝐾 → dom (𝐹‘𝑗) = dom (𝐹‘𝐾))
60		ssid 3935	. . . . 5 ⊢ dom (𝐹‘𝐾) ⊆ dom (𝐹‘𝐾)
61	60	a1i 11	. . . 4 ⊢ (𝜑 → dom (𝐹‘𝐾) ⊆ dom (𝐹‘𝐾))
62	57, 59, 61	iinssd 46351	. . 3 ⊢ (𝜑 → ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ⊆ dom (𝐹‘𝐾))
63	56, 62	sstrd 3923	. 2 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ⊆ dom (𝐹‘𝐾))
64	54, 63	eqsstrd 3947	1 ⊢ (𝜑 → dom (𝐻‘𝐾) ⊆ dom (𝐹‘𝐾))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  {crab 3416  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  ∩ ciin 4955   ↦ cmpt 5189  dom cdm 5655  ran crn 5656  ‘cfv 6558  supcsup 9459  ℝcr 11226  ℝ^*cxr 11369   < clt 11370  ℤcz 12720  ℤ_≥cuz 12992

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284  ax-pre-lttri 11301  ax-pre-lttrn 11302

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-po 5563  df-so 5564  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-er 8745  df-en 9002  df-dom 9003  df-sdom 9004  df-sup 9461  df-pnf 11372  df-mnf 11373  df-xr 11374  df-ltxr 11375  df-le 11376  df-neg 11571  df-z 12721  df-uz 12993

This theorem is used by:  smflimsuplem4  48038