Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > bezout | Unicode version |
Description: Bézout's identity:
For any integers and
, there are
integers such that
. This
is Metamath 100 proof #60.
The proof is constructive, in the sense that it applies the Extended Euclidian Algorithm to constuct a number which can be shown to be and which satisfies the rest of the theorem. In the presence of excluded middle, it is common to prove Bézout's identity by taking the smallest number which satisfies the Bézout condition, and showing it is the greatest common divisor. But we do not have the ability to show that number exists other than by providing a way to determine it. (Contributed by Mario Carneiro, 22-Feb-2014.) |
Ref | Expression |
---|---|
bezout |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bezoutlembi 11693 | . 2 | |
2 | simprrr 529 | . . 3 | |
3 | nfv 1508 | . . . . 5 | |
4 | nfv 1508 | . . . . . 6 | |
5 | nfv 1508 | . . . . . . 7 | |
6 | nfre1 2476 | . . . . . . 7 | |
7 | 5, 6 | nfan 1544 | . . . . . 6 |
8 | 4, 7 | nfan 1544 | . . . . 5 |
9 | 3, 8 | nfan 1544 | . . . 4 |
10 | nfv 1508 | . . . . . 6 | |
11 | nfv 1508 | . . . . . . 7 | |
12 | nfv 1508 | . . . . . . . 8 | |
13 | nfcv 2281 | . . . . . . . . 9 | |
14 | nfre1 2476 | . . . . . . . . 9 | |
15 | 13, 14 | nfrexya 2474 | . . . . . . . 8 |
16 | 12, 15 | nfan 1544 | . . . . . . 7 |
17 | 11, 16 | nfan 1544 | . . . . . 6 |
18 | 10, 17 | nfan 1544 | . . . . 5 |
19 | dfgcd3 11698 | . . . . . . . 8 | |
20 | 19 | adantr 274 | . . . . . . 7 |
21 | simprrl 528 | . . . . . . . 8 | |
22 | simprl 520 | . . . . . . . . 9 | |
23 | simpll 518 | . . . . . . . . . 10 | |
24 | simplr 519 | . . . . . . . . . 10 | |
25 | 23, 24, 22, 21 | bezoutlemeu 11695 | . . . . . . . . 9 |
26 | breq2 3933 | . . . . . . . . . . . 12 | |
27 | 26 | bibi1d 232 | . . . . . . . . . . 11 |
28 | 27 | ralbidv 2437 | . . . . . . . . . 10 |
29 | 28 | riota2 5752 | . . . . . . . . 9 |
30 | 22, 25, 29 | syl2anc 408 | . . . . . . . 8 |
31 | 21, 30 | mpbid 146 | . . . . . . 7 |
32 | 20, 31 | eqtrd 2172 | . . . . . 6 |
33 | 32 | eqeq1d 2148 | . . . . 5 |
34 | 18, 33 | rexbid 2436 | . . . 4 |
35 | 9, 34 | rexbid 2436 | . . 3 |
36 | 2, 35 | mpbird 166 | . 2 |
37 | 1, 36 | rexlimddv 2554 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wceq 1331 wcel 1480 wral 2416 wrex 2417 wreu 2418 class class class wbr 3929 crio 5729 (class class class)co 5774 caddc 7623 cmul 7625 cn0 8977 cz 9054 cdvds 11493 cgcd 11635 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-coll 4043 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-iinf 4502 ax-cnex 7711 ax-resscn 7712 ax-1cn 7713 ax-1re 7714 ax-icn 7715 ax-addcl 7716 ax-addrcl 7717 ax-mulcl 7718 ax-mulrcl 7719 ax-addcom 7720 ax-mulcom 7721 ax-addass 7722 ax-mulass 7723 ax-distr 7724 ax-i2m1 7725 ax-0lt1 7726 ax-1rid 7727 ax-0id 7728 ax-rnegex 7729 ax-precex 7730 ax-cnre 7731 ax-pre-ltirr 7732 ax-pre-ltwlin 7733 ax-pre-lttrn 7734 ax-pre-apti 7735 ax-pre-ltadd 7736 ax-pre-mulgt0 7737 ax-pre-mulext 7738 ax-arch 7739 ax-caucvg 7740 |
This theorem depends on definitions: df-bi 116 df-dc 820 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-nel 2404 df-ral 2421 df-rex 2422 df-reu 2423 df-rmo 2424 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-nul 3364 df-if 3475 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-tr 4027 df-id 4215 df-po 4218 df-iso 4219 df-iord 4288 df-on 4290 df-ilim 4291 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-riota 5730 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-recs 6202 df-frec 6288 df-sup 6871 df-pnf 7802 df-mnf 7803 df-xr 7804 df-ltxr 7805 df-le 7806 df-sub 7935 df-neg 7936 df-reap 8337 df-ap 8344 df-div 8433 df-inn 8721 df-2 8779 df-3 8780 df-4 8781 df-n0 8978 df-z 9055 df-uz 9327 df-q 9412 df-rp 9442 df-fz 9791 df-fzo 9920 df-fl 10043 df-mod 10096 df-seqfrec 10219 df-exp 10293 df-cj 10614 df-re 10615 df-im 10616 df-rsqrt 10770 df-abs 10771 df-dvds 11494 df-gcd 11636 |
This theorem is referenced by: dvdsgcd 11700 dvdsmulgcd 11713 lcmgcdlem 11758 divgcdcoprm0 11782 |
Copyright terms: Public domain | W3C validator |