Theorem ltaprlem 6808

Description: Lemma for Proposition 9-3.5(v) of [Gleason] p. 123. (Contributed by NM, 8-Apr-1996.)

Assertion

Ref	Expression
ltaprlem	|- ( C e. P. -> ( A <P B -> ( C +P. A ) <P ( C +P. B ) ) )

Proof of Theorem ltaprlem

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltexpri 6803	. . . 4 |- ( A <P B -> E. x e. P. ( A +P. x ) = B )
2	1	adantr 270	. . 3 |- ( ( A <P B /\ C e. P. ) -> E. x e. P. ( A +P. x ) = B )
3		simplr 496	. . . . . 6 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> C e. P. )
4		ltrelpr 6695	. . . . . . . . . 10 |- <P C_ ( P. X. P. )
5	4	brel 4410	. . . . . . . . 9 |- ( A <P B -> ( A e. P. /\ B e. P. ) )
6	5	simpld 110	. . . . . . . 8 |- ( A <P B -> A e. P. )
7	6	adantr 270	. . . . . . 7 |- ( ( A <P B /\ C e. P. ) -> A e. P. )
8	7	adantr 270	. . . . . 6 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> A e. P. )
9		addclpr 6727	. . . . . 6 |- ( ( C e. P. /\ A e. P. ) -> ( C +P. A ) e. P. )
10	3, 8, 9	syl2anc 403	. . . . 5 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> ( C +P. A ) e. P. )
11		simprl 497	. . . . 5 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> x e. P. )
12		ltaddpr 6787	. . . . 5 |- ( ( ( C +P. A ) e. P. /\ x e. P. ) -> ( C +P. A ) <P ( ( C +P. A ) +P. x ) )
13	10, 11, 12	syl2anc 403	. . . 4 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> ( C +P. A ) <P ( ( C +P. A ) +P. x ) )
14		addassprg 6769	. . . . . 6 |- ( ( C e. P. /\ A e. P. /\ x e. P. ) -> ( ( C +P. A ) +P. x ) = ( C +P. ( A +P. x ) ) )
15	3, 8, 11, 14	syl3anc 1169	. . . . 5 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> ( ( C +P. A ) +P. x ) = ( C +P. ( A +P. x ) ) )
16		oveq2 5540	. . . . . 6 |- ( ( A +P. x ) = B -> ( C +P. ( A +P. x ) ) = ( C +P. B ) )
17	16	ad2antll 474	. . . . 5 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> ( C +P. ( A +P. x ) ) = ( C +P. B ) )
18	15, 17	eqtrd 2113	. . . 4 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> ( ( C +P. A ) +P. x ) = ( C +P. B ) )
19	13, 18	breqtrd 3809	. . 3 |- ( ( ( A <P B /\ C e. P. ) /\ ( x e. P. /\ ( A +P. x ) = B ) ) -> ( C +P. A ) <P ( C +P. B ) )
20	2, 19	rexlimddv 2481	. 2 |- ( ( A <P B /\ C e. P. ) -> ( C +P. A ) <P ( C +P. B ) )
21	20	expcom 114	1 |- ( C e. P. -> ( A <P B -> ( C +P. A ) <P ( C +P. B ) ) )

Syntax hints:   -> wi 4   /\ wa 102   = wceq 1284   e. wcel 1433   E.wrex 2349   class class class wbr 3785  (class class class)co 5532   P.cnp 6481   +P. cpp 6483   <P cltp 6485

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-nul 3904  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-iinf 4329

This theorem depends on definitions:  df-bi 115  df-dc 776  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-tr 3876  df-eprel 4044  df-id 4048  df-po 4051  df-iso 4052  df-iord 4121  df-on 4123  df-suc 4126  df-iom 4332  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-recs 5943  df-irdg 5980  df-1o 6024  df-2o 6025  df-oadd 6028  df-omul 6029  df-er 6129  df-ec 6131  df-qs 6135  df-ni 6494  df-pli 6495  df-mi 6496  df-lti 6497  df-plpq 6534  df-mpq 6535  df-enq 6537  df-nqqs 6538  df-plqqs 6539  df-mqqs 6540  df-1nqqs 6541  df-rq 6542  df-ltnqqs 6543  df-enq0 6614  df-nq0 6615  df-0nq0 6616  df-plq0 6617  df-mq0 6618  df-inp 6656  df-iplp 6658  df-iltp 6660

This theorem is referenced by:  ltaprg  6809