Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sqrlem2 | Structured version Visualization version GIF version |
Description: Lemma for 01sqrex 13838. (Contributed by Mario Carneiro, 10-Jul-2013.) |
Ref | Expression |
---|---|
sqrlem1.1 | ⊢ 𝑆 = {𝑥 ∈ ℝ+ ∣ (𝑥↑2) ≤ 𝐴} |
sqrlem1.2 | ⊢ 𝐵 = sup(𝑆, ℝ, < ) |
Ref | Expression |
---|---|
sqrlem2 | ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐴 ∈ 𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 472 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐴 ∈ ℝ+) | |
2 | rpre 11715 | . . . . 5 ⊢ (𝐴 ∈ ℝ+ → 𝐴 ∈ ℝ) | |
3 | rpgt0 11720 | . . . . 5 ⊢ (𝐴 ∈ ℝ+ → 0 < 𝐴) | |
4 | 1re 9918 | . . . . . 6 ⊢ 1 ∈ ℝ | |
5 | lemul1 10754 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 1 ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 0 < 𝐴)) → (𝐴 ≤ 1 ↔ (𝐴 · 𝐴) ≤ (1 · 𝐴))) | |
6 | 4, 5 | mp3an2 1404 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 0 < 𝐴)) → (𝐴 ≤ 1 ↔ (𝐴 · 𝐴) ≤ (1 · 𝐴))) |
7 | 2, 2, 3, 6 | syl12anc 1316 | . . . 4 ⊢ (𝐴 ∈ ℝ+ → (𝐴 ≤ 1 ↔ (𝐴 · 𝐴) ≤ (1 · 𝐴))) |
8 | 7 | biimpa 500 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → (𝐴 · 𝐴) ≤ (1 · 𝐴)) |
9 | rpcn 11717 | . . . . 5 ⊢ (𝐴 ∈ ℝ+ → 𝐴 ∈ ℂ) | |
10 | 9 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐴 ∈ ℂ) |
11 | sqval 12784 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑2) = (𝐴 · 𝐴)) | |
12 | 11 | eqcomd 2616 | . . . 4 ⊢ (𝐴 ∈ ℂ → (𝐴 · 𝐴) = (𝐴↑2)) |
13 | 10, 12 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → (𝐴 · 𝐴) = (𝐴↑2)) |
14 | 9 | mulid2d 9937 | . . . 4 ⊢ (𝐴 ∈ ℝ+ → (1 · 𝐴) = 𝐴) |
15 | 14 | adantr 480 | . . 3 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → (1 · 𝐴) = 𝐴) |
16 | 8, 13, 15 | 3brtr3d 4614 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → (𝐴↑2) ≤ 𝐴) |
17 | oveq1 6556 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥↑2) = (𝐴↑2)) | |
18 | 17 | breq1d 4593 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥↑2) ≤ 𝐴 ↔ (𝐴↑2) ≤ 𝐴)) |
19 | sqrlem1.1 | . . 3 ⊢ 𝑆 = {𝑥 ∈ ℝ+ ∣ (𝑥↑2) ≤ 𝐴} | |
20 | 18, 19 | elrab2 3333 | . 2 ⊢ (𝐴 ∈ 𝑆 ↔ (𝐴 ∈ ℝ+ ∧ (𝐴↑2) ≤ 𝐴)) |
21 | 1, 16, 20 | sylanbrc 695 | 1 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐴 ≤ 1) → 𝐴 ∈ 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 {crab 2900 class class class wbr 4583 (class class class)co 6549 supcsup 8229 ℂcc 9813 ℝcr 9814 0cc0 9815 1c1 9816 · cmul 9820 < clt 9953 ≤ cle 9954 2c2 10947 ℝ+crp 11708 ↑cexp 12722 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-seq 12664 df-exp 12723 |
This theorem is referenced by: sqrlem3 13833 sqrlem4 13834 |
Copyright terms: Public domain | W3C validator |