Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dvdstr | Structured version Visualization version GIF version |
Description: The divides relation is transitive. Theorem 1.1(b) in [ApostolNT] p. 14 (transitive property of the divides relation). (Contributed by Paul Chapman, 21-Mar-2011.) |
Ref | Expression |
---|---|
dvdstr | ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 ∥ 𝑀 ∧ 𝑀 ∥ 𝑁) → 𝐾 ∥ 𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 3simpa 1147 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ)) | |
2 | 3simpc 1149 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
3 | 3simpb 1148 | . 2 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝐾 ∈ ℤ ∧ 𝑁 ∈ ℤ)) | |
4 | zmulcl 12369 | . . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑥 · 𝑦) ∈ ℤ) | |
5 | 4 | adantl 482 | . 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝑥 · 𝑦) ∈ ℤ) |
6 | oveq2 7279 | . . . . 5 ⊢ ((𝑥 · 𝐾) = 𝑀 → (𝑦 · (𝑥 · 𝐾)) = (𝑦 · 𝑀)) | |
7 | 6 | adantr 481 | . . . 4 ⊢ (((𝑥 · 𝐾) = 𝑀 ∧ (𝑦 · 𝑀) = 𝑁) → (𝑦 · (𝑥 · 𝐾)) = (𝑦 · 𝑀)) |
8 | eqeq2 2752 | . . . . 5 ⊢ ((𝑦 · 𝑀) = 𝑁 → ((𝑦 · (𝑥 · 𝐾)) = (𝑦 · 𝑀) ↔ (𝑦 · (𝑥 · 𝐾)) = 𝑁)) | |
9 | 8 | adantl 482 | . . . 4 ⊢ (((𝑥 · 𝐾) = 𝑀 ∧ (𝑦 · 𝑀) = 𝑁) → ((𝑦 · (𝑥 · 𝐾)) = (𝑦 · 𝑀) ↔ (𝑦 · (𝑥 · 𝐾)) = 𝑁)) |
10 | 7, 9 | mpbid 231 | . . 3 ⊢ (((𝑥 · 𝐾) = 𝑀 ∧ (𝑦 · 𝑀) = 𝑁) → (𝑦 · (𝑥 · 𝐾)) = 𝑁) |
11 | zcn 12324 | . . . . . . . 8 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ) | |
12 | zcn 12324 | . . . . . . . 8 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℂ) | |
13 | zcn 12324 | . . . . . . . 8 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℂ) | |
14 | mulass 10960 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝐾 ∈ ℂ) → ((𝑥 · 𝑦) · 𝐾) = (𝑥 · (𝑦 · 𝐾))) | |
15 | mul12 11140 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝐾 ∈ ℂ) → (𝑥 · (𝑦 · 𝐾)) = (𝑦 · (𝑥 · 𝐾))) | |
16 | 14, 15 | eqtrd 2780 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝐾 ∈ ℂ) → ((𝑥 · 𝑦) · 𝐾) = (𝑦 · (𝑥 · 𝐾))) |
17 | 11, 12, 13, 16 | syl3an 1159 | . . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 𝐾 ∈ ℤ) → ((𝑥 · 𝑦) · 𝐾) = (𝑦 · (𝑥 · 𝐾))) |
18 | 17 | 3comr 1124 | . . . . . 6 ⊢ ((𝐾 ∈ ℤ ∧ 𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → ((𝑥 · 𝑦) · 𝐾) = (𝑦 · (𝑥 · 𝐾))) |
19 | 18 | 3expb 1119 | . . . . 5 ⊢ ((𝐾 ∈ ℤ ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → ((𝑥 · 𝑦) · 𝐾) = (𝑦 · (𝑥 · 𝐾))) |
20 | 19 | 3ad2antl1 1184 | . . . 4 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → ((𝑥 · 𝑦) · 𝐾) = (𝑦 · (𝑥 · 𝐾))) |
21 | 20 | eqeq1d 2742 | . . 3 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (((𝑥 · 𝑦) · 𝐾) = 𝑁 ↔ (𝑦 · (𝑥 · 𝐾)) = 𝑁)) |
22 | 10, 21 | syl5ibr 245 | . 2 ⊢ (((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (((𝑥 · 𝐾) = 𝑀 ∧ (𝑦 · 𝑀) = 𝑁) → ((𝑥 · 𝑦) · 𝐾) = 𝑁)) |
23 | 1, 2, 3, 5, 22 | dvds2lem 15976 | 1 ⊢ ((𝐾 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝐾 ∥ 𝑀 ∧ 𝑀 ∥ 𝑁) → 𝐾 ∥ 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1542 ∈ wcel 2110 class class class wbr 5079 (class class class)co 7271 ℂcc 10870 · cmul 10877 ℤcz 12319 ∥ cdvds 15961 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7582 ax-resscn 10929 ax-1cn 10930 ax-icn 10931 ax-addcl 10932 ax-addrcl 10933 ax-mulcl 10934 ax-mulrcl 10935 ax-mulcom 10936 ax-addass 10937 ax-mulass 10938 ax-distr 10939 ax-i2m1 10940 ax-1ne0 10941 ax-1rid 10942 ax-rnegex 10943 ax-rrecex 10944 ax-cnre 10945 ax-pre-lttri 10946 ax-pre-lttrn 10947 ax-pre-ltadd 10948 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-nel 3052 df-ral 3071 df-rex 3072 df-reu 3073 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-iun 4932 df-br 5080 df-opab 5142 df-mpt 5163 df-tr 5197 df-id 5490 df-eprel 5496 df-po 5504 df-so 5505 df-fr 5545 df-we 5547 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-rn 5601 df-res 5602 df-ima 5603 df-pred 6201 df-ord 6268 df-on 6269 df-lim 6270 df-suc 6271 df-iota 6390 df-fun 6434 df-fn 6435 df-f 6436 df-f1 6437 df-fo 6438 df-f1o 6439 df-fv 6440 df-riota 7228 df-ov 7274 df-oprab 7275 df-mpo 7276 df-om 7707 df-2nd 7825 df-frecs 8088 df-wrecs 8119 df-recs 8193 df-rdg 8232 df-er 8481 df-en 8717 df-dom 8718 df-sdom 8719 df-pnf 11012 df-mnf 11013 df-ltxr 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-n0 12234 df-z 12320 df-dvds 15962 |
This theorem is referenced by: dvdstrd 16002 dvdsmultr1 16003 dvdsmultr2 16005 4dvdseven 16080 dvdsgcdb 16251 lcmgcdeq 16315 lcmdvdsb 16316 lcmftp 16339 lcmfdvdsb 16346 rpmulgcd2 16359 exprmfct 16407 rpexp 16425 pcpremul 16542 pcdvdsb 16568 pcprmpw2 16581 prmreclem3 16617 odmulg 19161 ablfac1b 19671 ablfac1eu 19674 wilth 26218 muval1 26280 dvdssqf 26285 sqff1o 26329 dvdsmulf1o 26341 vmasum 26362 bposlem3 26432 lgsquad2lem1 26530 goldbachthlem2 44967 |
Copyright terms: Public domain | W3C validator |