xlimmnfvlem2 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > xlimmnfvlem2		Structured version Visualization version GIF version

Theorem xlimmnfvlem2 45831

Description: Lemma for xlimmnf 45839: the "if" part of the biconditional. (Contributed by Glauco Siliprandi, 5-Feb-2022.)

**Hypotheses**
Ref	Expression
xlimmnfvlem2.k	⊢ Ⅎ𝑘𝜑
xlimmnfvlem2.j	⊢ Ⅎ𝑗𝜑
xlimmnfvlem2.m	⊢ (𝜑 → 𝑀 ∈ ℤ)
xlimmnfvlem2.z	⊢ 𝑍 = (ℤ_≥‘𝑀)
xlimmnfvlem2.f	⊢ (𝜑 → 𝐹:𝑍⟶ℝ^*)
xlimmnfvlem2.g	⊢ (𝜑 → ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)

**Assertion**
Ref	Expression
xlimmnfvlem2	⊢ (𝜑 → 𝐹~~>*-∞)

Distinct variable groups: 𝑗,𝐹,𝑘,𝑥 𝑗,𝑀 𝑗,𝑍,𝑘 𝜑,𝑥 Allowed substitution hints: 𝜑(𝑗,𝑘) 𝑀(𝑥,𝑘) 𝑍(𝑥)

