![]() |
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 8648 | . . 3 ⊢ (((𝐵 / 𝐴) ∈ ℕ ∧ (𝐶 / 𝐵) ∈ ℕ) → ((𝐵 / 𝐴) · (𝐶 / 𝐵)) ∈ ℕ) | |
2 | nncn 8635 | . . . . . . 7 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℂ) | |
3 | 2 | 3ad2ant2 986 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℂ) |
4 | simp3 966 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ) | |
5 | nncn 8635 | . . . . . . . 8 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ) | |
6 | nnap0 8656 | . . . . . . . 8 ⊢ (𝐴 ∈ ℕ → 𝐴 # 0) | |
7 | 5, 6 | jca 302 | . . . . . . 7 ⊢ (𝐴 ∈ ℕ → (𝐴 ∈ ℂ ∧ 𝐴 # 0)) |
8 | 7 | 3ad2ant1 985 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (𝐴 ∈ ℂ ∧ 𝐴 # 0)) |
9 | nnap0 8656 | . . . . . . . 8 ⊢ (𝐵 ∈ ℕ → 𝐵 # 0) | |
10 | 2, 9 | jca 302 | . . . . . . 7 ⊢ (𝐵 ∈ ℕ → (𝐵 ∈ ℂ ∧ 𝐵 # 0)) |
11 | 10 | 3ad2ant2 986 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (𝐵 ∈ ℂ ∧ 𝐵 # 0)) |
12 | divmul24ap 8386 | . . . . . 6 ⊢ (((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) ∧ ((𝐴 ∈ ℂ ∧ 𝐴 # 0) ∧ (𝐵 ∈ ℂ ∧ 𝐵 # 0))) → ((𝐵 / 𝐴) · (𝐶 / 𝐵)) = ((𝐵 / 𝐵) · (𝐶 / 𝐴))) | |
13 | 3, 4, 8, 11, 12 | syl22anc 1200 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → ((𝐵 / 𝐴) · (𝐶 / 𝐵)) = ((𝐵 / 𝐵) · (𝐶 / 𝐴))) |
14 | 2, 9 | dividapd 8456 | . . . . . . 7 ⊢ (𝐵 ∈ ℕ → (𝐵 / 𝐵) = 1) |
15 | 14 | oveq1d 5743 | . . . . . 6 ⊢ (𝐵 ∈ ℕ → ((𝐵 / 𝐵) · (𝐶 / 𝐴)) = (1 · (𝐶 / 𝐴))) |
16 | 15 | 3ad2ant2 986 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → ((𝐵 / 𝐵) · (𝐶 / 𝐴)) = (1 · (𝐶 / 𝐴))) |
17 | divclap 8348 | . . . . . . . . . 10 ⊢ ((𝐶 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐴 # 0) → (𝐶 / 𝐴) ∈ ℂ) | |
18 | 17 | 3expb 1165 | . . . . . . . . 9 ⊢ ((𝐶 ∈ ℂ ∧ (𝐴 ∈ ℂ ∧ 𝐴 # 0)) → (𝐶 / 𝐴) ∈ ℂ) |
19 | 7, 18 | sylan2 282 | . . . . . . . 8 ⊢ ((𝐶 ∈ ℂ ∧ 𝐴 ∈ ℕ) → (𝐶 / 𝐴) ∈ ℂ) |
20 | 19 | ancoms 266 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (𝐶 / 𝐴) ∈ ℂ) |
21 | 20 | mulid2d 7705 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (1 · (𝐶 / 𝐴)) = (𝐶 / 𝐴)) |
22 | 21 | 3adant2 983 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → (1 · (𝐶 / 𝐴)) = (𝐶 / 𝐴)) |
23 | 13, 16, 22 | 3eqtrd 2151 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℂ) → ((𝐵 / 𝐴) · (𝐶 / 𝐵)) = (𝐶 / 𝐴)) |
24 | 23 | eleq1d 2183 | . . 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 945 = wceq 1314 ∈ wcel 1463 class class class wbr 3895 (class class class)co 5728 ℂcc 7542 0cc0 7544 1c1 7545 · cmul 7549 # cap 8258 / cdiv 8342 ℕcn 8627 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 586 ax-in2 587 ax-io 681 ax-5 1406 ax-7 1407 ax-gen 1408 ax-ie1 1452 ax-ie2 1453 ax-8 1465 ax-10 1466 ax-11 1467 ax-i12 1468 ax-bndl 1469 ax-4 1470 ax-13 1474 ax-14 1475 ax-17 1489 ax-i9 1493 ax-ial 1497 ax-i5r 1498 ax-ext 2097 ax-sep 4006 ax-pow 4058 ax-pr 4091 ax-un 4315 ax-setind 4412 ax-cnex 7633 ax-resscn 7634 ax-1cn 7635 ax-1re 7636 ax-icn 7637 ax-addcl 7638 ax-addrcl 7639 ax-mulcl 7640 ax-mulrcl 7641 ax-addcom 7642 ax-mulcom 7643 ax-addass 7644 ax-mulass 7645 ax-distr 7646 ax-i2m1 7647 ax-0lt1 7648 ax-1rid 7649 ax-0id 7650 ax-rnegex 7651 ax-precex 7652 ax-cnre 7653 ax-pre-ltirr 7654 ax-pre-ltwlin 7655 ax-pre-lttrn 7656 ax-pre-apti 7657 ax-pre-ltadd 7658 ax-pre-mulgt0 7659 ax-pre-mulext 7660 |
This theorem depends on definitions: df-bi 116 df-3an 947 df-tru 1317 df-fal 1320 df-nf 1420 df-sb 1719 df-eu 1978 df-mo 1979 df-clab 2102 df-cleq 2108 df-clel 2111 df-nfc 2244 df-ne 2283 df-nel 2378 df-ral 2395 df-rex 2396 df-reu 2397 df-rmo 2398 df-rab 2399 df-v 2659 df-sbc 2879 df-dif 3039 df-un 3041 df-in 3043 df-ss 3050 df-pw 3478 df-sn 3499 df-pr 3500 df-op 3502 df-uni 3703 df-int 3738 df-br 3896 df-opab 3950 df-id 4175 df-po 4178 df-iso 4179 df-xp 4505 df-rel 4506 df-cnv 4507 df-co 4508 df-dm 4509 df-iota 5046 df-fun 5083 df-fv 5089 df-riota 5684 df-ov 5731 df-oprab 5732 df-mpo 5733 df-pnf 7723 df-mnf 7724 df-xr 7725 df-ltxr 7726 df-le 7727 df-sub 7855 df-neg 7856 df-reap 8252 df-ap 8259 df-div 8343 df-inn 8628 |
This theorem is referenced by: permnn 10407 |
Copyright terms: Public domain | W3C validator |