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 46282

Description: Lemma for xlimmnf 46290: 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 23183	. . . . . . 7 ⊢ (ordTop‘ ≤ ) ∈ (TopOn‘ℝ^*)
2	1	a1i 11	. . . . . 6 ⊢ (𝜑 → (ordTop‘ ≤ ) ∈ (TopOn‘ℝ^*))
3	2	elfvexd 6871	. . . . 5 ⊢ (𝜑 → ℝ^* ∈ V)
4		cnex 11113	. . . . . 6 ⊢ ℂ ∈ V
5	4	a1i 11	. . . . 5 ⊢ (𝜑 → ℂ ∈ V)
6		xlimmnfvlem2.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝑍⟶ℝ^*)
7		xlimmnfvlem2.z	. . . . . . 7 ⊢ 𝑍 = (ℤ_≥‘𝑀)
8	7	uzsscn2 45926	. . . . . 6 ⊢ 𝑍 ⊆ ℂ
9	8	a1i 11	. . . . 5 ⊢ (𝜑 → 𝑍 ⊆ ℂ)
10		elpm2r 8786	. . . . 5 ⊢ (((ℝ^* ∈ V ∧ ℂ ∈ V) ∧ (𝐹:𝑍⟶ℝ^* ∧ 𝑍 ⊆ ℂ)) → 𝐹 ∈ (ℝ^* ↑_pm ℂ))
11	3, 5, 6, 9, 10	syl22anc 839	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (ℝ^* ↑_pm ℂ))
12		mnfxr 11196	. . . . 5 ⊢ -∞ ∈ ℝ^*
13	12	a1i 11	. . . 4 ⊢ (𝜑 → -∞ ∈ ℝ^*)
14		mnfnei 23199	. . . . . . . 8 ⊢ ((𝑢 ∈ (ordTop‘ ≤ ) ∧ -∞ ∈ 𝑢) → ∃𝑥 ∈ ℝ (-∞[,)𝑥) ⊆ 𝑢)
15	14	adantll 715	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑢 ∈ (ordTop‘ ≤ )) ∧ -∞ ∈ 𝑢) → ∃𝑥 ∈ ℝ (-∞[,)𝑥) ⊆ 𝑢)
16		xlimmnfvlem2.j	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗𝜑
17		nfv 1916	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑗 𝑥 ∈ ℝ
18	16, 17	nfan 1901	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗(𝜑 ∧ 𝑥 ∈ ℝ)
19		nfv 1916	. . . . . . . . . . . 12 ⊢ Ⅎ𝑗(-∞[,)𝑥) ⊆ 𝑢
20	18, 19	nfan 1901	. . . . . . . . . . 11 ⊢ Ⅎ𝑗((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢)
21		simprr 773	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)
22		xlimmnfvlem2.k	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘𝜑
23		nfv 1916	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘 𝑥 ∈ ℝ
24	22, 23	nfan 1901	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘(𝜑 ∧ 𝑥 ∈ ℝ)
25		nfv 1916	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘(-∞[,)𝑥) ⊆ 𝑢
26	24, 25	nfan 1901	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢)
27		nfv 1916	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘 𝑗 ∈ 𝑍
28	26, 27	nfan 1901	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘(((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍)
29	7	uztrn2 12801	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
30	29	3adant1 1131	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ 𝑍)
31	6	fdmd 6673	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → dom 𝐹 = 𝑍)
32	31	3ad2ant1 1134	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → dom 𝐹 = 𝑍)
33	30, 32	eleqtrrd 2840	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → 𝑘 ∈ dom 𝐹)
34	33	ad5ant134 1370	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝜑 ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → 𝑘 ∈ dom 𝐹)
35	34	adantl4r 756	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → 𝑘 ∈ dom 𝐹)
36		simp-4r 784	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝜑 ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (-∞[,)𝑥) ⊆ 𝑢)
37	36	adantl4r 756	. . . . . . . . . . . . . . . . . 18 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (-∞[,)𝑥) ⊆ 𝑢)
38	12	a1i 11	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → -∞ ∈ ℝ^*)
39		simp-4r 784	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → 𝑥 ∈ ℝ)
40		rexr 11185	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℝ^*)
41	39, 40	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → 𝑥 ∈ ℝ^*)
42		simp-4l 783	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → 𝜑)
43	29	ad4ant23 754	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → 𝑘 ∈ 𝑍)
44	6	ffvelcdmda 7031	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ^*)
45	42, 43, 44	syl2anc 585	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (𝐹‘𝑘) ∈ ℝ^*)
46	45	mnfled 13081	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → -∞ ≤ (𝐹‘𝑘))
47		simpr 484	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (𝐹‘𝑘) < 𝑥)
48	38, 41, 45, 46, 47	elicod 13342	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (𝐹‘𝑘) ∈ (-∞[,)𝑥))
49	48	adantl3r 751	. . . . . . . . . . . . . . . . . 18 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (𝐹‘𝑘) ∈ (-∞[,)𝑥))
50	37, 49	sseldd 3923	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (𝐹‘𝑘) ∈ 𝑢)
51	35, 50	jca 511	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) ∧ (𝐹‘𝑘) < 𝑥) → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))
52	51	ex 412	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (ℤ_≥‘𝑗)) → ((𝐹‘𝑘) < 𝑥 → (𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
53	28, 52	ralimdaa 3239	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥 → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
54	53	adantrr 718	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)) → (∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥 → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
55	21, 54	mpd 15	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ (𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))
56	55	3impb 1115	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) ∧ 𝑗 ∈ 𝑍 ∧ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥) → ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))
57		xlimmnfvlem2.g	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∀𝑥 ∈ ℝ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)
58	57	r19.21bi 3230	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)
59	58	adantr 480	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝐹‘𝑘) < 𝑥)
60	20, 56, 59	reximdd 45599	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))
61		xlimmnfvlem2.m	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑀 ∈ ℤ)
62	7	rexuz3 15305	. . . . . . . . . . . 12 ⊢ (𝑀 ∈ ℤ → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
63	61, 62	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
64	63	ad2antrr 727	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) → (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
65	60, 64	mpbid 232	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ) ∧ (-∞[,)𝑥) ⊆ 𝑢) → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))
66	65	rexlimdva2 3141	. . . . . . . 8 ⊢ (𝜑 → (∃𝑥 ∈ ℝ (-∞[,)𝑥) ⊆ 𝑢 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
67	66	ad2antrr 727	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑢 ∈ (ordTop‘ ≤ )) ∧ -∞ ∈ 𝑢) → (∃𝑥 ∈ ℝ (-∞[,)𝑥) ⊆ 𝑢 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
68	15, 67	mpd 15	. . . . . 6 ⊢ (((𝜑 ∧ 𝑢 ∈ (ordTop‘ ≤ )) ∧ -∞ ∈ 𝑢) → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))
69	68	ex 412	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ (ordTop‘ ≤ )) → (-∞ ∈ 𝑢 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
70	69	ralrimiva 3130	. . . 4 ⊢ (𝜑 → ∀𝑢 ∈ (ordTop‘ ≤ )(-∞ ∈ 𝑢 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))
71	11, 13, 70	3jca 1129	. . 3 ⊢ (𝜑 → (𝐹 ∈ (ℝ^* ↑_pm ℂ) ∧ -∞ ∈ ℝ^* ∧ ∀𝑢 ∈ (ordTop‘ ≤ )(-∞ ∈ 𝑢 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢))))
72		nfcv 2899	. . . 4 ⊢ Ⅎ𝑘𝐹
73	72, 2	lmbr3 46196	. . 3 ⊢ (𝜑 → (𝐹(⇝_𝑡‘(ordTop‘ ≤ ))-∞ ↔ (𝐹 ∈ (ℝ^* ↑_pm ℂ) ∧ -∞ ∈ ℝ^* ∧ ∀𝑢 ∈ (ordTop‘ ≤ )(-∞ ∈ 𝑢 → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ_≥‘𝑗)(𝑘 ∈ dom 𝐹 ∧ (𝐹‘𝑘) ∈ 𝑢)))))
74	71, 73	mpbird 257	. 2 ⊢ (𝜑 → 𝐹(⇝_𝑡‘(ordTop‘ ≤ ))-∞)
75		df-xlim 46268	. . . 4 ⊢ ~~>* = (⇝_𝑡‘(ordTop‘ ≤ ))
76	75	breqi 5092	. . 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 1087 = wceq 1542 Ⅎwnf 1785 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 Vcvv 3430 ⊆ wss 3890 class class class wbr 5086 dom cdm 5625 ⟶wf 6489 ‘cfv 6493 (class class class)co 7361 ↑_pm cpm 8768 ℂcc 11030 ℝcr 11031 -∞cmnf 11171 ℝ^*cxr 11172 < clt 11173 ≤ cle 11174 ℤcz 12518 ℤ_≥cuz 12782 [,)cico 13294 ordTopcordt 17457 TopOnctopon 22888 ⇝_𝑡clm 23204 ~~>*clsxlim 46267

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-1o 8399 df-2o 8400 df-er 8637 df-pm 8770 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-fi 9318 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-z 12519 df-uz 12783 df-ioo 13296 df-ioc 13297 df-ico 13298 df-icc 13299 df-topgen 17400 df-ordt 17459 df-ps 18526 df-tsr 18527 df-top 22872 df-topon 22889 df-bases 22924 df-lm 23207 df-xlim 46268

This theorem is referenced by: xlimmnfv 46283

W3C validator