supxrgtmnf - Metamath Proof Explorer

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

Theorem supxrgtmnf 13354

Description: The supremum of a nonempty set of reals is greater than minus infinity. (Contributed by NM, 2-Feb-2006.)

**Assertion**
Ref	Expression
supxrgtmnf	⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) → -∞ < sup(𝐴, ℝ^*, < ))

**Proof of Theorem supxrgtmnf**
Step	Hyp	Ref	Expression
1		supxrbnd 13353	. . . . . 6 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅ ∧ sup(𝐴, ℝ^, < ) < +∞) → sup(𝐴, ℝ^, < ) ∈ ℝ)
2	1	3expia 1137	. . . . 5 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) → (sup(𝐴, ℝ^, < ) < +∞ → sup(𝐴, ℝ^, < ) ∈ ℝ))
3	2	con3d 153	. . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) → (¬ sup(𝐴, ℝ^, < ) ∈ ℝ → ¬ sup(𝐴, ℝ^, < ) < +∞))
4		ressxr 11252	. . . . . . . 8 ⊢ ℝ ⊆ ℝ^*
5		sstr 3953	. . . . . . . 8 ⊢ ((𝐴 ⊆ ℝ ∧ ℝ ⊆ ℝ^) → 𝐴 ⊆ ℝ^)
6	4, 5	mpan2 703	. . . . . . 7 ⊢ (𝐴 ⊆ ℝ → 𝐴 ⊆ ℝ^*)
7		supxrcl 13340	. . . . . . 7 ⊢ (𝐴 ⊆ ℝ^* → sup(𝐴, ℝ^, < ) ∈ ℝ^)
8	6, 7	syl 18	. . . . . 6 ⊢ (𝐴 ⊆ ℝ → sup(𝐴, ℝ^, < ) ∈ ℝ^)
9	8	adantr 485	. . . . 5 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) → sup(𝐴, ℝ^, < ) ∈ ℝ^)
10		nltpnft 13189	. . . . 5 ⊢ (sup(𝐴, ℝ^, < ) ∈ ℝ^ → (sup(𝐴, ℝ^, < ) = +∞ ↔ ¬ sup(𝐴, ℝ^, < ) < +∞))
11	9, 10	syl 18	. . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) → (sup(𝐴, ℝ^, < ) = +∞ ↔ ¬ sup(𝐴, ℝ^, < ) < +∞))
12	3, 11	sylibrd 262	. . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) → (¬ sup(𝐴, ℝ^, < ) ∈ ℝ → sup(𝐴, ℝ^, < ) = +∞))
13	12	orrd 876	. 2 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) → (sup(𝐴, ℝ^, < ) ∈ ℝ ∨ sup(𝐴, ℝ^, < ) = +∞))
14		mnfltxr 13151	. 2 ⊢ ((sup(𝐴, ℝ^, < ) ∈ ℝ ∨ sup(𝐴, ℝ^, < ) = +∞) → -∞ < sup(𝐴, ℝ^*, < ))
15	13, 14	syl 18	1 ⊢ ((𝐴 ⊆ ℝ ∧ 𝐴 ≠ ∅) → -∞ < sup(𝐴, ℝ^*, < ))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ⊆ wss 3913 ∅c0 4294 class class class wbr 5113 supcsup 9399 ℝcr 11098 +∞cpnf 11239 -∞cmnf 11240 ℝ^*cxr 11241 < clt 11242

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-po 5570 df-so 5571 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 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-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-sup 9401 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443

This theorem is referenced by: supxrre1 13355 ovolunlem1a 25623 suplesup 45946

W3C validator