| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nndivdvds | GIF version | ||
| Description: Strong form of dvdsval2 12352 for positive integers. (Contributed by Stefan O'Rear, 13-Sep-2014.) |
| Ref | Expression |
|---|---|
| nndivdvds | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℕ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnz 9498 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ) | |
| 2 | 1 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ∈ ℤ) |
| 3 | nnne0 9171 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ≠ 0) | |
| 4 | 3 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ≠ 0) |
| 5 | nnz 9498 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ) | |
| 6 | 5 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐴 ∈ ℤ) |
| 7 | dvdsval2 12352 | . . . 4 ⊢ ((𝐵 ∈ ℤ ∧ 𝐵 ≠ 0 ∧ 𝐴 ∈ ℤ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℤ)) | |
| 8 | 2, 4, 6, 7 | syl3anc 1273 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℤ)) |
| 9 | 8 | anbi1d 465 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐵 ∥ 𝐴 ∧ 0 < (𝐴 / 𝐵)) ↔ ((𝐴 / 𝐵) ∈ ℤ ∧ 0 < (𝐴 / 𝐵)))) |
| 10 | nnre 9150 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℝ) | |
| 11 | 10 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐴 ∈ ℝ) |
| 12 | nnre 9150 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℝ) | |
| 13 | 12 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ∈ ℝ) |
| 14 | nngt0 9168 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 0 < 𝐴) | |
| 15 | 14 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < 𝐴) |
| 16 | nngt0 9168 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 0 < 𝐵) | |
| 17 | 16 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < 𝐵) |
| 18 | 11, 13, 15, 17 | divgt0d 9115 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < (𝐴 / 𝐵)) |
| 19 | 18 | biantrud 304 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐵 ∥ 𝐴 ∧ 0 < (𝐴 / 𝐵)))) |
| 20 | elnnz 9489 | . . 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 2202 ≠ wne 2402 class class class wbr 4088 (class class class)co 6018 ℝcr 8031 0cc0 8032 < clt 8214 / cdiv 8852 ℕcn 9143 ℤcz 9479 ∥ cdvds 12349 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 ax-pre-mulext 8150 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-id 4390 df-po 4393 df-iso 4394 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-iota 5286 df-fun 5328 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-div 8853 df-inn 9144 df-n0 9403 df-z 9480 df-dvds 12350 |
| This theorem is referenced by: nndivides 12359 dvdsdivcl 12412 divgcdnn 12547 lcmgcdlem 12650 isprm6 12720 oddpwdclemodd 12745 oddpwdclemdc 12746 divnumden 12769 hashgcdlem 12811 hashgcdeq 12813 oddprmdvds 12928 infpnlem2 12934 infpn2 13078 znrrg 14676 mersenne 15723 perfectlem1 15725 perfect 15727 |
| Copyright terms: Public domain | W3C validator |