| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 01sqrexlem3 | Structured version Visualization version GIF version | ||
| Description: Lemma for 01sqrex 15302. (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 4035 | . . . . 5 ⊢ {𝑥 ∈ ℝ+ ∣ (𝑥↑2) ≤ 𝐴} ⊆ ℝ+ | |
| 3 | rpssre 13025 | . . . . 5 ⊢ ℝ+ ⊆ ℝ | |
| 4 | 2, 3 | sstri 3947 | . . . 4 ⊢ {𝑥 ∈ ℝ+ ∣ (𝑥↑2) ≤ 𝐴} ⊆ ℝ |
| 5 | 1, 4 | eqsstri 3984 | . . 3 ⊢ 𝑆 ⊆ ℝ |
| 6 | 5 | a1i 11 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝑆 ⊆ ℝ) |
| 7 | 01sqrexlem1.2 | . . . 4 ⊢ 𝐵 = sup(𝑆, ℝ, < ) | |
| 8 | 1, 7 | 01sqrexlem2 15296 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐴 ∈ 𝑆) |
| 9 | 8 | ne0d 4296 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝑆 ≠ ∅) |
| 10 | 1re 11209 | . . 3 ⊢ 1 ∈ ℝ | |
| 11 | 1, 7 | 01sqrexlem1 15295 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → ∀𝑦 ∈ 𝑆 𝑦 ≤ 1) |
| 12 | brralrspcev 5172 | . . 3 ⊢ ((1 ∈ ℝ ∧ ∀𝑦 ∈ 𝑆 𝑦 ≤ 1) → ∃𝑧 ∈ ℝ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧) | |
| 13 | 10, 11, 12 | sylancr 598 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → ∃𝑧 ∈ ℝ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧) |
| 14 | 6, 9, 13 | 3jca 1146 | 1 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → (𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑧 ∈ ℝ ∀𝑦 ∈ 𝑆 𝑦 ≤ 𝑧)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∀wral 3079 ∃wrex 3089 {crab 3416 ⊆ wss 3906 ∅c0 4287 class class class wbr 5110 (class class class)co 7412 supcsup 9401 ℝcr 11100 1c1 11102 < clt 11244 ≤ cle 11245 2c2 12296 ℝ+crp 13017 ↑cexp 14099 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-2 12304 df-n0 12506 df-z 12593 df-uz 12864 df-rp 13018 df-seq 14040 df-exp 14100 |
| This theorem is referenced by: 01sqrexlem4 15298 01sqrexlem5 15299 01sqrexlem6 15300 01sqrexlem7 15301 |
| Copyright terms: Public domain | W3C validator |