limsuplt - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > limsuplt		Structured version Visualization version GIF version

Theorem limsuplt 15518

Description: The defining property of the superior limit. (Contributed by Mario Carneiro, 7-Sep-2014.) (Revised by AV, 12-Sep-2020.)

**Hypothesis**
Ref	Expression
limsupval.1	⊢ 𝐺 = (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < ))

**Assertion**
Ref	Expression
limsuplt	⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^*) → ((lim sup‘𝐹) < 𝐴 ↔ ∃𝑗 ∈ ℝ (𝐺‘𝑗) < 𝐴))

Distinct variable groups: 𝑘,𝐹 𝐴,𝑗 𝐵,𝑗 𝑗,𝑘,𝐹 𝑗,𝐺 Allowed substitution hints: 𝐴(𝑘) 𝐵(𝑘) 𝐺(𝑘)

**Proof of Theorem limsuplt**
Step	Hyp	Ref	Expression
1		limsupval.1	. . . . 5 ⊢ 𝐺 = (𝑘 ∈ ℝ ↦ sup(((𝐹 “ (𝑘[,)+∞)) ∩ ℝ^), ℝ^, < ))
2	1	limsuple 15517	. . . 4 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^*) → (𝐴 ≤ (lim sup‘𝐹) ↔ ∀𝑗 ∈ ℝ 𝐴 ≤ (𝐺‘𝑗)))
3	2	notbid 321	. . 3 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^*) → (¬ 𝐴 ≤ (lim sup‘𝐹) ↔ ¬ ∀𝑗 ∈ ℝ 𝐴 ≤ (𝐺‘𝑗)))
4		rexnal 3117	. . 3 ⊢ (∃𝑗 ∈ ℝ ¬ 𝐴 ≤ (𝐺‘𝑗) ↔ ¬ ∀𝑗 ∈ ℝ 𝐴 ≤ (𝐺‘𝑗))
5	3, 4	bitr4di 292	. 2 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^*) → (¬ 𝐴 ≤ (lim sup‘𝐹) ↔ ∃𝑗 ∈ ℝ ¬ 𝐴 ≤ (𝐺‘𝑗)))
6		simp2 1153	. . . . 5 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^) → 𝐹:𝐵⟶ℝ^)
7		reex 11179	. . . . . . 7 ⊢ ℝ ∈ V
8	7	ssex 5281	. . . . . 6 ⊢ (𝐵 ⊆ ℝ → 𝐵 ∈ V)
9	8	3ad2ant1 1149	. . . . 5 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^*) → 𝐵 ∈ V)
10		xrex 12999	. . . . . 6 ⊢ ℝ^* ∈ V
11	10	a1i 11	. . . . 5 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^) → ℝ^ ∈ V)
12		fex2 7921	. . . . 5 ⊢ ((𝐹:𝐵⟶ℝ^* ∧ 𝐵 ∈ V ∧ ℝ^* ∈ V) → 𝐹 ∈ V)
13	6, 9, 11, 12	syl3anc 1394	. . . 4 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^*) → 𝐹 ∈ V)
14		limsupcl 15512	. . . 4 ⊢ (𝐹 ∈ V → (lim sup‘𝐹) ∈ ℝ^*)
15	13, 14	syl 18	. . 3 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^) → (lim sup‘𝐹) ∈ ℝ^)
16		simp3 1154	. . 3 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^) → 𝐴 ∈ ℝ^)
17		xrltnle 11264	. . 3 ⊢ (((lim sup‘𝐹) ∈ ℝ^* ∧ 𝐴 ∈ ℝ^*) → ((lim sup‘𝐹) < 𝐴 ↔ ¬ 𝐴 ≤ (lim sup‘𝐹)))
18	15, 16, 17	syl2anc 595	. 2 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^*) → ((lim sup‘𝐹) < 𝐴 ↔ ¬ 𝐴 ≤ (lim sup‘𝐹)))
19	1	limsupgf 15514	. . . . 5 ⊢ 𝐺:ℝ⟶ℝ^*
20	19	ffvelcdmi 7068	. . . 4 ⊢ (𝑗 ∈ ℝ → (𝐺‘𝑗) ∈ ℝ^*)
21		xrltnle 11264	. . . 4 ⊢ (((𝐺‘𝑗) ∈ ℝ^* ∧ 𝐴 ∈ ℝ^*) → ((𝐺‘𝑗) < 𝐴 ↔ ¬ 𝐴 ≤ (𝐺‘𝑗)))
22	20, 16, 21	syl2anr 608	. . 3 ⊢ (((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^*) ∧ 𝑗 ∈ ℝ) → ((𝐺‘𝑗) < 𝐴 ↔ ¬ 𝐴 ≤ (𝐺‘𝑗)))
23	22	rexbidva 3187	. 2 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^*) → (∃𝑗 ∈ ℝ (𝐺‘𝑗) < 𝐴 ↔ ∃𝑗 ∈ ℝ ¬ 𝐴 ≤ (𝐺‘𝑗)))
24	5, 18, 23	3bitr4d 314	1 ⊢ ((𝐵 ⊆ ℝ ∧ 𝐹:𝐵⟶ℝ^* ∧ 𝐴 ∈ ℝ^*) → ((lim sup‘𝐹) < 𝐴 ↔ ∃𝑗 ∈ ℝ (𝐺‘𝑗) < 𝐴))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ∀wral 3079 ∃wrex 3089 Vcvv 3457 ∩ cin 3906 ⊆ wss 3907 class class class wbr 5104 ↦ cmpt 5185 “ cima 5654 ⟶wf 6521 ‘cfv 6525 (class class class)co 7400 supcsup 9388 ℝcr 11087 +∞cpnf 11228 ℝ^*cxr 11230 < clt 11231 ≤ cle 11232 [,)cico 13362 lim supclsp 15509

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5105 df-opab 5167 df-mpt 5186 df-id 5546 df-po 5559 df-so 5560 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-sup 9390 df-inf 9391 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-limsup 15510

This theorem is referenced by: limsupgre 15520 limsuplt2 46326

W3C validator