| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 1idssfct | Structured version Visualization version 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 12359 | . . 3 ⊢ 1 ∈ ℕ | |
| 2 | nnz 12727 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
| 3 | 1dvds 16455 | . . . 4 ⊢ (𝑁 ∈ ℤ → 1 ∥ 𝑁) | |
| 4 | 2, 3 | syl 18 | . . 3 ⊢ (𝑁 ∈ ℕ → 1 ∥ 𝑁) |
| 5 | breq1 5109 | . . . . 5 ⊢ (𝑛 = 1 → (𝑛 ∥ 𝑁 ↔ 1 ∥ 𝑁)) | |
| 6 | 5 | elrab 3648 | . . . 4 ⊢ (1 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁} ↔ (1 ∈ ℕ ∧ 1 ∥ 𝑁)) |
| 7 | 6 | biimpri 231 | . . 3 ⊢ ((1 ∈ ℕ ∧ 1 ∥ 𝑁) → 1 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
| 8 | 1, 4, 7 | sylancr 599 | . 2 ⊢ (𝑁 ∈ ℕ → 1 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
| 9 | iddvds 16454 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∥ 𝑁) | |
| 10 | 2, 9 | syl 18 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∥ 𝑁) |
| 11 | breq1 5109 | . . . . 5 ⊢ (𝑛 = 𝑁 → (𝑛 ∥ 𝑁 ↔ 𝑁 ∥ 𝑁)) | |
| 12 | 11 | elrab 3648 | . . . 4 ⊢ (𝑁 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁} ↔ (𝑁 ∈ ℕ ∧ 𝑁 ∥ 𝑁)) |
| 13 | 12 | biimpri 231 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑁 ∥ 𝑁) → 𝑁 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
| 14 | 10, 13 | mpdan 700 | . 2 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
| 15 | 8, 14 | prssd 4781 | 1 ⊢ (𝑁 ∈ ℕ → {1, 𝑁} ⊆ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2146 {crab 3416 ⊆ wss 3900 {cpr 4590 class class class wbr 5106 1c1 11214 ℕcn 12348 ℤcz 12706 ∥ cdvds 16437 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7761 ax-resscn 11270 ax-1cn 11271 ax-icn 11272 ax-addcl 11273 ax-addrcl 11274 ax-mulcl 11275 ax-mulrcl 11276 ax-mulcom 11277 ax-mulass 11279 ax-distr 11280 ax-i2m1 11281 ax-1ne0 11282 ax-1rid 11283 ax-rrecex 11285 ax-cnre 11286 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6311 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-ov 7433 df-om 7888 df-2nd 8012 df-frecs 8313 df-wrecs 8344 df-recs 8393 df-rdg 8432 df-neg 11557 df-nn 12349 df-z 12707 df-dvds 16438 |
| This theorem is used by: isprm2 16872 |
| Copyright terms: Public domain | W3C validator |