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 40993

Description: Lemma for 3cubes 40999. (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 12878	. . . . 5 ⊢ (𝐴 ∈ ℚ → 𝐴 ∈ ℝ)
3	1, 2	syl 17	. . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ)
4		0red 11158	. . . 4 ⊢ (𝜑 → 0 ∈ ℝ)
5	3, 4	lttri4d 11296	. . 3 ⊢ (𝜑 → (𝐴 < 0 ∨ 𝐴 = 0 ∨ 0 < 𝐴))
6		simpl 483	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 ∈ ℝ)
7		0red 11158	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 0 ∈ ℝ)
8		peano2re 11328	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (𝐴 + 1) ∈ ℝ)
9	8	adantr 481	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → (𝐴 + 1) ∈ ℝ)
10	9	resqcld 14030	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → ((𝐴 + 1)↑2) ∈ ℝ)
11		simpr 485	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 < 0)
12	9	sqge0d 14042	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 0 ≤ ((𝐴 + 1)↑2))
13	6, 7, 10, 11, 12	ltletrd 11315	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 < ((𝐴 + 1)↑2))
14	13	a1i 11	. . . . 5 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 𝐴 < 0) → 𝐴 < ((𝐴 + 1)↑2)))
15	3, 14	mpand 693	. . . 4 ⊢ (𝜑 → (𝐴 < 0 → 𝐴 < ((𝐴 + 1)↑2)))
16		0lt1 11677	. . . . . . . 8 ⊢ 0 < 1
17	16	a1i 11	. . . . . . 7 ⊢ (𝐴 = 0 → 0 < 1)
18		id 22	. . . . . . 7 ⊢ (𝐴 = 0 → 𝐴 = 0)
19		sq1 14099	. . . . . . . 8 ⊢ (1↑2) = 1
20	19	a1i 11	. . . . . . 7 ⊢ (𝐴 = 0 → (1↑2) = 1)
21	17, 18, 20	3brtr4d 5137	. . . . . 6 ⊢ (𝐴 = 0 → 𝐴 < (1↑2))
22		0cnd 11148	. . . . . . . . 9 ⊢ (𝐴 = 0 → 0 ∈ ℂ)
23		1cnd 11150	. . . . . . . . 9 ⊢ (𝐴 = 0 → 1 ∈ ℂ)
24	18	oveq1d 7372	. . . . . . . . 9 ⊢ (𝐴 = 0 → (𝐴 + 1) = (0 + 1))
25	22, 23, 24	comraddd 11369	. . . . . . . 8 ⊢ (𝐴 = 0 → (𝐴 + 1) = (1 + 0))
26		1p0e1 12277	. . . . . . . 8 ⊢ (1 + 0) = 1
27	25, 26	eqtrdi 2792	. . . . . . 7 ⊢ (𝐴 = 0 → (𝐴 + 1) = 1)
28	27	oveq1d 7372	. . . . . 6 ⊢ (𝐴 = 0 → ((𝐴 + 1)↑2) = (1↑2))
29	21, 28	breqtrrd 5133	. . . . 5 ⊢ (𝐴 = 0 → 𝐴 < ((𝐴 + 1)↑2))
30	29	a1i 11	. . . 4 ⊢ (𝜑 → (𝐴 = 0 → 𝐴 < ((𝐴 + 1)↑2)))
31		ax-1rid 11121	. . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (𝐴 · 1) = 𝐴)
32	31	adantr 481	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (𝐴 · 1) = 𝐴)
33		simpl 483	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 ∈ ℝ)
34		1red 11156	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 1 ∈ ℝ)
35	33, 34	readdcld 11184	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (𝐴 + 1) ∈ ℝ)
36		simpr 485	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 0 < 𝐴)
37		0red 11158	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 0 ∈ ℝ)
38		ltle 11243	. . . . . . . . . . . 12 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (0 < 𝐴 → 0 ≤ 𝐴))
39	37, 33, 38	syl2anc 584	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (0 < 𝐴 → 0 ≤ 𝐴))
40	33	ltp1d 12085	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 < (𝐴 + 1))
41	39, 40	jctird 527	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (0 < 𝐴 → (0 ≤ 𝐴 ∧ 𝐴 < (𝐴 + 1))))
42	36, 41	mpd 15	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (0 ≤ 𝐴 ∧ 𝐴 < (𝐴 + 1)))
43	34, 35	jca 512	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (1 ∈ ℝ ∧ (𝐴 + 1) ∈ ℝ))
44		0le1 11678	. . . . . . . . . . 11 ⊢ 0 ≤ 1
45	44	a1i 11	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 0 ≤ 1)
46		1e0p1 12660	. . . . . . . . . . 11 ⊢ 1 = (0 + 1)
47	37, 33, 34, 36	ltadd1dd 11766	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (0 + 1) < (𝐴 + 1))
48	46, 47	eqbrtrid 5140	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 1 < (𝐴 + 1))
49	43, 45, 48	jca32 516	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ((1 ∈ ℝ ∧ (𝐴 + 1) ∈ ℝ) ∧ (0 ≤ 1 ∧ 1 < (𝐴 + 1))))
50		ltmul12a 12011	. . . . . . . . 9 ⊢ ((((𝐴 ∈ ℝ ∧ (𝐴 + 1) ∈ ℝ) ∧ (0 ≤ 𝐴 ∧ 𝐴 < (𝐴 + 1))) ∧ ((1 ∈ ℝ ∧ (𝐴 + 1) ∈ ℝ) ∧ (0 ≤ 1 ∧ 1 < (𝐴 + 1)))) → (𝐴 · 1) < ((𝐴 + 1) · (𝐴 + 1)))
51	33, 35, 42, 49, 50	syl1111anc 838	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (𝐴 · 1) < ((𝐴 + 1) · (𝐴 + 1)))
52	32, 51	eqbrtrrd 5129	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 < ((𝐴 + 1) · (𝐴 + 1)))
53	35	recnd 11183	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → (𝐴 + 1) ∈ ℂ)
54	53	sqvald 14048	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ((𝐴 + 1)↑2) = ((𝐴 + 1) · (𝐴 + 1)))
55	52, 54	breqtrrd 5133	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 < ((𝐴 + 1)↑2))
56	55	a1i 11	. . . . 5 ⊢ (𝜑 → ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → 𝐴 < ((𝐴 + 1)↑2)))
57	3, 56	mpand 693	. . . 4 ⊢ (𝜑 → (0 < 𝐴 → 𝐴 < ((𝐴 + 1)↑2)))
58	15, 30, 57	3jaod 1428	. . 3 ⊢ (𝜑 → ((𝐴 < 0 ∨ 𝐴 = 0 ∨ 0 < 𝐴) → 𝐴 < ((𝐴 + 1)↑2)))
59	5, 58	mpd 15	. 2 ⊢ (𝜑 → 𝐴 < ((𝐴 + 1)↑2))
60	3, 8	syl 17	. . . 4 ⊢ (𝜑 → (𝐴 + 1) ∈ ℝ)
61	60	resqcld 14030	. . 3 ⊢ (𝜑 → ((𝐴 + 1)↑2) ∈ ℝ)
62	3, 61	posdifd 11742	. 2 ⊢ (𝜑 → (𝐴 < ((𝐴 + 1)↑2) ↔ 0 < (((𝐴 + 1)↑2) − 𝐴)))
63	59, 62	mpbid 231	1 ⊢ (𝜑 → 0 < (((𝐴 + 1)↑2) − 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∨ w3o 1086 = wceq 1541 ∈ wcel 2106 class class class wbr 5105 (class class class)co 7357 ℝcr 11050 0cc0 11051 1c1 11052 + caddc 11054 · cmul 11056 < clt 11189 ≤ cle 11190 − cmin 11385 2c2 12208 ℚcq 12873 ↑cexp 13967

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-om 7803 df-1st 7921 df-2nd 7922 df-frecs 8212 df-wrecs 8243 df-recs 8317 df-rdg 8356 df-er 8648 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-div 11813 df-nn 12154 df-2 12216 df-n0 12414 df-z 12500 df-uz 12764 df-q 12874 df-seq 13907 df-exp 13968

This theorem is referenced by: 3cubeslem2 40994

W3C validator