| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > bezoutlemmo | GIF version | ||
| Description: Lemma for Bézout's identity. There is at most one nonnegative integer meeting the greatest common divisor condition. (Contributed by Mario Carneiro and Jim Kingdon, 9-Jan-2022.) |
| Ref | Expression |
|---|---|
| bezoutlemgcd.1 | ⊢ (𝜑 → 𝐴 ∈ ℤ) |
| bezoutlemgcd.2 | ⊢ (𝜑 → 𝐵 ∈ ℤ) |
| bezoutlemgcd.3 | ⊢ (𝜑 → 𝐷 ∈ ℕ0) |
| bezoutlemgcd.4 | ⊢ (𝜑 → ∀𝑧 ∈ ℤ (𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵))) |
| bezoutlemmo.5 | ⊢ (𝜑 → 𝐸 ∈ ℕ0) |
| bezoutlemmo.6 | ⊢ (𝜑 → ∀𝑧 ∈ ℤ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵))) |
| Ref | Expression |
|---|---|
| bezoutlemmo | ⊢ (𝜑 → 𝐷 = 𝐸) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bezoutlemgcd.3 | . 2 ⊢ (𝜑 → 𝐷 ∈ ℕ0) | |
| 2 | bezoutlemmo.5 | . 2 ⊢ (𝜑 → 𝐸 ∈ ℕ0) | |
| 3 | 1 | nn0zd 9697 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ ℤ) |
| 4 | iddvds 12486 | . . . 4 ⊢ (𝐷 ∈ ℤ → 𝐷 ∥ 𝐷) | |
| 5 | 3, 4 | syl 14 | . . 3 ⊢ (𝜑 → 𝐷 ∥ 𝐷) |
| 6 | breq1 4111 | . . . . 5 ⊢ (𝑧 = 𝐷 → (𝑧 ∥ 𝐷 ↔ 𝐷 ∥ 𝐷)) | |
| 7 | breq1 4111 | . . . . 5 ⊢ (𝑧 = 𝐷 → (𝑧 ∥ 𝐸 ↔ 𝐷 ∥ 𝐸)) | |
| 8 | 6, 7 | bibi12d 235 | . . . 4 ⊢ (𝑧 = 𝐷 → ((𝑧 ∥ 𝐷 ↔ 𝑧 ∥ 𝐸) ↔ (𝐷 ∥ 𝐷 ↔ 𝐷 ∥ 𝐸))) |
| 9 | bezoutlemgcd.4 | . . . . . 6 ⊢ (𝜑 → ∀𝑧 ∈ ℤ (𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵))) | |
| 10 | bezoutlemmo.6 | . . . . . 6 ⊢ (𝜑 → ∀𝑧 ∈ ℤ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵))) | |
| 11 | r19.26 2669 | . . . . . 6 ⊢ (∀𝑧 ∈ ℤ ((𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)) ∧ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵))) ↔ (∀𝑧 ∈ ℤ (𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)) ∧ ∀𝑧 ∈ ℤ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)))) | |
| 12 | 9, 10, 11 | sylanbrc 417 | . . . . 5 ⊢ (𝜑 → ∀𝑧 ∈ ℤ ((𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)) ∧ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)))) |
| 13 | biantr 961 | . . . . . 6 ⊢ (((𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)) ∧ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵))) → (𝑧 ∥ 𝐷 ↔ 𝑧 ∥ 𝐸)) | |
| 14 | 13 | ralimi 2605 | . . . . 5 ⊢ (∀𝑧 ∈ ℤ ((𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)) ∧ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵))) → ∀𝑧 ∈ ℤ (𝑧 ∥ 𝐷 ↔ 𝑧 ∥ 𝐸)) |
| 15 | 12, 14 | syl 14 | . . . 4 ⊢ (𝜑 → ∀𝑧 ∈ ℤ (𝑧 ∥ 𝐷 ↔ 𝑧 ∥ 𝐸)) |
| 16 | 8, 15, 3 | rspcdva 2925 | . . 3 ⊢ (𝜑 → (𝐷 ∥ 𝐷 ↔ 𝐷 ∥ 𝐸)) |
| 17 | 5, 16 | mpbid 147 | . 2 ⊢ (𝜑 → 𝐷 ∥ 𝐸) |
| 18 | 2 | nn0zd 9697 | . . . 4 ⊢ (𝜑 → 𝐸 ∈ ℤ) |
| 19 | iddvds 12486 | . . . 4 ⊢ (𝐸 ∈ ℤ → 𝐸 ∥ 𝐸) | |
| 20 | 18, 19 | syl 14 | . . 3 ⊢ (𝜑 → 𝐸 ∥ 𝐸) |
| 21 | breq1 4111 | . . . . 5 ⊢ (𝑧 = 𝐸 → (𝑧 ∥ 𝐷 ↔ 𝐸 ∥ 𝐷)) | |
| 22 | breq1 4111 | . . . . 5 ⊢ (𝑧 = 𝐸 → (𝑧 ∥ 𝐸 ↔ 𝐸 ∥ 𝐸)) | |
| 23 | 21, 22 | bibi12d 235 | . . . 4 ⊢ (𝑧 = 𝐸 → ((𝑧 ∥ 𝐷 ↔ 𝑧 ∥ 𝐸) ↔ (𝐸 ∥ 𝐷 ↔ 𝐸 ∥ 𝐸))) |
| 24 | 23, 15, 18 | rspcdva 2925 | . . 3 ⊢ (𝜑 → (𝐸 ∥ 𝐷 ↔ 𝐸 ∥ 𝐸)) |
| 25 | 20, 24 | mpbird 167 | . 2 ⊢ (𝜑 → 𝐸 ∥ 𝐷) |
| 26 | dvdseq 12530 | . 2 ⊢ (((𝐷 ∈ ℕ0 ∧ 𝐸 ∈ ℕ0) ∧ (𝐷 ∥ 𝐸 ∧ 𝐸 ∥ 𝐷)) → 𝐷 = 𝐸) | |
| 27 | 1, 2, 17, 25, 26 | syl22anc 1275 | 1 ⊢ (𝜑 → 𝐷 = 𝐸) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2203 ∀wral 2520 class class class wbr 4108 ℕ0cn0 9495 ℤcz 9576 ∥ cdvds 12469 |
| 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 4224 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 ax-cnex 8217 ax-resscn 8218 ax-1cn 8219 ax-1re 8220 ax-icn 8221 ax-addcl 8222 ax-addrcl 8223 ax-mulcl 8224 ax-mulrcl 8225 ax-addcom 8226 ax-mulcom 8227 ax-addass 8228 ax-mulass 8229 ax-distr 8230 ax-i2m1 8231 ax-0lt1 8232 ax-1rid 8233 ax-0id 8234 ax-rnegex 8235 ax-precex 8236 ax-cnre 8237 ax-pre-ltirr 8238 ax-pre-ltwlin 8239 ax-pre-lttrn 8240 ax-pre-apti 8241 ax-pre-ltadd 8242 ax-pre-mulgt0 8243 ax-pre-mulext 8244 ax-arch 8245 ax-caucvg 8246 |
| 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 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-if 3620 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-id 4413 df-po 4416 df-iso 4417 df-iord 4486 df-on 4488 df-ilim 4489 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-recs 6535 df-frec 6621 df-pnf 8309 df-mnf 8310 df-xr 8311 df-ltxr 8312 df-le 8313 df-sub 8445 df-neg 8446 df-reap 8848 df-ap 8855 df-div 8946 df-inn 9237 df-2 9295 df-3 9296 df-4 9297 df-n0 9496 df-z 9577 df-uz 9853 df-q 9951 df-rp 9986 df-seqfrec 10809 df-exp 10900 df-cj 11523 df-re 11524 df-im 11525 df-rsqrt 11679 df-abs 11680 df-dvds 12470 |
| This theorem is referenced by: bezoutlemeu 12699 |
| Copyright terms: Public domain | W3C validator |