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 42645

Description: Lemma for 3cubes 42651. (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 12888	. . . . 5 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℝ)
3	1, 2	syl 17	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ)
4		0red 11153	. . . 4 ⊢ (𝜑 → 0 ∈ ℝ)
5	3, 4	lttri4d 11291	. . 3 ⊢ (𝜑 → (𝐴 < 0 ∨ 𝐴 = 0 ∨ 0 < 𝐴))
6		simpl 482	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 ∈ ℝ)
7		0red 11153	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 0 ∈ ℝ)
8		peano2re 11323	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (𝐴 + 1) ∈ ℝ)
9	8	adantr 480	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → (𝐴 + 1) ∈ ℝ)
10	9	resqcld 14066	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → ((𝐴 + 1)↑2) ∈ ℝ)
11		simpr 484	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 < 0)
12	9	sqge0d 14078	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 0 ≤ ((𝐴 + 1)↑2))
13	6, 7, 10, 11, 12	ltletrd 11310	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 < ((𝐴 + 1)↑2))
14	13	a1i 11	. . . . 5 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 < ((𝐴 + 1)↑2)))
15	3, 14	mpand 695	. . . 4 ⊢ (𝜑 → (𝐴 < 0 → 𝐴 < ((𝐴 + 1)↑2)))
16		0lt1 11676	. . . . . . . 8 ⊢ 0 < 1
17	16	a1i 11	. . . . . . 7 ⊢ (𝐴 = 0 → 0 < 1)
18		id 22	. . . . . . 7 ⊢ (𝐴 = 0 → 𝐴 = 0)
19		sq1 14136	. . . . . . . 8 ⊢ (1↑2) = 1
20	19	a1i 11	. . . . . . 7 ⊢ (𝐴 = 0 → (1↑2) = 1)
21	17, 18, 20	3brtr4d 5134	. . . . . 6 ⊢ (𝐴 = 0 → 𝐴 < (1↑2))
22		0cnd 11143	. . . . . . . . 9 ⊢ (𝐴 = 0 → 0 ∈ ℂ)
23		1cnd 11145	. . . . . . . . 9 ⊢ (𝐴 = 0 → 1 ∈ ℂ)
24	18	oveq1d 7384	. . . . . . . . 9 ⊢ (𝐴 = 0 → (𝐴 + 1) = (0 + 1))
25	22, 23, 24	comraddd 11364	. . . . . . . 8 ⊢ (𝐴 = 0 → (𝐴 + 1) = (1 + 0))
26		1p0e1 12281	. . . . . . . 8 ⊢ (1 + 0) = 1
27	25, 26	eqtrdi 2780	. . . . . . 7 ⊢ (𝐴 = 0 → (𝐴 + 1) = 1)
28	27	oveq1d 7384	. . . . . 6 ⊢ (𝐴 = 0 → ((𝐴 + 1)↑2) = (1↑2))
29	21, 28	breqtrrd 5130	. . . . 5 ⊢ (𝐴 = 0 → 𝐴 < ((𝐴 + 1)↑2))
30	29	a1i 11	. . . 4 ⊢ (𝜑 → (𝐴 = 0 → 𝐴 < ((𝐴 + 1)↑2)))
31		ax-1rid 11114	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (𝐴 · 1) = 𝐴)
32	31	adantr 480	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (𝐴 · 1) = 𝐴)
33		simpl 482	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 ∈ ℝ)
34		1red 11151	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 1 ∈ ℝ)
35	33, 34	readdcld 11179	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (𝐴 + 1) ∈ ℝ)
36		simpr 484	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 0 < 𝐴)
37		0red 11153	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 0 ∈ ℝ)
38		ltle 11238	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (0 < 𝐴 → 0 ≤ 𝐴))
39	37, 33, 38	syl2anc 584	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (0 < 𝐴 → 0 ≤ 𝐴))
40	33	ltp1d 12089	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 < (𝐴 + 1))
41	39, 40	jctird 526	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (0 < 𝐴 → (0 ≤ 𝐴 ∧ 𝐴 < (𝐴 + 1))))
42	36, 41	mpd 15	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (0 ≤ 𝐴 ∧ 𝐴 < (𝐴 + 1)))
43	34, 35	jca 511	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (1 ∈ ℝ ∧ (𝐴 + 1) ∈ ℝ))
44		0le1 11677	. . . . . . . . . . 11 ⊢ 0 ≤ 1
45	44	a1i 11	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 0 ≤ 1)
46		1e0p1 12667	. . . . . . . . . . 11 ⊢ 1 = (0 + 1)
47	37, 33, 34, 36	ltadd1dd 11765	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (0 + 1) < (𝐴 + 1))
48	46, 47	eqbrtrid 5137	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 1 < (𝐴 + 1))
49	43, 45, 48	jca32 515	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ((1 ∈ ℝ ∧ (𝐴 + 1) ∈ ℝ) ∧ (0 ≤ 1 ∧ 1 < (𝐴 + 1))))
50		ltmul12a 12014	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ (𝐴 + 1) ∈ ℝ) ∧ (0 ≤ 𝐴 ∧ 𝐴 < (𝐴 + 1))) ∧ ((1 ∈ ℝ ∧ (𝐴 + 1) ∈ ℝ) ∧ (0 ≤ 1 ∧ 1 < (𝐴 + 1)))) → (𝐴 · 1) < ((𝐴 + 1) · (𝐴 + 1)))
51	33, 35, 42, 49, 50	syl1111anc 840	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (𝐴 · 1) < ((𝐴 + 1) · (𝐴 + 1)))
52	32, 51	eqbrtrrd 5126	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 < ((𝐴 + 1) · (𝐴 + 1)))
53	35	recnd 11178	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (𝐴 + 1) ∈ ℂ)
54	53	sqvald 14084	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ((𝐴 + 1)↑2) = ((𝐴 + 1) · (𝐴 + 1)))
55	52, 54	breqtrrd 5130	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 < ((𝐴 + 1)↑2))
56	55	a1i 11	. . . . 5 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 < ((𝐴 + 1)↑2)))
57	3, 56	mpand 695	. . . 4 ⊢ (𝜑 → (0 < 𝐴 → 𝐴 < ((𝐴 + 1)↑2)))
58	15, 30, 57	3jaod 1431	. . 3 ⊢ (𝜑 → ((𝐴 < 0 ∨ 𝐴 = 0 ∨ 0 < 𝐴) → 𝐴 < ((𝐴 + 1)↑2)))
59	5, 58	mpd 15	. 2 ⊢ (𝜑 → 𝐴 < ((𝐴 + 1)↑2))
60	3, 8	syl 17	. . . 4 ⊢ (𝜑 → (𝐴 + 1) ∈ ℝ)
61	60	resqcld 14066	. . 3 ⊢ (𝜑 → ((𝐴 + 1)↑2) ∈ ℝ)
62	3, 61	posdifd 11741	. 2 ⊢ (𝜑 → (𝐴 < ((𝐴 + 1)↑2) ↔ 0 < (((𝐴 + 1)↑2) − 𝐴)))
63	59, 62	mpbid 232	1 ⊢ (𝜑 → 0 < (((𝐴 + 1)↑2) − 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∨ w3o 1085 = wceq 1540 ∈ wcel 2109 class class class wbr 5102 (class class class)co 7369 ℝcr 11043 0cc0 11044 1c1 11045 + caddc 11047 · cmul 11049 < clt 11184 ≤ cle 11185 − cmin 11381 2c2 12217 ℚcq 12883 ↑cexp 14002

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 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121

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-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-div 11812 df-nn 12163 df-2 12225 df-n0 12419 df-z 12506 df-uz 12770 df-q 12884 df-seq 13943 df-exp 14003

This theorem is referenced by: 3cubeslem2 42646

W3C validator