![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > isprm4 | GIF version |
Description: The predicate "is a prime number". A prime number is an integer greater than or equal to 2 whose only divisor greater than or equal to 2 is itself. (Contributed by Paul Chapman, 26-Oct-2012.) |
Ref | Expression |
---|---|
isprm4 | ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑧 ∈ (ℤ≥‘2)(𝑧 ∥ 𝑃 → 𝑧 = 𝑃))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isprm2 12149 | . 2 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑧 ∈ ℕ (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))) | |
2 | eluz2nn 9596 | . . . . . . . 8 ⊢ (𝑧 ∈ (ℤ≥‘2) → 𝑧 ∈ ℕ) | |
3 | 2 | pm4.71ri 392 | . . . . . . 7 ⊢ (𝑧 ∈ (ℤ≥‘2) ↔ (𝑧 ∈ ℕ ∧ 𝑧 ∈ (ℤ≥‘2))) |
4 | 3 | imbi1i 238 | . . . . . 6 ⊢ ((𝑧 ∈ (ℤ≥‘2) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ ((𝑧 ∈ ℕ ∧ 𝑧 ∈ (ℤ≥‘2)) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃))) |
5 | impexp 263 | . . . . . 6 ⊢ (((𝑧 ∈ ℕ ∧ 𝑧 ∈ (ℤ≥‘2)) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∈ ℕ → (𝑧 ∈ (ℤ≥‘2) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)))) | |
6 | 4, 5 | bitri 184 | . . . . 5 ⊢ ((𝑧 ∈ (ℤ≥‘2) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∈ ℕ → (𝑧 ∈ (ℤ≥‘2) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)))) |
7 | eluz2b3 9634 | . . . . . . . 8 ⊢ (𝑧 ∈ (ℤ≥‘2) ↔ (𝑧 ∈ ℕ ∧ 𝑧 ≠ 1)) | |
8 | 7 | imbi1i 238 | . . . . . . 7 ⊢ ((𝑧 ∈ (ℤ≥‘2) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ ((𝑧 ∈ ℕ ∧ 𝑧 ≠ 1) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃))) |
9 | impexp 263 | . . . . . . . 8 ⊢ (((𝑧 ∈ ℕ ∧ 𝑧 ≠ 1) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∈ ℕ → (𝑧 ≠ 1 → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)))) | |
10 | bi2.04 248 | . . . . . . . . . 10 ⊢ ((𝑧 ≠ 1 → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∥ 𝑃 → (𝑧 ≠ 1 → 𝑧 = 𝑃))) | |
11 | df-ne 2361 | . . . . . . . . . . . . 13 ⊢ (𝑧 ≠ 1 ↔ ¬ 𝑧 = 1) | |
12 | 11 | imbi1i 238 | . . . . . . . . . . . 12 ⊢ ((𝑧 ≠ 1 → 𝑧 = 𝑃) ↔ (¬ 𝑧 = 1 → 𝑧 = 𝑃)) |
13 | nnz 9302 | . . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ ℕ → 𝑧 ∈ ℤ) | |
14 | 1zzd 9310 | . . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ ℕ → 1 ∈ ℤ) | |
15 | zdceq 9358 | . . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ ℤ ∧ 1 ∈ ℤ) → DECID 𝑧 = 1) | |
16 | 13, 14, 15 | syl2anc 411 | . . . . . . . . . . . . 13 ⊢ (𝑧 ∈ ℕ → DECID 𝑧 = 1) |
17 | dfordc 893 | . . . . . . . . . . . . 13 ⊢ (DECID 𝑧 = 1 → ((𝑧 = 1 ∨ 𝑧 = 𝑃) ↔ (¬ 𝑧 = 1 → 𝑧 = 𝑃))) | |
18 | 16, 17 | syl 14 | . . . . . . . . . . . 12 ⊢ (𝑧 ∈ ℕ → ((𝑧 = 1 ∨ 𝑧 = 𝑃) ↔ (¬ 𝑧 = 1 → 𝑧 = 𝑃))) |
19 | 12, 18 | bitr4id 199 | . . . . . . . . . . 11 ⊢ (𝑧 ∈ ℕ → ((𝑧 ≠ 1 → 𝑧 = 𝑃) ↔ (𝑧 = 1 ∨ 𝑧 = 𝑃))) |
20 | 19 | imbi2d 230 | . . . . . . . . . 10 ⊢ (𝑧 ∈ ℕ → ((𝑧 ∥ 𝑃 → (𝑧 ≠ 1 → 𝑧 = 𝑃)) ↔ (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))) |
21 | 10, 20 | bitrid 192 | . . . . . . . . 9 ⊢ (𝑧 ∈ ℕ → ((𝑧 ≠ 1 → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))) |
22 | 21 | imbi2d 230 | . . . . . . . 8 ⊢ (𝑧 ∈ ℕ → ((𝑧 ∈ ℕ → (𝑧 ≠ 1 → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃))) ↔ (𝑧 ∈ ℕ → (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃))))) |
23 | 9, 22 | bitrid 192 | . . . . . . 7 ⊢ (𝑧 ∈ ℕ → (((𝑧 ∈ ℕ ∧ 𝑧 ≠ 1) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∈ ℕ → (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃))))) |
24 | 8, 23 | bitrid 192 | . . . . . 6 ⊢ (𝑧 ∈ ℕ → ((𝑧 ∈ (ℤ≥‘2) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∈ ℕ → (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃))))) |
25 | 24 | pm5.74i 180 | . . . . 5 ⊢ ((𝑧 ∈ ℕ → (𝑧 ∈ (ℤ≥‘2) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃))) ↔ (𝑧 ∈ ℕ → (𝑧 ∈ ℕ → (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃))))) |
26 | pm5.4 249 | . . . . 5 ⊢ ((𝑧 ∈ ℕ → (𝑧 ∈ ℕ → (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))) ↔ (𝑧 ∈ ℕ → (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))) | |
27 | 6, 25, 26 | 3bitri 206 | . . . 4 ⊢ ((𝑧 ∈ (ℤ≥‘2) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∈ ℕ → (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))) |
28 | 27 | ralbii2 2500 | . . 3 ⊢ (∀𝑧 ∈ (ℤ≥‘2)(𝑧 ∥ 𝑃 → 𝑧 = 𝑃) ↔ ∀𝑧 ∈ ℕ (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃))) |
29 | 28 | anbi2i 457 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑧 ∈ (ℤ≥‘2)(𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑧 ∈ ℕ (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))) |
30 | 1, 29 | bitr4i 187 | 1 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑧 ∈ (ℤ≥‘2)(𝑧 ∥ 𝑃 → 𝑧 = 𝑃))) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 DECID wdc 835 = wceq 1364 ∈ wcel 2160 ≠ wne 2360 ∀wral 2468 class class class wbr 4018 ‘cfv 5235 1c1 7842 ℕcn 8949 2c2 9000 ℤcz 9283 ℤ≥cuz 9558 ∥ cdvds 11826 ℙcprime 12139 |
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 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-nul 4144 ax-pow 4192 ax-pr 4227 ax-un 4451 ax-setind 4554 ax-iinf 4605 ax-cnex 7932 ax-resscn 7933 ax-1cn 7934 ax-1re 7935 ax-icn 7936 ax-addcl 7937 ax-addrcl 7938 ax-mulcl 7939 ax-mulrcl 7940 ax-addcom 7941 ax-mulcom 7942 ax-addass 7943 ax-mulass 7944 ax-distr 7945 ax-i2m1 7946 ax-0lt1 7947 ax-1rid 7948 ax-0id 7949 ax-rnegex 7950 ax-precex 7951 ax-cnre 7952 ax-pre-ltirr 7953 ax-pre-ltwlin 7954 ax-pre-lttrn 7955 ax-pre-apti 7956 ax-pre-ltadd 7957 ax-pre-mulgt0 7958 ax-pre-mulext 7959 ax-arch 7960 ax-caucvg 7961 |
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 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rmo 2476 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-if 3550 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-tr 4117 df-id 4311 df-po 4314 df-iso 4315 df-iord 4384 df-on 4386 df-ilim 4387 df-suc 4389 df-iom 4608 df-xp 4650 df-rel 4651 df-cnv 4652 df-co 4653 df-dm 4654 df-rn 4655 df-res 4656 df-ima 4657 df-iota 5196 df-fun 5237 df-fn 5238 df-f 5239 df-f1 5240 df-fo 5241 df-f1o 5242 df-fv 5243 df-riota 5852 df-ov 5899 df-oprab 5900 df-mpo 5901 df-1st 6165 df-2nd 6166 df-recs 6330 df-frec 6416 df-1o 6441 df-2o 6442 df-er 6559 df-en 6767 df-pnf 8024 df-mnf 8025 df-xr 8026 df-ltxr 8027 df-le 8028 df-sub 8160 df-neg 8161 df-reap 8562 df-ap 8569 df-div 8660 df-inn 8950 df-2 9008 df-3 9009 df-4 9010 df-n0 9207 df-z 9284 df-uz 9559 df-q 9650 df-rp 9684 df-seqfrec 10477 df-exp 10551 df-cj 10883 df-re 10884 df-im 10885 df-rsqrt 11039 df-abs 11040 df-dvds 11827 df-prm 12140 |
This theorem is referenced by: nprm 12155 prmuz2 12163 dvdsprm 12169 |
Copyright terms: Public domain | W3C validator |