![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > ressioosup | Structured version Visualization version GIF version |
Description: If the supremum does not belong to a set of reals, the set is a subset of the unbounded below, right-open interval, with upper bound equal to the supremum. (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
Ref | Expression |
---|---|
ressioosup.a | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
ressioosup.s | ⊢ 𝑆 = sup(𝐴, ℝ*, < ) |
ressioosup.n | ⊢ (𝜑 → ¬ 𝑆 ∈ 𝐴) |
ressioosup.i | ⊢ 𝐼 = (-∞(,)𝑆) |
Ref | Expression |
---|---|
ressioosup | ⊢ (𝜑 → 𝐴 ⊆ 𝐼) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mnfxr 11213 | . . . . . 6 ⊢ -∞ ∈ ℝ* | |
2 | 1 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -∞ ∈ ℝ*) |
3 | ressioosup.s | . . . . . 6 ⊢ 𝑆 = sup(𝐴, ℝ*, < ) | |
4 | ressioosup.a | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
5 | ressxr 11200 | . . . . . . . . . 10 ⊢ ℝ ⊆ ℝ* | |
6 | 5 | a1i 11 | . . . . . . . . 9 ⊢ (𝜑 → ℝ ⊆ ℝ*) |
7 | 4, 6 | sstrd 3955 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ⊆ ℝ*) |
8 | 7 | adantr 482 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐴 ⊆ ℝ*) |
9 | 8 | supxrcld 43324 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → sup(𝐴, ℝ*, < ) ∈ ℝ*) |
10 | 3, 9 | eqeltrid 2842 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑆 ∈ ℝ*) |
11 | 4 | adantr 482 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐴 ⊆ ℝ) |
12 | simpr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
13 | 11, 12 | sseldd 3946 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ) |
14 | 13 | mnfltd 13046 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → -∞ < 𝑥) |
15 | 7 | sselda 3945 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ*) |
16 | supxrub 13244 | . . . . . . . 8 ⊢ ((𝐴 ⊆ ℝ* ∧ 𝑥 ∈ 𝐴) → 𝑥 ≤ sup(𝐴, ℝ*, < )) | |
17 | 8, 12, 16 | syl2anc 585 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≤ sup(𝐴, ℝ*, < )) |
18 | 3 | a1i 11 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑆 = sup(𝐴, ℝ*, < )) |
19 | 18 | eqcomd 2743 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → sup(𝐴, ℝ*, < ) = 𝑆) |
20 | 17, 19 | breqtrd 5132 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≤ 𝑆) |
21 | id 22 | . . . . . . . . . . . 12 ⊢ (𝑥 = 𝑆 → 𝑥 = 𝑆) | |
22 | 21 | eqcomd 2743 | . . . . . . . . . . 11 ⊢ (𝑥 = 𝑆 → 𝑆 = 𝑥) |
23 | 22 | adantl 483 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 = 𝑆) → 𝑆 = 𝑥) |
24 | simpl 484 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 = 𝑆) → 𝑥 ∈ 𝐴) | |
25 | 23, 24 | eqeltrd 2838 | . . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 = 𝑆) → 𝑆 ∈ 𝐴) |
26 | 25 | adantll 713 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑥 = 𝑆) → 𝑆 ∈ 𝐴) |
27 | ressioosup.n | . . . . . . . . 9 ⊢ (𝜑 → ¬ 𝑆 ∈ 𝐴) | |
28 | 27 | ad2antrr 725 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑥 = 𝑆) → ¬ 𝑆 ∈ 𝐴) |
29 | 26, 28 | pm2.65da 816 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ¬ 𝑥 = 𝑆) |
30 | 29 | neqned 2951 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ≠ 𝑆) |
31 | 15, 10, 20, 30 | xrleneltd 43564 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 < 𝑆) |
32 | 2, 10, 13, 14, 31 | eliood 43743 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ (-∞(,)𝑆)) |
33 | ressioosup.i | . . . 4 ⊢ 𝐼 = (-∞(,)𝑆) | |
34 | 32, 33 | eleqtrrdi 2849 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐼) |
35 | 34 | ralrimiva 3144 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝑥 ∈ 𝐼) |
36 | dfss3 3933 | . 2 ⊢ (𝐴 ⊆ 𝐼 ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ 𝐼) | |
37 | 35, 36 | sylibr 233 | 1 ⊢ (𝜑 → 𝐴 ⊆ 𝐼) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3065 ⊆ wss 3911 class class class wbr 5106 (class class class)co 7358 supcsup 9377 ℝcr 11051 -∞cmnf 11188 ℝ*cxr 11189 < clt 11190 ≤ cle 11191 (,)cioo 13265 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2708 ax-sep 5257 ax-nul 5264 ax-pow 5321 ax-pr 5385 ax-un 7673 ax-cnex 11108 ax-resscn 11109 ax-1cn 11110 ax-icn 11111 ax-addcl 11112 ax-addrcl 11113 ax-mulcl 11114 ax-mulrcl 11115 ax-mulcom 11116 ax-addass 11117 ax-mulass 11118 ax-distr 11119 ax-i2m1 11120 ax-1ne0 11121 ax-1rid 11122 ax-rnegex 11123 ax-rrecex 11124 ax-cnre 11125 ax-pre-lttri 11126 ax-pre-lttrn 11127 ax-pre-ltadd 11128 ax-pre-mulgt0 11129 ax-pre-sup 11130 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3066 df-rex 3075 df-rmo 3354 df-reu 3355 df-rab 3409 df-v 3448 df-sbc 3741 df-csb 3857 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4284 df-if 4488 df-pw 4563 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4867 df-iun 4957 df-br 5107 df-opab 5169 df-mpt 5190 df-id 5532 df-po 5546 df-so 5547 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6449 df-fun 6499 df-fn 6500 df-f 6501 df-f1 6502 df-fo 6503 df-f1o 6504 df-fv 6505 df-riota 7314 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7922 df-2nd 7923 df-er 8649 df-en 8885 df-dom 8886 df-sdom 8887 df-sup 9379 df-pnf 11192 df-mnf 11193 df-xr 11194 df-ltxr 11195 df-le 11196 df-sub 11388 df-neg 11389 df-ioo 13269 |
This theorem is referenced by: pimdecfgtioo 44965 pimincfltioo 44966 |
Copyright terms: Public domain | W3C validator |