| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nn0sqdcq | GIF version | ||
| Description: A nonnegative integer is a perfect square or not. This is similar to nn0sqdc 11162 but expresses the idea of being a perfect square as having a rational number which, when squared, gives the original number. (Contributed by Jim Kingdon, 25-Aug-2026.) |
| Ref | Expression |
|---|---|
| nn0sqdcq | ⊢ (𝑁 ∈ ℕ0 → DECID ∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nn0sqdc 11162 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → DECID ∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2)) | |
| 2 | exmiddc 848 | . . . 4 ⊢ (DECID ∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2) → (∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2) ∨ ¬ ∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2))) | |
| 3 | 1, 2 | syl 14 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2) ∨ ¬ ∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2))) |
| 4 | nn0ssq 10038 | . . . . 5 ⊢ ℕ0 ⊆ ℚ | |
| 5 | ssrexv 3313 | . . . . 5 ⊢ (ℕ0 ⊆ ℚ → (∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2) → ∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2))) | |
| 6 | 4, 5 | mp1i 10 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2) → ∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2))) |
| 7 | oveq1 6092 | . . . . . . . 8 ⊢ (𝑞 = 𝑟 → (𝑞↑2) = (𝑟↑2)) | |
| 8 | 7 | eqeq2d 2250 | . . . . . . 7 ⊢ (𝑞 = 𝑟 → (𝑁 = (𝑞↑2) ↔ 𝑁 = (𝑟↑2))) |
| 9 | 8 | cbvrexv 2787 | . . . . . 6 ⊢ (∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2) ↔ ∃𝑟 ∈ ℚ 𝑁 = (𝑟↑2)) |
| 10 | oveq1 6092 | . . . . . . . . 9 ⊢ (𝑞 = (abs‘𝑟) → (𝑞↑2) = ((abs‘𝑟)↑2)) | |
| 11 | 10 | eqeq2d 2250 | . . . . . . . 8 ⊢ (𝑞 = (abs‘𝑟) → (𝑁 = (𝑞↑2) ↔ 𝑁 = ((abs‘𝑟)↑2))) |
| 12 | simprr 537 | . . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → 𝑁 = (𝑟↑2)) | |
| 13 | 12 | fveq2d 5699 | . . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → (√‘𝑁) = (√‘(𝑟↑2))) |
| 14 | qre 10035 | . . . . . . . . . . . . 13 ⊢ (𝑟 ∈ ℚ → 𝑟 ∈ ℝ) | |
| 15 | 14 | ad2antrl 494 | . . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → 𝑟 ∈ ℝ) |
| 16 | 15 | absred 11945 | . . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → (abs‘𝑟) = (√‘(𝑟↑2))) |
| 17 | 13, 16 | eqtr4d 2274 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → (√‘𝑁) = (abs‘𝑟)) |
| 18 | qabscl 11859 | . . . . . . . . . . . . 13 ⊢ (𝑟 ∈ ℚ → (abs‘𝑟) ∈ ℚ) | |
| 19 | 18 | ad2antrl 494 | . . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → (abs‘𝑟) ∈ ℚ) |
| 20 | 17, 19 | eqeltrd 2315 | . . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → (√‘𝑁) ∈ ℚ) |
| 21 | nn0sqrtelqelz 13005 | . . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ (√‘𝑁) ∈ ℚ) → (√‘𝑁) ∈ ℤ) | |
| 22 | 20, 21 | syldan 282 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → (√‘𝑁) ∈ ℤ) |
| 23 | 17, 22 | eqeltrrd 2316 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → (abs‘𝑟) ∈ ℤ) |
| 24 | 15 | recnd 8355 | . . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → 𝑟 ∈ ℂ) |
| 25 | 24 | absge0d 11967 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → 0 ≤ (abs‘𝑟)) |
| 26 | elnn0z 9662 | . . . . . . . . 9 ⊢ ((abs‘𝑟) ∈ ℕ0 ↔ ((abs‘𝑟) ∈ ℤ ∧ 0 ≤ (abs‘𝑟))) | |
| 27 | 23, 25, 26 | sylanbrc 421 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → (abs‘𝑟) ∈ ℕ0) |
| 28 | absresq 11861 | . . . . . . . . . 10 ⊢ (𝑟 ∈ ℝ → ((abs‘𝑟)↑2) = (𝑟↑2)) | |
| 29 | 15, 28 | syl 14 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → ((abs‘𝑟)↑2) = (𝑟↑2)) |
| 30 | 12, 29 | eqtr4d 2274 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → 𝑁 = ((abs‘𝑟)↑2)) |
| 31 | 11, 27, 30 | rspcedvdw 2936 | . . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑟 ∈ ℚ ∧ 𝑁 = (𝑟↑2))) → ∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2)) |
| 32 | 31 | rexlimdvaa 2669 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (∃𝑟 ∈ ℚ 𝑁 = (𝑟↑2) → ∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2))) |
| 33 | 9, 32 | biimtrid 152 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2) → ∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2))) |
| 34 | 33 | con3d 640 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (¬ ∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2) → ¬ ∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2))) |
| 35 | 6, 34 | orim12d 798 | . . 3 ⊢ (𝑁 ∈ ℕ0 → ((∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2) ∨ ¬ ∃𝑞 ∈ ℕ0 𝑁 = (𝑞↑2)) → (∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2) ∨ ¬ ∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2)))) |
| 36 | 3, 35 | mpd 13 | . 2 ⊢ (𝑁 ∈ ℕ0 → (∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2) ∨ ¬ ∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2))) |
| 37 | df-dc 847 | . 2 ⊢ (DECID ∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2) ↔ (∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2) ∨ ¬ ∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2))) | |
| 38 | 36, 37 | sylibr 134 | 1 ⊢ (𝑁 ∈ ℕ0 → DECID ∃𝑞 ∈ ℚ 𝑁 = (𝑞↑2)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 ∨ wo 720 DECID wdc 846 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 ⊆ wss 3220 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 ℝcr 8179 0cc0 8180 ≤ cle 8362 2c2 9358 ℕ0cn0 9568 ℤcz 9649 ℚcq 10029 ↑cexp 10990 √csqrt 11778 abscabs 11779 |
| This proof depends on 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 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-mulrcl 8279 ax-addcom 8280 ax-mulcom 8281 ax-addass 8282 ax-mulass 8283 ax-distr 8284 ax-i2m1 8285 ax-0lt1 8286 ax-1rid 8287 ax-0id 8288 ax-rnegex 8289 ax-precex 8290 ax-cnre 8291 ax-pre-ltirr 8292 ax-pre-ltwlin 8293 ax-pre-lttrn 8294 ax-pre-apti 8295 ax-pre-ltadd 8296 ax-pre-mulgt0 8297 ax-pre-mulext 8298 ax-arch 8299 ax-caucvg 8300 |
| This proof depends on definitions: df-bi 117 df-stab 843 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 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-sup 7325 df-pnf 8363 df-mnf 8364 df-xr 8365 df-ltxr 8366 df-le 8367 df-sub 8501 df-neg 8502 df-reap 8906 df-ap 8913 df-div 9006 df-inn 9308 df-2 9366 df-3 9367 df-4 9368 df-n0 9569 df-z 9650 df-uz 9932 df-q 10030 df-rp 10066 df-fz 10423 df-fzo 10561 df-fl 10716 df-mod 10775 df-seqfrec 10900 df-exp 10991 df-cj 11623 df-re 11624 df-im 11625 df-rsqrt 11780 df-abs 11781 df-dvds 12574 df-gcd 12750 df-numer 12982 df-denom 12983 |
| This theorem is used by: sqrtrirr 13008 |
| Copyright terms: Public domain | W3C validator |