Proof of Theorem xlimmnfvlem2 Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		letopon 23092	. . . . . . 7 ⊢ (ordTop‘ ≤ ) ∈ (TopOn‘ℝ^*)
2	1	a1i 11	. . . . . 6 ⊢ (𝜑 → (ordTop‘ ≤ ) ∈ (TopOn‘ℝ^*))
3	2	elfvexd 6897	. . . . 5 ⊢ (𝜑 → ℝ^* ∈ V)
4		cnex 11149	. . . . . 6 ⊢ ℂ ∈ V
5	4	a1i 11	. . . . 5 ⊢ (𝜑 → ℂ ∈ V)
6		xlimmnfvlem2.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ^*)
7		xlimmnfvlem2.z	. . . . . . 7 ⊢ 𝑍 = (ℤ_≥‘𝑀)
8	7	uzsscn2 45473	. . . . . 6 ⊢ 𝑍 ⊆ ℂ
9	8	a1i 11	. . . . 5 ⊢ (𝜑 → 𝑍 ⊆ ℂ)
10		elpm2r 8818	. . . . 5 ⊢ (((ℝ^* ∈ V ∧ ℂ ∈ V) ∧ (𝐹:𝑍⟶ℝ^* ∧ 𝑍 ⊆ ℂ)) → 𝐹 ∈ (ℝ^* ↑_pm ℂ))
11	3, 5, 6, 9, 10	syl22anc 838	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (ℝ^* ↑_pm ℂ))
12		mnfxr 11231	. . . . 5 ⊢ -∞ ∈ ℝ^*
13	12	a1i 11	. . . 4 ⊢ (𝜑 → -∞ ∈ ℝ^*)
14		mnfnei 23108	. . . . . . . 8 ⊢ ((𝑢 ∈ (ordTop‘ ≤ ) ∧ -∞ ∈ 𝑢) → ∃𝑥 ∈ ℝ (-∞[,)𝑥) ⊆ 𝑢)
15	14	adantll 714	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑢 ∈ (ordTop‘ ≤ )) ∧ -∞ ∈ 𝑢) → ∃𝑥 ∈ ℝ (-∞[,)𝑥) ⊆ 𝑢)
16		xlimmnfvlem2.j	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗𝜑
17		nfv 1914	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗 𝑥 ∈ ℝ
18	16, 17	nfan 1899	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑥 ∈ ℝ)
19		nfv 1914	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗(-∞[,)𝑥) ⊆ 𝑢
20	18, 19	nfan 1899	. . . . . . . . . . 11 ⊢ Ⅎ𝑗((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢)
21		simprr 772	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)
22		xlimmnfvlem2.k	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘𝜑
23		nfv 1914	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘 𝑥 ∈ ℝ
24	22, 23	nfan 1899	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑥 ∈ ℝ)
25		nfv 1914	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘(-∞[,)𝑥) ⊆ 𝑢
26	24, 25	nfan 1899	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢)
27		nfv 1914	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘 𝑗 ∈ 𝑍
28	26, 27	nfan 1899	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘(((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍)
29	7	uztrn2 12812	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
30	29	3adant1 1130	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
31	6	fdmd 6698	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → dom 𝐹 = 𝑍)
32	31	3ad2ant1 1133	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → dom 𝐹 = 𝑍)
33	30, 32	eleqtrrd 2831	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ dom 𝐹)
34	33	ad5ant134 1369	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝜑 ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → 𝑘 ∈ dom 𝐹)
35	34	adantl4r 755	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → 𝑘 ∈ dom 𝐹)
36		simp-4r 783	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝜑 ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (-∞[,)𝑥) ⊆ 𝑢)
37	36	adantl4r 755	. . . . . . . . . . . . . . . . . 18 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (-∞[,)𝑥) ⊆ 𝑢)
38	12	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → -∞ ∈ ℝ^*)
39		simp-4r 783	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → 𝑥 ∈ ℝ)
40		rexr 11220	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ^*)
41	39, 40	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → 𝑥 ∈ ℝ^*)
42		simp-4l 782	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → 𝜑)
43	29	ad4ant23 753	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → 𝑘 ∈ 𝑍)
44	6	ffvelcdmda 7056	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ^*)
45	42, 43, 44	syl2anc 584	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (𝐹‘𝑘) ∈ ℝ^*)
46	45	mnfled 13096	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → -∞ ≤ (𝐹‘𝑘))
47		simpr 484	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (𝐹‘𝑘) < 𝑥)
48	38, 41, 45, 46, 47	elicod 13356	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (𝐹‘𝑘) ∈ (-∞[,)𝑥))
49	48	adantl3r 750	. . . . . . . . . . . . . . . . . 18 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (𝐹‘𝑘) ∈ (-∞[,)𝑥))
50	37, 49	sseldd 3947	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (𝐹‘𝑘) ∈ 𝑢)
51	35, 50	jca 511	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))
52	51	ex 412	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝐹‘𝑘) < 𝑥 → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
53	28, 52	ralimdaa 3238	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥 → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
54	53	adantrr 717	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥 → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
55	21, 54	mpd 15	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))
56	55	3impb 1114	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))
57		xlimmnfvlem2.g	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)
58	57	r19.21bi 3229	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)
59	58	adantr 480	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)
60	20, 56, 59	reximdd 45142	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))
61		xlimmnfvlem2.m	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑀 ∈ ℤ)
62	7	rexuz3 15315	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
63	61, 62	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
64	63	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
65	60, 64	mpbid 232	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))
66	65	rexlimdva2 3136	. . . . . . . 8 ⊢ (𝜑 → (∃𝑥 ∈ ℝ (-∞[,)𝑥) ⊆ 𝑢 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
67	66	ad2antrr 726	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑢 ∈ (ordTop‘ ≤ )) ∧ -∞ ∈ 𝑢) → (∃𝑥 ∈ ℝ (-∞[,)𝑥) ⊆ 𝑢 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
68	15, 67	mpd 15	. . . . . 6 ⊢ (((𝜑 ∧ 𝑢 ∈ (ordTop‘ ≤ )) ∧ -∞ ∈ 𝑢) → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))
69	68	ex 412	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ (ordTop‘ ≤ )) → (-∞ ∈ 𝑢 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
70	69	ralrimiva 3125	. . . 4 ⊢ (𝜑 → ∀𝑢 ∈ (ordTop‘ ≤ )(-∞ ∈ 𝑢 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
71	11, 13, 70	3jca 1128	. . 3 ⊢ (𝜑 → (𝐹 ∈ (ℝ^* ↑_pm ℂ) ∧ -∞ ∈ ℝ^* ∧ ∀𝑢 ∈ (ordTop‘ ≤ )(-∞ ∈ 𝑢 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))))
72		nfcv 2891	. . . 4 ⊢ Ⅎ𝑘𝐹
73	72, 2	lmbr3 45745	. . 3 ⊢ (𝜑 → (𝐹(⇝_𝑡‘(ordTop‘ ≤ ))-∞ ↔ (𝐹 ∈ (ℝ^* ↑_pm ℂ) ∧ -∞ ∈ ℝ^* ∧ ∀𝑢 ∈ (ordTop‘ ≤ )(-∞ ∈ 𝑢 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))))
74	71, 73	mpbird 257	. 2 ⊢ (𝜑 → 𝐹(⇝_𝑡‘(ordTop‘ ≤ ))-∞)
75		df-xlim 45817	. . . 4 ⊢ ~~>* = (⇝_𝑡‘(ordTop‘ ≤ ))
76	75	breqi 5113	. . 3 ⊢ (𝐹~~>*-∞ ↔ 𝐹(⇝_𝑡‘(ordTop‘ ≤ ))-∞)
77	76	a1i 11	. 2 ⊢ (𝜑 → (𝐹~~>*-∞ ↔ 𝐹(⇝_𝑡‘(ordTop‘ ≤ ))-∞))
78	74, 77	mpbird 257	1 ⊢ (𝜑 → 𝐹~~>*-∞)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 Ⅎwnf 1783 ∈ wcel 2109 ∀wral 3044 ∃wrex 3053 Vcvv 3447 ⊆ wss 3914 class class class wbr 5107 dom cdm 5638 ⟶wf 6507 ‘cfv 6511 (class class class)co 7387 ↑_pm cpm 8800 ℂcc 11066 ℝcr 11067 -∞cmnf 11206 ℝ^*cxr 11207 < clt 11208 ≤ cle 11209 ℤcz 12529 ℤ_≥cuz 12793 [,)cico 13308 ordTopcordt 17462 TopOnctopon 22797 ⇝_𝑡clm 23113 ~~>*clsxlim 45816

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-1o 8434 df-2o 8435 df-er 8671 df-pm 8802 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-fi 9362 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-z 12530 df-uz 12794 df-ioo 13310 df-ioc 13311 df-ico 13312 df-icc 13313 df-topgen 17406 df-ordt 17464 df-ps 18525 df-tsr 18526 df-top 22781 df-topon 22798 df-bases 22833 df-lm 23116 df-xlim 45817

This theorem is referenced by: xlimmnfv 45832

W3C validator