| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > bezoutlemsup | Unicode version | ||
| Description: Lemma for Bézout's
identity. The number satisfying the
greatest common divisor condition is the supremum of divisors of
both |
| Ref | Expression |
|---|---|
| bezoutlemgcd.1 |
|
| bezoutlemgcd.2 |
|
| bezoutlemgcd.3 |
|
| bezoutlemgcd.4 |
|
| bezoutlemgcd.5 |
|
| Ref | Expression |
|---|---|
| bezoutlemsup |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bezoutlemgcd.3 |
. . . 4
| |
| 2 | 1 | nn0red 9423 |
. . 3
|
| 3 | elrabi 2956 |
. . . . . . 7
| |
| 4 | 3 | adantl 277 |
. . . . . 6
|
| 5 | 4 | zred 9569 |
. . . . 5
|
| 6 | 2 | adantr 276 |
. . . . 5
|
| 7 | breq1 4086 |
. . . . . . . . . 10
| |
| 8 | breq1 4086 |
. . . . . . . . . 10
| |
| 9 | 7, 8 | anbi12d 473 |
. . . . . . . . 9
|
| 10 | 9 | elrab 2959 |
. . . . . . . 8
|
| 11 | 10 | simprbi 275 |
. . . . . . 7
|
| 12 | 11 | adantl 277 |
. . . . . 6
|
| 13 | breq1 4086 |
. . . . . . . . 9
| |
| 14 | 9, 13 | imbi12d 234 |
. . . . . . . 8
|
| 15 | bezoutlemgcd.1 |
. . . . . . . . . 10
| |
| 16 | bezoutlemgcd.2 |
. . . . . . . . . 10
| |
| 17 | bezoutlemgcd.4 |
. . . . . . . . . 10
| |
| 18 | bezoutlemgcd.5 |
. . . . . . . . . 10
| |
| 19 | 15, 16, 1, 17, 18 | bezoutlemle 12529 |
. . . . . . . . 9
|
| 20 | 19 | adantr 276 |
. . . . . . . 8
|
| 21 | simpr 110 |
. . . . . . . 8
| |
| 22 | 14, 20, 21 | rspcdva 2912 |
. . . . . . 7
|
| 23 | 3, 22 | sylan2 286 |
. . . . . 6
|
| 24 | 12, 23 | mpd 13 |
. . . . 5
|
| 25 | 5, 6, 24 | lensymd 8268 |
. . . 4
|
| 26 | 25 | ralrimiva 2603 |
. . 3
|
| 27 | 1 | nn0zd 9567 |
. . . . . . . . . 10
|
| 28 | iddvds 12315 |
. . . . . . . . . 10
| |
| 29 | 27, 28 | syl 14 |
. . . . . . . . 9
|
| 30 | breq1 4086 |
. . . . . . . . . . 11
| |
| 31 | breq1 4086 |
. . . . . . . . . . . 12
| |
| 32 | breq1 4086 |
. . . . . . . . . . . 12
| |
| 33 | 31, 32 | anbi12d 473 |
. . . . . . . . . . 11
|
| 34 | 30, 33 | bibi12d 235 |
. . . . . . . . . 10
|
| 35 | 34, 17, 27 | rspcdva 2912 |
. . . . . . . . 9
|
| 36 | 29, 35 | mpbid 147 |
. . . . . . . 8
|
| 37 | 36 | ad2antrr 488 |
. . . . . . 7
|
| 38 | 1 | ad2antrr 488 |
. . . . . . . . 9
|
| 39 | 38 | nn0zd 9567 |
. . . . . . . 8
|
| 40 | 33 | elrab3 2960 |
. . . . . . . 8
|
| 41 | 39, 40 | syl 14 |
. . . . . . 7
|
| 42 | 37, 41 | mpbird 167 |
. . . . . 6
|
| 43 | breq2 4087 |
. . . . . . 7
| |
| 44 | 43 | rspcev 2907 |
. . . . . 6
|
| 45 | 42, 44 | sylancom 420 |
. . . . 5
|
| 46 | 45 | ex 115 |
. . . 4
|
| 47 | 46 | ralrimiva 2603 |
. . 3
|
| 48 | lttri3 8226 |
. . . . 5
| |
| 49 | 48 | adantl 277 |
. . . 4
|
| 50 | 49 | eqsupti 7163 |
. . 3
|
| 51 | 2, 26, 47, 50 | mp3and 1374 |
. 2
|
| 52 | 51 | eqcomd 2235 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8090 ax-resscn 8091 ax-1cn 8092 ax-1re 8093 ax-icn 8094 ax-addcl 8095 ax-addrcl 8096 ax-mulcl 8097 ax-mulrcl 8098 ax-addcom 8099 ax-mulcom 8100 ax-addass 8101 ax-mulass 8102 ax-distr 8103 ax-i2m1 8104 ax-0lt1 8105 ax-1rid 8106 ax-0id 8107 ax-rnegex 8108 ax-precex 8109 ax-cnre 8110 ax-pre-ltirr 8111 ax-pre-ltwlin 8112 ax-pre-lttrn 8113 ax-pre-apti 8114 ax-pre-ltadd 8115 ax-pre-mulgt0 8116 ax-pre-mulext 8117 |
| This theorem depends on definitions: df-bi 117 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 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-po 4387 df-iso 4388 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-fv 5326 df-riota 5954 df-ov 6004 df-oprab 6005 df-mpo 6006 df-1st 6286 df-2nd 6287 df-sup 7151 df-pnf 8183 df-mnf 8184 df-xr 8185 df-ltxr 8186 df-le 8187 df-sub 8319 df-neg 8320 df-reap 8722 df-ap 8729 df-div 8820 df-inn 9111 df-n0 9370 df-z 9447 df-q 9815 df-dvds 12299 |
| This theorem is referenced by: dfgcd3 12531 |
| Copyright terms: Public domain | W3C validator |