![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > dvdsdivcl | GIF version |
Description: The complement of a divisor of 𝑁 is also a divisor of 𝑁. (Contributed by Mario Carneiro, 2-Jul-2015.) (Proof shortened by AV, 9-Aug-2021.) |
Ref | Expression |
---|---|
dvdsdivcl | ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑁}) → (𝑁 / 𝐴) ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑁}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq1 4033 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∥ 𝑁 ↔ 𝐴 ∥ 𝑁)) | |
2 | 1 | elrab 2917 | . . . 4 ⊢ (𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑁} ↔ (𝐴 ∈ ℕ ∧ 𝐴 ∥ 𝑁)) |
3 | nndivdvds 11942 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℕ) → (𝐴 ∥ 𝑁 ↔ (𝑁 / 𝐴) ∈ ℕ)) | |
4 | 3 | biimpd 144 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℕ) → (𝐴 ∥ 𝑁 → (𝑁 / 𝐴) ∈ ℕ)) |
5 | 4 | expcom 116 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → (𝑁 ∈ ℕ → (𝐴 ∥ 𝑁 → (𝑁 / 𝐴) ∈ ℕ))) |
6 | 5 | com23 78 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → (𝐴 ∥ 𝑁 → (𝑁 ∈ ℕ → (𝑁 / 𝐴) ∈ ℕ))) |
7 | 6 | imp 124 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐴 ∥ 𝑁) → (𝑁 ∈ ℕ → (𝑁 / 𝐴) ∈ ℕ)) |
8 | nnne0 9012 | . . . . . . . 8 ⊢ (𝐴 ∈ ℕ → 𝐴 ≠ 0) | |
9 | 8 | anim1i 340 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐴 ∥ 𝑁) → (𝐴 ≠ 0 ∧ 𝐴 ∥ 𝑁)) |
10 | 9 | ancomd 267 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐴 ∥ 𝑁) → (𝐴 ∥ 𝑁 ∧ 𝐴 ≠ 0)) |
11 | divconjdvds 11994 | . . . . . 6 ⊢ ((𝐴 ∥ 𝑁 ∧ 𝐴 ≠ 0) → (𝑁 / 𝐴) ∥ 𝑁) | |
12 | 10, 11 | syl 14 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐴 ∥ 𝑁) → (𝑁 / 𝐴) ∥ 𝑁) |
13 | 7, 12 | jctird 317 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐴 ∥ 𝑁) → (𝑁 ∈ ℕ → ((𝑁 / 𝐴) ∈ ℕ ∧ (𝑁 / 𝐴) ∥ 𝑁))) |
14 | 2, 13 | sylbi 121 | . . 3 ⊢ (𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑁} → (𝑁 ∈ ℕ → ((𝑁 / 𝐴) ∈ ℕ ∧ (𝑁 / 𝐴) ∥ 𝑁))) |
15 | 14 | impcom 125 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑁}) → ((𝑁 / 𝐴) ∈ ℕ ∧ (𝑁 / 𝐴) ∥ 𝑁)) |
16 | breq1 4033 | . . 3 ⊢ (𝑥 = (𝑁 / 𝐴) → (𝑥 ∥ 𝑁 ↔ (𝑁 / 𝐴) ∥ 𝑁)) | |
17 | 16 | elrab 2917 | . 2 ⊢ ((𝑁 / 𝐴) ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑁} ↔ ((𝑁 / 𝐴) ∈ ℕ ∧ (𝑁 / 𝐴) ∥ 𝑁)) |
18 | 15, 17 | sylibr 134 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑁}) → (𝑁 / 𝐴) ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑁}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2164 ≠ wne 2364 {crab 2476 class class class wbr 4030 (class class class)co 5919 0cc0 7874 / cdiv 8693 ℕcn 8984 ∥ cdvds 11933 |
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-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 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 |
This theorem depends on definitions: df-bi 117 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-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-br 4031 df-opab 4092 df-id 4325 df-po 4328 df-iso 4329 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-iota 5216 df-fun 5257 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 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-n0 9244 df-z 9321 df-dvds 11934 |
This theorem is referenced by: dvdsflip 11996 |
Copyright terms: Public domain | W3C validator |