supxrss - Metamath Proof Explorer

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

Theorem supxrss 13259

Description: Smaller sets of extended reals have smaller suprema. (Contributed by Mario Carneiro, 1-Apr-2015.)

**Assertion**
Ref	Expression
supxrss	⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ^) → sup(𝐴, ℝ^, < ) ≤ sup(𝐵, ℝ^*, < ))

Proof of Theorem supxrss Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplr 769	. . . 4 ⊢ (((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ^) ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ ℝ^)
2		simpl 482	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ^*) → 𝐴 ⊆ 𝐵)
3	2	sselda 3935	. . . 4 ⊢ (((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ^*) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐵)
4		supxrub 13251	. . . 4 ⊢ ((𝐵 ⊆ ℝ^* ∧ 𝑥 ∈ 𝐵) → 𝑥 ≤ sup(𝐵, ℝ^*, < ))
5	1, 3, 4	syl2anc 585	. . 3 ⊢ (((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ^) ∧ 𝑥 ∈ 𝐴) → 𝑥 ≤ sup(𝐵, ℝ^, < ))
6	5	ralrimiva 3130	. 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ^) → ∀𝑥 ∈ 𝐴 𝑥 ≤ sup(𝐵, ℝ^, < ))
7		sstr 3944	. . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ^) → 𝐴 ⊆ ℝ^)
8		supxrcl 13242	. . . 4 ⊢ (𝐵 ⊆ ℝ^* → sup(𝐵, ℝ^, < ) ∈ ℝ^)
9	8	adantl 481	. . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ^) → sup(𝐵, ℝ^, < ) ∈ ℝ^*)
10		supxrleub 13253	. . 3 ⊢ ((𝐴 ⊆ ℝ^* ∧ sup(𝐵, ℝ^, < ) ∈ ℝ^) → (sup(𝐴, ℝ^, < ) ≤ sup(𝐵, ℝ^, < ) ↔ ∀𝑥 ∈ 𝐴 𝑥 ≤ sup(𝐵, ℝ^*, < )))
11	7, 9, 10	syl2anc 585	. 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ^) → (sup(𝐴, ℝ^, < ) ≤ sup(𝐵, ℝ^, < ) ↔ ∀𝑥 ∈ 𝐴 𝑥 ≤ sup(𝐵, ℝ^, < )))
12	6, 11	mpbird 257	1 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ ℝ^) → sup(𝐴, ℝ^, < ) ≤ sup(𝐵, ℝ^*, < ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2114 ∀wral 3052 ⊆ wss 3903 class class class wbr 5100 supcsup 9355 ℝ^*cxr 11177 < clt 11178 ≤ cle 11179

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 ax-pre-sup 11116

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: deg1mul3le 26090 ioossioobi 45866 limsupres 46052 supcnvlimsup 46087 liminfval2 46115 sge0less 46739 sge0reuz 46794 smflimsuplem4 47170

W3C validator