| 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 9590 | . . . 4 ⊢ (𝜑 → 𝐷 ∈ ℤ) |
| 4 | iddvds 12355 | . . . 4 ⊢ (𝐷 ∈ ℤ → 𝐷 ∥ 𝐷) | |
| 5 | 3, 4 | syl 14 | . . 3 ⊢ (𝜑 → 𝐷 ∥ 𝐷) |
| 6 | breq1 4089 | . . . . 5 ⊢ (𝑧 = 𝐷 → (𝑧 ∥ 𝐷 ↔ 𝐷 ∥ 𝐷)) | |
| 7 | breq1 4089 | . . . . 5 ⊢ (𝑧 = 𝐷 → (𝑧 ∥ 𝐸 ↔ 𝐷 ∥ 𝐸)) | |
| 8 | 6, 7 | bibi12d 235 | . . . 4 ⊢ (𝑧 = 𝐷 → ((𝑧 ∥ 𝐷 ↔ 𝑧 ∥ 𝐸) ↔ (𝐷 ∥ 𝐷 ↔ 𝐷 ∥ 𝐸))) |
| 9 | bezoutlemgcd.4 | . . . . . 6 ⊢ (𝜑 → ∀𝑧 ∈ ℤ (𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵))) | |
| 10 | bezoutlemmo.6 | . . . . . 6 ⊢ (𝜑 → ∀𝑧 ∈ ℤ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵))) | |
| 11 | r19.26 2657 | . . . . . 6 ⊢ (∀𝑧 ∈ ℤ ((𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)) ∧ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵))) ↔ (∀𝑧 ∈ ℤ (𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)) ∧ ∀𝑧 ∈ ℤ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)))) | |
| 12 | 9, 10, 11 | sylanbrc 417 | . . . . 5 ⊢ (𝜑 → ∀𝑧 ∈ ℤ ((𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)) ∧ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)))) |
| 13 | biantr 958 | . . . . . 6 ⊢ (((𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)) ∧ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵))) → (𝑧 ∥ 𝐷 ↔ 𝑧 ∥ 𝐸)) | |
| 14 | 13 | ralimi 2593 | . . . . 5 ⊢ (∀𝑧 ∈ ℤ ((𝑧 ∥ 𝐷 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵)) ∧ (𝑧 ∥ 𝐸 ↔ (𝑧 ∥ 𝐴 ∧ 𝑧 ∥ 𝐵))) → ∀𝑧 ∈ ℤ (𝑧 ∥ 𝐷 ↔ 𝑧 ∥ 𝐸)) |
| 15 | 12, 14 | syl 14 | . . . 4 ⊢ (𝜑 → ∀𝑧 ∈ ℤ (𝑧 ∥ 𝐷 ↔ 𝑧 ∥ 𝐸)) |
| 16 | 8, 15, 3 | rspcdva 2913 | . . 3 ⊢ (𝜑 → (𝐷 ∥ 𝐷 ↔ 𝐷 ∥ 𝐸)) |
| 17 | 5, 16 | mpbid 147 | . 2 ⊢ (𝜑 → 𝐷 ∥ 𝐸) |
| 18 | 2 | nn0zd 9590 | . . . 4 ⊢ (𝜑 → 𝐸 ∈ ℤ) |
| 19 | iddvds 12355 | . . . 4 ⊢ (𝐸 ∈ ℤ → 𝐸 ∥ 𝐸) | |
| 20 | 18, 19 | syl 14 | . . 3 ⊢ (𝜑 → 𝐸 ∥ 𝐸) |
| 21 | breq1 4089 | . . . . 5 ⊢ (𝑧 = 𝐸 → (𝑧 ∥ 𝐷 ↔ 𝐸 ∥ 𝐷)) | |
| 22 | breq1 4089 | . . . . 5 ⊢ (𝑧 = 𝐸 → (𝑧 ∥ 𝐸 ↔ 𝐸 ∥ 𝐸)) | |
| 23 | 21, 22 | bibi12d 235 | . . . 4 ⊢ (𝑧 = 𝐸 → ((𝑧 ∥ 𝐷 ↔ 𝑧 ∥ 𝐸) ↔ (𝐸 ∥ 𝐷 ↔ 𝐸 ∥ 𝐸))) |
| 24 | 23, 15, 18 | rspcdva 2913 | . . 3 ⊢ (𝜑 → (𝐸 ∥ 𝐷 ↔ 𝐸 ∥ 𝐸)) |
| 25 | 20, 24 | mpbird 167 | . 2 ⊢ (𝜑 → 𝐸 ∥ 𝐷) |
| 26 | dvdseq 12399 | . 2 ⊢ (((𝐷 ∈ ℕ0 ∧ 𝐸 ∈ ℕ0) ∧ (𝐷 ∥ 𝐸 ∧ 𝐸 ∥ 𝐷)) → 𝐷 = 𝐸) | |
| 27 | 1, 2, 17, 25, 26 | syl22anc 1272 | 1 ⊢ (𝜑 → 𝐷 = 𝐸) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1395 ∈ wcel 2200 ∀wral 2508 class class class wbr 4086 ℕ0cn0 9392 ℤcz 9469 ∥ cdvds 12338 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-mulrcl 8121 ax-addcom 8122 ax-mulcom 8123 ax-addass 8124 ax-mulass 8125 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-1rid 8129 ax-0id 8130 ax-rnegex 8131 ax-precex 8132 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-apti 8137 ax-pre-ltadd 8138 ax-pre-mulgt0 8139 ax-pre-mulext 8140 ax-arch 8141 ax-caucvg 8142 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-po 4391 df-iso 4392 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-frec 6552 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-reap 8745 df-ap 8752 df-div 8843 df-inn 9134 df-2 9192 df-3 9193 df-4 9194 df-n0 9393 df-z 9470 df-uz 9746 df-q 9844 df-rp 9879 df-seqfrec 10700 df-exp 10791 df-cj 11393 df-re 11394 df-im 11395 df-rsqrt 11549 df-abs 11550 df-dvds 12339 |
| This theorem is referenced by: bezoutlemeu 12568 |
| Copyright terms: Public domain | W3C validator |