![]() |
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 12136 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ) → (¬ 𝑃 ∥ 𝑀 ↔ (𝑃 gcd 𝑀) = 1)) | |
2 | 1 | 3adant3 1017 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑃 ∥ 𝑀 ↔ (𝑃 gcd 𝑀) = 1)) |
3 | 2 | anbi2d 464 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ (𝑀 · 𝑁) ∧ ¬ 𝑃 ∥ 𝑀) ↔ (𝑃 ∥ (𝑀 · 𝑁) ∧ (𝑃 gcd 𝑀) = 1))) |
4 | prmz 12103 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
5 | coprmdvds 12084 | . . . . . 6 ⊢ ((𝑃 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ (𝑀 · 𝑁) ∧ (𝑃 gcd 𝑀) = 1) → 𝑃 ∥ 𝑁)) | |
6 | 4, 5 | syl3an1 1271 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ (𝑀 · 𝑁) ∧ (𝑃 gcd 𝑀) = 1) → 𝑃 ∥ 𝑁)) |
7 | 3, 6 | sylbid 150 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ (𝑀 · 𝑁) ∧ ¬ 𝑃 ∥ 𝑀) → 𝑃 ∥ 𝑁)) |
8 | 7 | expd 258 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑃 ∥ (𝑀 · 𝑁) → (¬ 𝑃 ∥ 𝑀 → 𝑃 ∥ 𝑁))) |
9 | prmnn 12102 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
10 | 9 | 3ad2ant1 1018 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑃 ∈ ℕ) |
11 | simp2 998 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℤ) | |
12 | dvdsdc 11798 | . . . . 5 ⊢ ((𝑃 ∈ ℕ ∧ 𝑀 ∈ ℤ) → DECID 𝑃 ∥ 𝑀) | |
13 | 10, 11, 12 | syl2anc 411 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑃 ∥ 𝑀) |
14 | dfordc 892 | . . . 4 ⊢ (DECID 𝑃 ∥ 𝑀 → ((𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁) ↔ (¬ 𝑃 ∥ 𝑀 → 𝑃 ∥ 𝑁))) | |
15 | 13, 14 | syl 14 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁) ↔ (¬ 𝑃 ∥ 𝑀 → 𝑃 ∥ 𝑁))) |
16 | 8, 15 | sylibrd 169 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑃 ∥ (𝑀 · 𝑁) → (𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁))) |
17 | ordvdsmul 11834 | . . 3 ⊢ ((𝑃 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁) → 𝑃 ∥ (𝑀 · 𝑁))) | |
18 | 4, 17 | syl3an1 1271 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁) → 𝑃 ∥ (𝑀 · 𝑁))) |
19 | 16, 18 | impbid 129 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑃 ∥ (𝑀 · 𝑁) ↔ (𝑃 ∥ 𝑀 ∨ 𝑃 ∥ 𝑁))) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 708 DECID wdc 834 ∧ w3a 978 = wceq 1353 ∈ wcel 2148 class class class wbr 4002 (class class class)co 5872 1c1 7809 · cmul 7813 ℕcn 8915 ℤcz 9249 ∥ cdvds 11787 gcd cgcd 11935 ℙcprime 12099 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4117 ax-sep 4120 ax-nul 4128 ax-pow 4173 ax-pr 4208 ax-un 4432 ax-setind 4535 ax-iinf 4586 ax-cnex 7899 ax-resscn 7900 ax-1cn 7901 ax-1re 7902 ax-icn 7903 ax-addcl 7904 ax-addrcl 7905 ax-mulcl 7906 ax-mulrcl 7907 ax-addcom 7908 ax-mulcom 7909 ax-addass 7910 ax-mulass 7911 ax-distr 7912 ax-i2m1 7913 ax-0lt1 7914 ax-1rid 7915 ax-0id 7916 ax-rnegex 7917 ax-precex 7918 ax-cnre 7919 ax-pre-ltirr 7920 ax-pre-ltwlin 7921 ax-pre-lttrn 7922 ax-pre-apti 7923 ax-pre-ltadd 7924 ax-pre-mulgt0 7925 ax-pre-mulext 7926 ax-arch 7927 ax-caucvg 7928 |
This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-if 3535 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-int 3845 df-iun 3888 df-br 4003 df-opab 4064 df-mpt 4065 df-tr 4101 df-id 4292 df-po 4295 df-iso 4296 df-iord 4365 df-on 4367 df-ilim 4368 df-suc 4370 df-iom 4589 df-xp 4631 df-rel 4632 df-cnv 4633 df-co 4634 df-dm 4635 df-rn 4636 df-res 4637 df-ima 4638 df-iota 5177 df-fun 5217 df-fn 5218 df-f 5219 df-f1 5220 df-fo 5221 df-f1o 5222 df-fv 5223 df-riota 5828 df-ov 5875 df-oprab 5876 df-mpo 5877 df-1st 6138 df-2nd 6139 df-recs 6303 df-frec 6389 df-1o 6414 df-2o 6415 df-er 6532 df-en 6738 df-sup 6980 df-pnf 7990 df-mnf 7991 df-xr 7992 df-ltxr 7993 df-le 7994 df-sub 8126 df-neg 8127 df-reap 8528 df-ap 8535 df-div 8626 df-inn 8916 df-2 8974 df-3 8975 df-4 8976 df-n0 9173 df-z 9250 df-uz 9525 df-q 9616 df-rp 9650 df-fz 10005 df-fzo 10138 df-fl 10265 df-mod 10318 df-seqfrec 10441 df-exp 10515 df-cj 10844 df-re 10845 df-im 10846 df-rsqrt 11000 df-abs 11001 df-dvds 11788 df-gcd 11936 df-prm 12100 |
This theorem is referenced by: isprm6 12139 prmdvdsexp 12140 prmfac1 12144 sqpweven 12167 2sqpwodd 12168 pcpremul 12285 lgslem1 14272 lgsdir2 14305 2sqlem4 14325 2sqlem6 14327 |
Copyright terms: Public domain | W3C validator |