01sqrexlem2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > 01sqrexlem2		Structured version Visualization version GIF version

Theorem 01sqrexlem2 15168

Description: Lemma for 01sqrex 15174. (Contributed by Mario Carneiro, 10-Jul-2013.)

**Hypotheses**
Ref	Expression
01sqrexlem1.1	⊢ 𝑆 = {𝑥 ∈ ℝ⁺ ∣ (𝑥↑2) ≤ 𝐴}
01sqrexlem1.2	⊢ 𝐵 = sup(𝑆, ℝ, < )

**Assertion**
Ref	Expression
01sqrexlem2	⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐴 ≤ 1) → 𝐴 ∈ 𝑆)

Distinct variable group: 𝑥,𝐴 Allowed substitution hints: 𝐵(𝑥) 𝑆(𝑥)

**Proof of Theorem 01sqrexlem2**
Step	Hyp	Ref	Expression
1		simpl 482	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐴 ≤ 1) → 𝐴 ∈ ℝ⁺)
2		rpre 12920	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → 𝐴 ∈ ℝ)
3		rpgt0 12924	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → 0 < 𝐴)
4		1re 11134	. . . . . 6 ⊢ 1 ∈ ℝ
5		lemul1 11994	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 1 ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 0 < 𝐴)) → (𝐴 ≤ 1 ↔ (𝐴 · 𝐴) ≤ (1 · 𝐴)))
6	4, 5	mp3an2 1451	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 0 < 𝐴)) → (𝐴 ≤ 1 ↔ (𝐴 · 𝐴) ≤ (1 · 𝐴)))
7	2, 2, 3, 6	syl12anc 836	. . . 4 ⊢ (𝐴 ∈ ℝ⁺ → (𝐴 ≤ 1 ↔ (𝐴 · 𝐴) ≤ (1 · 𝐴)))
8	7	biimpa 476	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐴 ≤ 1) → (𝐴 · 𝐴) ≤ (1 · 𝐴))
9		rpcn 12922	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → 𝐴 ∈ ℂ)
10	9	adantr 480	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐴 ≤ 1) → 𝐴 ∈ ℂ)
11		sqval 14039	. . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑2) = (𝐴 · 𝐴))
12	11	eqcomd 2735	. . . 4 ⊢ (𝐴 ∈ ℂ → (𝐴 · 𝐴) = (𝐴↑2))
13	10, 12	syl 17	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐴 ≤ 1) → (𝐴 · 𝐴) = (𝐴↑2))
14	9	mullidd 11152	. . . 4 ⊢ (𝐴 ∈ ℝ⁺ → (1 · 𝐴) = 𝐴)
15	14	adantr 480	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐴 ≤ 1) → (1 · 𝐴) = 𝐴)
16	8, 13, 15	3brtr3d 5126	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐴 ≤ 1) → (𝐴↑2) ≤ 𝐴)
17		oveq1 7360	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥↑2) = (𝐴↑2))
18	17	breq1d 5105	. . 3 ⊢ (𝑥 = 𝐴 → ((𝑥↑2) ≤ 𝐴 ↔ (𝐴↑2) ≤ 𝐴))
19		01sqrexlem1.1	. . 3 ⊢ 𝑆 = {𝑥 ∈ ℝ⁺ ∣ (𝑥↑2) ≤ 𝐴}
20	18, 19	elrab2 3653	. 2 ⊢ (𝐴 ∈ 𝑆 ↔ (𝐴 ∈ ℝ⁺ ∧ (𝐴↑2) ≤ 𝐴))
21	1, 16, 20	sylanbrc 583	1 ⊢ ((𝐴 ∈ ℝ⁺ ∧ 𝐴 ≤ 1) → 𝐴 ∈ 𝑆)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 {crab 3396 class class class wbr 5095 (class class class)co 7353 supcsup 9349 ℂcc 11026 ℝcr 11027 0cc0 11028 1c1 11029 · cmul 11033 < clt 11168 ≤ cle 11169 2c2 12201 ℝ⁺crp 12911 ↑cexp 13986

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7675 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7310 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8632 df-en 8880 df-dom 8881 df-sdom 8882 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11367 df-neg 11368 df-nn 12147 df-2 12209 df-n0 12403 df-z 12490 df-uz 12754 df-rp 12912 df-seq 13927 df-exp 13987

This theorem is referenced by: 01sqrexlem3 15169 01sqrexlem4 15170

W3C validator