Theorem bezoutlema 12720

Description: Lemma for Bézout's identity. The is-bezout condition is satisfied by A. (Contributed by Jim Kingdon, 30-Dec-2021.)

Hypotheses

Ref	Expression
bezoutlema.is-bezout	|- ( ph <-> E. s e. ZZ E. t e. ZZ r = ( ( A x. s ) + ( B x. t ) ) )
bezoutlema.a	|- ( th -> A e. NN0 )
bezoutlema.b	|- ( th -> B e. NN0 )

Assertion

Ref	Expression
bezoutlema	|- ( th -> [. A / r ]. ph )

Distinct variable groups:   A, r, s, t   B, r, s, t

Allowed substitution hints:   ph( t, s, r)   th( t, s, r)

Proof of Theorem bezoutlema

Step	Hyp	Ref	Expression
1		1z 9620	. . 3 |- 1 e. ZZ
2		0z 9605	. . 3 |- 0 e. ZZ
3		bezoutlema.b	. . . . . . 7 |- ( th -> B e. NN0 )
4	3	nn0cnd 9572	. . . . . 6 |- ( th -> B e. CC )
5	4	mul01d 8683	. . . . 5 |- ( th -> ( B x. 0 ) = 0 )
6	5	oveq2d 6074	. . . 4 |- ( th -> ( ( A x. 1 ) + ( B x. 0 ) ) = ( ( A x. 1 ) + 0 ) )
7		bezoutlema.a	. . . . . . 7 |- ( th -> A e. NN0 )
8	7	nn0cnd 9572	. . . . . 6 |- ( th -> A e. CC )
9		1cnd 8306	. . . . . 6 |- ( th -> 1 e. CC )
10	8, 9	mulcld 8310	. . . . 5 |- ( th -> ( A x. 1 ) e. CC )
11	10	addridd 8438	. . . 4 |- ( th -> ( ( A x. 1 ) + 0 ) = ( A x. 1 ) )
12	8	mulridd 8307	. . . 4 |- ( th -> ( A x. 1 ) = A )
13	6, 11, 12	3eqtrrd 2272	. . 3 |- ( th -> A = ( ( A x. 1 ) + ( B x. 0 ) ) )
14		oveq2 6066	. . . . . 6 |- ( s = 1 -> ( A x. s ) = ( A x. 1 ) )
15	14	oveq1d 6073	. . . . 5 |- ( s = 1 -> ( ( A x. s ) + ( B x. t ) ) = ( ( A x. 1 ) + ( B x. t ) ) )
16	15	eqeq2d 2246	. . . 4 |- ( s = 1 -> ( A = ( ( A x. s ) + ( B x. t ) ) <-> A = ( ( A x. 1 ) + ( B x. t ) ) ) )
17		oveq2 6066	. . . . . 6 |- ( t = 0 -> ( B x. t ) = ( B x. 0 ) )
18	17	oveq2d 6074	. . . . 5 |- ( t = 0 -> ( ( A x. 1 ) + ( B x. t ) ) = ( ( A x. 1 ) + ( B x. 0 ) ) )
19	18	eqeq2d 2246	. . . 4 |- ( t = 0 -> ( A = ( ( A x. 1 ) + ( B x. t ) ) <-> A = ( ( A x. 1 ) + ( B x. 0 ) ) ) )
20	16, 19	rspc2ev 2939	. . 3 |- ( ( 1 e. ZZ /\ 0 e. ZZ /\ A = ( ( A x. 1 ) + ( B x. 0 ) ) ) -> E. s e. ZZ E. t e. ZZ A = ( ( A x. s ) + ( B x. t ) ) )
21	1, 2, 13, 20	mp3an12i 1378	. 2 |- ( th -> E. s e. ZZ E. t e. ZZ A = ( ( A x. s ) + ( B x. t ) ) )
22		bezoutlema.is-bezout	. . . . 5 |- ( ph <-> E. s e. ZZ E. t e. ZZ r = ( ( A x. s ) + ( B x. t ) ) )
23		eqeq1 2241	. . . . . 6 |- ( r = A -> ( r = ( ( A x. s ) + ( B x. t ) ) <-> A = ( ( A x. s ) + ( B x. t ) ) ) )
24	23	2rexbidv 2569	. . . . 5 |- ( r = A -> ( E. s e. ZZ E. t e. ZZ r = ( ( A x. s ) + ( B x. t ) ) <-> E. s e. ZZ E. t e. ZZ A = ( ( A x. s ) + ( B x. t ) ) ) )
25	22, 24	bitrid 192	. . . 4 |- ( r = A -> ( ph <-> E. s e. ZZ E. t e. ZZ A = ( ( A x. s ) + ( B x. t ) ) ) )
26	25	sbcieg 3078	. . 3 |- ( A e. NN0 -> ( [. A / r ]. ph <-> E. s e. ZZ E. t e. ZZ A = ( ( A x. s ) + ( B x. t ) ) ) )
27	7, 26	syl 14	. 2 |- ( th -> ( [. A / r ]. ph <-> E. s e. ZZ E. t e. ZZ A = ( ( A x. s ) + ( B x. t ) ) ) )
28	21, 27	mpbird 167	1 |- ( th -> [. A / r ]. ph )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1398   e. wcel 2205   E.wrex 2523   [.wsbc 3045  (class class class)co 6058   0cc0 8143   1c1 8144   + caddc 8146   x. cmul 8148   NN0cn0 9513   ZZcz 9594

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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-ltadd 8259

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-iota 5317  df-fun 5359  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-n0 9514  df-z 9595

This theorem is referenced by:  bezoutlemex  12722