![]() |
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 12285 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ) → (¬ 𝑃 ∥ 𝑀 ↔ (𝑃 gcd 𝑀) = 1)) | |
2 | 1 | 3adant3 1019 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑃 ∥ 𝑀 ↔ (𝑃 gcd 𝑀) = 1)) |
3 | 2 | anbi2d 464 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ (𝑀 · 𝑁) ∧ ¬ 𝑃 ∥ 𝑀) ↔ (𝑃 ∥ (𝑀 · 𝑁) ∧ (𝑃 gcd 𝑀) = 1))) |
4 | prmz 12252 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
5 | coprmdvds 12233 | . . . . . 6 ⊢ ((𝑃 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ (𝑀 · 𝑁) ∧ (𝑃 gcd 𝑀) = 1) → 𝑃 ∥ 𝑁)) | |
6 | 4, 5 | syl3an1 1282 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ (𝑀 · 𝑁) ∧ (𝑃 gcd 𝑀) = 1) → 𝑃 ∥ 𝑁)) |
7 | 3, 6 | sylbid 150 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ (𝑀 · 𝑁) ∧ ¬ 𝑃 ∥ 𝑀) → 𝑃 ∥ 𝑁)) |
8 | 7 | expd 258 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑃 ∥ (𝑀 · 𝑁) → (¬ 𝑃 ∥ 𝑀 → 𝑃 ∥ 𝑁))) |
9 | prmnn 12251 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
10 | 9 | 3ad2ant1 1020 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑃 ∈ ℕ) |
11 | simp2 1000 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℤ) | |
12 | dvdsdc 11944 | . . . . 5 ⊢ ((𝑃 ∈ ℕ ∧ 𝑀 ∈ ℤ) → DECID 𝑃 ∥ 𝑀) | |
13 | 10, 11, 12 | syl2anc 411 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑃 ∥ 𝑀) |
14 | dfordc 893 | . . . 4 ⊢ (DECID 𝑃 ∥ 𝑀 → ((𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁) ↔ (¬ 𝑃 ∥ 𝑀 → 𝑃 ∥ 𝑁))) | |
15 | 13, 14 | syl 14 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁) ↔ (¬ 𝑃 ∥ 𝑀 → 𝑃 ∥ 𝑁))) |
16 | 8, 15 | sylibrd 169 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑃 ∥ (𝑀 · 𝑁) → (𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁))) |
17 | ordvdsmul 11980 | . . 3 ⊢ ((𝑃 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁) → 𝑃 ∥ (𝑀 · 𝑁))) | |
18 | 4, 17 | syl3an1 1282 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁) → 𝑃 ∥ (𝑀 · 𝑁))) |
19 | 16, 18 | impbid 129 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑃 ∥ (𝑀 · 𝑁) ↔ (𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁))) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 DECID wdc 835 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 class class class wbr 4030 (class class class)co 5919 1c1 7875 · cmul 7879 ℕcn 8984 ℤcz 9320 ∥ cdvds 11933 gcd cgcd 12082 ℙcprime 12248 |
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-coll 4145 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-iinf 4621 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-mulrcl 7973 ax-addcom 7974 ax-mulcom 7975 ax-addass 7976 ax-mulass 7977 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-1rid 7981 ax-0id 7982 ax-rnegex 7983 ax-precex 7984 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-ltwlin 7987 ax-pre-lttrn 7988 ax-pre-apti 7989 ax-pre-ltadd 7990 ax-pre-mulgt0 7991 ax-pre-mulext 7992 ax-arch 7993 ax-caucvg 7994 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 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 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-if 3559 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-tr 4129 df-id 4325 df-po 4328 df-iso 4329 df-iord 4398 df-on 4400 df-ilim 4401 df-suc 4403 df-iom 4624 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-recs 6360 df-frec 6446 df-1o 6471 df-2o 6472 df-er 6589 df-en 6797 df-sup 7045 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-reap 8596 df-ap 8603 df-div 8694 df-inn 8985 df-2 9043 df-3 9044 df-4 9045 df-n0 9244 df-z 9321 df-uz 9596 df-q 9688 df-rp 9723 df-fz 10078 df-fzo 10212 df-fl 10342 df-mod 10397 df-seqfrec 10522 df-exp 10613 df-cj 10989 df-re 10990 df-im 10991 df-rsqrt 11145 df-abs 11146 df-dvds 11934 df-gcd 12083 df-prm 12249 |
This theorem is referenced by: isprm6 12288 prmdvdsexp 12289 prmfac1 12293 sqpweven 12316 2sqpwodd 12317 pcpremul 12434 4sqlem11 12542 znidom 14156 wilthlem1 15153 lgslem1 15157 lgsdir2 15190 2sqlem4 15275 2sqlem6 15277 |
Copyright terms: Public domain | W3C validator |