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 8724 | . . 3 ⊢ 1 ∈ ℕ | |
2 | nnz 9066 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | |
3 | 1dvds 11496 | . . . 4 ⊢ (𝑁 ∈ ℤ → 1 ∥ 𝑁) | |
4 | 2, 3 | syl 14 | . . 3 ⊢ (𝑁 ∈ ℕ → 1 ∥ 𝑁) |
5 | breq1 3927 | . . . . 5 ⊢ (𝑛 = 1 → (𝑛 ∥ 𝑁 ↔ 1 ∥ 𝑁)) | |
6 | 5 | elrab 2835 | . . . 4 ⊢ (1 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁} ↔ (1 ∈ ℕ ∧ 1 ∥ 𝑁)) |
7 | 6 | biimpri 132 | . . 3 ⊢ ((1 ∈ ℕ ∧ 1 ∥ 𝑁) → 1 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
8 | 1, 4, 7 | sylancr 410 | . 2 ⊢ (𝑁 ∈ ℕ → 1 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
9 | iddvds 11495 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∥ 𝑁) | |
10 | 2, 9 | syl 14 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∥ 𝑁) |
11 | breq1 3927 | . . . . 5 ⊢ (𝑛 = 𝑁 → (𝑛 ∥ 𝑁 ↔ 𝑁 ∥ 𝑁)) | |
12 | 11 | elrab 2835 | . . . 4 ⊢ (𝑁 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁} ↔ (𝑁 ∈ ℕ ∧ 𝑁 ∥ 𝑁)) |
13 | 12 | biimpri 132 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑁 ∥ 𝑁) → 𝑁 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
14 | 10, 13 | mpdan 417 | . 2 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
15 | prssi 3673 | . 2 ⊢ ((1 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁} ∧ 𝑁 ∈ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) → {1, 𝑁} ⊆ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) | |
16 | 8, 14, 15 | syl2anc 408 | 1 ⊢ (𝑁 ∈ ℕ → {1, 𝑁} ⊆ {𝑛 ∈ ℕ ∣ 𝑛 ∥ 𝑁}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∈ wcel 1480 {crab 2418 ⊆ wss 3066 {cpr 3523 class class class wbr 3924 1c1 7614 ℕcn 8713 ℤcz 9047 ∥ cdvds 11482 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-pow 4093 ax-pr 4126 ax-un 4350 ax-setind 4447 ax-cnex 7704 ax-resscn 7705 ax-1cn 7706 ax-1re 7707 ax-icn 7708 ax-addcl 7709 ax-addrcl 7710 ax-mulcl 7711 ax-addcom 7713 ax-mulcom 7714 ax-addass 7715 ax-mulass 7716 ax-distr 7717 ax-i2m1 7718 ax-0lt1 7719 ax-1rid 7720 ax-0id 7721 ax-rnegex 7722 ax-cnre 7724 ax-pre-ltirr 7725 ax-pre-ltwlin 7726 ax-pre-lttrn 7727 ax-pre-ltadd 7729 |
This theorem depends on definitions: df-bi 116 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ne 2307 df-nel 2402 df-ral 2419 df-rex 2420 df-reu 2421 df-rab 2423 df-v 2683 df-sbc 2905 df-dif 3068 df-un 3070 df-in 3072 df-ss 3079 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-int 3767 df-br 3925 df-opab 3985 df-id 4210 df-xp 4540 df-rel 4541 df-cnv 4542 df-co 4543 df-dm 4544 df-iota 5083 df-fun 5120 df-fv 5126 df-riota 5723 df-ov 5770 df-oprab 5771 df-mpo 5772 df-pnf 7795 df-mnf 7796 df-xr 7797 df-ltxr 7798 df-le 7799 df-sub 7928 df-neg 7929 df-inn 8714 df-z 9048 df-dvds 11483 |
This theorem is referenced by: isprm2 11787 |
Copyright terms: Public domain | W3C validator |