![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > 1idssfct | GIF version |
Description: The positive divisors of a positive integer include 1 and itself. (Contributed by Paul Chapman, 22-Jun-2011.) |
Ref | Expression |
---|---|
1idssfct | ⊢ (𝑁 ∈ ℕ → {1, 𝑁} ⊆ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1nn 8932 | . . 3 ⊢ 1 ∈ ℕ | |
2 | nnz 9274 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
3 | 1dvds 11814 | . . . 4 ⊢ (𝑁 ∈ ℤ → 1 ∥ 𝑁) | |
4 | 2, 3 | syl 14 | . . 3 ⊢ (𝑁 ∈ ℕ → 1 ∥ 𝑁) |
5 | breq1 4008 | . . . . 5 ⊢ (𝑛 = 1 → (𝑛 ∥ 𝑁 ↔ 1 ∥ 𝑁)) | |
6 | 5 | elrab 2895 | . . . 4 ⊢ (1 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁} ↔ (1 ∈ ℕ ∧ 1 ∥ 𝑁)) |
7 | 6 | biimpri 133 | . . 3 ⊢ ((1 ∈ ℕ ∧ 1 ∥ 𝑁) → 1 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
8 | 1, 4, 7 | sylancr 414 | . 2 ⊢ (𝑁 ∈ ℕ → 1 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
9 | iddvds 11813 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∥ 𝑁) | |
10 | 2, 9 | syl 14 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∥ 𝑁) |
11 | breq1 4008 | . . . . 5 ⊢ (𝑛 = 𝑁 → (𝑛 ∥ 𝑁 ↔ 𝑁 ∥ 𝑁)) | |
12 | 11 | elrab 2895 | . . . 4 ⊢ (𝑁 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁} ↔ (𝑁 ∈ ℕ ∧ 𝑁 ∥ 𝑁)) |
13 | 12 | biimpri 133 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑁 ∥ 𝑁) → 𝑁 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
14 | 10, 13 | mpdan 421 | . 2 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
15 | prssi 3752 | . 2 ⊢ ((1 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁} ∧ 𝑁 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) → {1, 𝑁} ⊆ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) | |
16 | 8, 14, 15 | syl2anc 411 | 1 ⊢ (𝑁 ∈ ℕ → {1, 𝑁} ⊆ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2148 {crab 2459 ⊆ wss 3131 {cpr 3595 class class class wbr 4005 1c1 7814 ℕcn 8921 ℤcz 9255 ∥ cdvds 11796 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-cnex 7904 ax-resscn 7905 ax-1cn 7906 ax-1re 7907 ax-icn 7908 ax-addcl 7909 ax-addrcl 7910 ax-mulcl 7911 ax-addcom 7913 ax-mulcom 7914 ax-addass 7915 ax-mulass 7916 ax-distr 7917 ax-i2m1 7918 ax-0lt1 7919 ax-1rid 7920 ax-0id 7921 ax-rnegex 7922 ax-cnre 7924 ax-pre-ltirr 7925 ax-pre-ltwlin 7926 ax-pre-lttrn 7927 ax-pre-ltadd 7929 |
This theorem depends on definitions: df-bi 117 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2741 df-sbc 2965 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-br 4006 df-opab 4067 df-id 4295 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-iota 5180 df-fun 5220 df-fv 5226 df-riota 5833 df-ov 5880 df-oprab 5881 df-mpo 5882 df-pnf 7996 df-mnf 7997 df-xr 7998 df-ltxr 7999 df-le 8000 df-sub 8132 df-neg 8133 df-inn 8922 df-z 9256 df-dvds 11797 |
This theorem is referenced by: isprm2 12119 |
Copyright terms: Public domain | W3C validator |