Theorem smflimsuplem1 47656

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 6882	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑗 → (𝐹‘𝑚) = (𝐹‘𝑗))
3	2	fveq1d 6884	. . . . . . . . . . 11 ⊢ (𝑚 = 𝑗 → ((𝐹‘𝑚)‘𝑥) = ((𝐹‘𝑗)‘𝑥))
4	3	cbvmptv 5213	. . . . . . . . . 10 ⊢ (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥))
5	4	rneqi 5925	. . . . . . . . 9 ⊢ ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)) = ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥))
6	5	supeq1i 9421	. . . . . . . 8 ⊢ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) = sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )
7	6	mpteq2i 5205	. . . . . . 7 ⊢ (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ))
8	7	a1i 11	. . . . . 6 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
9		fveq2 6882	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (𝐸‘𝑛) = (𝐸‘𝐾))
10		fveq2 6882	. . . . . . . . . 10 ⊢ (𝑛 = 𝐾 → (ℤ≥‘𝑛) = (ℤ≥‘𝐾))
11	10	mpteq1d 5199	. . . . . . . . 9 ⊢ (𝑛 = 𝐾 → (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)) = (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)))
12	11	rneqd 5926	. . . . . . . 8 ⊢ (𝑛 = 𝐾 → ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)) = ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)))
13	12	supeq1d 9420	. . . . . . 7 ⊢ (𝑛 = 𝐾 → sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) = sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ))
14	9, 13	mpteq12dv 5196	. . . . . 6 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
15	8, 14	eqtrd 2797	. . . . 5 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ (𝐸‘𝑛) ↦ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
16		smflimsuplem1.k	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ 𝑍)
17		fvex 6895	. . . . . . 7 ⊢ (𝐸‘𝐾) ∈ V
18	17	mptex 7226	. . . . . 6 ⊢ (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) ∈ V
19	18	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) ∈ V)
20	1, 15, 16, 19	fvmptd3 7014	. . . 4 ⊢ (𝜑 → (𝐻‘𝐾) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
21	20	dmeqd 5893	. . 3 ⊢ (𝜑 → dom (𝐻‘𝐾) = dom (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )))
22		xrltso 13196	. . . . . 6 ⊢ < Or ℝ*
23	22	supex 9438	. . . . 5 ⊢ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ V
24		eqid 2762	. . . . 5 ⊢ (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ))
25	23, 24	dmmpti 6680	. . . 4 ⊢ dom (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝐸‘𝐾)
26	25	a1i 11	. . 3 ⊢ (𝜑 → dom (𝑥 ∈ (𝐸‘𝐾) ↦ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < )) = (𝐸‘𝐾))
27		smflimsuplem1.e	. . . 4 ⊢ 𝐸 = (𝑛 ∈ 𝑍 ↦ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ})
28	2	dmeqd 5893	. . . . . . . . . 10 ⊢ (𝑚 = 𝑗 → dom (𝐹‘𝑚) = dom (𝐹‘𝑗))
29	28	cbviinv 5002	. . . . . . . . 9 ⊢ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) = ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗)
30	29	eleq2i 2854	. . . . . . . 8 ⊢ (𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ↔ 𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗))
31	6	eleq1i 2853	. . . . . . . 8 ⊢ (sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ ↔ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ)
32	30, 31	anbi12i 640	. . . . . . 7 ⊢ ((𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∧ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ) ↔ (𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∧ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ))
33	32	rabbia2 3417	. . . . . 6 ⊢ {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ}
34	33	a1i 11	. . . . 5 ⊢ (𝑛 = 𝐾 → {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
35	10	iineq1d 45930	. . . . . . . 8 ⊢ (𝑛 = 𝐾 → ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) = ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗))
36	35	eleq2d 2848	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ↔ 𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗)))
37	13	eleq1d 2847	. . . . . . 7 ⊢ (𝑛 = 𝐾 → (sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ ↔ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ))
38	36, 37	anbi12d 644	. . . . . 6 ⊢ (𝑛 = 𝐾 → ((𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∧ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ) ↔ (𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∧ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ)))
39	38	rabbidva2 3416	. . . . 5 ⊢ (𝑛 = 𝐾 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
40	34, 39	eqtrd 2797	. . . 4 ⊢ (𝑛 = 𝐾 → {𝑥 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)dom (𝐹‘𝑚) ∣ sup(ran (𝑚 ∈ (ℤ≥‘𝑛) ↦ ((𝐹‘𝑚)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
41		eqid 2762	. . . . 5 ⊢ {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ}
42		smflimsuplem1.z	. . . . . . . 8 ⊢ 𝑍 = (ℤ≥‘𝑀)
43	42, 16	eluzelz2d 46249	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ ℤ)
44		uzid 12906	. . . . . . 7 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ (ℤ≥‘𝐾))
45		ne0i 4290	. . . . . . 7 ⊢ (𝐾 ∈ (ℤ≥‘𝐾) → (ℤ≥‘𝐾) ≠ ∅)
46	43, 44, 45	3syl 19	. . . . . 6 ⊢ (𝜑 → (ℤ≥‘𝐾) ≠ ∅)
47		fvex 6895	. . . . . . . . 9 ⊢ (𝐹‘𝑗) ∈ V
48	47	dmex 7910	. . . . . . . 8 ⊢ dom (𝐹‘𝑗) ∈ V
49	48	rgenw 3082	. . . . . . 7 ⊢ ∀𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∈ V
50	49	a1i 11	. . . . . 6 ⊢ (𝜑 → ∀𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∈ V)
51	46, 50	iinexd 45973	. . . . 5 ⊢ (𝜑 → ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∈ V)
52	41, 51	rabexd 5308	. . . 4 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ∈ V)
53	27, 40, 16, 52	fvmptd3 7014	. . 3 ⊢ (𝜑 → (𝐸‘𝐾) = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
54	21, 26, 53	3eqtrd 2801	. 2 ⊢ (𝜑 → dom (𝐻‘𝐾) = {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ})
55		ssrab2 4031	. . . 4 ⊢ {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ⊆ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗)
56	55	a1i 11	. . 3 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ⊆ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗))
57	43, 44	syl 18	. . . 4 ⊢ (𝜑 → 𝐾 ∈ (ℤ≥‘𝐾))
58		fveq2 6882	. . . . 5 ⊢ (𝑗 = 𝐾 → (𝐹‘𝑗) = (𝐹‘𝐾))
59	58	dmeqd 5893	. . . 4 ⊢ (𝑗 = 𝐾 → dom (𝐹‘𝑗) = dom (𝐹‘𝐾))
60		ssid 3956	. . . . 5 ⊢ dom (𝐹‘𝐾) ⊆ dom (𝐹‘𝐾)
61	60	a1i 11	. . . 4 ⊢ (𝜑 → dom (𝐹‘𝐾) ⊆ dom (𝐹‘𝐾))
62	57, 59, 61	iinssd 45971	. . 3 ⊢ (𝜑 → ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ⊆ dom (𝐹‘𝐾))
63	56, 62	sstrd 3944	. 2 ⊢ (𝜑 → {𝑥 ∈ ∩ 𝑗 ∈ (ℤ≥‘𝐾)dom (𝐹‘𝑗) ∣ sup(ran (𝑗 ∈ (ℤ≥‘𝐾) ↦ ((𝐹‘𝑗)‘𝑥)), ℝ*, < ) ∈ ℝ} ⊆ dom (𝐹‘𝐾))
64	54, 63	eqsstrd 3968	1 ⊢ (𝜑 → dom (𝐻‘𝐾) ⊆ dom (𝐹‘𝐾))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078  {crab 3414  Vcvv 3453   ⊆ wss 3902  ∅c0 4282  ∩ ciin 4955   ↦ cmpt 5190  dom cdm 5659  ran crn 5660  ‘cfv 6537  supcsup 9414  ℝcr 11127  ℝ^*cxr 11270   < clt 11271  ℤcz 12619  ℤ_≥cuz 12891

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-cnex 11184  ax-resscn 11185  ax-pre-lttri 11202  ax-pre-lttrn 11203

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-po 5567  df-so 5568  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-er 8700  df-en 8957  df-dom 8958  df-sdom 8959  df-sup 9416  df-pnf 11273  df-mnf 11274  df-xr 11275  df-ltxr 11276  df-le 11277  df-neg 11472  df-z 12620  df-uz 12892

This theorem is used by:  smflimsuplem4  47659