Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sqrlem4 | Structured version Visualization version GIF version |
Description: Lemma for 01sqrex 14597. (Contributed by Mario Carneiro, 10-Jul-2013.) |
Ref | Expression |
---|---|
sqrlem1.1 | ⊢ 𝑆 = {𝑥 ∈ ℝ+ ∣ (𝑥↑2) ≤ 𝐴} |
sqrlem1.2 | ⊢ 𝐵 = sup(𝑆, ℝ, < ) |
Ref | Expression |
---|---|
sqrlem4 | ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → (𝐵 ∈ ℝ+ ∧ 𝐵 ≤ 1)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sqrlem1.2 | . . . 4 ⊢ 𝐵 = sup(𝑆, ℝ, < ) | |
2 | sqrlem1.1 | . . . . . 6 ⊢ 𝑆 = {𝑥 ∈ ℝ+ ∣ (𝑥↑2) ≤ 𝐴} | |
3 | 2, 1 | sqrlem3 14592 | . . . . 5 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → (𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝑦)) |
4 | suprcl 11589 | . . . . 5 ⊢ ((𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝑦) → sup(𝑆, ℝ, < ) ∈ ℝ) | |
5 | 3, 4 | syl 17 | . . . 4 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → sup(𝑆, ℝ, < ) ∈ ℝ) |
6 | 1, 5 | eqeltrid 2914 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐵 ∈ ℝ) |
7 | rpgt0 12389 | . . . . 5 ⊢ (𝐴 ∈ ℝ+ → 0 < 𝐴) | |
8 | 7 | adantr 481 | . . . 4 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 0 < 𝐴) |
9 | 2, 1 | sqrlem2 14591 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐴 ∈ 𝑆) |
10 | suprub 11590 | . . . . . 6 ⊢ (((𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝑦) ∧ 𝐴 ∈ 𝑆) → 𝐴 ≤ sup(𝑆, ℝ, < )) | |
11 | 3, 9, 10 | syl2anc 584 | . . . . 5 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐴 ≤ sup(𝑆, ℝ, < )) |
12 | 11, 1 | breqtrrdi 5099 | . . . 4 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐴 ≤ 𝐵) |
13 | 0re 10631 | . . . . 5 ⊢ 0 ∈ ℝ | |
14 | rpre 12385 | . . . . 5 ⊢ (𝐴 ∈ ℝ+ → 𝐴 ∈ ℝ) | |
15 | ltletr 10720 | . . . . 5 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((0 < 𝐴 ∧ 𝐴 ≤ 𝐵) → 0 < 𝐵)) | |
16 | 13, 14, 6, 15 | mp3an2ani 1459 | . . . 4 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → ((0 < 𝐴 ∧ 𝐴 ≤ 𝐵) → 0 < 𝐵)) |
17 | 8, 12, 16 | mp2and 695 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 0 < 𝐵) |
18 | 6, 17 | elrpd 12416 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐵 ∈ ℝ+) |
19 | 2, 1 | sqrlem1 14590 | . . . 4 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → ∀𝑧 ∈ 𝑆 𝑧 ≤ 1) |
20 | 1re 10629 | . . . . 5 ⊢ 1 ∈ ℝ | |
21 | suprleub 11595 | . . . . 5 ⊢ (((𝑆 ⊆ ℝ ∧ 𝑆 ≠ ∅ ∧ ∃𝑦 ∈ ℝ ∀𝑧 ∈ 𝑆 𝑧 ≤ 𝑦) ∧ 1 ∈ ℝ) → (sup(𝑆, ℝ, < ) ≤ 1 ↔ ∀𝑧 ∈ 𝑆 𝑧 ≤ 1)) | |
22 | 3, 20, 21 | sylancl 586 | . . . 4 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → (sup(𝑆, ℝ, < ) ≤ 1 ↔ ∀𝑧 ∈ 𝑆 𝑧 ≤ 1)) |
23 | 19, 22 | mpbird 258 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → sup(𝑆, ℝ, < ) ≤ 1) |
24 | 1, 23 | eqbrtrid 5092 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐵 ≤ 1) |
25 | 18, 24 | jca 512 | 1 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → (𝐵 ∈ ℝ+ ∧ 𝐵 ≤ 1)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 ≠ wne 3013 ∀wral 3135 ∃wrex 3136 {crab 3139 ⊆ wss 3933 ∅c0 4288 class class class wbr 5057 (class class class)co 7145 supcsup 8892 ℝcr 10524 0cc0 10525 1c1 10526 < clt 10663 ≤ cle 10664 2c2 11680 ℝ+crp 12377 ↑cexp 13417 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 ax-pre-sup 10603 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-sup 8894 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-2 11688 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-seq 13358 df-exp 13418 |
This theorem is referenced by: sqrlem5 14594 sqrlem7 14596 01sqrex 14597 |
Copyright terms: Public domain | W3C validator |