supxrpnf - Metamath Proof Explorer

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

Theorem supxrpnf 13245

Description: The supremum of a set of extended reals containing plus infinity is plus infinity. (Contributed by NM, 15-Oct-2005.)

**Assertion**
Ref	Expression
supxrpnf	⊢ ((𝐴 ⊆ ℝ^* ∧ +∞ ∈ 𝐴) → sup(𝐴, ℝ^*, < ) = +∞)

Proof of Theorem supxrpnf Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssel 3929	. . . . 5 ⊢ (𝐴 ⊆ ℝ^* → (𝑦 ∈ 𝐴 → 𝑦 ∈ ℝ^*))
2		pnfnlt 13054	. . . . 5 ⊢ (𝑦 ∈ ℝ^* → ¬ +∞ < 𝑦)
3	1, 2	syl6 35	. . . 4 ⊢ (𝐴 ⊆ ℝ^* → (𝑦 ∈ 𝐴 → ¬ +∞ < 𝑦))
4	3	ralrimiv 3129	. . 3 ⊢ (𝐴 ⊆ ℝ^* → ∀𝑦 ∈ 𝐴 ¬ +∞ < 𝑦)
5		breq2 5104	. . . . . 6 ⊢ (𝑧 = +∞ → (𝑦 < 𝑧 ↔ 𝑦 < +∞))
6	5	rspcev 3578	. . . . 5 ⊢ ((+∞ ∈ 𝐴 ∧ 𝑦 < +∞) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)
7	6	ex 412	. . . 4 ⊢ (+∞ ∈ 𝐴 → (𝑦 < +∞ → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))
8	7	ralrimivw 3134	. . 3 ⊢ (+∞ ∈ 𝐴 → ∀𝑦 ∈ ℝ (𝑦 < +∞ → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))
9	4, 8	anim12i 614	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ +∞ ∈ 𝐴) → (∀𝑦 ∈ 𝐴 ¬ +∞ < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < +∞ → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
10		pnfxr 11198	. . 3 ⊢ +∞ ∈ ℝ^*
11		supxr 13240	. . 3 ⊢ (((𝐴 ⊆ ℝ^* ∧ +∞ ∈ ℝ^) ∧ (∀𝑦 ∈ 𝐴 ¬ +∞ < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < +∞ → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))) → sup(𝐴, ℝ^, < ) = +∞)
12	10, 11	mpanl2 702	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ (∀𝑦 ∈ 𝐴 ¬ +∞ < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < +∞ → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))) → sup(𝐴, ℝ^*, < ) = +∞)
13	9, 12	syldan 592	1 ⊢ ((𝐴 ⊆ ℝ^* ∧ +∞ ∈ 𝐴) → sup(𝐴, ℝ^*, < ) = +∞)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 ⊆ wss 3903 class class class wbr 5100 supcsup 9355 ℝcr 11037 +∞cpnf 11175 ℝ^*cxr 11177 < clt 11178

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 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115

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-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-po 5540 df-so 5541 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-sup 9357 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379

This theorem is referenced by: xrsup 13800 volsup 25525 supxrge 45691 supminfxr2 45821 sge0tsms 46732 sge0sup 46743

W3C validator