| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cncongrprm | Structured version Visualization version GIF version | ||
| Description: Corollary 2 of Cancellability of Congruences: Two products with a common factor are congruent modulo a prime number not dividing the common factor iff the other factors are congruent modulo the prime number. (Contributed by AV, 13-Jul-2021.) |
| Ref | Expression |
|---|---|
| cncongrprm | ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) ∧ (𝑃 ∈ ℙ ∧ ¬ 𝑃 ∥ 𝐶)) → (((𝐴 · 𝐶) mod 𝑃) = ((𝐵 · 𝐶) mod 𝑃) ↔ (𝐴 mod 𝑃) = (𝐵 mod 𝑃))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | prmnn 16727 | . . . 4 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ) | |
| 2 | 1 | ad2antrl 740 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) ∧ (𝑃 ∈ ℙ ∧ ¬ 𝑃 ∥ 𝐶)) → 𝑃 ∈ ℕ) |
| 3 | coprm 16765 | . . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ 𝐶 ∈ ℤ) → (¬ 𝑃 ∥ 𝐶 ↔ (𝑃 gcd 𝐶) = 1)) | |
| 4 | prmz 16728 | . . . . . . . . . . 11 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
| 5 | gcdcom 16566 | . . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℤ ∧ 𝐶 ∈ ℤ) → (𝑃 gcd 𝐶) = (𝐶 gcd 𝑃)) | |
| 6 | 4, 5 | sylan 591 | . . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝐶 ∈ ℤ) → (𝑃 gcd 𝐶) = (𝐶 gcd 𝑃)) |
| 7 | 6 | eqeq1d 2765 | . . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ 𝐶 ∈ ℤ) → ((𝑃 gcd 𝐶) = 1 ↔ (𝐶 gcd 𝑃) = 1)) |
| 8 | 3, 7 | bitrd 282 | . . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝐶 ∈ ℤ) → (¬ 𝑃 ∥ 𝐶 ↔ (𝐶 gcd 𝑃) = 1)) |
| 9 | 8 | ancoms 463 | . . . . . . 7 ⊢ ((𝐶 ∈ ℤ ∧ 𝑃 ∈ ℙ) → (¬ 𝑃 ∥ 𝐶 ↔ (𝐶 gcd 𝑃) = 1)) |
| 10 | 9 | biimpd 232 | . . . . . 6 ⊢ ((𝐶 ∈ ℤ ∧ 𝑃 ∈ ℙ) → (¬ 𝑃 ∥ 𝐶 → (𝐶 gcd 𝑃) = 1)) |
| 11 | 10 | expimpd 458 | . . . . 5 ⊢ (𝐶 ∈ ℤ → ((𝑃 ∈ ℙ ∧ ¬ 𝑃 ∥ 𝐶) → (𝐶 gcd 𝑃) = 1)) |
| 12 | 11 | 3ad2ant3 1153 | . . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) → ((𝑃 ∈ ℙ ∧ ¬ 𝑃 ∥ 𝐶) → (𝐶 gcd 𝑃) = 1)) |
| 13 | 12 | imp 411 | . . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) ∧ (𝑃 ∈ ℙ ∧ ¬ 𝑃 ∥ 𝐶)) → (𝐶 gcd 𝑃) = 1) |
| 14 | 2, 13 | jca 520 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) ∧ (𝑃 ∈ ℙ ∧ ¬ 𝑃 ∥ 𝐶)) → (𝑃 ∈ ℕ ∧ (𝐶 gcd 𝑃) = 1)) |
| 15 | cncongrcoprm 16723 | . 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) ∧ (𝑃 ∈ ℕ ∧ (𝐶 gcd 𝑃) = 1)) → (((𝐴 · 𝐶) mod 𝑃) = ((𝐵 · 𝐶) mod 𝑃) ↔ (𝐴 mod 𝑃) = (𝐵 mod 𝑃))) | |
| 16 | 14, 15 | syldan 602 | 1 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) ∧ (𝑃 ∈ ℙ ∧ ¬ 𝑃 ∥ 𝐶)) → (((𝐴 · 𝐶) mod 𝑃) = ((𝐵 · 𝐶) mod 𝑃) ↔ (𝐴 mod 𝑃) = (𝐵 mod 𝑃))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 class class class wbr 5109 (class class class)co 7410 1c1 11096 · cmul 11100 ℕcn 12228 ℤcz 12586 mod cmo 13898 ∥ cdvds 16305 gcd cgcd 16547 ℙcprime 16724 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 ax-pre-sup 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9398 df-inf 9399 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-div 11867 df-nn 12229 df-2 12298 df-3 12299 df-n0 12500 df-z 12587 df-uz 12858 df-rp 13012 df-fl 13821 df-mod 13899 df-seq 14034 df-exp 14094 df-cj 15146 df-re 15147 df-im 15148 df-sqrt 15282 df-abs 15283 df-dvds 16306 df-gcd 16548 df-prm 16725 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |