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 and . (Contributed by Mario Carneiro and Jim Kingdon, 9-Jan-2022.) |
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 9168 | . . 3 |
3 | elrabi 2879 | . . . . . . 7 | |
4 | 3 | adantl 275 | . . . . . 6 |
5 | 4 | zred 9313 | . . . . 5 |
6 | 2 | adantr 274 | . . . . 5 |
7 | breq1 3985 | . . . . . . . . . 10 | |
8 | breq1 3985 | . . . . . . . . . 10 | |
9 | 7, 8 | anbi12d 465 | . . . . . . . . 9 |
10 | 9 | elrab 2882 | . . . . . . . 8 |
11 | 10 | simprbi 273 | . . . . . . 7 |
12 | 11 | adantl 275 | . . . . . 6 |
13 | breq1 3985 | . . . . . . . . 9 | |
14 | 9, 13 | imbi12d 233 | . . . . . . . 8 |
15 | bezoutlemgcd.1 | . . . . . . . . . 10 | |
16 | bezoutlemgcd.2 | . . . . . . . . . 10 | |
17 | bezoutlemgcd.4 | . . . . . . . . . 10 | |
18 | bezoutlemgcd.5 | . . . . . . . . . 10 | |
19 | 15, 16, 1, 17, 18 | bezoutlemle 11941 | . . . . . . . . 9 |
20 | 19 | adantr 274 | . . . . . . . 8 |
21 | simpr 109 | . . . . . . . 8 | |
22 | 14, 20, 21 | rspcdva 2835 | . . . . . . 7 |
23 | 3, 22 | sylan2 284 | . . . . . 6 |
24 | 12, 23 | mpd 13 | . . . . 5 |
25 | 5, 6, 24 | lensymd 8020 | . . . 4 |
26 | 25 | ralrimiva 2539 | . . 3 |
27 | 1 | nn0zd 9311 | . . . . . . . . . 10 |
28 | iddvds 11744 | . . . . . . . . . 10 | |
29 | 27, 28 | syl 14 | . . . . . . . . 9 |
30 | breq1 3985 | . . . . . . . . . . 11 | |
31 | breq1 3985 | . . . . . . . . . . . 12 | |
32 | breq1 3985 | . . . . . . . . . . . 12 | |
33 | 31, 32 | anbi12d 465 | . . . . . . . . . . 11 |
34 | 30, 33 | bibi12d 234 | . . . . . . . . . 10 |
35 | 34, 17, 27 | rspcdva 2835 | . . . . . . . . 9 |
36 | 29, 35 | mpbid 146 | . . . . . . . 8 |
37 | 36 | ad2antrr 480 | . . . . . . 7 |
38 | 1 | ad2antrr 480 | . . . . . . . . 9 |
39 | 38 | nn0zd 9311 | . . . . . . . 8 |
40 | 33 | elrab3 2883 | . . . . . . . 8 |
41 | 39, 40 | syl 14 | . . . . . . 7 |
42 | 37, 41 | mpbird 166 | . . . . . 6 |
43 | breq2 3986 | . . . . . . 7 | |
44 | 43 | rspcev 2830 | . . . . . 6 |
45 | 42, 44 | sylancom 417 | . . . . 5 |
46 | 45 | ex 114 | . . . 4 |
47 | 46 | ralrimiva 2539 | . . 3 |
48 | lttri3 7978 | . . . . 5 | |
49 | 48 | adantl 275 | . . . 4 |
50 | 49 | eqsupti 6961 | . . 3 |
51 | 2, 26, 47, 50 | mp3and 1330 | . 2 |
52 | 51 | eqcomd 2171 | 1 |
Colors of variables: wff set class |
Syntax hints: wn 3 wi 4 wa 103 wb 104 wceq 1343 wcel 2136 wral 2444 wrex 2445 crab 2448 class class class wbr 3982 csup 6947 cr 7752 cc0 7753 clt 7933 cle 7934 cn0 9114 cz 9191 cdvds 11727 |
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 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 ax-un 4411 ax-setind 4514 ax-cnex 7844 ax-resscn 7845 ax-1cn 7846 ax-1re 7847 ax-icn 7848 ax-addcl 7849 ax-addrcl 7850 ax-mulcl 7851 ax-mulrcl 7852 ax-addcom 7853 ax-mulcom 7854 ax-addass 7855 ax-mulass 7856 ax-distr 7857 ax-i2m1 7858 ax-0lt1 7859 ax-1rid 7860 ax-0id 7861 ax-rnegex 7862 ax-precex 7863 ax-cnre 7864 ax-pre-ltirr 7865 ax-pre-ltwlin 7866 ax-pre-lttrn 7867 ax-pre-apti 7868 ax-pre-ltadd 7869 ax-pre-mulgt0 7870 ax-pre-mulext 7871 |
This theorem depends on definitions: df-bi 116 df-3or 969 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-nel 2432 df-ral 2449 df-rex 2450 df-reu 2451 df-rmo 2452 df-rab 2453 df-v 2728 df-sbc 2952 df-csb 3046 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-nul 3410 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-int 3825 df-iun 3868 df-br 3983 df-opab 4044 df-mpt 4045 df-id 4271 df-po 4274 df-iso 4275 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-rn 4615 df-res 4616 df-ima 4617 df-iota 5153 df-fun 5190 df-fn 5191 df-f 5192 df-fv 5196 df-riota 5798 df-ov 5845 df-oprab 5846 df-mpo 5847 df-1st 6108 df-2nd 6109 df-sup 6949 df-pnf 7935 df-mnf 7936 df-xr 7937 df-ltxr 7938 df-le 7939 df-sub 8071 df-neg 8072 df-reap 8473 df-ap 8480 df-div 8569 df-inn 8858 df-n0 9115 df-z 9192 df-q 9558 df-dvds 11728 |
This theorem is referenced by: dfgcd3 11943 |
Copyright terms: Public domain | W3C validator |