| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 01sqrexlem3 | Structured version Visualization version GIF version | ||
| Description: Lemma for 01sqrex 15409. (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 13121 | . . . . 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 15403 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐴 ∈ 𝑆) |
| 9 | 8 | ne0d 4288 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝑆 ≠ ∅) |
| 10 | 1re 11301 | . . 3 ⊢ 1 ∈ ℝ | |
| 11 | 1, 7 | 01sqrexlem1 15402 | . . 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 2956 ∀wral 3077 ∃wrex 3087 {crab 3413 ⊆ wss 3899 ∅c0 4279 class class class wbr 5103 (class class class)co 7418 supcsup 9425 ℝcr 11192 1c1 11194 < clt 11336 ≤ cle 11337 2c2 12390 ℝ+crp 13113 ↑cexp 14197 |
| 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 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-div 11967 df-nn 12329 df-2 12398 df-n0 12600 df-z 12687 df-uz 12959 df-rp 13114 df-seq 14138 df-exp 14198 |
| This theorem is used by: 01sqrexlem4 15405 01sqrexlem5 15406 01sqrexlem6 15407 01sqrexlem7 15408 |
| Copyright terms: Public domain | W3C validator |