| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sqnprm | GIF version | ||
| Description: A square is never prime. (Contributed by Mario Carneiro, 20-Jun-2015.) |
| Ref | Expression |
|---|---|
| sqnprm | ⊢ (𝐴 ∈ ℤ → ¬ (𝐴↑2) ∈ ℙ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zre 9527 | . . . . . 6 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ) | |
| 2 | 1 | adantr 276 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → 𝐴 ∈ ℝ) |
| 3 | absresq 11701 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((abs‘𝐴)↑2) = (𝐴↑2)) | |
| 4 | 2, 3 | syl 14 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → ((abs‘𝐴)↑2) = (𝐴↑2)) |
| 5 | 2 | recnd 8250 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → 𝐴 ∈ ℂ) |
| 6 | 5 | abscld 11804 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (abs‘𝐴) ∈ ℝ) |
| 7 | 6 | recnd 8250 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (abs‘𝐴) ∈ ℂ) |
| 8 | 7 | sqvald 10978 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → ((abs‘𝐴)↑2) = ((abs‘𝐴) · (abs‘𝐴))) |
| 9 | 4, 8 | eqtr3d 2266 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (𝐴↑2) = ((abs‘𝐴) · (abs‘𝐴))) |
| 10 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (𝐴↑2) ∈ ℙ) | |
| 11 | 9, 10 | eqeltrrd 2309 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → ((abs‘𝐴) · (abs‘𝐴)) ∈ ℙ) |
| 12 | nn0abscl 11708 | . . . . . 6 ⊢ (𝐴 ∈ ℤ → (abs‘𝐴) ∈ ℕ0) | |
| 13 | 12 | adantr 276 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (abs‘𝐴) ∈ ℕ0) |
| 14 | 13 | nn0zd 9644 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (abs‘𝐴) ∈ ℤ) |
| 15 | sq1 10941 | . . . . . 6 ⊢ (1↑2) = 1 | |
| 16 | prmuz2 12766 | . . . . . . . . 9 ⊢ ((𝐴↑2) ∈ ℙ → (𝐴↑2) ∈ (ℤ≥‘2)) | |
| 17 | 16 | adantl 277 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (𝐴↑2) ∈ (ℤ≥‘2)) |
| 18 | eluz2b1 9879 | . . . . . . . . 9 ⊢ ((𝐴↑2) ∈ (ℤ≥‘2) ↔ ((𝐴↑2) ∈ ℤ ∧ 1 < (𝐴↑2))) | |
| 19 | 18 | simprbi 275 | . . . . . . . 8 ⊢ ((𝐴↑2) ∈ (ℤ≥‘2) → 1 < (𝐴↑2)) |
| 20 | 17, 19 | syl 14 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → 1 < (𝐴↑2)) |
| 21 | 20, 4 | breqtrrd 4121 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → 1 < ((abs‘𝐴)↑2)) |
| 22 | 15, 21 | eqbrtrid 4128 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (1↑2) < ((abs‘𝐴)↑2)) |
| 23 | 5 | absge0d 11807 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → 0 ≤ (abs‘𝐴)) |
| 24 | 1re 8221 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
| 25 | 0le1 8703 | . . . . . . 7 ⊢ 0 ≤ 1 | |
| 26 | lt2sq 10921 | . . . . . . 7 ⊢ (((1 ∈ ℝ ∧ 0 ≤ 1) ∧ ((abs‘𝐴) ∈ ℝ ∧ 0 ≤ (abs‘𝐴))) → (1 < (abs‘𝐴) ↔ (1↑2) < ((abs‘𝐴)↑2))) | |
| 27 | 24, 25, 26 | mpanl12 436 | . . . . . 6 ⊢ (((abs‘𝐴) ∈ ℝ ∧ 0 ≤ (abs‘𝐴)) → (1 < (abs‘𝐴) ↔ (1↑2) < ((abs‘𝐴)↑2))) |
| 28 | 6, 23, 27 | syl2anc 411 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (1 < (abs‘𝐴) ↔ (1↑2) < ((abs‘𝐴)↑2))) |
| 29 | 22, 28 | mpbird 167 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → 1 < (abs‘𝐴)) |
| 30 | eluz2b1 9879 | . . . 4 ⊢ ((abs‘𝐴) ∈ (ℤ≥‘2) ↔ ((abs‘𝐴) ∈ ℤ ∧ 1 < (abs‘𝐴))) | |
| 31 | 14, 29, 30 | sylanbrc 417 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (abs‘𝐴) ∈ (ℤ≥‘2)) |
| 32 | nprm 12758 | . . 3 ⊢ (((abs‘𝐴) ∈ (ℤ≥‘2) ∧ (abs‘𝐴) ∈ (ℤ≥‘2)) → ¬ ((abs‘𝐴) · (abs‘𝐴)) ∈ ℙ) | |
| 33 | 31, 31, 32 | syl2anc 411 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → ¬ ((abs‘𝐴) · (abs‘𝐴)) ∈ ℙ) |
| 34 | 11, 33 | pm2.65da 667 | 1 ⊢ (𝐴 ∈ ℤ → ¬ (𝐴↑2) ∈ ℙ) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2202 class class class wbr 4093 ‘cfv 5333 (class class class)co 6028 ℝcr 8074 0cc0 8075 1c1 8076 · cmul 8080 < clt 8256 ≤ cle 8257 2c2 9236 ℕ0cn0 9444 ℤcz 9523 ℤ≥cuz 9799 ↑cexp 10846 abscabs 11620 ℙcprime 12742 |
| 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 ax-arch 8194 ax-caucvg 8195 |
| 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-1o 6625 df-2o 6626 df-er 6745 df-en 6953 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-3 9245 df-4 9246 df-n0 9445 df-z 9524 df-uz 9800 df-q 9898 df-rp 9933 df-seqfrec 10756 df-exp 10847 df-cj 11465 df-re 11466 df-im 11467 df-rsqrt 11621 df-abs 11622 df-dvds 12412 df-prm 12743 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |