3cubeslem1 - Mathbox for Igor Ieskov

	Mathbox for Igor Ieskov		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > 3cubeslem1		Structured version Visualization version GIF version

Theorem 3cubeslem1 43140

Description: Lemma for 3cubes 43146. (Contributed by Igor Ieskov, 22-Jan-2024.)

**Hypothesis**
Ref	Expression
3cubeslem1.a	⊢ (𝜑 → 𝐴 ∈ ℚ)

**Assertion**
Ref	Expression
3cubeslem1	⊢ (𝜑 → 0 < (((𝐴 + 1)↑2) − 𝐴))

**Proof of Theorem 3cubeslem1**
Step	Hyp	Ref	Expression
1		3cubeslem1.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℚ)
2		qre 12901	. . . . 5 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℝ)
3	1, 2	syl 17	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ)
4		0red 11145	. . . 4 ⊢ (𝜑 → 0 ∈ ℝ)
5	3, 4	lttri4d 11285	. . 3 ⊢ (𝜑 → (𝐴 < 0 ∨ 𝐴 = 0 ∨ 0 < 𝐴))
6		simpl 483	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 ∈ ℝ)
7		0red 11145	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 0 ∈ ℝ)
8		peano2re 11317	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (𝐴 + 1) ∈ ℝ)
9	8	adantr 481	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → (𝐴 + 1) ∈ ℝ)
10	9	resqcld 14085	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → ((𝐴 + 1)↑2) ∈ ℝ)
11		simpr 485	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 < 0)
12	9	sqge0d 14097	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 0 ≤ ((𝐴 + 1)↑2))
13	6, 7, 10, 11, 12	ltletrd 11304	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 < ((𝐴 + 1)↑2))
14	13	a1i 11	. . . . 5 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 < ((𝐴 + 1)↑2)))
15	3, 14	mpand 701	. . . 4 ⊢ (𝜑 → (𝐴 < 0 → 𝐴 < ((𝐴 + 1)↑2)))
16		0lt1 11670	. . . . . . . 8 ⊢ 0 < 1
17	16	a1i 11	. . . . . . 7 ⊢ (𝐴 = 0 → 0 < 1)
18		id 22	. . . . . . 7 ⊢ (𝐴 = 0 → 𝐴 = 0)
19		sq1 14155	. . . . . . . 8 ⊢ (1↑2) = 1
20	19	a1i 11	. . . . . . 7 ⊢ (𝐴 = 0 → (1↑2) = 1)
21	17, 18, 20	3brtr4d 5111	. . . . . 6 ⊢ (𝐴 = 0 → 𝐴 < (1↑2))
22		0cnd 11135	. . . . . . . . 9 ⊢ (𝐴 = 0 → 0 ∈ ℂ)
23		1cnd 11137	. . . . . . . . 9 ⊢ (𝐴 = 0 → 1 ∈ ℂ)
24	18	oveq1d 7378	. . . . . . . . 9 ⊢ (𝐴 = 0 → (𝐴 + 1) = (0 + 1))
25	22, 23, 24	comraddd 11358	. . . . . . . 8 ⊢ (𝐴 = 0 → (𝐴 + 1) = (1 + 0))
26		1p0e1 12298	. . . . . . . 8 ⊢ (1 + 0) = 1
27	25, 26	eqtrdi 2791	. . . . . . 7 ⊢ (𝐴 = 0 → (𝐴 + 1) = 1)
28	27	oveq1d 7378	. . . . . 6 ⊢ (𝐴 = 0 → ((𝐴 + 1)↑2) = (1↑2))
29	21, 28	breqtrrd 5107	. . . . 5 ⊢ (𝐴 = 0 → 𝐴 < ((𝐴 + 1)↑2))
30	29	a1i 11	. . . 4 ⊢ (𝜑 → (𝐴 = 0 → 𝐴 < ((𝐴 + 1)↑2)))
31		ax-1rid 11106	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (𝐴 · 1) = 𝐴)
32	31	adantr 481	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (𝐴 · 1) = 𝐴)
33		simpl 483	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 ∈ ℝ)
34		1red 11143	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 1 ∈ ℝ)
35	33, 34	readdcld 11172	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (𝐴 + 1) ∈ ℝ)
36		simpr 485	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 0 < 𝐴)
37		0red 11145	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 0 ∈ ℝ)
38		ltle 11232	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (0 < 𝐴 → 0 ≤ 𝐴))
39	37, 33, 38	syl2anc 590	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (0 < 𝐴 → 0 ≤ 𝐴))
40	33	ltp1d 12084	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 < (𝐴 + 1))
41	39, 40	jctird 531	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (0 < 𝐴 → (0 ≤ 𝐴 ∧ 𝐴 < (𝐴 + 1))))
42	36, 41	mpd 15	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (0 ≤ 𝐴 ∧ 𝐴 < (𝐴 + 1)))
43	34, 35	jca 516	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (1 ∈ ℝ ∧ (𝐴 + 1) ∈ ℝ))
44		0le1 11671	. . . . . . . . . . 11 ⊢ 0 ≤ 1
45	44	a1i 11	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 0 ≤ 1)
46		1e0p1 12684	. . . . . . . . . . 11 ⊢ 1 = (0 + 1)
47	37, 33, 34, 36	ltadd1dd 11759	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (0 + 1) < (𝐴 + 1))
48	46, 47	eqbrtrid 5114	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 1 < (𝐴 + 1))
49	43, 45, 48	jca32 520	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ((1 ∈ ℝ ∧ (𝐴 + 1) ∈ ℝ) ∧ (0 ≤ 1 ∧ 1 < (𝐴 + 1))))
50		ltmul12a 12009	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ (𝐴 + 1) ∈ ℝ) ∧ (0 ≤ 𝐴 ∧ 𝐴 < (𝐴 + 1))) ∧ ((1 ∈ ℝ ∧ (𝐴 + 1) ∈ ℝ) ∧ (0 ≤ 1 ∧ 1 < (𝐴 + 1)))) → (𝐴 · 1) < ((𝐴 + 1) · (𝐴 + 1)))
51	33, 35, 42, 49, 50	syl1111anc 846	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (𝐴 · 1) < ((𝐴 + 1) · (𝐴 + 1)))
52	32, 51	eqbrtrrd 5103	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 < ((𝐴 + 1) · (𝐴 + 1)))
53	35	recnd 11171	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (𝐴 + 1) ∈ ℂ)
54	53	sqvald 14103	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ((𝐴 + 1)↑2) = ((𝐴 + 1) · (𝐴 + 1)))
55	52, 54	breqtrrd 5107	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 < ((𝐴 + 1)↑2))
56	55	a1i 11	. . . . 5 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 < ((𝐴 + 1)↑2)))
57	3, 56	mpand 701	. . . 4 ⊢ (𝜑 → (0 < 𝐴 → 𝐴 < ((𝐴 + 1)↑2)))
58	15, 30, 57	3jaod 1437	. . 3 ⊢ (𝜑 → ((𝐴 < 0 ∨ 𝐴 = 0 ∨ 0 < 𝐴) → 𝐴 < ((𝐴 + 1)↑2)))
59	5, 58	mpd 15	. 2 ⊢ (𝜑 → 𝐴 < ((𝐴 + 1)↑2))
60	3, 8	syl 17	. . . 4 ⊢ (𝜑 → (𝐴 + 1) ∈ ℝ)
61	60	resqcld 14085	. . 3 ⊢ (𝜑 → ((𝐴 + 1)↑2) ∈ ℝ)
62	3, 61	posdifd 11735	. 2 ⊢ (𝜑 → (𝐴 < ((𝐴 + 1)↑2) ↔ 0 < (((𝐴 + 1)↑2) − 𝐴)))
63	59, 62	mpbid 233	1 ⊢ (𝜑 → 0 < (((𝐴 + 1)↑2) − 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∨ w3o 1091 = wceq 1547 ∈ wcel 2119 class class class wbr 5079 (class class class)co 7363 ℝcr 11035 0cc0 11036 1c1 11037 + caddc 11039 · cmul 11041 < clt 11177 ≤ cle 11178 − cmin 11375 2c2 12234 ℚcq 12896 ↑cexp 14021

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-div 11806 df-nn 12173 df-2 12242 df-n0 12436 df-z 12523 df-uz 12787 df-q 12897 df-seq 13962 df-exp 14022

This theorem is referenced by: 3cubeslem2 43141

W3C validator