![]() |
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 9324 | . . . . . 6 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℝ) | |
2 | 1 | adantr 276 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → 𝐴 ∈ ℝ) |
3 | absresq 11225 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((abs‘𝐴)↑2) = (𝐴↑2)) | |
4 | 2, 3 | syl 14 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → ((abs‘𝐴)↑2) = (𝐴↑2)) |
5 | 2 | recnd 8050 | . . . . . . 7 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → 𝐴 ∈ ℂ) |
6 | 5 | abscld 11328 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (abs‘𝐴) ∈ ℝ) |
7 | 6 | recnd 8050 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (abs‘𝐴) ∈ ℂ) |
8 | 7 | sqvald 10744 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → ((abs‘𝐴)↑2) = ((abs‘𝐴) · (abs‘𝐴))) |
9 | 4, 8 | eqtr3d 2228 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (𝐴↑2) = ((abs‘𝐴) · (abs‘𝐴))) |
10 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (𝐴↑2) ∈ ℙ) | |
11 | 9, 10 | eqeltrrd 2271 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → ((abs‘𝐴) · (abs‘𝐴)) ∈ ℙ) |
12 | nn0abscl 11232 | . . . . . 6 ⊢ (𝐴 ∈ ℤ → (abs‘𝐴) ∈ ℕ0) | |
13 | 12 | adantr 276 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (abs‘𝐴) ∈ ℕ0) |
14 | 13 | nn0zd 9440 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (abs‘𝐴) ∈ ℤ) |
15 | sq1 10707 | . . . . . 6 ⊢ (1↑2) = 1 | |
16 | prmuz2 12272 | . . . . . . . . 9 ⊢ ((𝐴↑2) ∈ ℙ → (𝐴↑2) ∈ (ℤ≥‘2)) | |
17 | 16 | adantl 277 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (𝐴↑2) ∈ (ℤ≥‘2)) |
18 | eluz2b1 9669 | . . . . . . . . 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 4058 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → 1 < ((abs‘𝐴)↑2)) |
22 | 15, 21 | eqbrtrid 4065 | . . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (1↑2) < ((abs‘𝐴)↑2)) |
23 | 5 | absge0d 11331 | . . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → 0 ≤ (abs‘𝐴)) |
24 | 1re 8020 | . . . . . . 7 ⊢ 1 ∈ ℝ | |
25 | 0le1 8502 | . . . . . . 7 ⊢ 0 ≤ 1 | |
26 | lt2sq 10687 | . . . . . . 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 9669 | . . . 4 ⊢ ((abs‘𝐴) ∈ (ℤ≥‘2) ↔ ((abs‘𝐴) ∈ ℤ ∧ 1 < (abs‘𝐴))) | |
31 | 14, 29, 30 | sylanbrc 417 | . . 3 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → (abs‘𝐴) ∈ (ℤ≥‘2)) |
32 | nprm 12264 | . . 3 ⊢ (((abs‘𝐴) ∈ (ℤ≥‘2) ∧ (abs‘𝐴) ∈ (ℤ≥‘2)) → ¬ ((abs‘𝐴) · (abs‘𝐴)) ∈ ℙ) | |
33 | 31, 31, 32 | syl2anc 411 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ (𝐴↑2) ∈ ℙ) → ¬ ((abs‘𝐴) · (abs‘𝐴)) ∈ ℙ) |
34 | 11, 33 | pm2.65da 662 | 1 ⊢ (𝐴 ∈ ℤ → ¬ (𝐴↑2) ∈ ℙ) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2164 class class class wbr 4030 ‘cfv 5255 (class class class)co 5919 ℝcr 7873 0cc0 7874 1c1 7875 · cmul 7879 < clt 8056 ≤ cle 8057 2c2 9035 ℕ0cn0 9243 ℤcz 9320 ℤ≥cuz 9595 ↑cexp 10612 abscabs 11144 ℙcprime 12248 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-iinf 4621 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-mulrcl 7973 ax-addcom 7974 ax-mulcom 7975 ax-addass 7976 ax-mulass 7977 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-1rid 7981 ax-0id 7982 ax-rnegex 7983 ax-precex 7984 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-ltwlin 7987 ax-pre-lttrn 7988 ax-pre-apti 7989 ax-pre-ltadd 7990 ax-pre-mulgt0 7991 ax-pre-mulext 7992 ax-arch 7993 ax-caucvg 7994 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-if 3559 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-tr 4129 df-id 4325 df-po 4328 df-iso 4329 df-iord 4398 df-on 4400 df-ilim 4401 df-suc 4403 df-iom 4624 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-recs 6360 df-frec 6446 df-1o 6471 df-2o 6472 df-er 6589 df-en 6797 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-reap 8596 df-ap 8603 df-div 8694 df-inn 8985 df-2 9043 df-3 9044 df-4 9045 df-n0 9244 df-z 9321 df-uz 9596 df-q 9688 df-rp 9723 df-seqfrec 10522 df-exp 10613 df-cj 10989 df-re 10990 df-im 10991 df-rsqrt 11145 df-abs 11146 df-dvds 11934 df-prm 12249 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |