| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nn0opthlem1d | GIF version | ||
| Description: A rather pretty lemma for nn0opth2 11140. (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 9558 | . . . . 5 ⊢ 1 ∈ ℕ0 | |
| 3 | 2 | a1i 9 | . . . 4 ⊢ (𝜑 → 1 ∈ ℕ0) |
| 4 | 1, 3 | nn0addcld 9603 | . . 3 ⊢ (𝜑 → (𝐴 + 1) ∈ ℕ0) |
| 5 | nn0opthlem1d.2 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℕ0) | |
| 6 | 4, 5 | nn0le2msqd 11135 | . 2 ⊢ (𝜑 → ((𝐴 + 1) ≤ 𝐶 ↔ ((𝐴 + 1) · (𝐴 + 1)) ≤ (𝐶 · 𝐶))) |
| 7 | nn0ltp1le 9686 | . . 3 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝐶 ∈ ℕ0) → (𝐴 < 𝐶 ↔ (𝐴 + 1) ≤ 𝐶)) | |
| 8 | 1, 5, 7 | syl2anc 415 | . 2 ⊢ (𝜑 → (𝐴 < 𝐶 ↔ (𝐴 + 1) ≤ 𝐶)) |
| 9 | 1, 1 | nn0mulcld 9604 | . . . . 5 ⊢ (𝜑 → (𝐴 · 𝐴) ∈ ℕ0) |
| 10 | 2nn0 9559 | . . . . . . 7 ⊢ 2 ∈ ℕ0 | |
| 11 | 10 | a1i 9 | . . . . . 6 ⊢ (𝜑 → 2 ∈ ℕ0) |
| 12 | 11, 1 | nn0mulcld 9604 | . . . . 5 ⊢ (𝜑 → (2 · 𝐴) ∈ ℕ0) |
| 13 | 9, 12 | nn0addcld 9603 | . . . 4 ⊢ (𝜑 → ((𝐴 · 𝐴) + (2 · 𝐴)) ∈ ℕ0) |
| 14 | 5, 5 | nn0mulcld 9604 | . . . 4 ⊢ (𝜑 → (𝐶 · 𝐶) ∈ ℕ0) |
| 15 | nn0ltp1le 9686 | . . . 4 ⊢ ((((𝐴 · 𝐴) + (2 · 𝐴)) ∈ ℕ0 ∧ (𝐶 · 𝐶) ∈ ℕ0) → (((𝐴 · 𝐴) + (2 · 𝐴)) < (𝐶 · 𝐶) ↔ (((𝐴 · 𝐴) + (2 · 𝐴)) + 1) ≤ (𝐶 · 𝐶))) | |
| 16 | 13, 14, 15 | syl2anc 415 | . . 3 ⊢ (𝜑 → (((𝐴 · 𝐴) + (2 · 𝐴)) < (𝐶 · 𝐶) ↔ (((𝐴 · 𝐴) + (2 · 𝐴)) + 1) ≤ (𝐶 · 𝐶))) |
| 17 | 1 | nn0cnd 9601 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 18 | 1cnd 8332 | . . . . . . 7 ⊢ (𝜑 → 1 ∈ ℂ) | |
| 19 | binom2 11066 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝐴 + 1)↑2) = (((𝐴↑2) + (2 · (𝐴 · 1))) + (1↑2))) | |
| 20 | 17, 18, 19 | syl2anc 415 | . . . . . 6 ⊢ (𝜑 → ((𝐴 + 1)↑2) = (((𝐴↑2) + (2 · (𝐴 · 1))) + (1↑2))) |
| 21 | 17, 18 | addcld 8335 | . . . . . . 7 ⊢ (𝜑 → (𝐴 + 1) ∈ ℂ) |
| 22 | 21 | sqvald 11086 | . . . . . 6 ⊢ (𝜑 → ((𝐴 + 1)↑2) = ((𝐴 + 1) · (𝐴 + 1))) |
| 23 | 17 | sqvald 11086 | . . . . . . . 8 ⊢ (𝜑 → (𝐴↑2) = (𝐴 · 𝐴)) |
| 24 | 23 | oveq1d 6090 | . . . . . . 7 ⊢ (𝜑 → ((𝐴↑2) + (2 · (𝐴 · 1))) = ((𝐴 · 𝐴) + (2 · (𝐴 · 1)))) |
| 25 | 18 | sqvald 11086 | . . . . . . 7 ⊢ (𝜑 → (1↑2) = (1 · 1)) |
| 26 | 24, 25 | oveq12d 6093 | . . . . . 6 ⊢ (𝜑 → (((𝐴↑2) + (2 · (𝐴 · 1))) + (1↑2)) = (((𝐴 · 𝐴) + (2 · (𝐴 · 1))) + (1 · 1))) |
| 27 | 20, 22, 26 | 3eqtr3d 2279 | . . . . 5 ⊢ (𝜑 → ((𝐴 + 1) · (𝐴 + 1)) = (((𝐴 · 𝐴) + (2 · (𝐴 · 1))) + (1 · 1))) |
| 28 | 17 | mulridd 8333 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 · 1) = 𝐴) |
| 29 | 28 | oveq2d 6091 | . . . . . . 7 ⊢ (𝜑 → (2 · (𝐴 · 1)) = (2 · 𝐴)) |
| 30 | 29 | oveq2d 6091 | . . . . . 6 ⊢ (𝜑 → ((𝐴 · 𝐴) + (2 · (𝐴 · 1))) = ((𝐴 · 𝐴) + (2 · 𝐴))) |
| 31 | 18 | mulridd 8333 | . . . . . 6 ⊢ (𝜑 → (1 · 1) = 1) |
| 32 | 30, 31 | oveq12d 6093 | . . . . 5 ⊢ (𝜑 → (((𝐴 · 𝐴) + (2 · (𝐴 · 1))) + (1 · 1)) = (((𝐴 · 𝐴) + (2 · 𝐴)) + 1)) |
| 33 | 27, 32 | eqtrd 2271 | . . . 4 ⊢ (𝜑 → ((𝐴 + 1) · (𝐴 + 1)) = (((𝐴 · 𝐴) + (2 · 𝐴)) + 1)) |
| 34 | 33 | breq1d 4135 | . . 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 1402 ∈ wcel 2209 class class class wbr 4125 (class class class)co 6075 ℂcc 8167 1c1 8170 + caddc 8172 · cmul 8174 < clt 8350 ≤ cle 8351 2c2 9334 ℕ0cn0 9542 ↑cexp 10953 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4241 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-iinf 4730 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-mulrcl 8268 ax-addcom 8269 ax-mulcom 8270 ax-addass 8271 ax-mulass 8272 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-1rid 8276 ax-0id 8277 ax-rnegex 8278 ax-precex 8279 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-apti 8284 ax-pre-ltadd 8285 ax-pre-mulgt0 8286 ax-pre-mulext 8287 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3636 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-id 4433 df-po 4436 df-iso 4437 df-iord 4506 df-on 4508 df-ilim 4509 df-suc 4511 df-iom 4733 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-recs 6566 df-frec 6652 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-reap 8893 df-ap 8900 df-div 8993 df-inn 9284 df-2 9342 df-n0 9543 df-z 9624 df-uz 9901 df-seqfrec 10863 df-exp 10954 |
| This theorem is referenced by: nn0opthlem2d 11137 |
| Copyright terms: Public domain | W3C validator |