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 8833 | . . 3 ⊢ (((𝐵 / 𝐴) ∈ ℕ ∧ (𝐶 / 𝐵) ∈ ℕ) → ((𝐵 / 𝐴) · (𝐶 / 𝐵)) ∈ ℕ) | |
2 | nncn 8820 | . . . . . . 7 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℂ) | |
3 | 2 | 3ad2ant2 1004 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℂ) |
4 | simp3 984 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ) | |
5 | nncn 8820 | . . . . . . . 8 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ) | |
6 | nnap0 8841 | . . . . . . . 8 ⊢ (𝐴 ∈ ℕ → 𝐴 # 0) | |
7 | 5, 6 | jca 304 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → (𝐴 ∈ ℂ ∧ 𝐴 # 0)) |
8 | 7 | 3ad2ant1 1003 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (𝐴 ∈ ℂ ∧ 𝐴 # 0)) |
9 | nnap0 8841 | . . . . . . . 8 ⊢ (𝐵 ∈ ℕ → 𝐵 # 0) | |
10 | 2, 9 | jca 304 | . . . . . . 7 ⊢ (𝐵 ∈ ℕ → (𝐵 ∈ ℂ ∧ 𝐵 # 0)) |
11 | 10 | 3ad2ant2 1004 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (𝐵 ∈ ℂ ∧ 𝐵 # 0)) |
12 | divmul24ap 8568 | . . . . . 6 ⊢ (((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0))) → ((𝐵 / 𝐴) · (𝐶 / 𝐵)) = ((𝐵 / 𝐵) · (𝐶 / 𝐴))) | |
13 | 3, 4, 8, 11, 12 | syl22anc 1218 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → ((𝐵 / 𝐴) · (𝐶 / 𝐵)) = ((𝐵 / 𝐵) · (𝐶 / 𝐴))) |
14 | 2, 9 | dividapd 8638 | . . . . . . 7 ⊢ (𝐵 ∈ ℕ → (𝐵 / 𝐵) = 1) |
15 | 14 | oveq1d 5829 | . . . . . 6 ⊢ (𝐵 ∈ ℕ → ((𝐵 / 𝐵) · (𝐶 / 𝐴)) = (1 · (𝐶 / 𝐴))) |
16 | 15 | 3ad2ant2 1004 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → ((𝐵 / 𝐵) · (𝐶 / 𝐴)) = (1 · (𝐶 / 𝐴))) |
17 | divclap 8530 | . . . . . . . . . 10 ⊢ ((𝐶 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐴 # 0) → (𝐶 / 𝐴) ∈ ℂ) | |
18 | 17 | 3expb 1183 | . . . . . . . . 9 ⊢ ((𝐶 ∈ ℂ ∧ (𝐴 ∈ ℂ ∧ 𝐴 # 0)) → (𝐶 / 𝐴) ∈ ℂ) |
19 | 7, 18 | sylan2 284 | . . . . . . . 8 ⊢ ((𝐶 ∈ ℂ ∧ 𝐴 ∈ ℕ) → (𝐶 / 𝐴) ∈ ℂ) |
20 | 19 | ancoms 266 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (𝐶 / 𝐴) ∈ ℂ) |
21 | 20 | mulid2d 7875 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (1 · (𝐶 / 𝐴)) = (𝐶 / 𝐴)) |
22 | 21 | 3adant2 1001 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (1 · (𝐶 / 𝐴)) = (𝐶 / 𝐴)) |
23 | 13, 16, 22 | 3eqtrd 2191 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → ((𝐵 / 𝐴) · (𝐶 / 𝐵)) = (𝐶 / 𝐴)) |
24 | 23 | eleq1d 2223 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (((𝐵 / 𝐴) · (𝐶 / 𝐵)) ∈ ℕ ↔ (𝐶 / 𝐴) ∈ ℕ)) |
25 | 1, 24 | syl5ib 153 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (((𝐵 / 𝐴) ∈ ℕ ∧ (𝐶 / 𝐵) ∈ ℕ) → (𝐶 / 𝐴) ∈ ℕ)) |
26 | 25 | imp 123 | 1 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) ∧ ((𝐵 / 𝐴) ∈ ℕ ∧ (𝐶 / 𝐵) ∈ ℕ)) → (𝐶 / 𝐴) ∈ ℕ) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 963 = wceq 1332 ∈ wcel 2125 class class class wbr 3961 (class class class)co 5814 ℂcc 7709 0cc0 7711 1c1 7712 · cmul 7716 # cap 8435 / cdiv 8524 ℕcn 8812 |
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 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1481 ax-10 1482 ax-11 1483 ax-i12 1484 ax-bndl 1486 ax-4 1487 ax-17 1503 ax-i9 1507 ax-ial 1511 ax-i5r 1512 ax-13 2127 ax-14 2128 ax-ext 2136 ax-sep 4078 ax-pow 4130 ax-pr 4164 ax-un 4388 ax-setind 4490 ax-cnex 7802 ax-resscn 7803 ax-1cn 7804 ax-1re 7805 ax-icn 7806 ax-addcl 7807 ax-addrcl 7808 ax-mulcl 7809 ax-mulrcl 7810 ax-addcom 7811 ax-mulcom 7812 ax-addass 7813 ax-mulass 7814 ax-distr 7815 ax-i2m1 7816 ax-0lt1 7817 ax-1rid 7818 ax-0id 7819 ax-rnegex 7820 ax-precex 7821 ax-cnre 7822 ax-pre-ltirr 7823 ax-pre-ltwlin 7824 ax-pre-lttrn 7825 ax-pre-apti 7826 ax-pre-ltadd 7827 ax-pre-mulgt0 7828 ax-pre-mulext 7829 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-fal 1338 df-nf 1438 df-sb 1740 df-eu 2006 df-mo 2007 df-clab 2141 df-cleq 2147 df-clel 2150 df-nfc 2285 df-ne 2325 df-nel 2420 df-ral 2437 df-rex 2438 df-reu 2439 df-rmo 2440 df-rab 2441 df-v 2711 df-sbc 2934 df-dif 3100 df-un 3102 df-in 3104 df-ss 3111 df-pw 3541 df-sn 3562 df-pr 3563 df-op 3565 df-uni 3769 df-int 3804 df-br 3962 df-opab 4022 df-id 4248 df-po 4251 df-iso 4252 df-xp 4585 df-rel 4586 df-cnv 4587 df-co 4588 df-dm 4589 df-iota 5128 df-fun 5165 df-fv 5171 df-riota 5770 df-ov 5817 df-oprab 5818 df-mpo 5819 df-pnf 7893 df-mnf 7894 df-xr 7895 df-ltxr 7896 df-le 7897 df-sub 8027 df-neg 8028 df-reap 8429 df-ap 8436 df-div 8525 df-inn 8813 |
This theorem is referenced by: permnn 10622 |
Copyright terms: Public domain | W3C validator |