| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > euclemma | GIF version | ||
| Description: Euclid's lemma. A prime number divides the product of two integers iff it divides at least one of them. Theorem 1.9 in [ApostolNT] p. 17. (Contributed by Paul Chapman, 17-Nov-2012.) |
| Ref | Expression |
|---|---|
| euclemma | ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑃 ∥ (𝑀 · 𝑁) ↔ (𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | coprm 12841 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ) → (¬ 𝑃 ∥ 𝑀 ↔ (𝑃 gcd 𝑀) = 1)) | |
| 2 | 1 | 3adant3 1044 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑃 ∥ 𝑀 ↔ (𝑃 gcd 𝑀) = 1)) |
| 3 | 2 | anbi2d 464 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ (𝑀 · 𝑁) ∧ ¬ 𝑃 ∥ 𝑀) ↔ (𝑃 ∥ (𝑀 · 𝑁) ∧ (𝑃 gcd 𝑀) = 1))) |
| 4 | prmz 12808 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
| 5 | coprmdvds 12789 | . . . . . 6 ⊢ ((𝑃 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ (𝑀 · 𝑁) ∧ (𝑃 gcd 𝑀) = 1) → 𝑃 ∥ 𝑁)) | |
| 6 | 4, 5 | syl3an1 1307 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ (𝑀 · 𝑁) ∧ (𝑃 gcd 𝑀) = 1) → 𝑃 ∥ 𝑁)) |
| 7 | 3, 6 | sylbid 150 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ (𝑀 · 𝑁) ∧ ¬ 𝑃 ∥ 𝑀) → 𝑃 ∥ 𝑁)) |
| 8 | 7 | expd 258 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑃 ∥ (𝑀 · 𝑁) → (¬ 𝑃 ∥ 𝑀 → 𝑃 ∥ 𝑁))) |
| 9 | prmnn 12807 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 10 | 9 | 3ad2ant1 1045 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑃 ∈ ℕ) |
| 11 | simp2 1025 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℤ) | |
| 12 | dvdsdc 12484 | . . . . 5 ⊢ ((𝑃 ∈ ℕ ∧ 𝑀 ∈ ℤ) → DECID 𝑃 ∥ 𝑀) | |
| 13 | 10, 11, 12 | syl2anc 411 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑃 ∥ 𝑀) |
| 14 | dfordc 900 | . . . 4 ⊢ (DECID 𝑃 ∥ 𝑀 → ((𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁) ↔ (¬ 𝑃 ∥ 𝑀 → 𝑃 ∥ 𝑁))) | |
| 15 | 13, 14 | syl 14 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁) ↔ (¬ 𝑃 ∥ 𝑀 → 𝑃 ∥ 𝑁))) |
| 16 | 8, 15 | sylibrd 169 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑃 ∥ (𝑀 · 𝑁) → (𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁))) |
| 17 | ordvdsmul 12520 | . . 3 ⊢ ((𝑃 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁) → 𝑃 ∥ (𝑀 · 𝑁))) | |
| 18 | 4, 17 | syl3an1 1307 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁) → 𝑃 ∥ (𝑀 · 𝑁))) |
| 19 | 16, 18 | impbid 129 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑃 ∥ (𝑀 · 𝑁) ↔ (𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁))) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 DECID wdc 842 ∧ w3a 1005 = wceq 1398 ∈ wcel 2203 class class class wbr 4109 (class class class)co 6050 1c1 8128 · cmul 8132 ℕcn 9237 ℤcz 9577 ∥ cdvds 12473 gcd cgcd 12649 ℙcprime 12804 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-iinf 4710 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-mulrcl 8226 ax-addcom 8227 ax-mulcom 8228 ax-addass 8229 ax-mulass 8230 ax-distr 8231 ax-i2m1 8232 ax-0lt1 8233 ax-1rid 8234 ax-0id 8235 ax-rnegex 8236 ax-precex 8237 ax-cnre 8238 ax-pre-ltirr 8239 ax-pre-ltwlin 8240 ax-pre-lttrn 8241 ax-pre-apti 8242 ax-pre-ltadd 8243 ax-pre-mulgt0 8244 ax-pre-mulext 8245 ax-arch 8246 ax-caucvg 8247 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-if 3621 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-tr 4209 df-id 4414 df-po 4417 df-iso 4418 df-iord 4487 df-on 4489 df-ilim 4490 df-suc 4492 df-iom 4713 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-recs 6536 df-frec 6622 df-1o 6647 df-2o 6648 df-er 6767 df-en 6976 df-sup 7275 df-pnf 8310 df-mnf 8311 df-xr 8312 df-ltxr 8313 df-le 8314 df-sub 8446 df-neg 8447 df-reap 8849 df-ap 8856 df-div 8947 df-inn 9238 df-2 9296 df-3 9297 df-4 9298 df-n0 9497 df-z 9578 df-uz 9854 df-q 9952 df-rp 9987 df-fz 10343 df-fzo 10477 df-fl 10630 df-mod 10685 df-seqfrec 10810 df-exp 10901 df-cj 11527 df-re 11528 df-im 11529 df-rsqrt 11683 df-abs 11684 df-dvds 12474 df-gcd 12650 df-prm 12805 |
| This theorem is referenced by: isprm6 12844 prmdvdsexp 12845 prmfac1 12849 sqpweven 12872 2sqpwodd 12873 pcpremul 12991 4sqlem11 13099 znidom 14805 wilthlem1 15848 lgslem1 15873 lgsdir2 15906 2sqlem4 15991 2sqlem6 15993 |
| Copyright terms: Public domain | W3C validator |