| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nndivdvds | GIF version | ||
| Description: Strong form of dvdsval2 11957 for positive integers. (Contributed by Stefan O'Rear, 13-Sep-2014.) |
| Ref | Expression |
|---|---|
| nndivdvds | ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℕ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnz 9347 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℤ) | |
| 2 | 1 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ∈ ℤ) |
| 3 | nnne0 9020 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ≠ 0) | |
| 4 | 3 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ≠ 0) |
| 5 | nnz 9347 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ) | |
| 6 | 5 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐴 ∈ ℤ) |
| 7 | dvdsval2 11957 | . . . 4 ⊢ ((𝐵 ∈ ℤ ∧ 𝐵 ≠ 0 ∧ 𝐴 ∈ ℤ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℤ)) | |
| 8 | 2, 4, 6, 7 | syl3anc 1249 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐴 / 𝐵) ∈ ℤ)) |
| 9 | 8 | anbi1d 465 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐵 ∥ 𝐴 ∧ 0 < (𝐴 / 𝐵)) ↔ ((𝐴 / 𝐵) ∈ ℤ ∧ 0 < (𝐴 / 𝐵)))) |
| 10 | nnre 8999 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℝ) | |
| 11 | 10 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐴 ∈ ℝ) |
| 12 | nnre 8999 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℝ) | |
| 13 | 12 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 𝐵 ∈ ℝ) |
| 14 | nngt0 9017 | . . . . 5 ⊢ (𝐴 ∈ ℕ → 0 < 𝐴) | |
| 15 | 14 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < 𝐴) |
| 16 | nngt0 9017 | . . . . 5 ⊢ (𝐵 ∈ ℕ → 0 < 𝐵) | |
| 17 | 16 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < 𝐵) |
| 18 | 11, 13, 15, 17 | divgt0d 8964 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → 0 < (𝐴 / 𝐵)) |
| 19 | 18 | biantrud 304 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (𝐵 ∥ 𝐴 ↔ (𝐵 ∥ 𝐴 ∧ 0 < (𝐴 / 𝐵)))) |
| 20 | elnnz 9338 | . . 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 2167 ≠ wne 2367 class class class wbr 4034 (class class class)co 5923 ℝcr 7880 0cc0 7881 < clt 8063 / cdiv 8701 ℕcn 8992 ℤcz 9328 ∥ cdvds 11954 |
| 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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-cnex 7972 ax-resscn 7973 ax-1cn 7974 ax-1re 7975 ax-icn 7976 ax-addcl 7977 ax-addrcl 7978 ax-mulcl 7979 ax-mulrcl 7980 ax-addcom 7981 ax-mulcom 7982 ax-addass 7983 ax-mulass 7984 ax-distr 7985 ax-i2m1 7986 ax-0lt1 7987 ax-1rid 7988 ax-0id 7989 ax-rnegex 7990 ax-precex 7991 ax-cnre 7992 ax-pre-ltirr 7993 ax-pre-ltwlin 7994 ax-pre-lttrn 7995 ax-pre-apti 7996 ax-pre-ltadd 7997 ax-pre-mulgt0 7998 ax-pre-mulext 7999 |
| This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-br 4035 df-opab 4096 df-id 4329 df-po 4332 df-iso 4333 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-iota 5220 df-fun 5261 df-fv 5267 df-riota 5878 df-ov 5926 df-oprab 5927 df-mpo 5928 df-pnf 8065 df-mnf 8066 df-xr 8067 df-ltxr 8068 df-le 8069 df-sub 8201 df-neg 8202 df-reap 8604 df-ap 8611 df-div 8702 df-inn 8993 df-n0 9252 df-z 9329 df-dvds 11955 |
| This theorem is referenced by: nndivides 11964 dvdsdivcl 12017 divgcdnn 12152 lcmgcdlem 12255 isprm6 12325 oddpwdclemodd 12350 oddpwdclemdc 12351 divnumden 12374 hashgcdlem 12416 hashgcdeq 12418 oddprmdvds 12533 infpnlem2 12539 infpn2 12683 znrrg 14226 mersenne 15243 perfectlem1 15245 perfect 15247 |
| Copyright terms: Public domain | W3C validator |