![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nnlesq | GIF version |
Description: A positive integer is less than or equal to its square. (Contributed by NM, 15-Sep-1999.) (Revised by Mario Carneiro, 12-Sep-2015.) |
Ref | Expression |
---|---|
nnlesq | ⊢ (𝑁 ∈ ℕ → 𝑁 ≤ (𝑁↑2)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nncn 8342 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ) | |
2 | 1 | mulid1d 7426 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 · 1) = 𝑁) |
3 | nnge1 8357 | . . . 4 ⊢ (𝑁 ∈ ℕ → 1 ≤ 𝑁) | |
4 | 1red 7424 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 1 ∈ ℝ) | |
5 | nnre 8341 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ) | |
6 | nngt0 8359 | . . . . 5 ⊢ (𝑁 ∈ ℕ → 0 < 𝑁) | |
7 | lemul2 8230 | . . . . 5 ⊢ ((1 ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ (𝑁 ∈ ℝ ∧ 0 < 𝑁)) → (1 ≤ 𝑁 ↔ (𝑁 · 1) ≤ (𝑁 · 𝑁))) | |
8 | 4, 5, 5, 6, 7 | syl112anc 1176 | . . . 4 ⊢ (𝑁 ∈ ℕ → (1 ≤ 𝑁 ↔ (𝑁 · 1) ≤ (𝑁 · 𝑁))) |
9 | 3, 8 | mpbid 145 | . . 3 ⊢ (𝑁 ∈ ℕ → (𝑁 · 1) ≤ (𝑁 · 𝑁)) |
10 | 2, 9 | eqbrtrrd 3836 | . 2 ⊢ (𝑁 ∈ ℕ → 𝑁 ≤ (𝑁 · 𝑁)) |
11 | sqval 9864 | . . 3 ⊢ (𝑁 ∈ ℂ → (𝑁↑2) = (𝑁 · 𝑁)) | |
12 | 1, 11 | syl 14 | . 2 ⊢ (𝑁 ∈ ℕ → (𝑁↑2) = (𝑁 · 𝑁)) |
13 | 10, 12 | breqtrrd 3840 | 1 ⊢ (𝑁 ∈ ℕ → 𝑁 ≤ (𝑁↑2)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 103 = wceq 1287 ∈ wcel 1436 class class class wbr 3814 (class class class)co 5594 ℂcc 7269 ℝcr 7270 0cc0 7271 1c1 7272 · cmul 7276 < clt 7443 ≤ cle 7444 ℕcn 8334 2c2 8384 ↑cexp 9805 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 577 ax-in2 578 ax-io 663 ax-5 1379 ax-7 1380 ax-gen 1381 ax-ie1 1425 ax-ie2 1426 ax-8 1438 ax-10 1439 ax-11 1440 ax-i12 1441 ax-bndl 1442 ax-4 1443 ax-13 1447 ax-14 1448 ax-17 1462 ax-i9 1466 ax-ial 1470 ax-i5r 1471 ax-ext 2067 ax-coll 3922 ax-sep 3925 ax-nul 3933 ax-pow 3977 ax-pr 4003 ax-un 4227 ax-setind 4319 ax-iinf 4369 ax-cnex 7357 ax-resscn 7358 ax-1cn 7359 ax-1re 7360 ax-icn 7361 ax-addcl 7362 ax-addrcl 7363 ax-mulcl 7364 ax-mulrcl 7365 ax-addcom 7366 ax-mulcom 7367 ax-addass 7368 ax-mulass 7369 ax-distr 7370 ax-i2m1 7371 ax-0lt1 7372 ax-1rid 7373 ax-0id 7374 ax-rnegex 7375 ax-precex 7376 ax-cnre 7377 ax-pre-ltirr 7378 ax-pre-ltwlin 7379 ax-pre-lttrn 7380 ax-pre-apti 7381 ax-pre-ltadd 7382 ax-pre-mulgt0 7383 ax-pre-mulext 7384 |
This theorem depends on definitions: df-bi 115 df-dc 779 df-3or 923 df-3an 924 df-tru 1290 df-fal 1293 df-nf 1393 df-sb 1690 df-eu 1948 df-mo 1949 df-clab 2072 df-cleq 2078 df-clel 2081 df-nfc 2214 df-ne 2252 df-nel 2347 df-ral 2360 df-rex 2361 df-reu 2362 df-rmo 2363 df-rab 2364 df-v 2616 df-sbc 2829 df-csb 2922 df-dif 2988 df-un 2990 df-in 2992 df-ss 2999 df-nul 3273 df-if 3377 df-pw 3411 df-sn 3431 df-pr 3432 df-op 3434 df-uni 3631 df-int 3666 df-iun 3709 df-br 3815 df-opab 3869 df-mpt 3870 df-tr 3905 df-id 4087 df-po 4090 df-iso 4091 df-iord 4160 df-on 4162 df-ilim 4163 df-suc 4165 df-iom 4372 df-xp 4410 df-rel 4411 df-cnv 4412 df-co 4413 df-dm 4414 df-rn 4415 df-res 4416 df-ima 4417 df-iota 4937 df-fun 4974 df-fn 4975 df-f 4976 df-f1 4977 df-fo 4978 df-f1o 4979 df-fv 4980 df-riota 5550 df-ov 5597 df-oprab 5598 df-mpt2 5599 df-1st 5849 df-2nd 5850 df-recs 6005 df-frec 6091 df-pnf 7445 df-mnf 7446 df-xr 7447 df-ltxr 7448 df-le 7449 df-sub 7576 df-neg 7577 df-reap 7970 df-ap 7977 df-div 8056 df-inn 8335 df-2 8393 df-n0 8584 df-z 8661 df-uz 8929 df-iseq 9755 df-iexp 9806 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |