![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nn0opthlem1d | GIF version |
Description: A rather pretty lemma for nn0opth2 10795. (Contributed by Jim Kingdon, 31-Oct-2021.) |
Ref | Expression |
---|---|
nn0opthlem1d.1 | ⊢ (𝜑 → 𝐴 ∈ ℕ0) |
nn0opthlem1d.2 | ⊢ (𝜑 → 𝐶 ∈ ℕ0) |
Ref | Expression |
---|---|
nn0opthlem1d | ⊢ (𝜑 → (𝐴 < 𝐶 ↔ ((𝐴 · 𝐴) + (2 · 𝐴)) < (𝐶 · 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nn0opthlem1d.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℕ0) | |
2 | 1nn0 9256 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
3 | 2 | a1i 9 | . . . 4 ⊢ (𝜑 → 1 ∈ ℕ0) |
4 | 1, 3 | nn0addcld 9297 | . . 3 ⊢ (𝜑 → (𝐴 + 1) ∈ ℕ0) |
5 | nn0opthlem1d.2 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℕ0) | |
6 | 4, 5 | nn0le2msqd 10790 | . 2 ⊢ (𝜑 → ((𝐴 + 1) ≤ 𝐶 ↔ ((𝐴 + 1) · (𝐴 + 1)) ≤ (𝐶 · 𝐶))) |
7 | nn0ltp1le 9379 | . . 3 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝐶 ∈ ℕ0) → (𝐴 < 𝐶 ↔ (𝐴 + 1) ≤ 𝐶)) | |
8 | 1, 5, 7 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝐴 < 𝐶 ↔ (𝐴 + 1) ≤ 𝐶)) |
9 | 1, 1 | nn0mulcld 9298 | . . . . 5 ⊢ (𝜑 → (𝐴 · 𝐴) ∈ ℕ0) |
10 | 2nn0 9257 | . . . . . . 7 ⊢ 2 ∈ ℕ0 | |
11 | 10 | a1i 9 | . . . . . 6 ⊢ (𝜑 → 2 ∈ ℕ0) |
12 | 11, 1 | nn0mulcld 9298 | . . . . 5 ⊢ (𝜑 → (2 · 𝐴) ∈ ℕ0) |
13 | 9, 12 | nn0addcld 9297 | . . . 4 ⊢ (𝜑 → ((𝐴 · 𝐴) + (2 · 𝐴)) ∈ ℕ0) |
14 | 5, 5 | nn0mulcld 9298 | . . . 4 ⊢ (𝜑 → (𝐶 · 𝐶) ∈ ℕ0) |
15 | nn0ltp1le 9379 | . . . 4 ⊢ ((((𝐴 · 𝐴) + (2 · 𝐴)) ∈ ℕ0 ∧ (𝐶 · 𝐶) ∈ ℕ0) → (((𝐴 · 𝐴) + (2 · 𝐴)) < (𝐶 · 𝐶) ↔ (((𝐴 · 𝐴) + (2 · 𝐴)) + 1) ≤ (𝐶 · 𝐶))) | |
16 | 13, 14, 15 | syl2anc 411 | . . 3 ⊢ (𝜑 → (((𝐴 · 𝐴) + (2 · 𝐴)) < (𝐶 · 𝐶) ↔ (((𝐴 · 𝐴) + (2 · 𝐴)) + 1) ≤ (𝐶 · 𝐶))) |
17 | 1 | nn0cnd 9295 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
18 | 1cnd 8035 | . . . . . . 7 ⊢ (𝜑 → 1 ∈ ℂ) | |
19 | binom2 10722 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝐴 + 1)↑2) = (((𝐴↑2) + (2 · (𝐴 · 1))) + (1↑2))) | |
20 | 17, 18, 19 | syl2anc 411 | . . . . . 6 ⊢ (𝜑 → ((𝐴 + 1)↑2) = (((𝐴↑2) + (2 · (𝐴 · 1))) + (1↑2))) |
21 | 17, 18 | addcld 8039 | . . . . . . 7 ⊢ (𝜑 → (𝐴 + 1) ∈ ℂ) |
22 | 21 | sqvald 10741 | . . . . . 6 ⊢ (𝜑 → ((𝐴 + 1)↑2) = ((𝐴 + 1) · (𝐴 + 1))) |
23 | 17 | sqvald 10741 | . . . . . . . 8 ⊢ (𝜑 → (𝐴↑2) = (𝐴 · 𝐴)) |
24 | 23 | oveq1d 5933 | . . . . . . 7 ⊢ (𝜑 → ((𝐴↑2) + (2 · (𝐴 · 1))) = ((𝐴 · 𝐴) + (2 · (𝐴 · 1)))) |
25 | 18 | sqvald 10741 | . . . . . . 7 ⊢ (𝜑 → (1↑2) = (1 · 1)) |
26 | 24, 25 | oveq12d 5936 | . . . . . 6 ⊢ (𝜑 → (((𝐴↑2) + (2 · (𝐴 · 1))) + (1↑2)) = (((𝐴 · 𝐴) + (2 · (𝐴 · 1))) + (1 · 1))) |
27 | 20, 22, 26 | 3eqtr3d 2234 | . . . . 5 ⊢ (𝜑 → ((𝐴 + 1) · (𝐴 + 1)) = (((𝐴 · 𝐴) + (2 · (𝐴 · 1))) + (1 · 1))) |
28 | 17 | mulridd 8036 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 · 1) = 𝐴) |
29 | 28 | oveq2d 5934 | . . . . . . 7 ⊢ (𝜑 → (2 · (𝐴 · 1)) = (2 · 𝐴)) |
30 | 29 | oveq2d 5934 | . . . . . 6 ⊢ (𝜑 → ((𝐴 · 𝐴) + (2 · (𝐴 · 1))) = ((𝐴 · 𝐴) + (2 · 𝐴))) |
31 | 18 | mulridd 8036 | . . . . . 6 ⊢ (𝜑 → (1 · 1) = 1) |
32 | 30, 31 | oveq12d 5936 | . . . . 5 ⊢ (𝜑 → (((𝐴 · 𝐴) + (2 · (𝐴 · 1))) + (1 · 1)) = (((𝐴 · 𝐴) + (2 · 𝐴)) + 1)) |
33 | 27, 32 | eqtrd 2226 | . . . 4 ⊢ (𝜑 → ((𝐴 + 1) · (𝐴 + 1)) = (((𝐴 · 𝐴) + (2 · 𝐴)) + 1)) |
34 | 33 | breq1d 4039 | . . 3 ⊢ (𝜑 → (((𝐴 + 1) · (𝐴 + 1)) ≤ (𝐶 · 𝐶) ↔ (((𝐴 · 𝐴) + (2 · 𝐴)) + 1) ≤ (𝐶 · 𝐶))) |
35 | 16, 34 | bitr4d 191 | . 2 ⊢ (𝜑 → (((𝐴 · 𝐴) + (2 · 𝐴)) < (𝐶 · 𝐶) ↔ ((𝐴 + 1) · (𝐴 + 1)) ≤ (𝐶 · 𝐶))) |
36 | 6, 8, 35 | 3bitr4d 220 | 1 ⊢ (𝜑 → (𝐴 < 𝐶 ↔ ((𝐴 · 𝐴) + (2 · 𝐴)) < (𝐶 · 𝐶))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 105 = wceq 1364 ∈ wcel 2164 class class class wbr 4029 (class class class)co 5918 ℂcc 7870 1c1 7873 + caddc 7875 · cmul 7877 < clt 8054 ≤ cle 8055 2c2 9033 ℕ0cn0 9240 ↑cexp 10609 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-nul 4155 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-iinf 4620 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-mulrcl 7971 ax-addcom 7972 ax-mulcom 7973 ax-addass 7974 ax-mulass 7975 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-1rid 7979 ax-0id 7980 ax-rnegex 7981 ax-precex 7982 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-apti 7987 ax-pre-ltadd 7988 ax-pre-mulgt0 7989 ax-pre-mulext 7990 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-if 3558 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-tr 4128 df-id 4324 df-po 4327 df-iso 4328 df-iord 4397 df-on 4399 df-ilim 4400 df-suc 4402 df-iom 4623 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 df-recs 6358 df-frec 6444 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-reap 8594 df-ap 8601 df-div 8692 df-inn 8983 df-2 9041 df-n0 9241 df-z 9318 df-uz 9593 df-seqfrec 10519 df-exp 10610 |
This theorem is referenced by: nn0opthlem2d 10792 |
Copyright terms: Public domain | W3C validator |