![]() |
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 4020 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∥ 𝑁 ↔ 𝐴 ∥ 𝑁)) | |
2 | 1 | elrab 2907 | . . . 4 ⊢ (𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑁} ↔ (𝐴 ∈ ℕ ∧ 𝐴 ∥ 𝑁)) |
3 | nndivdvds 11820 | . . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℕ) → (𝐴 ∥ 𝑁 ↔ (𝑁 / 𝐴) ∈ ℕ)) | |
4 | 3 | biimpd 144 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℕ) → (𝐴 ∥ 𝑁 → (𝑁 / 𝐴) ∈ ℕ)) |
5 | 4 | expcom 116 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → (𝑁 ∈ ℕ → (𝐴 ∥ 𝑁 → (𝑁 / 𝐴) ∈ ℕ))) |
6 | 5 | com23 78 | . . . . . 6 ⊢ (𝐴 ∈ ℕ → (𝐴 ∥ 𝑁 → (𝑁 ∈ ℕ → (𝑁 / 𝐴) ∈ ℕ))) |
7 | 6 | imp 124 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐴 ∥ 𝑁) → (𝑁 ∈ ℕ → (𝑁 / 𝐴) ∈ ℕ)) |
8 | nnne0 8964 | . . . . . . . 8 ⊢ (𝐴 ∈ ℕ → 𝐴 ≠ 0) | |
9 | 8 | anim1i 340 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐴 ∥ 𝑁) → (𝐴 ≠ 0 ∧ 𝐴 ∥ 𝑁)) |
10 | 9 | ancomd 267 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐴 ∥ 𝑁) → (𝐴 ∥ 𝑁 ∧ 𝐴 ≠ 0)) |
11 | divconjdvds 11872 | . . . . . 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 4020 | . . 3 ⊢ (𝑥 = (𝑁 / 𝐴) → (𝑥 ∥ 𝑁 ↔ (𝑁 / 𝐴) ∥ 𝑁)) | |
17 | 16 | elrab 2907 | . 2 ⊢ ((𝑁 / 𝐴) ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑁} ↔ ((𝑁 / 𝐴) ∈ ℕ ∧ (𝑁 / 𝐴) ∥ 𝑁)) |
18 | 15, 17 | sylibr 134 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑁}) → (𝑁 / 𝐴) ∈ {𝑥 ∈ ℕ ∣ 𝑥 ∥ 𝑁}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2159 ≠ wne 2359 {crab 2471 class class class wbr 4017 (class class class)co 5890 0cc0 7828 / cdiv 8646 ℕcn 8936 ∥ cdvds 11811 |
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 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2161 ax-14 2162 ax-ext 2170 ax-sep 4135 ax-pow 4188 ax-pr 4223 ax-un 4447 ax-setind 4550 ax-cnex 7919 ax-resscn 7920 ax-1cn 7921 ax-1re 7922 ax-icn 7923 ax-addcl 7924 ax-addrcl 7925 ax-mulcl 7926 ax-mulrcl 7927 ax-addcom 7928 ax-mulcom 7929 ax-addass 7930 ax-mulass 7931 ax-distr 7932 ax-i2m1 7933 ax-0lt1 7934 ax-1rid 7935 ax-0id 7936 ax-rnegex 7937 ax-precex 7938 ax-cnre 7939 ax-pre-ltirr 7940 ax-pre-ltwlin 7941 ax-pre-lttrn 7942 ax-pre-apti 7943 ax-pre-ltadd 7944 ax-pre-mulgt0 7945 ax-pre-mulext 7946 |
This theorem depends on definitions: df-bi 117 df-3or 980 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2040 df-mo 2041 df-clab 2175 df-cleq 2181 df-clel 2184 df-nfc 2320 df-ne 2360 df-nel 2455 df-ral 2472 df-rex 2473 df-reu 2474 df-rmo 2475 df-rab 2476 df-v 2753 df-sbc 2977 df-dif 3145 df-un 3147 df-in 3149 df-ss 3156 df-pw 3591 df-sn 3612 df-pr 3613 df-op 3615 df-uni 3824 df-int 3859 df-br 4018 df-opab 4079 df-id 4307 df-po 4310 df-iso 4311 df-xp 4646 df-rel 4647 df-cnv 4648 df-co 4649 df-dm 4650 df-iota 5192 df-fun 5232 df-fv 5238 df-riota 5846 df-ov 5893 df-oprab 5894 df-mpo 5895 df-pnf 8011 df-mnf 8012 df-xr 8013 df-ltxr 8014 df-le 8015 df-sub 8147 df-neg 8148 df-reap 8549 df-ap 8556 df-div 8647 df-inn 8937 df-n0 9194 df-z 9271 df-dvds 11812 |
This theorem is referenced by: dvdsflip 11874 |
Copyright terms: Public domain | W3C validator |