![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nndivtr | GIF version |
Description: Transitive property of divisibility: if 𝐴 divides 𝐵 and 𝐵 divides 𝐶, then 𝐴 divides 𝐶. Typically, 𝐶 would be an integer, although the theorem holds for complex 𝐶. (Contributed by NM, 3-May-2005.) |
Ref | Expression |
---|---|
nndivtr | ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) ∧ ((𝐵 / 𝐴) ∈ ℕ ∧ (𝐶 / 𝐵) ∈ ℕ)) → (𝐶 / 𝐴) ∈ ℕ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnmulcl 9003 | . . 3 ⊢ (((𝐵 / 𝐴) ∈ ℕ ∧ (𝐶 / 𝐵) ∈ ℕ) → ((𝐵 / 𝐴) · (𝐶 / 𝐵)) ∈ ℕ) | |
2 | nncn 8990 | . . . . . . 7 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℂ) | |
3 | 2 | 3ad2ant2 1021 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℂ) |
4 | simp3 1001 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ) | |
5 | nncn 8990 | . . . . . . . 8 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ) | |
6 | nnap0 9011 | . . . . . . . 8 ⊢ (𝐴 ∈ ℕ → 𝐴 # 0) | |
7 | 5, 6 | jca 306 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → (𝐴 ∈ ℂ ∧ 𝐴 # 0)) |
8 | 7 | 3ad2ant1 1020 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (𝐴 ∈ ℂ ∧ 𝐴 # 0)) |
9 | nnap0 9011 | . . . . . . . 8 ⊢ (𝐵 ∈ ℕ → 𝐵 # 0) | |
10 | 2, 9 | jca 306 | . . . . . . 7 ⊢ (𝐵 ∈ ℕ → (𝐵 ∈ ℂ ∧ 𝐵 # 0)) |
11 | 10 | 3ad2ant2 1021 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (𝐵 ∈ ℂ ∧ 𝐵 # 0)) |
12 | divmul24ap 8735 | . . . . . 6 ⊢ (((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0))) → ((𝐵 / 𝐴) · (𝐶 / 𝐵)) = ((𝐵 / 𝐵) · (𝐶 / 𝐴))) | |
13 | 3, 4, 8, 11, 12 | syl22anc 1250 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → ((𝐵 / 𝐴) · (𝐶 / 𝐵)) = ((𝐵 / 𝐵) · (𝐶 / 𝐴))) |
14 | 2, 9 | dividapd 8805 | . . . . . . 7 ⊢ (𝐵 ∈ ℕ → (𝐵 / 𝐵) = 1) |
15 | 14 | oveq1d 5933 | . . . . . 6 ⊢ (𝐵 ∈ ℕ → ((𝐵 / 𝐵) · (𝐶 / 𝐴)) = (1 · (𝐶 / 𝐴))) |
16 | 15 | 3ad2ant2 1021 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → ((𝐵 / 𝐵) · (𝐶 / 𝐴)) = (1 · (𝐶 / 𝐴))) |
17 | divclap 8697 | . . . . . . . . . 10 ⊢ ((𝐶 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐴 # 0) → (𝐶 / 𝐴) ∈ ℂ) | |
18 | 17 | 3expb 1206 | . . . . . . . . 9 ⊢ ((𝐶 ∈ ℂ ∧ (𝐴 ∈ ℂ ∧ 𝐴 # 0)) → (𝐶 / 𝐴) ∈ ℂ) |
19 | 7, 18 | sylan2 286 | . . . . . . . 8 ⊢ ((𝐶 ∈ ℂ ∧ 𝐴 ∈ ℕ) → (𝐶 / 𝐴) ∈ ℂ) |
20 | 19 | ancoms 268 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (𝐶 / 𝐴) ∈ ℂ) |
21 | 20 | mulid2d 8038 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (1 · (𝐶 / 𝐴)) = (𝐶 / 𝐴)) |
22 | 21 | 3adant2 1018 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (1 · (𝐶 / 𝐴)) = (𝐶 / 𝐴)) |
23 | 13, 16, 22 | 3eqtrd 2230 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → ((𝐵 / 𝐴) · (𝐶 / 𝐵)) = (𝐶 / 𝐴)) |
24 | 23 | eleq1d 2262 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (((𝐵 / 𝐴) · (𝐶 / 𝐵)) ∈ ℕ ↔ (𝐶 / 𝐴) ∈ ℕ)) |
25 | 1, 24 | imbitrid 154 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (((𝐵 / 𝐴) ∈ ℕ ∧ (𝐶 / 𝐵) ∈ ℕ) → (𝐶 / 𝐴) ∈ ℕ)) |
26 | 25 | imp 124 | 1 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) ∧ ((𝐵 / 𝐴) ∈ ℕ ∧ (𝐶 / 𝐵) ∈ ℕ)) → (𝐶 / 𝐴) ∈ ℕ) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 class class class wbr 4029 (class class class)co 5918 ℂcc 7870 0cc0 7872 1c1 7873 · cmul 7877 # cap 8600 / cdiv 8691 ℕcn 8982 |
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 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-mulrcl 7971 ax-addcom 7972 ax-mulcom 7973 ax-addass 7974 ax-mulass 7975 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-1rid 7979 ax-0id 7980 ax-rnegex 7981 ax-precex 7982 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-apti 7987 ax-pre-ltadd 7988 ax-pre-mulgt0 7989 ax-pre-mulext 7990 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2986 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-br 4030 df-opab 4091 df-id 4324 df-po 4327 df-iso 4328 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-iota 5215 df-fun 5256 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-reap 8594 df-ap 8601 df-div 8692 df-inn 8983 |
This theorem is referenced by: permnn 10842 infpnlem1 12497 |
Copyright terms: Public domain | W3C validator |