| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nndivdvds | GIF version | ||
| Description: Strong form of dvdsval2 12480 for positive integers. (Contributed by Stefan O'Rear, 13-Sep-2014.) |
| Ref | Expression |
|---|---|
| nndivdvds | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℕ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnz 9598 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ) | |
| 2 | 1 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ∈ ℤ) |
| 3 | nnne0 9267 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ≠ 0) | |
| 4 | 3 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ≠ 0) |
| 5 | nnz 9598 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ) | |
| 6 | 5 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐴 ∈ ℤ) |
| 7 | dvdsval2 12480 | . . . 4 ⊢ ((𝐵 ∈ ℤ ∧ 𝐵 ≠ 0 ∧ 𝐴 ∈ ℤ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℤ)) | |
| 8 | 2, 4, 6, 7 | syl3anc 1274 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℤ)) |
| 9 | 8 | anbi1d 465 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐵 ∥ 𝐴 ∧ 0 < (𝐴 / 𝐵)) ↔ ((𝐴 / 𝐵) ∈ ℤ ∧ 0 < (𝐴 / 𝐵)))) |
| 10 | nnre 9246 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℝ) | |
| 11 | 10 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐴 ∈ ℝ) |
| 12 | nnre 9246 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℝ) | |
| 13 | 12 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ∈ ℝ) |
| 14 | nngt0 9264 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 0 < 𝐴) | |
| 15 | 14 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < 𝐴) |
| 16 | nngt0 9264 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 0 < 𝐵) | |
| 17 | 16 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < 𝐵) |
| 18 | 11, 13, 15, 17 | divgt0d 9211 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < (𝐴 / 𝐵)) |
| 19 | 18 | biantrud 304 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐵 ∥ 𝐴 ∧ 0 < (𝐴 / 𝐵)))) |
| 20 | elnnz 9589 | . . 3 ⊢ ((𝐴 / 𝐵) ∈ ℕ ↔ ((𝐴 / 𝐵) ∈ ℤ ∧ 0 < (𝐴 / 𝐵))) | |
| 21 | 20 | a1i 9 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 / 𝐵) ∈ ℕ ↔ ((𝐴 / 𝐵) ∈ ℤ ∧ 0 < (𝐴 / 𝐵)))) |
| 22 | 9, 19, 21 | 3bitr4d 220 | 1 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℕ)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2205 ≠ wne 2414 class class class wbr 4111 (class class class)co 6052 ℝcr 8128 0cc0 8129 < clt 8310 / cdiv 8948 ℕcn 9239 ℤcz 9579 ∥ cdvds 12477 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-cnex 8220 ax-resscn 8221 ax-1cn 8222 ax-1re 8223 ax-icn 8224 ax-addcl 8225 ax-addrcl 8226 ax-mulcl 8227 ax-mulrcl 8228 ax-addcom 8229 ax-mulcom 8230 ax-addass 8231 ax-mulass 8232 ax-distr 8233 ax-i2m1 8234 ax-0lt1 8235 ax-1rid 8236 ax-0id 8237 ax-rnegex 8238 ax-precex 8239 ax-cnre 8240 ax-pre-ltirr 8241 ax-pre-ltwlin 8242 ax-pre-lttrn 8243 ax-pre-apti 8244 ax-pre-ltadd 8245 ax-pre-mulgt0 8246 ax-pre-mulext 8247 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3045 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-br 4112 df-opab 4174 df-id 4416 df-po 4419 df-iso 4420 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-iota 5314 df-fun 5356 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-pnf 8312 df-mnf 8313 df-xr 8314 df-ltxr 8315 df-le 8316 df-sub 8448 df-neg 8449 df-reap 8851 df-ap 8858 df-div 8949 df-inn 9240 df-n0 9499 df-z 9580 df-dvds 12478 |
| This theorem is referenced by: nndivides 12487 dvdsdivcl 12540 divgcdnn 12675 lcmgcdlem 12778 isprm6 12848 oddpwdclemodd 12873 oddpwdclemdc 12874 divnumden 12897 hashgcdlem 12939 hashgcdeq 12941 oddprmdvds 13056 infpnlem2 13062 infpn2 13224 znrrg 14825 mersenne 15882 perfectlem1 15884 perfect 15886 |
| Copyright terms: Public domain | W3C validator |