Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nndivdvds | GIF version |
Description: Strong form of dvdsval2 11730 for positive integers. (Contributed by Stefan O'Rear, 13-Sep-2014.) |
Ref | Expression |
---|---|
nndivdvds | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℕ)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnz 9210 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ) | |
2 | 1 | adantl 275 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ∈ ℤ) |
3 | nnne0 8885 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ≠ 0) | |
4 | 3 | adantl 275 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ≠ 0) |
5 | nnz 9210 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ) | |
6 | 5 | adantr 274 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐴 ∈ ℤ) |
7 | dvdsval2 11730 | . . . 4 ⊢ ((𝐵 ∈ ℤ ∧ 𝐵 ≠ 0 ∧ 𝐴 ∈ ℤ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℤ)) | |
8 | 2, 4, 6, 7 | syl3anc 1228 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℤ)) |
9 | 8 | anbi1d 461 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐵 ∥ 𝐴 ∧ 0 < (𝐴 / 𝐵)) ↔ ((𝐴 / 𝐵) ∈ ℤ ∧ 0 < (𝐴 / 𝐵)))) |
10 | nnre 8864 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℝ) | |
11 | 10 | adantr 274 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐴 ∈ ℝ) |
12 | nnre 8864 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℝ) | |
13 | 12 | adantl 275 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ∈ ℝ) |
14 | nngt0 8882 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 0 < 𝐴) | |
15 | 14 | adantr 274 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < 𝐴) |
16 | nngt0 8882 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 0 < 𝐵) | |
17 | 16 | adantl 275 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < 𝐵) |
18 | 11, 13, 15, 17 | divgt0d 8830 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < (𝐴 / 𝐵)) |
19 | 18 | biantrud 302 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐵 ∥ 𝐴 ∧ 0 < (𝐴 / 𝐵)))) |
20 | elnnz 9201 | . . 3 ⊢ ((𝐴 / 𝐵) ∈ ℕ ↔ ((𝐴 / 𝐵) ∈ ℤ ∧ 0 < (𝐴 / 𝐵))) | |
21 | 20 | a1i 9 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 / 𝐵) ∈ ℕ ↔ ((𝐴 / 𝐵) ∈ ℤ ∧ 0 < (𝐴 / 𝐵)))) |
22 | 9, 19, 21 | 3bitr4d 219 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℕ)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∈ wcel 2136 ≠ wne 2336 class class class wbr 3982 (class class class)co 5842 ℝcr 7752 0cc0 7753 < clt 7933 / cdiv 8568 ℕcn 8857 ℤcz 9191 ∥ cdvds 11727 |
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 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 ax-un 4411 ax-setind 4514 ax-cnex 7844 ax-resscn 7845 ax-1cn 7846 ax-1re 7847 ax-icn 7848 ax-addcl 7849 ax-addrcl 7850 ax-mulcl 7851 ax-mulrcl 7852 ax-addcom 7853 ax-mulcom 7854 ax-addass 7855 ax-mulass 7856 ax-distr 7857 ax-i2m1 7858 ax-0lt1 7859 ax-1rid 7860 ax-0id 7861 ax-rnegex 7862 ax-precex 7863 ax-cnre 7864 ax-pre-ltirr 7865 ax-pre-ltwlin 7866 ax-pre-lttrn 7867 ax-pre-apti 7868 ax-pre-ltadd 7869 ax-pre-mulgt0 7870 ax-pre-mulext 7871 |
This theorem depends on definitions: df-bi 116 df-3or 969 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-nel 2432 df-ral 2449 df-rex 2450 df-reu 2451 df-rmo 2452 df-rab 2453 df-v 2728 df-sbc 2952 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-int 3825 df-br 3983 df-opab 4044 df-id 4271 df-po 4274 df-iso 4275 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-iota 5153 df-fun 5190 df-fv 5196 df-riota 5798 df-ov 5845 df-oprab 5846 df-mpo 5847 df-pnf 7935 df-mnf 7936 df-xr 7937 df-ltxr 7938 df-le 7939 df-sub 8071 df-neg 8072 df-reap 8473 df-ap 8480 df-div 8569 df-inn 8858 df-n0 9115 df-z 9192 df-dvds 11728 |
This theorem is referenced by: nndivides 11737 dvdsdivcl 11788 divgcdnn 11908 lcmgcdlem 12009 isprm6 12079 oddpwdclemodd 12104 oddpwdclemdc 12105 divnumden 12128 hashgcdlem 12170 hashgcdeq 12171 oddprmdvds 12284 infpnlem2 12290 infpn2 12389 |
Copyright terms: Public domain | W3C validator |