| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nn0opthlem1d | GIF version | ||
| Description: A rather pretty lemma for nn0opth2 11032. (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 9460 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
| 3 | 2 | a1i 9 | . . . 4 ⊢ (𝜑 → 1 ∈ ℕ0) |
| 4 | 1, 3 | nn0addcld 9503 | . . 3 ⊢ (𝜑 → (𝐴 + 1) ∈ ℕ0) |
| 5 | nn0opthlem1d.2 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℕ0) | |
| 6 | 4, 5 | nn0le2msqd 11027 | . 2 ⊢ (𝜑 → ((𝐴 + 1) ≤ 𝐶 ↔ ((𝐴 + 1) · (𝐴 + 1)) ≤ (𝐶 · 𝐶))) |
| 7 | nn0ltp1le 9586 | . . 3 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝐶 ∈ ℕ0) → (𝐴 < 𝐶 ↔ (𝐴 + 1) ≤ 𝐶)) | |
| 8 | 1, 5, 7 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝐴 < 𝐶 ↔ (𝐴 + 1) ≤ 𝐶)) |
| 9 | 1, 1 | nn0mulcld 9504 | . . . . 5 ⊢ (𝜑 → (𝐴 · 𝐴) ∈ ℕ0) |
| 10 | 2nn0 9461 | . . . . . . 7 ⊢ 2 ∈ ℕ0 | |
| 11 | 10 | a1i 9 | . . . . . 6 ⊢ (𝜑 → 2 ∈ ℕ0) |
| 12 | 11, 1 | nn0mulcld 9504 | . . . . 5 ⊢ (𝜑 → (2 · 𝐴) ∈ ℕ0) |
| 13 | 9, 12 | nn0addcld 9503 | . . . 4 ⊢ (𝜑 → ((𝐴 · 𝐴) + (2 · 𝐴)) ∈ ℕ0) |
| 14 | 5, 5 | nn0mulcld 9504 | . . . 4 ⊢ (𝜑 → (𝐶 · 𝐶) ∈ ℕ0) |
| 15 | nn0ltp1le 9586 | . . . 4 ⊢ ((((𝐴 · 𝐴) + (2 · 𝐴)) ∈ ℕ0 ∧ (𝐶 · 𝐶) ∈ ℕ0) → (((𝐴 · 𝐴) + (2 · 𝐴)) < (𝐶 · 𝐶) ↔ (((𝐴 · 𝐴) + (2 · 𝐴)) + 1) ≤ (𝐶 · 𝐶))) | |
| 16 | 13, 14, 15 | syl2anc 411 | . . 3 ⊢ (𝜑 → (((𝐴 · 𝐴) + (2 · 𝐴)) < (𝐶 · 𝐶) ↔ (((𝐴 · 𝐴) + (2 · 𝐴)) + 1) ≤ (𝐶 · 𝐶))) |
| 17 | 1 | nn0cnd 9501 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 18 | 1cnd 8238 | . . . . . . 7 ⊢ (𝜑 → 1 ∈ ℂ) | |
| 19 | binom2 10959 | . . . . . . 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 8241 | . . . . . . 7 ⊢ (𝜑 → (𝐴 + 1) ∈ ℂ) |
| 22 | 21 | sqvald 10978 | . . . . . 6 ⊢ (𝜑 → ((𝐴 + 1)↑2) = ((𝐴 + 1) · (𝐴 + 1))) |
| 23 | 17 | sqvald 10978 | . . . . . . . 8 ⊢ (𝜑 → (𝐴↑2) = (𝐴 · 𝐴)) |
| 24 | 23 | oveq1d 6043 | . . . . . . 7 ⊢ (𝜑 → ((𝐴↑2) + (2 · (𝐴 · 1))) = ((𝐴 · 𝐴) + (2 · (𝐴 · 1)))) |
| 25 | 18 | sqvald 10978 | . . . . . . 7 ⊢ (𝜑 → (1↑2) = (1 · 1)) |
| 26 | 24, 25 | oveq12d 6046 | . . . . . 6 ⊢ (𝜑 → (((𝐴↑2) + (2 · (𝐴 · 1))) + (1↑2)) = (((𝐴 · 𝐴) + (2 · (𝐴 · 1))) + (1 · 1))) |
| 27 | 20, 22, 26 | 3eqtr3d 2272 | . . . . 5 ⊢ (𝜑 → ((𝐴 + 1) · (𝐴 + 1)) = (((𝐴 · 𝐴) + (2 · (𝐴 · 1))) + (1 · 1))) |
| 28 | 17 | mulridd 8239 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 · 1) = 𝐴) |
| 29 | 28 | oveq2d 6044 | . . . . . . 7 ⊢ (𝜑 → (2 · (𝐴 · 1)) = (2 · 𝐴)) |
| 30 | 29 | oveq2d 6044 | . . . . . 6 ⊢ (𝜑 → ((𝐴 · 𝐴) + (2 · (𝐴 · 1))) = ((𝐴 · 𝐴) + (2 · 𝐴))) |
| 31 | 18 | mulridd 8239 | . . . . . 6 ⊢ (𝜑 → (1 · 1) = 1) |
| 32 | 30, 31 | oveq12d 6046 | . . . . 5 ⊢ (𝜑 → (((𝐴 · 𝐴) + (2 · (𝐴 · 1))) + (1 · 1)) = (((𝐴 · 𝐴) + (2 · 𝐴)) + 1)) |
| 33 | 27, 32 | eqtrd 2264 | . . . 4 ⊢ (𝜑 → ((𝐴 + 1) · (𝐴 + 1)) = (((𝐴 · 𝐴) + (2 · 𝐴)) + 1)) |
| 34 | 33 | breq1d 4103 | . . 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 1398 ∈ wcel 2202 class class class wbr 4093 (class class class)co 6028 ℂcc 8073 1c1 8076 + caddc 8078 · cmul 8080 < clt 8256 ≤ cle 8257 2c2 9236 ℕ0cn0 9444 ↑cexp 10846 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-mulrcl 8174 ax-addcom 8175 ax-mulcom 8176 ax-addass 8177 ax-mulass 8178 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-1rid 8182 ax-0id 8183 ax-rnegex 8184 ax-precex 8185 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-apti 8190 ax-pre-ltadd 8191 ax-pre-mulgt0 8192 ax-pre-mulext 8193 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-if 3608 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-ilim 4472 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-frec 6600 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-reap 8797 df-ap 8804 df-div 8895 df-inn 9186 df-2 9244 df-n0 9445 df-z 9524 df-uz 9800 df-seqfrec 10756 df-exp 10847 |
| This theorem is referenced by: nn0opthlem2d 11029 |
| Copyright terms: Public domain | W3C validator |