| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 01sqrexlem3 | Structured version Visualization version GIF version | ||
| Description: Lemma for 01sqrex 15336. (Contributed by Mario Carneiro, 10-Jul-2013.) |
| Ref | Expression |
|---|---|
| 01sqrexlem1.1 | ⊢ 𝑆 = {𝑥 ∈ ℝ+ ∣ (𝑥↑2) ≤ 𝐴} |
| 01sqrexlem1.2 | ⊢ 𝐵 = sup(𝑆, ℝ, < ) |
| Ref | Expression |
|---|---|
| 01sqrexlem3 | ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → (𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑧 ∈ ℝ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 01sqrexlem1.1 | . . . 4 ⊢ 𝑆 = {𝑥 ∈ ℝ+ ∣ (𝑥↑2) ≤ 𝐴} | |
| 2 | ssrab2 4028 | . . . . 5 ⊢ {𝑥 ∈ ℝ+ ∣ (𝑥↑2) ≤ 𝐴} ⊆ ℝ+ | |
| 3 | rpssre 13050 | . . . . 5 ⊢ ℝ+ ⊆ ℝ | |
| 4 | 2, 3 | sstri 3940 | . . . 4 ⊢ {𝑥 ∈ ℝ+ ∣ (𝑥↑2) ≤ 𝐴} ⊆ ℝ |
| 5 | 1, 4 | eqsstri 3977 | . . 3 ⊢ 𝑆 ⊆ ℝ |
| 6 | 5 | a1i 11 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝑆 ⊆ ℝ) |
| 7 | 01sqrexlem1.2 | . . . 4 ⊢ 𝐵 = sup(𝑆, ℝ, < ) | |
| 8 | 1, 7 | 01sqrexlem2 15330 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐴 ∈ 𝑆) |
| 9 | 8 | ne0d 4288 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝑆 ≠ ∅) |
| 10 | 1re 11232 | . . 3 ⊢ 1 ∈ ℝ | |
| 11 | 1, 7 | 01sqrexlem1 15329 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → ∀𝑦 ∈ 𝑆 𝑦 ≤ 1) |
| 12 | brralrspcev 5165 | . . 3 ⊢ ((1 ∈ ℝ ∧ ∀𝑦 ∈ 𝑆 𝑦 ≤ 1) → ∃𝑧 ∈ ℝ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧) | |
| 13 | 10, 11, 12 | sylancr 599 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → ∃𝑧 ∈ ℝ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧) |
| 14 | 6, 9, 13 | 3jca 1146 | 1 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → (𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑧 ∈ ℝ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ∀wral 3076 ∃wrex 3086 {crab 3412 ⊆ wss 3899 ∅c0 4279 class class class wbr 5103 (class class class)co 7413 supcsup 9410 ℝcr 11123 1c1 11125 < clt 11267 ≤ cle 11268 2c2 12319 ℝ+crp 13042 ↑cexp 14125 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-n0 12529 df-z 12616 df-uz 12888 df-rp 13043 df-seq 14066 df-exp 14126 |
| This theorem is used by: 01sqrexlem4 15332 01sqrexlem5 15333 01sqrexlem6 15334 01sqrexlem7 15335 |
| Copyright terms: Public domain | W3C validator |